{"as_of":"2026-08-16T17:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dfcd41866843fc84c501123436c4a038c6109613bd42699bfcc96b4754b76ebc","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:54:30.311297Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T14:29:43.379840Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"cited_work":{"arxiv_id":"2506.18383","doi":"10.48550/arxiv.2506.18383","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.18383","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CoRR , volume =","venue":"arXiv (Cornell University)","work_id":"54bce6d8-ec76-40d4-a993-b3dda43a0d80","year":2025},"citing_paper":{"arxiv_id":"2606.02837","last_updated":"2026-06-01T20:00:35Z","snapshot_observed_at":"2026-08-14T18:50:55.500836Z","submitted_at":"2026-06-01T20:00:35Z","title":"Fixing FOLIO and MALLS: Verified Annotations and an LLM-assisted Framework to Focus Human Relabeling","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-06-28T14:29:43.379840Z"},"links":{"cited_paper":"/paper/2506.18383","citing_paper":"/paper/2606.02837"},"observation_digest":"sha256:a2e11319969f9bbf77696379fd43ac64205dd7bbe554f315f2beaece49fc93a9","observation_id":"07a3f812-afc9-416e-a7cf-f4b74ec55c0d","resolution":{"observed_at":"2026-06-28T14:32:17.690321Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.18383/citation-record","integrity":"/paper/2506.18383/integrity","json":"/paper/2506.18383/citation-record.json","paper":"/paper/2506.18383"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.01306","last_updated":"2024-11-19T18:12:45Z","snapshot_observed_at":"2026-08-12T21:18:02.964833Z","submitted_at":"2024-02-02T10:53:36Z","title":"KTO: Model Alignment as Prospect Theoretic Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01306","snapshot_observed_at":"2026-08-15T18:54:30.238507Z","title":"Ruifang Ge and Raymond J","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.238507Z"},"links":{"cited_paper":"/paper/2402.01306","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:eec20a01c11bf7235aca63f1652d1be321b5346336f28a632ad611bfaeef8fdc","observation_id":"dadb5a6b-b771-423a-9bd6-47e8cb55365c","resolution":{"observed_at":"2026-08-15T18:54:30.238507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-15T18:54:30.242928Z","title":"Yu Gu, Vardaan Pahuja, Gong Cheng, and Yu Su","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.242928Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:5b17aac19fd5a6044bb689ceb8f1152153be83c34085fae5384df21cc78ef62f","observation_id":"d1e55af5-37c6-4633-bd00-ed29ba32111f","resolution":{"observed_at":"2026-08-15T18:54:30.242928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-15T18:54:30.247454Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.247454Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:02e0ae5121350949ca48bb86f32e277eb2cdc3f711675fbbbef0e86465f0d0bd","observation_id":"a1adb26a-ab4c-4db6-b047-6a193a80b76c","resolution":{"observed_at":"2026-08-15T18:54:30.247454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-15T18:54:30.251866Z","title":"URL https://doi.org/10","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.251866Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:5cb34ab3e9543c6728314726dc6490ed259b3bf4dfe7ba6730e8ccddfda9a125","observation_id":"d44dadbf-3869-4b43-a7cb-d3ca64082543","resolution":{"observed_at":"2026-08-15T18:54:30.251866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.259880Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.259880Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:487fae9702b27b24483ea7dd07110736c0ef60e6d753e656b537aa4d1dd69049","observation_id":"4fff75c4-67b7-4a1b-9649-f96579568790","resolution":{"observed_at":"2026-08-15T18:54:30.259880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.263650Z","title":"URL https://doi.org/10","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.263650Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:85d7b1e73d529fe73e76612af778fac0ce7178b471149858d4bf62e56a598c10","observation_id":"5fe2ce00-2a27-4bae-9a01-1d0a06521d34","resolution":{"observed_at":"2026-08-15T18:54:30.263650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.768274Z","title":"URL https://aclanthology.org/2022.coling-1.481","venue":null,"work_id":"9a5f9f95-75be-453f-bfbd-6b519dd988ac","year":2022},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.267309Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:64c0015eb5de1fbc76de5b62adb459bdf78b335eb840925be9e9f2d5de55462f","observation_id":"116b68f0-51c2-494a-b27b-717dedb21ccd","resolution":{"observed_at":"2026-08-15T18:54:30.771646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21272","last_updated":"2025-05-20T16:29:40Z","snapshot_observed_at":"2026-08-16T13:05:16.958093Z","submitted_at":"2024-10-28T17:59:06Z","title":"Arithmetic Without Algorithms: Language Models Solve Math With a Bag of Heuristics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21272","snapshot_observed_at":"2026-08-15T18:54:30.271111Z","title":"Theo Olausson, Alex Gu, Benjamin Lipkin, Cedegao E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.271111Z"},"links":{"cited_paper":"/paper/2410.21272","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:ebdb047ee9b308f312bd4db14c6213e6d4ff2e8895fbac0ea06a75a9396dfead","observation_id":"c7a55a19-c026-404d-9d44-1d2304ce5fb8","resolution":{"observed_at":"2026-08-15T18:54:30.271111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.274494Z","title":"EMNLP-MAIN.313","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.274494Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:5693ebabdd1d735d0d14e1c23871893ee1470d96db34e44f9db17108a48a3924","observation_id":"279e1922-afe4-40b7-8b91-e13b961a445c","resolution":{"observed_at":"2026-08-15T18:54:30.274494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.277846Z","title":"URL https://doi.org/10.18653/v1/2023.findings-emnlp.248","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.277846Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:dd5a816cc89882d3c68b454bc86dba196b842e1914bd4f63037f9eb5765ce929","observation_id":"aa19c657-3cc2-43e2-9dbf-76342822e65d","resolution":{"observed_at":"2026-08-15T18:54:30.277846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18290","last_updated":"2024-07-29T22:26:36Z","snapshot_observed_at":"2026-08-01T16:34:38.795326Z","submitted_at":"2023-05-29T17:57:46Z","title":"Direct Preference Optimization: Your Language Model is Secretly a Reward Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18290","snapshot_observed_at":"2026-08-15T18:54:30.281028Z","title":"Abulhair Saparov and He He","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.281028Z"},"links":{"cited_paper":"/paper/2305.18290","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:bfa926c75e8cae87831a532684ea52236ebdadec434fdbc210a17eee02d565e8","observation_id":"a23f518a-38dd-41a2-b984-523bde8d810d","resolution":{"observed_at":"2026-08-15T18:54:30.281028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.757781Z","title":"Arpit Sharma, Nguyen Ha Vo, Somak Aditya, and Chitta Baral","venue":null,"work_id":"96ecbaca-0654-4922-a2e8-16f73d1d9787","year":2015},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.284198Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:33013dcb8bf0efcd733df2b9d80c40a09c79623f0dcd83a4ad23f1b67560c574","observation_id":"1c5ef0b2-a9a2-4a04-8f99-333eb9e9e9f9","resolution":{"observed_at":"2026-08-15T18:54:30.761066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-15T18:54:30.292666Z","title":"Ramya Keerthy Thatikonda, Jiuzhou Han, Wray Buntine, and Ehsan Shareghi","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.292666Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:e6385437cc8f24669d5c87e7e5f79ad2f8d9169c7c502961004c26fe2fd3971a","observation_id":"45c2e073-8186-490a-8be3-156fa420dcd0","resolution":{"observed_at":"2026-08-15T18:54:30.292666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.747663Z","title":"Dick, and Anton van den Hengel","venue":null,"work_id":"75faa706-0f14-469d-bbc3-2dc21bb001bf","year":2016},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.296937Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:73ec9d1c91d54b9827005a6435855dbac80d34d1f778243f83de5cddf18d2250","observation_id":"7c295393-d544-4117-b08f-f2f06ceea373","resolution":{"observed_at":"2026-08-15T18:54:30.751268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.303790Z","title":"doi: 10.18653/v1/2024.acl-long.375","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.303790Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:49b1b1d5b9180e58ff72b12e7befedbc6da2869b9cd69f7b34e2d5bbb987fb43","observation_id":"cc649e5a-e970-4266-9a25-ebc4efd490b7","resolution":{"observed_at":"2026-08-15T18:54:30.303790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.736827Z","title":"A Appendix A.1 Few-shot Baseline prompts For our baseline models, we evaluate off-the-shelf models in a few-shot setting","venue":null,"work_id":"df611a95-8124-4576-be04-676eb65d644c","year":2023},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.306936Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:0cad1b2cee1c6e2a2d759570378fcd4013a5d44c32c0a07207733fbf3d054f54","observation_id":"e694105b-2f35-4e6c-a3bd-8e6dcdd9ce02","resolution":{"observed_at":"2026-08-15T18:54:30.740461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4330.5324","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.502368Z","title":"As the process of ProverQA creation was quite different, the high improvement of the preference optimized models underlines the generalizability of our LOGICPO dataset","venue":null,"work_id":"8a282bb7-6a35-4987-9641-03ce9b9320ca","year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.311297Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:25cc6651475662e21b91277b9327020786fb5f48f04e4b46a4b8e8a3402202db","observation_id":"28df8fef-cedd-4b41-bb5c-fa8d6aea2a9b","resolution":{"observed_at":"2026-08-15T18:54:30.509357Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12788","last_updated":"2023-03-22T17:57:47Z","snapshot_observed_at":"2026-08-16T15:46:09.087207Z","submitted_at":"2023-03-22T17:57:47Z","title":"Open-source Frame Semantic Parsing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.12788","snapshot_observed_at":"2026-08-15T18:54:30.226908Z","title":"doi: 10.3115/v1/P14-1114","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.226908Z"},"links":{"cited_paper":"/paper/2303.12788","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:9a976b38be27d37c707b4d302fdbfa97cceba4139bbc4f761d427c857e072d52","observation_id":"14965f1d-da49-497e-ad69-3101fca734b7","resolution":{"observed_at":"2026-08-15T18:54:30.226908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/cvpr.2016.500","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.339162Z","title":"URLhttps://doi.org/10.1109/CVPR.2016.500","venue":null,"work_id":"2995c8b5-803a-478d-83c8-58d44fb7cead","year":2016},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.300599Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:774b6df0c8a91d6e99eb69f9051b4f9ba8a4345a5b3662a52cef9e8b516b1ab8","observation_id":"5faba0a5-d42c-4577-92dc-215d74f5b921","resolution":{"observed_at":"2026-08-15T18:54:30.343465Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.255764Z","title":"URLhttp://www.vldb.org/pvldb/vol13/p1737-kim.pdf","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.255764Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:229cc83657342075b7d0a77c9685366caaa48771dfd53435c0b711fd99c9c25a","observation_id":"18a51ac2-5c2b-44bd-ab19-e352b9ca3d43","resolution":{"observed_at":"2026-08-15T18:54:30.255764Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13048","last_updated":"2021-06-03T19:15:08Z","snapshot_observed_at":"2026-08-14T20:23:27.689805Z","submitted_at":"2020-12-24T00:55:46Z","title":"ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Language","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13048","snapshot_observed_at":"2026-08-15T18:54:30.288031Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.288031Z"},"links":{"cited_paper":"/paper/2012.13048","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:0b9e3a445a46f3ad039fb0a187d519233cec318486b8c4854c2afc092b47b72c","observation_id":"cf09980f-6237-433a-88f5-3cbbf8646f5d","resolution":{"observed_at":"2026-08-15T18:54:30.288031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2022/568","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.445532Z","title":"URLhttps://doi.org/10.24963/ijcai.2022/568","venue":null,"work_id":"b5d8d00d-7621-4659-8597-16bc6d18fd7b","year":2022},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.234687Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:8cec9ad0363f0f5d868925186eff2ebe78d369b8a92af653105984675aedb6df","observation_id":"6dea769a-f21b-4e49-bc38-a2992fe418f8","resolution":{"observed_at":"2026-08-15T18:54:30.449203Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:54:30.777867Z","title":"In- terpretable amr-based question decomposition for multi-hop question answering","venue":null,"work_id":"88114617-e27e-4061-b880-a370a0bd1cbb","year":2022},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.231078Z"},"links":{"citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:232028f232da2f7a79cf8ad606cecfee08033183cfe99e0560af4b4d96882505","observation_id":"32b67e4b-166b-44bb-ae41-bdaf065842ec","resolution":{"observed_at":"2026-08-15T18:54:30.781527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14219","last_updated":"2024-08-30T21:17:17Z","snapshot_observed_at":"2026-08-10T14:07:02.234322Z","submitted_at":"2024-04-22T14:32:33Z","title":"Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14219","snapshot_observed_at":"2026-08-15T18:54:30.221905Z","title":"Laura Banarescu, Claire Bonial, Shu Cai, Madalina Georgescu, Kira Griffitt, Ulf Hermjakob, Kevin Knight, Philipp Koehn, Martha Palmer, and Nathan Schneider","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T18:54:30.221905Z"},"links":{"cited_paper":"/paper/2404.14219","citing_paper":"/paper/2506.18383"},"observation_digest":"sha256:f8d0cf2b3e1b64303544d449086aa6b9ed39ba777f2bc869f68c8254827cb428","observation_id":"1aa34efc-bc18-4840-a3e5-7baa54ad1cba","resolution":{"observed_at":"2026-08-15T18:54:30.221905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.18383","last_updated":"2025-06-23T08:15:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T06:32:08.473180Z","submitted_at":"2025-06-23T08:15:24Z","title":"LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":3,"verified_fuzzy":5},"total_outbound_references":24},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 1 inbound Pith citation observation for arXiv:2506.18383."}