{"as_of":"2026-08-22T19:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c8344b221da6ce310c32c24f7461a6af02a10cc8232ee8d920f1390ede5f52d8","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T05:54:17.861186Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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-05-15T19:45:34.338092Z","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":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"cited_work":{"arxiv_id":"2502.18473","doi":"10.48550/arxiv.2502.18473","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18473","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ArXiv.org","work_id":"0beb009d-7ec2-487f-825a-9a8117b87216","year":2025},"citing_paper":{"arxiv_id":"2604.16320","last_updated":"2026-02-24T19:07:25Z","snapshot_observed_at":"2026-08-13T07:26:14.087734Z","submitted_at":"2026-02-24T19:07:25Z","title":"How Robustly do LLMs Understand Execution Semantics?","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-15T19:45:34.338092Z"},"links":{"cited_paper":"/paper/2502.18473","citing_paper":"/paper/2604.16320"},"observation_digest":"sha256:98a1586a9740a32cbd610a21dc758add70e32994db12723a94af118ccc89bf92","observation_id":"42bc0641-7f62-491c-bc91-cc70d2faa0d8","resolution":{"observed_at":"2026-05-15T19:46:32.914616Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.18473/citation-record","integrity":"/paper/2502.18473/integrity","json":"/paper/2502.18473/citation-record.json","paper":"/paper/2502.18473"},"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-09T05:54:18.101724Z","title":"Automated unit test improvement using large language models at M eta","venue":null,"work_id":"15cee5f0-ce83-4421-a136-abb0324e6fb5","year":2024},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.791370Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:57a9d1c3678ccdbab1e928c329d1da4c9913ae888bdaa502d18a50f3afc20fa4","observation_id":"a60a836c-9f6b-45d8-a15f-749b4247e61e","resolution":{"observed_at":"2026-08-09T05:54:18.105514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.10397","last_updated":"2022-11-23T07:42:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-07-21T10:18:37Z","title":"CodeT: Code Generation with Generated Tests","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.10397","snapshot_observed_at":"2026-08-09T05:54:17.795544Z","title":"Code T : Code generation with generated tests","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.795544Z"},"links":{"cited_paper":"/paper/2207.10397","citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:853f8276e5072945fd0b9b2fccf2ce16859601ecc9182de94fa551523019911c","observation_id":"9948a37f-d826-4b94-b4fe-3937186e3c16","resolution":{"observed_at":"2026-08-09T05:54:17.795544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-20T20:50:23.483838Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-09T05:54:17.799348Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.799348Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:640ee404e9ccf0adfc4ca354bc6cbabf906e252efa571dd281c97ea9834c9612","observation_id":"3074b179-cd43-42c5-aaa0-de9d0299692e","resolution":{"observed_at":"2026-08-09T05:54:17.799348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17311","last_updated":"2023-11-29T02:07:09Z","snapshot_observed_at":"2026-08-16T16:45:56.159370Z","submitted_at":"2023-11-29T02:07:09Z","title":"Universal Self-Consistency for Large Language Model Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.17311","snapshot_observed_at":"2026-08-09T05:54:17.803254Z","title":"Universal self-consistency for large language model generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.803254Z"},"links":{"cited_paper":"/paper/2311.17311","citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:a986cab6e1fd4750cb93d73fdaf4d82fb5b923aa294d3c2e464b8fac6118cd83","observation_id":"7550de0f-eae8-4dde-9d62-c0284217b314","resolution":{"observed_at":"2026-08-09T05:54:17.803254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.05128","last_updated":"2023-10-05T09:12:07Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-04-11T10:43:43Z","title":"Teaching Large Language Models to Self-Debug","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.05128","snapshot_observed_at":"2026-08-09T05:54:17.808996Z","title":"Teaching large language models to self-debug","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.808996Z"},"links":{"cited_paper":"/paper/2304.05128","citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:3b9eb7e6990d1c55748ed9a2b8b2db7f3f96b057dec595d004078f239f40a72b","observation_id":"f19c978a-e492-446c-bace-d01fe1e58f6c","resolution":{"observed_at":"2026-08-09T05:54:17.808996Z","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-09T05:54:18.090267Z","title":"Automated testing of refactoring engines","venue":null,"work_id":"11237b9b-948e-4f76-b6cb-7eb448f53e4d","year":2007},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.812924Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:ab591d420dd95f88686076d883ad27d5ce7844e08e3a7e887a4121b1dc007e90","observation_id":"57993b9c-9aec-4d5a-b4cb-5084f327ae06","resolution":{"observed_at":"2026-08-09T05:54:18.093908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01006","last_updated":"2024-10-31T23:44:31Z","snapshot_observed_at":"2026-08-16T13:46:53.603876Z","submitted_at":"2024-06-03T05:36:57Z","title":"SemCoder: Training Code Language Models with Comprehensive Semantics Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01006","snapshot_observed_at":"2026-08-09T05:54:17.816673Z","title":"J., Kaiser, G., Yang, J., and Ray, B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.816673Z"},"links":{"cited_paper":"/paper/2406.01006","citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:25ca869ed4cbf0338344f139f557dfa4f3fd6c9e629edc312a42ffc77af020c5","observation_id":"66f442b8-373a-4504-9292-1a66a89bfd07","resolution":{"observed_at":"2026-08-09T05:54:17.816673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01831","last_updated":"2024-04-15T23:08:37Z","snapshot_observed_at":"2026-08-16T14:55:35.543838Z","submitted_at":"2023-10-03T06:55:45Z","title":"Can Large Language Models Transform Natural Language Intent into Formal Method Postconditions?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01831","snapshot_observed_at":"2026-08-09T05:54:17.820677Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.820677Z"},"links":{"cited_paper":"/paper/2310.01831","citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:8f8c34d3a364c9deba76d2dcc81c023d1d1fbaa34933a1ba42d0f1d118367abf","observation_id":"b8585ea0-7c3c-4c6a-ab67-6de2df08abea","resolution":{"observed_at":"2026-08-09T05:54:17.820677Z","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-09T05:54:18.079042Z","title":"and Bishop, M","venue":null,"work_id":"64c19cfc-4348-4c9d-8161-23803a90f60d","year":1997},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.824780Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:e13575ebd83a56059c0ebf42ead4be1cfadd9eac76752f9b46a58268ab9fc331","observation_id":"7ce956eb-9b39-49a3-82c4-f5d1e9c5d5a2","resolution":{"observed_at":"2026-08-09T05:54:18.082704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16092","last_updated":"2025-02-22T07:07:32Z","snapshot_observed_at":"2026-08-21T10:01:46.085673Z","submitted_at":"2024-10-21T15:13:32Z","title":"ChangeGuard: Validating Code Changes via Pairwise Learning-Guided Execution","version":2},"cited_work":{"arxiv_id":"2410.16092","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.16092","snapshot_observed_at":"2026-08-09T05:54:17.916444Z","title":"ChangeGuard: Validating Code Changes via Pairwise Learning-Guided Execution","venue":"cs.SE","work_id":"c9a461ba-deca-4173-8926-3fea37c3bc8b","year":2024},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.828483Z"},"links":{"cited_paper":"/paper/2410.16092","citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:a17162481a7a6d552a797d0a8af3bd6f3bb9a8930e82d90e8e7d3718ba249206","observation_id":"e759eb1e-9ffe-415a-b295-11203c7957f3","resolution":{"observed_at":"2026-08-09T05:54:17.922488Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:54:18.066742Z","title":"Self-supervised learning to prove equivalence between straight-line programs via rewrite rules","venue":null,"work_id":"19368d94-d209-497e-9949-697fad8e79f0","year":2023},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.832080Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:f8e61a9346021e8ede262874f6d6d24602874ae0a5ec8a10b0131a32f10a728d","observation_id":"6916095f-6a28-4427-bd0c-bbea6779177c","resolution":{"observed_at":"2026-08-09T05:54:18.071092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:54:18.054886Z","title":"Compiler validation via equivalence modulo inputs","venue":null,"work_id":"0699499b-406d-48fa-aae7-4d01ac5bc150","year":2014},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.835729Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:0872a578b56117e5021c19f6be2a1a6365ec81fa8c44c849b8d87264a4f09dfd","observation_id":"ebaa91f4-2df0-46f8-85e1-5ed89425a599","resolution":{"observed_at":"2026-08-09T05:54:18.058832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:54:18.044351Z","title":"P., Lahiri, S","venue":null,"work_id":"2ffce7fe-7d46-46e0-9efd-0b680b8ac6be","year":2023},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.839581Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:975492c971361b7ea5ddd5af35c21c50564c1fa817ceb15fc61f6c65245c9d90","observation_id":"f4f586be-af10-4f90-a88d-03924d136ac5","resolution":{"observed_at":"2026-08-09T05:54:18.048023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:54:18.033637Z","title":"S., Wang, Y., and Zhang, L","venue":null,"work_id":"64048d0a-0286-4224-97fa-61ee0476fe83","year":2024},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.843035Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:d6e534dd81bdb32702da2047fd5be086d855d154d10ceab89a35a7ad6712871d","observation_id":"1307cb70-c637-4db1-bc84-0ca6e6045bf2","resolution":{"observed_at":"2026-08-09T05:54:18.037283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07565","last_updated":"2024-10-03T16:48:55Z","snapshot_observed_at":"2026-08-22T04:10:39.410152Z","submitted_at":"2024-07-10T11:50:20Z","title":"On Leakage of Code Generation Evaluation Datasets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07565","snapshot_observed_at":"2026-08-09T05:54:17.846372Z","title":"On leakage of code generation evaluation datasets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.846372Z"},"links":{"cited_paper":"/paper/2407.07565","citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:6a921cf371d2fbdf8753a1e29cfebfe8778a2d8fbceef139aa8ef8597897e3da","observation_id":"e008c9ec-d0dd-42a5-b23d-e94421bec760","resolution":{"observed_at":"2026-08-09T05:54:17.846372Z","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-09T05:54:18.023468Z","title":"User interaction models for disambiguation in programming by example","venue":null,"work_id":"78f2e78f-045d-4ac1-b586-752f402405a1","year":2015},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.850052Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:2475d9037c7d0ef94b099a36285a183c9d22ae3271c6aaf92739019567eb24b8","observation_id":"30f4f378-8d72-497d-8669-895e95d57930","resolution":{"observed_at":"2026-08-09T05:54:18.027178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T05:54:18.010883Z","title":null,"venue":null,"work_id":"b5cdf53f-8cc7-4d6d-94d5-e7535670a56f","year":1998},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.853618Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:1f4d45dc3413187acdd9a3f6c5cbf81ea9b9cd3ea7957007cabd4d5cdccd876c","observation_id":"2595e9de-c4ec-4a1e-bf81-784122c6127c","resolution":{"observed_at":"2026-08-09T05:54:18.015326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11171","last_updated":"2023-03-07T17:57:37Z","snapshot_observed_at":"2026-08-16T01:49:22.176843Z","submitted_at":"2022-03-21T17:48:52Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.11171","snapshot_observed_at":"2026-08-09T05:54:17.857319Z","title":"Self-consistency improves chain of thought reasoning in language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.857319Z"},"links":{"cited_paper":"/paper/2203.11171","citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:2cf9310a6deb218a538a7f3a64b6c410a48b34675f825be697ffb79ad1e710f1","observation_id":"3a77ba75-7c70-4189-9b3f-21a534de5227","resolution":{"observed_at":"2026-08-09T05:54:17.857319Z","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-09T05:54:17.861186Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T05:54:17.861186Z"},"links":{"citing_paper":"/paper/2502.18473"},"observation_digest":"sha256:c9d07119f362452cf53a703a7765326f81f2f2abaa6b2c931f600db197b66654","observation_id":"3cbcfe10-2de1-4f59-8ab0-29ba1875fc34","resolution":{"observed_at":"2026-08-09T05:54:17.861186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.18473","last_updated":"2025-02-05T12:54:17Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-21T10:01:54.282525Z","submitted_at":"2025-02-05T12:54:17Z","title":"Disproving Program Equivalence with LLMs"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":19},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 1 inbound Pith citation observation for arXiv:2502.18473."}