{"as_of":"2026-08-09T21:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c353953ebab473aaef9bf0b0ed61e34a6c097a65e7418d3ff126e83a84a48ed8","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T18:28:57.329263Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-06-30T08:14:25.322516Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1305.0297","last_updated":"2013-05-01T21:24:17Z","snapshot_observed_at":"2026-08-01T16:12:31.103197Z","submitted_at":"2013-05-01T21:24:17Z","title":"The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.0297","snapshot_observed_at":"2026-08-07T18:28:57.329263Z","title":"The operad of wiring diagrams: Formalizing a graphical language for databases, recursion, and plug-and-play circuits","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.10368","last_updated":"2025-05-09T04:56:35Z","snapshot_observed_at":"2026-08-09T11:56:24.477540Z","submitted_at":"2025-02-14T18:47:07Z","title":"Generalised Process Theories","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T18:28:57.329263Z"},"links":{"cited_paper":"/paper/1305.0297","citing_paper":"/paper/2502.10368"},"observation_digest":"sha256:683e2f5badba7c115d08b6ae28a0c36b49cf3a034b7e17995f1019d0cfd0f2ea","observation_id":"8b87b610-6ede-4a63-a93a-f45e70cdfb88","resolution":{"observed_at":"2026-08-07T18:28:57.329263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1305.0297","last_updated":"2013-05-01T21:24:17Z","snapshot_observed_at":"2026-08-01T16:12:31.103197Z","submitted_at":"2013-05-01T21:24:17Z","title":"The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.0297","snapshot_observed_at":"2026-08-06T04:23:01.812022Z","title":"Preprint, doi:10.48550/arXiv.1305.0297","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.03642","last_updated":"2025-08-05T16:54:15Z","snapshot_observed_at":"2026-08-08T09:25:21.772517Z","submitted_at":"2025-08-05T16:54:15Z","title":"Intent Preserving Generation of Diverse and Idiomatic (Code-)Artifacts","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T04:23:01.812022Z"},"links":{"cited_paper":"/paper/1305.0297","citing_paper":"/paper/2508.03642"},"observation_digest":"sha256:8e2a96f61f0e9d9848c45158eb96df54730f6cd0bf051d594daae2765523c24d","observation_id":"e88db1a3-0490-409d-bcb1-302ab3b164b0","resolution":{"observed_at":"2026-08-06T04:23:01.812022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1305.0297","last_updated":"2013-05-01T21:24:17Z","snapshot_observed_at":"2026-08-01T16:12:31.103197Z","submitted_at":"2013-05-01T21:24:17Z","title":"The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.0297","snapshot_observed_at":"2026-08-05T22:42:54.479152Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.06637","last_updated":"2026-06-24T15:57:13Z","snapshot_observed_at":"2026-08-07T16:38:57.553847Z","submitted_at":"2025-08-08T18:34:36Z","title":"Double-functorial representation of regular hyperdoctrines","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T22:42:54.479152Z"},"links":{"cited_paper":"/paper/1305.0297","citing_paper":"/paper/2508.06637"},"observation_digest":"sha256:3912f4eed62eb682a0f82c6ed752999e594e884650daf4f40ea218d7855b5348","observation_id":"d50ab691-68f3-4d6e-8b5c-ccdc6918c427","resolution":{"observed_at":"2026-08-05T22:42:54.479152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1305.0297","last_updated":"2013-05-01T21:24:17Z","snapshot_observed_at":"2026-08-01T16:12:31.103197Z","submitted_at":"2013-05-01T21:24:17Z","title":"The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits","version":1},"cited_work":{"arxiv_id":"1305.0297","doi":null,"metadata_source":"pith","pith_arxiv_id":"1305.0297","snapshot_observed_at":"2026-06-30T08:14:25.322516Z","title":"The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits","venue":"cs.DB","work_id":"825bdc6e-6a04-4b4e-9917-6f40da1d72b6","year":2013},"citing_paper":{"arxiv_id":"2605.08609","last_updated":"2026-05-09T02:08:42Z","snapshot_observed_at":"2026-08-02T06:12:04.045952Z","submitted_at":"2026-05-09T02:08:42Z","title":"Sheaves as a Means of Maintaining Consistency in Model-based Systems Engineering","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T01:02:35.431348Z"},"links":{"cited_paper":"/paper/1305.0297","citing_paper":"/paper/2605.08609"},"observation_digest":"sha256:076ccf5eb151c0ca0721b9ef22d15042cd7202d51a3cd82f04230a93f0aa4e8d","observation_id":"fc9b0d01-44e2-40be-a9da-5fa4486648e5","resolution":{"observed_at":"2026-05-12T08:31:24.592048Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1305.0297","last_updated":"2013-05-01T21:24:17Z","snapshot_observed_at":"2026-08-01T16:12:31.103197Z","submitted_at":"2013-05-01T21:24:17Z","title":"The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits","version":1},"cited_work":{"arxiv_id":"1305.0297","doi":null,"metadata_source":"pith","pith_arxiv_id":"1305.0297","snapshot_observed_at":"2026-06-30T08:14:25.322516Z","title":"The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits","venue":"cs.DB","work_id":"825bdc6e-6a04-4b4e-9917-6f40da1d72b6","year":2013},"citing_paper":{"arxiv_id":"2606.28984","last_updated":"2026-06-27T15:39:01Z","snapshot_observed_at":"2026-08-06T21:32:02.588381Z","submitted_at":"2026-06-27T15:39:01Z","title":"Compositional Dynamics in Learning and Mechanics","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T08:14:14.851773Z"},"links":{"cited_paper":"/paper/1305.0297","citing_paper":"/paper/2606.28984"},"observation_digest":"sha256:cedf2f50eb0b376756340d3a724a80303c9a1d6e8c986af76c3552338d4080a0","observation_id":"dce84806-0687-4de4-83eb-4c9a6e01d887","resolution":{"observed_at":"2026-06-30T08:14:25.323866Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1305.0297/citation-record","integrity":"/paper/1305.0297/integrity","json":"/paper/1305.0297/citation-record.json","paper":"/paper/1305.0297"},"outbound":[],"paper":{"arxiv_id":"1305.0297","last_updated":"2013-05-01T21:24:17Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-01T16:12:31.103197Z","submitted_at":"2013-05-01T21:24:17Z","title":"The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1305.0297."}