{"as_of":"2026-08-10T03:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d6b5a97576c69e416dced027686ca63c68fb47993af683df1377122e8c5f5f45","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-09T06:31:02.800959+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-05T05:34:48.434367Z","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-13T18:38:07.523680Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1307.6894","last_updated":"2013-07-25T23:33:24Z","snapshot_observed_at":"2026-08-04T05:30:08.638968Z","submitted_at":"2013-07-25T23:33:24Z","title":"The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1307.6894","snapshot_observed_at":"2026-08-05T05:34:48.434367Z","title":"Wiring diagrams as normal forms for computing in symmetric monoidal categories","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05462","last_updated":"2025-09-05T19:35:08Z","snapshot_observed_at":"2026-08-05T05:34:42.854457Z","submitted_at":"2025-09-05T19:35:08Z","title":"The compact double category $\\mathbf{Int}(\\mathbf{Poly}_*)$ models control flow and data transformations","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T05:34:48.434367Z"},"links":{"cited_paper":"/paper/1307.6894","citing_paper":"/paper/2509.05462"},"observation_digest":"sha256:c68061b195efd9c6441690430de5ed36d3028889db00696b9e8ecd5d4ccf72ea","observation_id":"85853baf-b970-452b-9ceb-af32a5012059","resolution":{"observed_at":"2026-08-05T05:34:48.434367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1307.6894","last_updated":"2013-07-25T23:33:24Z","snapshot_observed_at":"2026-08-04T05:30:08.638968Z","submitted_at":"2013-07-25T23:33:24Z","title":"The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes","version":1},"cited_work":{"arxiv_id":"1307.6894","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1307.6894","snapshot_observed_at":"2026-07-04T18:36:21.898366Z","title":"Spivak (2013):The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes","venue":null,"work_id":"031acb37-bc85-454a-af60-b2a20da8564d","year":2013},"citing_paper":{"arxiv_id":"2604.03017","last_updated":"2026-04-03T13:02:04Z","snapshot_observed_at":"2026-07-06T22:52:15.263364Z","submitted_at":"2026-04-03T13:02:04Z","title":"Compositionality of Lyapunov functions via assume-guarantee reasoning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-13T18:35:47.564184Z"},"links":{"cited_paper":"/paper/1307.6894","citing_paper":"/paper/2604.03017"},"observation_digest":"sha256:6586c715b589d37ee10a3218218cc81d42ad942fd7815f0ac7faa552a4ee2c5e","observation_id":"2668d176-0383-4aac-86d6-a94909fb5d54","resolution":{"observed_at":"2026-07-04T18:36:21.898366Z","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":"1307.6894","last_updated":"2013-07-25T23:33:24Z","snapshot_observed_at":"2026-08-04T05:30:08.638968Z","submitted_at":"2013-07-25T23:33:24Z","title":"The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes","version":1},"cited_work":{"arxiv_id":"1307.6894","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1307.6894","snapshot_observed_at":"2026-07-04T18:36:21.898366Z","title":"Spivak (2013):The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes","venue":null,"work_id":"031acb37-bc85-454a-af60-b2a20da8564d","year":2013},"citing_paper":{"arxiv_id":"2604.04495","last_updated":"2026-04-06T07:43:29Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T07:43:29Z","title":"Kleisli semantics and hypergraph composition for Greimasian narrative programs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:48.820658Z"},"links":{"cited_paper":"/paper/1307.6894","citing_paper":"/paper/2604.04495"},"observation_digest":"sha256:e2b19229b27e8c036fae31de7961268047cdbfc9bc8c2b09ae1bebfcd395b92c","observation_id":"c6aa2f2d-40a7-4913-bb2e-d5bc8dd47bac","resolution":{"observed_at":"2026-07-04T18:36:21.898366Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1307.6894/citation-record","integrity":"/paper/1307.6894/integrity","json":"/paper/1307.6894/citation-record.json","paper":"/paper/1307.6894"},"outbound":[],"paper":{"arxiv_id":"1307.6894","last_updated":"2013-07-25T23:33:24Z","latest_version":1,"primary_category":"math.CT","snapshot_observed_at":"2026-08-04T05:30:08.638968Z","submitted_at":"2013-07-25T23:33:24Z","title":"The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1307.6894."}