{"as_of":"2026-08-10T09:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:831995a47172a48bafaf4864a48a2bd9979896e5684dc35de611dc7dcccb24b9","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T21:36:35.209599Z","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":"2408.14701","last_updated":"2024-08-27T00:00:16Z","snapshot_observed_at":"2026-08-09T23:45:29.260795Z","submitted_at":"2024-08-27T00:00:16Z","title":"A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14701","snapshot_observed_at":"2026-08-02T21:36:35.209599Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.19776","last_updated":"2026-07-28T15:48:12Z","snapshot_observed_at":"2026-08-07T16:45:56.692775Z","submitted_at":"2026-02-23T12:31:15Z","title":"Layered Monoidal Theories I: Diagrammatic Algebra and Applications","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-02T21:36:35.209599Z"},"links":{"cited_paper":"/paper/2408.14701","citing_paper":"/paper/2602.19776"},"observation_digest":"sha256:6f50d7309a9a62421d2977d7551a4c892a75022090c1f7381522406691a7af8a","observation_id":"20688330-d410-4d5f-9712-fa811834d80b","resolution":{"observed_at":"2026-08-02T21:36:35.209599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14701","last_updated":"2024-08-27T00:00:16Z","snapshot_observed_at":"2026-08-09T23:45:29.260795Z","submitted_at":"2024-08-27T00:00:16Z","title":"A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming","version":1},"cited_work":{"arxiv_id":"2408.14701","doi":"10.48550/arxiv.2408.14701","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.14701","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"48550/ARXIV.2408.14701","venue":"arXiv (Cornell University)","work_id":"90d29071-abd7-4f03-9c6d-2c4b00bbf965","year":2023},"citing_paper":{"arxiv_id":"2604.27268","last_updated":"2026-04-29T23:48:07Z","snapshot_observed_at":"2026-07-06T23:12:47.745700Z","submitted_at":"2026-04-29T23:48:07Z","title":"A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T09:39:01.657035Z"},"links":{"cited_paper":"/paper/2408.14701","citing_paper":"/paper/2604.27268"},"observation_digest":"sha256:c9bb1f68189cfc7d812c225bd6912651923af6c5b75cf4d019c7ee07b68e83e8","observation_id":"ccd3f430-c224-4feb-9a29-26fa2a76f25e","resolution":{"observed_at":"2026-05-09T04:15:12.645653Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14701","last_updated":"2024-08-27T00:00:16Z","snapshot_observed_at":"2026-08-09T23:45:29.260795Z","submitted_at":"2024-08-27T00:00:16Z","title":"A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming","version":1},"cited_work":{"arxiv_id":"2408.14701","doi":"10.48550/arxiv.2408.14701","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.14701","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"48550/ARXIV.2408.14701","venue":"arXiv (Cornell University)","work_id":"90d29071-abd7-4f03-9c6d-2c4b00bbf965","year":2023},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-02T08:41:12.366504Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"cited_paper":"/paper/2408.14701","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:276c2fe69689b84d8c5fe990f6435ca07861fc0ce606e3a5f379b8cd2154d5af","observation_id":"d72634e1-3b64-46d8-b0b4-dc59e745c2ef","resolution":{"observed_at":"2026-07-04T02:49:24.902861Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.14701/citation-record","integrity":"/paper/2408.14701/integrity","json":"/paper/2408.14701/citation-record.json","paper":"/paper/2408.14701"},"outbound":[],"paper":{"arxiv_id":"2408.14701","last_updated":"2024-08-27T00:00:16Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-09T23:45:29.260795Z","submitted_at":"2024-08-27T00:00:16Z","title":"A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2408.14701."}