{"as_of":"2026-08-08T02:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2dc5b00026cd9436e755ac753175b437fff98c71aa367532117158dd4520ddc0","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:39:51.688969Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-17T04:21:30.887901Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.13111","last_updated":"2024-10-17T00:49:53Z","snapshot_observed_at":"2026-07-06T19:34:59.826604Z","submitted_at":"2024-10-17T00:49:53Z","title":"Controllable Generation via Locally Constrained Resampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13111","snapshot_observed_at":"2026-08-05T22:39:51.688969Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.688969Z"},"links":{"cited_paper":"/paper/2410.13111","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:5417ca7d16ea7f2e4cb51719d509a79886db08fb77a463f8142168f69d4d0c55","observation_id":"e71510d3-554c-47c1-9e2b-de4e601eb46d","resolution":{"observed_at":"2026-08-05T22:39:51.688969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13111","last_updated":"2024-10-17T00:49:53Z","snapshot_observed_at":"2026-07-06T19:34:59.826604Z","submitted_at":"2024-10-17T00:49:53Z","title":"Controllable Generation via Locally Constrained Resampling","version":1},"cited_work":{"arxiv_id":"2410.13111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13111","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d1e15831-1a78-4f14-b31b-9a150e8d7b3d","year":2024},"citing_paper":{"arxiv_id":"2511.22277","last_updated":"2026-04-24T08:52:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-11-27T09:59:39Z","title":"TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-17T04:19:18.805697Z"},"links":{"cited_paper":"/paper/2410.13111","citing_paper":"/paper/2511.22277"},"observation_digest":"sha256:5011720b0597a61b1e57e493f52c2f2b8433bed3513171858d5b96d3e88960d2","observation_id":"329006c7-98c8-4b90-9379-84b4713d2cc2","resolution":{"observed_at":"2026-05-17T04:21:30.889669Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.13111/citation-record","integrity":"/paper/2410.13111/integrity","json":"/paper/2410.13111/citation-record.json","paper":"/paper/2410.13111"},"outbound":[],"paper":{"arxiv_id":"2410.13111","last_updated":"2024-10-17T00:49:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:34:59.826604Z","submitted_at":"2024-10-17T00:49:53Z","title":"Controllable Generation via Locally Constrained Resampling"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.13111."}