{"as_of":"2026-08-12T05:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ab6e5a3383a8fa6e0a3a2ac50912a4bd4b67b6435d65bc99d21ff42366cfb72","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-07T15:29:19.489764Z","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.25321/citation-record","integrity":"/paper/2604.25321/integrity","json":"/paper/2604.25321/citation-record.json","paper":"/paper/2604.25321"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4204/eptcs.333.13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DisCoPy: Monoidal categories in Python","venue":"Electronic Proceedings in Theoretical Computer Science","work_id":"c2bad176-2f65-4b2a-b034-045006e001ab","year":2020},"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":1,"source":"pdf_text","source_observed_at":"2026-05-07T15:29:19.489764Z"},"links":{"citing_paper":"/paper/2604.25321"},"observation_digest":"sha256:09a634a107bc059ed043b4843140f229e148fa90a3f62589daf6b7b683fda53f","observation_id":"19f60c64-8a11-4722-9e2a-29ad2b4630bd","resolution":{"observed_at":"2026-05-09T02:29:40.369647Z","resolver_source":"doi","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":{"arxiv_id":"2006.15512","last_updated":"2021-06-14T18:59:25Z","snapshot_observed_at":"2026-08-06T11:18:06.931929Z","submitted_at":"2020-06-28T05:09:18Z","title":"Parallel Weighted Model Counting with Tensor Networks","version":2},"cited_work":{"arxiv_id":"2006.15512","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.15512","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Par- allel Weighted Model Counting with Tensor Networks","venue":null,"work_id":"f20c4ae1-9ff7-4add-8012-b3f905c9e821","year":2021},"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":2,"source":"pdf_text","source_observed_at":"2026-05-07T15:29:19.489764Z"},"links":{"cited_paper":"/paper/2006.15512","citing_paper":"/paper/2604.25321"},"observation_digest":"sha256:e6f1eeb0983eaa92c190b3e380117f7d06abbe7ff070bbe8720536d51d52fa00","observation_id":"2b8f8f04-40e4-4fda-a26b-e2f7d4575841","resolution":{"observed_at":"2026-05-12T00:21:22.684402Z","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":{"arxiv_id":"1406.5942","last_updated":"2015-08-19T08:31:21Z","snapshot_observed_at":"2026-08-12T04:36:32.640529Z","submitted_at":"2014-06-23T15:25:28Z","title":"Finite matrices are complete for (dagger-)hypergraph categories","version":2},"cited_work":{"arxiv_id":"1406.5942","doi":"10.48550/arxiv.1406.5942","metadata_source":"arxiv_reference","pith_arxiv_id":"1406.5942","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.48550/arXiv.1406.5942 , urldate =","venue":"arXiv (Cornell University)","work_id":"440609b3-5707-4bbd-bae8-26e199385dfa","year":null},"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":3,"source":"pdf_text","source_observed_at":"2026-05-07T15:29:19.489764Z"},"links":{"cited_paper":"/paper/1406.5942","citing_paper":"/paper/2604.25321"},"observation_digest":"sha256:4cb430a611715dd42132aaec49234f737fd34609f73a81aec60e20a944aea2b0","observation_id":"cac9e13f-7927-4bc2-9138-cd477c4ddb94","resolution":{"observed_at":"2026-07-04T20:31:53.480513Z","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":null,"cited_work":{"arxiv_id":"2511.14717","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A unified compositional view of attack tree metrics.arXiv preprint arXiv:2511.14717","venue":null,"work_id":"8ce920a3-8f12-4e47-95b0-ae32a456412e","year":null},"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":4,"source":"pdf_text","source_observed_at":"2026-05-07T15:29:19.489764Z"},"links":{"citing_paper":"/paper/2604.25321"},"observation_digest":"sha256:3571049cbef89046cc7b3cc56f1874c864217f30cf7bb88debdb95e16aaa284a","observation_id":"84a8e169-cb96-4448-95f2-38a4bf3b4078","resolution":{"observed_at":"2026-05-12T00:21:22.366491Z","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":{"arxiv_id":"2404.02679","last_updated":"2024-04-03T12:22:24Z","snapshot_observed_at":"2026-07-06T17:55:03.561275Z","submitted_at":"2024-04-03T12:22:24Z","title":"Rendering string diagrams recursively","version":1},"cited_work":{"arxiv_id":"2404.02679","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.02679","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rendering string diagrams recursively.arXiv preprint arXiv:2404.02679","venue":null,"work_id":"877d78f6-4a63-4af4-af25-bf14e9949e2a","year":null},"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":5,"source":"pdf_text","source_observed_at":"2026-05-07T15:29:19.489764Z"},"links":{"cited_paper":"/paper/2404.02679","citing_paper":"/paper/2604.25321"},"observation_digest":"sha256:9b7bbc1ad5d5e2b9a9b8a6818a2938f2857230aa818b7287a8f582a22680661a","observation_id":"afcf40c4-7e5f-42be-8b42-a21f9f09b43d","resolution":{"observed_at":"2026-05-12T00:21:22.576953Z","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":{"arxiv_id":"2311.10608","last_updated":"2023-11-17T16:03:08Z","snapshot_observed_at":"2026-07-06T16:49:04.651019Z","submitted_at":"2023-11-17T16:03:08Z","title":"DisCoPy: the Hierarchy of Graphical Languages in Python","version":1},"cited_work":{"arxiv_id":"2311.10608","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.10608","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"DisCoPy: the hierarchy of graphical languages in Python.arXiv preprint arXiv:2311.10608","venue":null,"work_id":"90061dbd-93dd-4d75-9daa-0d4a6d107a0f","year":null},"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":6,"source":"pdf_text","source_observed_at":"2026-05-07T15:29:19.489764Z"},"links":{"cited_paper":"/paper/2311.10608","citing_paper":"/paper/2604.25321"},"observation_digest":"sha256:f2565df4b46baa195cf9b4396ca662d0458522830620ac0f7c548ee7ce85d6b3","observation_id":"035acc4a-845a-49ac-a108-814b650da35a","resolution":{"observed_at":"2026-05-12T00:21:22.476101Z","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":{"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:dd4e2ca77cca9d48d7f6366a8727348d2a8b19471b1766f3ebc40aa4ba9ddece","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-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":"1712.09495","last_updated":"2018-01-03T10:07:31Z","snapshot_observed_at":"2026-08-08T00:08:15.763520Z","submitted_at":"2017-12-27T05:15:21Z","title":"Rewriting in Free Hypergraph Categories","version":2},"cited_work":{"arxiv_id":"1712.09495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1712.09495","snapshot_observed_at":"2026-07-04T22:27:11.068068Z","title":"Rewriting in free hypergraph categories.arXiv preprint arXiv:1712.09495","venue":null,"work_id":"b1737d88-035a-4e5a-b9fd-7f09ad0923a0","year":null},"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":8,"source":"pdf_text","source_observed_at":"2026-05-07T15:29:19.489764Z"},"links":{"cited_paper":"/paper/1712.09495","citing_paper":"/paper/2604.25321"},"observation_digest":"sha256:e792621eec94890510ff1eab8334f50be580a4127330dce878a4bbeeb788b9d6","observation_id":"30ac3009-de56-45fb-be42-e97fdfda2cf5","resolution":{"observed_at":"2026-07-04T22:27:11.068068Z","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"}}],"paper":{"arxiv_id":"2604.25321","last_updated":"2026-04-28T07:36:44Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":7,"verified_fuzzy":0},"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 12 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:2604.25321."}