{"as_of":"2026-08-11T16:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0034d5c17bc61b764cc71768b77266894047487d797a8cf17f39e02383093aa7","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T06:47:55.926034Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2604.17010/citation-record","integrity":"/paper/2604.17010/integrity","json":"/paper/2604.17010/citation-record.json","paper":"/paper/2604.17010"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.08227","last_updated":"2022-12-19T10:30:12Z","snapshot_observed_at":"2026-08-09T09:48:07.734660Z","submitted_at":"2022-08-17T11:16:52Z","title":"MultiPL-E: A Scalable and Extensible Approach to Benchmarking Neural Code Generation","version":4},"cited_work":{"arxiv_id":"2208.08227","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.08227","snapshot_observed_at":"2026-07-02T22:17:25.584510Z","title":"Multipl-e: A scalable and extensible approach to benchmarking neural code generation","venue":null,"work_id":"eb2a6abe-2ae0-4366-96e5-78fe4c32cc33","year":2022},"citing_paper":{"arxiv_id":"2604.17010","last_updated":"2026-05-03T12:28:34Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T14:43:00Z","title":"Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T06:47:55.926034Z"},"links":{"cited_paper":"/paper/2208.08227","citing_paper":"/paper/2604.17010"},"observation_digest":"sha256:8e3575402822ad041adad63eca6930c6ca3fa5fa73adbc32f4c6efb260832692","observation_id":"d0485bf0-4f79-4403-a644-59bb932e7edc","resolution":{"observed_at":"2026-05-10T06:51:46.287422Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19085","last_updated":"2025-01-31T12:23:28Z","snapshot_observed_at":"2026-08-09T21:20:36.045949Z","submitted_at":"2025-01-31T12:23:28Z","title":"Enhancing Code Generation for Low-Resource Languages: No Silver Bullet","version":1},"cited_work":{"arxiv_id":"2501.19085","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.19085","snapshot_observed_at":"2026-07-10T19:57:34.124979Z","title":"Enhanc- ing code generation for low-resource languages: No silver bullet","venue":"cs.SE","work_id":"083884d7-6ef4-4e4a-9044-dadb97670289","year":2025},"citing_paper":{"arxiv_id":"2604.17010","last_updated":"2026-05-03T12:28:34Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T14:43:00Z","title":"Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T06:47:55.926034Z"},"links":{"cited_paper":"/paper/2501.19085","citing_paper":"/paper/2604.17010"},"observation_digest":"sha256:d58436c8fa4763f69e036403606a5ee06694f1ede64a0e56556ac3069162a127","observation_id":"84365819-21b4-4d06-835e-ab0d9076d00a","resolution":{"observed_at":"2026-05-10T06:51:46.289968Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"This purity ensures that two functions are semantically equivalent if they produce the same outputs for all inputs, regardless of how those outputs are computed","venue":null,"work_id":"ee287440-82fd-4374-85ec-4da04d5f611a","year":null},"citing_paper":{"arxiv_id":"2604.17010","last_updated":"2026-05-03T12:28:34Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T14:43:00Z","title":"Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T06:47:55.926034Z"},"links":{"citing_paper":"/paper/2604.17010"},"observation_digest":"sha256:823f10a0bc605e0059ed17432e0a491460b1edb974d9b9c7e3b09dc1b46aca68","observation_id":"accc54bd-36e1-4d1a-9086-78ac769c17b8","resolution":{"observed_at":"2026-05-21T15:20:18.582282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"negative","venue":null,"work_id":"3dff8010-08b3-445f-8ae1-8caa922c1a5d","year":2025},"citing_paper":{"arxiv_id":"2604.17010","last_updated":"2026-05-03T12:28:34Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T14:43:00Z","title":"Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T06:47:55.926034Z"},"links":{"citing_paper":"/paper/2604.17010"},"observation_digest":"sha256:4ee1f6295ae7266e2e835327073a66e607b8d17123cd601f5f971d937dc5ff5d","observation_id":"e41a3da1-79e7-4982-9b70-7e4bff4c3aa5","resolution":{"observed_at":"2026-05-21T15:20:18.577356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"@-}}`annotation , with the exact naming pattern lemma_<P>_equiv","venue":null,"work_id":"32cb69fe-bf31-4bd7-a9ce-78e7dd76c2ce","year":null},"citing_paper":{"arxiv_id":"2604.17010","last_updated":"2026-05-03T12:28:34Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T14:43:00Z","title":"Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T06:47:55.926034Z"},"links":{"citing_paper":"/paper/2604.17010"},"observation_digest":"sha256:5058156e1b0992628bbd44060edaf73564bd2a178a98f79b4285fbc1e398f1b3","observation_id":"5b74925d-11f2-4f23-af46-74ad4ba300a4","resolution":{"observed_at":"2026-05-21T15:20:18.579982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9cbc0a93-7c5d-4681-8d62-2ce9b4ab684a","year":null},"citing_paper":{"arxiv_id":"2604.17010","last_updated":"2026-05-03T12:28:34Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T14:43:00Z","title":"Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T06:47:55.926034Z"},"links":{"citing_paper":"/paper/2604.17010"},"observation_digest":"sha256:dfad8a21ca8167f6c99a97fbc09571bf932ec4e79abf28d5c6e739056531e95e","observation_id":"196edc9e-3e2c-4cfc-b7eb-34e8759e0490","resolution":{"observed_at":"2026-05-21T15:20:18.585019Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"21c9a296-a994-412b-8e26-0107a1c7e9e4","year":null},"citing_paper":{"arxiv_id":"2604.17010","last_updated":"2026-05-03T12:28:34Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T14:43:00Z","title":"Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T06:47:55.926034Z"},"links":{"citing_paper":"/paper/2604.17010"},"observation_digest":"sha256:b0457b827295ac386f40444fb44314455a0d0ff92f3b09620f2a0c39c9da63d9","observation_id":"2f545094-75d4-48cc-9f2e-ae855e5d9ff4","resolution":{"observed_at":"2026-05-21T15:20:18.572568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"--reflection","venue":null,"work_id":"ae395657-fb8e-41aa-8396-f05f1f019acd","year":2025},"citing_paper":{"arxiv_id":"2604.17010","last_updated":"2026-05-03T12:28:34Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T14:43:00Z","title":"Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T06:47:55.926034Z"},"links":{"citing_paper":"/paper/2604.17010"},"observation_digest":"sha256:92d2a95af289765b861646208c8b215297e35c12a20b1f9e83b3d5597fc9eeca","observation_id":"b6891fe2-b5c2-4df0-98ec-49fd19544073","resolution":{"observed_at":"2026-05-21T15:20:18.574882Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.17010","last_updated":"2026-05-03T12:28:34Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T14:43:00Z","title":"Improving LLM Code Reasoning via Semantic Equivalence Self-Play with Formal Verification"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":3},"total_outbound_references":8},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:2604.17010."}