[{"id": 616956, "created": "2025-08-08T05:09:50.362819", "project_id": 294, "task_id": 649173, "user_id": 315, "user_ip": null, "finish_time": "2025-08-08T05:10:52.562474", "timeout": null, "calibration": null, "external_uid": null, "media_url": null, "info": {"id": 1395, "src": "our set cover-based method guarantees that all bursty n-grams including irregularly-formed ones must be covered by extracted bursty phrases .", "target": "given that bursty incomplete n-grams always accompany overlapping bursty phrases , we can avoid extracting bursty incomplete n-grams using the set cover problem .", "clarity": "very_clear", "faithfulness": "faithful", "plausibility": "plausible", "informativeness": "very_informative"}}, {"id": 622355, "created": "2025-08-15T08:24:29.586906", "project_id": 294, "task_id": 649173, "user_id": 325, "user_ip": null, "finish_time": "2025-08-15T08:24:43.285844", "timeout": null, "calibration": null, "external_uid": null, "media_url": null, "info": {"id": 1395, "src": "our set cover-based method guarantees that all bursty n-grams including irregularly-formed ones must be covered by extracted bursty phrases .", "target": "given that bursty incomplete n-grams always accompany overlapping bursty phrases , we can avoid extracting bursty incomplete n-grams using the set cover problem .", "clarity": "neutral", "faithfulness": "moderately_faithful", "plausibility": "moderately_plausible", "informativeness": "moderately_informative"}}]