{"as_of":"2026-08-12T19:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:316b214bf8a83350b4dc8ba24d6621a101ca1036f84052569034fb4fc2a2bbf5","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-12T06:34:41.77262+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-05-10T17:23:40.195717Z","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-12T00:21:22.337959Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.01041","last_updated":"2023-05-01T19:02:20Z","snapshot_observed_at":"2026-08-08T01:08:22.199627Z","submitted_at":"2023-05-01T19:02:20Z","title":"Data-Parallel Algorithms for String Diagrams","version":1},"cited_work":{"arxiv_id":"2305.01041","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.01041","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Data-parallel algorithms for string diagrams.arXiv preprint arXiv:2305.01041","venue":null,"work_id":"cf6aa88a-b9d4-41ab-9b4e-2502472e6a5a","year":2023},"citing_paper":{"arxiv_id":"2604.08331","last_updated":"2026-04-09T15:04:18Z","snapshot_observed_at":"2026-08-08T13:41:57.935528Z","submitted_at":"2026-04-09T15:04:18Z","title":"Metacat: a categorical framework for formal systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T17:23:40.195717Z"},"links":{"cited_paper":"/paper/2305.01041","citing_paper":"/paper/2604.08331"},"observation_digest":"sha256:4c49677502b868467b449ab82fd697541999b48999ac7d6922285bd54d3c0cee","observation_id":"981e9d52-e71e-457b-a121-56836fcd9ad5","resolution":{"observed_at":"2026-05-11T06:55:59.379355Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.01041","last_updated":"2023-05-01T19:02:20Z","snapshot_observed_at":"2026-08-08T01:08:22.199627Z","submitted_at":"2023-05-01T19:02:20Z","title":"Data-Parallel Algorithms for String Diagrams","version":1},"cited_work":{"arxiv_id":"2305.01041","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.01041","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Data-parallel algorithms for string diagrams.arXiv preprint arXiv:2305.01041","venue":null,"work_id":"cf6aa88a-b9d4-41ab-9b4e-2502472e6a5a","year":2023},"citing_paper":{"arxiv_id":"2604.25321","last_updated":"2026-04-28T07:36:44Z","snapshot_observed_at":"2026-07-06T23:11:11.827339Z","submitted_at":"2026-04-28T07:36:44Z","title":"Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T15:29:19.489764Z"},"links":{"cited_paper":"/paper/2305.01041","citing_paper":"/paper/2604.25321"},"observation_digest":"sha256:463928fabc2bc8d682a7261f854fbe9153dab2b3f00ab0c2495c3bcd66f3f112","observation_id":"2d543740-99fc-415f-a119-c02785ed2d43","resolution":{"observed_at":"2026-05-12T00:21:22.355094Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.01041/citation-record","integrity":"/paper/2305.01041/integrity","json":"/paper/2305.01041/citation-record.json","paper":"/paper/2305.01041"},"outbound":[],"paper":{"arxiv_id":"2305.01041","last_updated":"2023-05-01T19:02:20Z","latest_version":1,"primary_category":"math.CT","snapshot_observed_at":"2026-08-08T01:08:22.199627Z","submitted_at":"2023-05-01T19:02:20Z","title":"Data-Parallel Algorithms for String Diagrams"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2305.01041."}