[{"id": 617320, "created": "2025-08-08T08:54:44.221319", "project_id": 294, "task_id": 649460, "user_id": 315, "user_ip": null, "finish_time": "2025-08-08T08:55:02.758780", "timeout": null, "calibration": null, "external_uid": null, "media_url": null, "info": {"id": 480, "src": "cohn and lapata formulated sentence compression as a tree-to-tree rewrite problem .", "target": "cohn and lapata , 2007 ) cast the sentence compression problem as a tree-to-tree rewriting task .", "clarity": "very_clear", "faithfulness": "very_faithful", "plausibility": "highly_plausible", "informativeness": "informative"}}, {"id": 626481, "created": "2025-08-18T03:19:24.784551", "project_id": 294, "task_id": 649460, "user_id": 325, "user_ip": null, "finish_time": "2025-08-18T03:19:42.359633", "timeout": null, "calibration": null, "external_uid": null, "media_url": null, "info": {"id": 480, "src": "cohn and lapata formulated sentence compression as a tree-to-tree rewrite problem .", "target": "cohn and lapata , 2007 ) cast the sentence compression problem as a tree-to-tree rewriting task .", "clarity": "neutral", "faithfulness": "moderately_faithful", "plausibility": "moderately_plausible", "informativeness": "moderately_informative"}}]