{"as_of":"2026-08-09T12:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c36e594eb497e18b0ba8213bf9d8659b4c018a06659910ee81e7187cd780be6","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T09:24:56.665259Z","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-16T06:12:26.020177Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2112.13650","last_updated":"2023-02-20T06:34:54Z","snapshot_observed_at":"2026-08-05T01:08:34.184120Z","submitted_at":"2021-12-27T13:19:26Z","title":"Multiagent Transition Systems for Composing Fault-Resilient Protocol Stacks","version":17},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13650","snapshot_observed_at":"2026-08-04T09:24:56.665259Z","title":"Multiagent transition systems: Protocol-stack mathematics for dis- tributed computing.arXiv preprint arXiv:2112.13650, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.15747","last_updated":"2026-07-02T20:41:11Z","snapshot_observed_at":"2026-08-04T09:24:49.755541Z","submitted_at":"2025-10-17T15:34:27Z","title":"GLP: A Grassroots, Multiagent, Concurrent, Logic Programming Language for AI (Full Version)","version":4},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T09:24:56.665259Z"},"links":{"cited_paper":"/paper/2112.13650","citing_paper":"/paper/2510.15747"},"observation_digest":"sha256:cf4babae15f13848def4373fd23d7de8f6a3857fb5d96d2fa63cf6c756733cdc","observation_id":"d47b8f0a-149a-408b-8213-89c65f386b38","resolution":{"observed_at":"2026-08-04T09:24:56.665259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13650","last_updated":"2023-02-20T06:34:54Z","snapshot_observed_at":"2026-08-05T01:08:34.184120Z","submitted_at":"2021-12-27T13:19:26Z","title":"Multiagent Transition Systems for Composing Fault-Resilient Protocol Stacks","version":17},"cited_work":{"arxiv_id":"2112.13650","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13650","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multiagent transition systems: Protocol-stack mathematics for distributed computing.arXiv preprint arXiv:2112.13650","venue":null,"work_id":"cc16a13a-1330-4ab0-8786-851cd1fe395d","year":null},"citing_paper":{"arxiv_id":"2602.06934","last_updated":"2026-07-21T16:29:08Z","snapshot_observed_at":"2026-08-03T03:51:58.391886Z","submitted_at":"2026-02-06T18:30:11Z","title":"Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI (Full Version)","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-16T06:10:44.878821Z"},"links":{"cited_paper":"/paper/2112.13650","citing_paper":"/paper/2602.06934"},"observation_digest":"sha256:cb10122af0fdf4b23bdd4a3b56c0167ba34bb670f860f6b60c1a88539e8451d5","observation_id":"d48c2802-77c5-45ad-8b79-ca27153709df","resolution":{"observed_at":"2026-05-16T06:12:26.022312Z","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":"2112.13650","last_updated":"2023-02-20T06:34:54Z","snapshot_observed_at":"2026-08-05T01:08:34.184120Z","submitted_at":"2021-12-27T13:19:26Z","title":"Multiagent Transition Systems for Composing Fault-Resilient Protocol Stacks","version":17},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13650","snapshot_observed_at":"2026-08-03T03:52:00.421625Z","title":"Multiagent transition systems: Protocol-stack mathematics for distributed computing.arXiv preprint arXiv:2112.13650,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.06934","last_updated":"2026-07-21T16:29:08Z","snapshot_observed_at":"2026-08-03T03:51:58.391886Z","submitted_at":"2026-02-06T18:30:11Z","title":"Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI (Full Version)","version":6},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-03T03:52:00.421625Z"},"links":{"cited_paper":"/paper/2112.13650","citing_paper":"/paper/2602.06934"},"observation_digest":"sha256:2dc0ae23a21094ce3c1401ec6751809f425acb0ef42eac0fd3fa6e8c965e50c7","observation_id":"71f5a363-ec92-4274-999e-902870d11d58","resolution":{"observed_at":"2026-08-03T03:52:00.421625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13650","last_updated":"2023-02-20T06:34:54Z","snapshot_observed_at":"2026-08-05T01:08:34.184120Z","submitted_at":"2021-12-27T13:19:26Z","title":"Multiagent Transition Systems for Composing Fault-Resilient Protocol Stacks","version":17},"cited_work":{"arxiv_id":"2112.13650","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13650","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multiagent transition systems: Protocol-stack mathematics for distributed computing.arXiv preprint arXiv:2112.13650","venue":null,"work_id":"cc16a13a-1330-4ab0-8786-851cd1fe395d","year":null},"citing_paper":{"arxiv_id":"2604.25596","last_updated":"2026-07-04T10:24:56Z","snapshot_observed_at":"2026-07-12T18:11:15.020131Z","submitted_at":"2026-04-28T13:02:49Z","title":"Volition-Guarded Multiagent Atomic Transactions: Describing People and their Machines","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-07T15:13:17.088491Z"},"links":{"cited_paper":"/paper/2112.13650","citing_paper":"/paper/2604.25596"},"observation_digest":"sha256:7e8de2cf21157ef3215764af839bccd55fc329912634f89149f8eb635653fe33","observation_id":"01500875-2dce-4dc0-988b-fa3d05b070ea","resolution":{"observed_at":"2026-05-12T00:31:17.090410Z","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":"2112.13650","last_updated":"2023-02-20T06:34:54Z","snapshot_observed_at":"2026-08-05T01:08:34.184120Z","submitted_at":"2021-12-27T13:19:26Z","title":"Multiagent Transition Systems for Composing Fault-Resilient Protocol Stacks","version":17},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13650","snapshot_observed_at":"2026-07-12T18:11:17.044928Z","title":"40 Ehud Shapiro","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.25596","last_updated":"2026-07-04T10:24:56Z","snapshot_observed_at":"2026-07-12T18:11:15.020131Z","submitted_at":"2026-04-28T13:02:49Z","title":"Volition-Guarded Multiagent Atomic Transactions: Describing People and their Machines","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T18:11:17.044928Z"},"links":{"cited_paper":"/paper/2112.13650","citing_paper":"/paper/2604.25596"},"observation_digest":"sha256:aeede9e31d750af6bc73d50492e2a513ff51523d6778522eb57f366e9ce8e576","observation_id":"d7eeeedb-7846-478d-8371-06d17a7878ad","resolution":{"observed_at":"2026-07-12T18:11:17.044928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13650","last_updated":"2023-02-20T06:34:54Z","snapshot_observed_at":"2026-08-05T01:08:34.184120Z","submitted_at":"2021-12-27T13:19:26Z","title":"Multiagent Transition Systems for Composing Fault-Resilient Protocol Stacks","version":17},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13650","snapshot_observed_at":"2026-08-02T07:44:29.194331Z","title":"Multiagent transition systems: Protocol-stack mathematics for distributed computing.arXiv preprint arXiv:2112.13650, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14138","last_updated":"2026-07-10T14:43:30Z","snapshot_observed_at":"2026-08-06T14:19:15.363607Z","submitted_at":"2026-07-10T14:43:30Z","title":"Volition Elicitation: Operational Semantics for People and Their Machines","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T07:44:29.194331Z"},"links":{"cited_paper":"/paper/2112.13650","citing_paper":"/paper/2607.14138"},"observation_digest":"sha256:045088d006e3297ca80958e003cbdef522ad551408eeef779885b62bedcdbc9d","observation_id":"47389437-dd07-4f98-a8cf-3353309d7bc7","resolution":{"observed_at":"2026-08-02T07:44:29.194331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13650","last_updated":"2023-02-20T06:34:54Z","snapshot_observed_at":"2026-08-05T01:08:34.184120Z","submitted_at":"2021-12-27T13:19:26Z","title":"Multiagent Transition Systems for Composing Fault-Resilient Protocol Stacks","version":17},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13650","snapshot_observed_at":"2026-08-01T08:19:38.160911Z","title":"arXiv preprint arXiv:2112.13650","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.21189","last_updated":"2026-07-23T11:16:12Z","snapshot_observed_at":"2026-08-08T13:03:12.374260Z","submitted_at":"2026-07-23T11:16:12Z","title":"GLP: A Grassroots, Multiagent, Concurrent, Logic Programming Language for AI","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T08:19:38.160911Z"},"links":{"cited_paper":"/paper/2112.13650","citing_paper":"/paper/2607.21189"},"observation_digest":"sha256:8dfd9750ea790ac7296b67ba5db082a1269cc9c92666fe327e0af03350ddd09d","observation_id":"4945e3ff-3424-4aca-8d7d-9c96d954a7e0","resolution":{"observed_at":"2026-08-01T08:19:38.160911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2112.13650/citation-record","integrity":"/paper/2112.13650/integrity","json":"/paper/2112.13650/citation-record.json","paper":"/paper/2112.13650"},"outbound":[],"paper":{"arxiv_id":"2112.13650","last_updated":"2023-02-20T06:34:54Z","latest_version":17,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-05T01:08:34.184120Z","submitted_at":"2021-12-27T13:19:26Z","title":"Multiagent Transition Systems for Composing Fault-Resilient Protocol Stacks"},"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 7 inbound Pith citation observations for arXiv:2112.13650."}