{"as_of":"2026-08-08T07:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e407796d9298df2b149d15b3663c08e289a30048f67b548416e3a4c7ad4845ba","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:42:56.845720Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.24012/citation-record","integrity":"/paper/2505.24012/integrity","json":"/paper/2505.24012/citation-record.json","paper":"/paper/2505.24012"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:43:00.353425Z","title":"Hanjie, Runzhe Yang, and Karthik R Narasimhan","venue":null,"work_id":"89931206-d5e9-4d7a-b2ea-63981bc041d9","year":2024},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:53.501613Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:8042acc0f84058d9177bb011497161d39f121db6eefaabc563df7380757f2fd5","observation_id":"98ba7793-ca96-45e0-b812-c5ad5b98a855","resolution":{"observed_at":"2026-08-07T12:43:00.420402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:43:00.226960Z","title":"Bartoldson, Bhavya Kailkhura, and Ferdi- nando Fioretto","venue":null,"work_id":"f4a87dad-6774-4b18-bc4d-094ade868c2c","year":2025},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:53.580556Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:c3d55d8848798688737dcbb04c2af5ec0f244b0af922a28989421554bcf7ec3d","observation_id":"4b7af7aa-c4d1-4116-a872-493df53d5ed1","resolution":{"observed_at":"2026-08-07T12:43:00.298538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:43:00.161515Z","title":"Adversarial tokenization, 2025","venue":null,"work_id":"02bebb14-0fae-4155-b234-d1dd7f380c59","year":2025},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:53.747514Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:95461751388f3241cb0edc5db9df2e9105fd76330de636d19147ec8f53b25597","observation_id":"cef9ab56-e2c0-443c-a4cf-9b32f95203fd","resolution":{"observed_at":"2026-08-07T12:43:00.190740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:43:00.026332Z","title":"Chi, Quoc V","venue":null,"work_id":"03d4f211-cf8d-49ad-91c1-4251d864ed3a","year":2022},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:53.874793Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:b9b56d6fb1da54ae372b93095b0cb19be366516f48d530d2c0cd45277d35aab5","observation_id":"8e7e59aa-6a20-4b4a-a929-ec36821080f6","resolution":{"observed_at":"2026-08-07T12:43:00.112730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:59.934520Z","title":"Griffiths, Yuan Cao, and Karthik Narasimhan","venue":null,"work_id":"88fb5ef4-1a1c-4405-aa3b-934ab3603935","year":2023},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.011601Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:b551824f73a60f8ac4ba6eb12a7246154d33bd923442418d17cda3951b61d46b","observation_id":"8b68c25b-5458-48a4-8883-b067d2e0fda5","resolution":{"observed_at":"2026-08-07T12:42:59.973236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:59.774964Z","title":"Fast lexically constrained decoding with dynamic beam allocation for neural ma- chine translation","venue":null,"work_id":"7a2520a2-e8f5-47a9-88d9-f393efafe857","year":2018},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.088440Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:fed1110fa4abc37c0d03ea10f6ae0d6d54d907463be2ec40b3b6b172711bace3","observation_id":"edf759c4-d85b-48c9-a74f-1ad7935200aa","resolution":{"observed_at":"2026-08-07T12:42:59.840488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:59.635003Z","title":"Smith, and Yejin Choi","venue":null,"work_id":"9bfb5d05-8e31-40de-b7f6-3c943acb0445","year":2022},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.159819Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:91e9465ed229f0a290a38782ef8b9096122182b71775716320e90dbd34d64545","observation_id":"ec7148c9-483f-43f3-9e16-1e36d5e367f8","resolution":{"observed_at":"2026-08-07T12:42:59.678944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:59.450523Z","title":"Constraints first: A new mdd-based model to generate sentences under constraints","venue":null,"work_id":"b3d85ea7-e999-4e79-8bb4-2f4b2491dcb3","year":1901},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.233927Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:69a031d7ccffbb792b888ea6fa74de8c13a4b15399a600338bf18329f660d6b8","observation_id":"6baba849-1e5c-4e9d-b646-dd77a43b254a","resolution":{"observed_at":"2026-08-07T12:42:59.543622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:59.343912Z","title":"Intertwining cp and nlp: The generation of unreasonably con- strained sentences","venue":null,"work_id":"756fe424-a482-4349-8759-8c75ec0a42dd","year":2024},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.352100Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:4d06ec82c75445bb7104c448c44802ce40ea4c94c5db913f34bb35dc60525ab5","observation_id":"8c3f2936-114f-4caf-9929-315c7ed7bb5b","resolution":{"observed_at":"2026-08-07T12:42:59.382185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:59.185816Z","title":"Markov constraint as large language model surrogate","venue":null,"work_id":"7a680b1c-6c1e-4d74-b316-25cebc7af7d3","year":2024},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.489572Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:d5ae1cf2a55a8182a21f4fc24724da3d902221281a8255c80dded7403b085461","observation_id":"9f8e8166-15ca-490e-bf18-97b15319aa91","resolution":{"observed_at":"2026-08-07T12:42:59.239403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:59.093621Z","title":"Combining Constraint Programming Reason- ing with Large Language Model Predictions","venue":null,"work_id":"07ddaacc-ff3d-40e0-b586-de20be3d59d0","year":2024},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.568242Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:12b6411a8c9c4cb9f6cbd5fb0dd37e29d597cc042a33f150ff57306e7fe790c0","observation_id":"6f092341-92ce-44fc-936b-93eec9565eac","resolution":{"observed_at":"2026-08-07T12:42:59.129597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:54.662289Z","title":"The curious case of neural text degeneration","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.662289Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:841ac77988fb1eb1dfd616c4f0653ca38eba8291799574dc2c55a1b327628969","observation_id":"c0c6741f-363c-4600-beac-2a079a145f7e","resolution":{"observed_at":"2026-08-07T12:42:54.662289Z","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-07T12:42:58.979436Z","title":"Where is the signal in tokenization space? In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, pages 3966–3979, 2024","venue":null,"work_id":"b60f7ba7-f17f-4704-8fa7-747c986a2176","year":2024},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.839156Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:130bd6686f01bab4cbbea964c48d693b06d4e215c271d4e42c368008417c1793","observation_id":"4536babd-5779-41b0-910f-291b404cf4ac","resolution":{"observed_at":"2026-08-07T12:42:59.022460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.905786Z","title":"Markov constraints: Steerable generation of markov sequences","venue":null,"work_id":"d4799649-0646-47c1-a3b7-2ccc1aae03d5","year":2011},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.932143Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:2d974de2020ea4f442dd20ffc4d9f054fe9b3682ab38ced22ab8c816b73effa7","observation_id":"fd43477f-80e9-4dbd-bb45-febf43bfa209","resolution":{"observed_at":"2026-08-07T12:42:58.927368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.801812Z","title":"BERT: pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":"afb9b91e-1525-437e-8e4b-e06c3615d5b7","year":2019},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.009222Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:43319df913982e76fa6c0526b85b0a95de24ded802dcd003270ab0273947ed9e","observation_id":"2305328c-e7c2-4749-a1cf-77949bd69279","resolution":{"observed_at":"2026-08-07T12:42:58.850613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.718599Z","title":"Constraint propagation","venue":null,"work_id":"d89a14ea-0752-429e-bce4-33825a3558a5","year":2006},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.063203Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:9835792bd55417a88b38146f0646114d23157669e0f00b305d7f284a6b1e454d","observation_id":"eef691df-bd46-4d7a-8206-96e7ebccc75e","resolution":{"observed_at":"2026-08-07T12:42:58.732776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.667348Z","title":"Markov constraints for generating lyrics with style","venue":null,"work_id":"d24fcf42-c6b5-4c8c-8d9d-99e799ac45f1","year":2012},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.109120Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:c7abd3903972f4281047a3dbc4c1c11356e7bc81e82bfd5d104ce924d9d85c94","observation_id":"97b23d26-bbed-4633-9a5f-1064da61f3e4","resolution":{"observed_at":"2026-08-07T12:42:58.693074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.603568Z","title":"Avoiding plagiarism in markov sequence generation","venue":null,"work_id":"cef414d0-5ccd-4e28-985d-78bdb28ea485","year":2014},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.159708Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:97795473aabaffca10abe7f606f5cc9940850f4378a8940cf22b4648b4cb5f0b","observation_id":"02babfa4-a7a2-401c-b3d3-a357092a9c5d","resolution":{"observed_at":"2026-08-07T12:42:58.635106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.511793Z","title":"Generating all possible palin- dromes from ngram corpora","venue":null,"work_id":"640d9598-900b-4153-a990-264d8e606012","year":2015},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.274012Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:dafbfb4b980770dc685dedbdf3f21d3fc6c00ea233fafcb485d134fd30b0f154","observation_id":"c23ac38e-5c7e-4050-8a86-065fef7b6d85","resolution":{"observed_at":"2026-08-07T12:42:58.550139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.447054Z","title":"Assisted lead sheet composition using flowcomposer","venue":null,"work_id":"64a344b9-f17d-4b80-81a8-f5f9c82fb09b","year":2016},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.325706Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:f942c6cfc6ba31a4d6169d89ceff956778ae035415c94e756be2b7c33319978e","observation_id":"c290aa1f-069e-42cd-b395-05b316fe1568","resolution":{"observed_at":"2026-08-07T12:42:58.476378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.344166Z","title":"Expressing musical ideas with constraint programming using a model of tonal harmony","venue":null,"work_id":"725f32bc-9445-4c18-9ac6-732162a71a30","year":2024},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.399454Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:435afe09338efcbc600898b4359d4961c2b933ac85ba4d2cce77a4b8cec15bd4","observation_id":"b4bb3a9a-844c-4693-aa2f-40843d54b98c","resolution":{"observed_at":"2026-08-07T12:42:58.399994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.287867Z","title":"Lexically constrained decoding for sequence generation using grid beam search","venue":null,"work_id":"c2589e7c-d8fd-422a-965a-91a38460a3cb","year":2017},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.449719Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:ca8b0bc2944ae8560969bbe4002e3e595194845809130c33d12fe6db71736af0","observation_id":"c92cbe3f-6946-498e-9c5b-26b31d380c7f","resolution":{"observed_at":"2026-08-07T12:42:58.314378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.221886Z","title":"Neuro- Logic decoding: (un)supervised neural text generation with predicate logic constraints","venue":null,"work_id":"9a5e59c0-71f8-4bfc-be40-4a02d0f55810","year":2021},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.510328Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:0fce5fa76173354b05902cd2ed0b1b5dada9f6ae750c31e5cfca9f12e17037c2","observation_id":"a6d639a2-eea2-447c-8447-10b50d0bb3db","resolution":{"observed_at":"2026-08-07T12:42:58.245662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.165177Z","title":"Using on-the-fly model checking to improve constraint programming for dynamic problems","venue":null,"work_id":"5f6e743c-5c18-4f22-b231-c0009f71c4f3","year":2023},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.674602Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:9ef3aea7a1ce95ce122c924d64a7c80805695dd74039c3af11a81a657c74d03e","observation_id":"81155c10-74f1-4397-aa71-0cbdf0819dd3","resolution":{"observed_at":"2026-08-07T12:42:58.179684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:58.056133Z","title":"Generative constraint programming","venue":null,"work_id":"9267a137-df33-4ab9-8f89-a7a229ff0824","year":2024},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.772605Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:456365478ef887a3e1937011e4429c37fb8ef402a8f06335270b36be3cbc63a8","observation_id":"9deb284a-cbcf-4728-affe-80a64117ff00","resolution":{"observed_at":"2026-08-07T12:42:58.137680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.05395","last_updated":"2025-04-13T19:54:25Z","snapshot_observed_at":"2026-07-06T13:19:40.561842Z","submitted_at":"2022-06-11T02:07:33Z","title":"Why is constrained neural language generation particularly challenging?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.05395","snapshot_observed_at":"2026-08-07T12:42:55.894786Z","title":"Why is constrained neural language generation particularly challenging? arXiv preprint arXiv:2206.05395, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.894786Z"},"links":{"cited_paper":"/paper/2206.05395","citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:bd06b90ff5c5b14b7b66cc02194b8b8826e77eaa39f424a3f008098f0da01981","observation_id":"ddb7d4aa-df37-4093-a9d7-2f1b02168d51","resolution":{"observed_at":"2026-08-07T12:42:55.894786Z","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-07T12:42:57.914383Z","title":"A dynamic programming approach for consistency and propagation for knapsack constraints","venue":null,"work_id":"5e8cd41d-25d1-45f3-ab34-6ac250823f54","year":2003},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:56.008118Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:74c6c2abffabe9e204ea0b33f3baf529fc8988ed2d43ddc01fa4ae0f4aee3d55","observation_id":"59115db8-b128-45ea-8876-2d0d68db9560","resolution":{"observed_at":"2026-08-07T12:42:57.986627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:57.673525Z","title":"Flashattention: Fast and memory-efficient exact attention with io-awareness","venue":null,"work_id":"5d707724-5027-4232-b6b0-8b681298141f","year":2022},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:56.118441Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:e9fd49b99f6f56ba6be43294c6b7ba8a2ad9553b09bf96a95fba20c33d732d06","observation_id":"923ee6ee-2bf8-432f-be34-cbe729f8d4e5","resolution":{"observed_at":"2026-08-07T12:42:57.834301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.13630","last_updated":"2021-06-21T21:01:12Z","snapshot_observed_at":"2026-07-06T10:53:11.986981Z","submitted_at":"2021-03-25T06:57:11Z","title":"A Survey of Quantization Methods for Efficient Neural Network Inference","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.13630","snapshot_observed_at":"2026-08-07T12:42:56.274457Z","title":"Mahoney, and Kurt Keutzer","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:56.274457Z"},"links":{"cited_paper":"/paper/2103.13630","citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:68fdea7687b2911f4ad6d106373e6ddecbb44fa3507a548f27c5051fca63da1c","observation_id":"b2f43a7e-a1c9-427f-89d8-214f9fb73466","resolution":{"observed_at":"2026-08-07T12:42:56.274457Z","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-07T12:42:57.518817Z","title":"Thinking, fast and slow","venue":null,"work_id":"1a0a22ef-b6ae-4075-af4f-644533978c47","year":2011},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:56.427843Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:23151ebef2145c3a80af2a60aaaca10fe916606cacddbade2e216dfd6b7b1740","observation_id":"9e0abb26-7f78-4e4a-a5b0-948c73f28910","resolution":{"observed_at":"2026-08-07T12:42:57.603055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:57.276117Z","title":"Thinking fast and slow in ai","venue":null,"work_id":"d7c45948-d46f-4ff4-af48-de24ac0e9121","year":2021},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:56.544697Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:056e06875586806b71913099613c9d0c5bfb2d389c0c114e00cc7125453bef11","observation_id":"940f9649-b7d4-4d5f-be5d-701eaf6b1a25","resolution":{"observed_at":"2026-08-07T12:42:57.391623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:57.103899Z","title":"Lazy arc consistency","venue":null,"work_id":"70cdb37f-d22a-4020-a027-37dcdfb9d7c4","year":1996},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:56.671981Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:30c1a2069f21e71a42204c7a131bb9863319c2466ebecffe1ba7ce3552fb0235","observation_id":"3cce8f23-c007-4951-95dd-60a1ac31604a","resolution":{"observed_at":"2026-08-07T12:42:57.170727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:57.024247Z","title":"Constraint-based scheduling: applying constraint pro- gramming to scheduling problems, volume 39","venue":null,"work_id":"f1e6c786-4fa1-45b2-8aed-4492a88222e6","year":2001},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:56.845720Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:3ade4c0bd9a530d05fc2b141fe9af6f68a5db47248e5dece66b3cbd2ee9c2317","observation_id":"9765a5ce-47ee-4ce8-80c4-7f6201358d93","resolution":{"observed_at":"2026-08-07T12:42:57.069304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:42:54.739359Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:54.739359Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:d176999da7d6eb13068ada4f98ed16a8d6d96a6523c9699be1f31abf3304bd4e","observation_id":"8f2507be-b1aa-4d3f-93c4-558b0317cab1","resolution":{"observed_at":"2026-08-07T12:42:54.739359Z","resolver_source":null,"status":"parse_uncertain"},"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-07T12:42:55.569066Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:55.569066Z"},"links":{"citing_paper":"/paper/2505.24012"},"observation_digest":"sha256:c375cc7e4061f59efa38177f6a2cbb5cf10c95c810edb1e156f6c0644fea6b5d","observation_id":"d16883cd-6ae6-4f7d-8396-5c5d60a24fd4","resolution":{"observed_at":"2026-08-07T12:42:55.569066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.24012","last_updated":"2025-05-29T21:18:12Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T12:35:30.352031Z","submitted_at":"2025-05-29T21:18:12Z","title":"Large Language Model Meets Constraint Propagation"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":4,"verified_exact":0,"verified_fuzzy":30},"total_outbound_references":35},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2505.24012."}