{"as_of":"2026-08-10T04:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc0c6a8f218affabf7fdba6f843d460c7c566cc74c43fe091e3c24575254e2fd","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:30:28.943717Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-16T19:51:00.513249Z","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-16T19:51:13.116171Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"cited_work":{"arxiv_id":"2502.00892","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00892","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Available at https://arxiv.org/abs/2502.00892","venue":null,"work_id":"2ae3a99e-8372-4976-97b8-fb0ce984d67e","year":2025},"citing_paper":{"arxiv_id":"2512.21137","last_updated":"2026-05-13T10:19:58Z","snapshot_observed_at":"2026-08-06T23:19:09.609214Z","submitted_at":"2025-12-24T12:07:25Z","title":"Declarative distributed algorithms as axiomatic theories in three-valued modal logic over semitopologies","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-16T19:51:00.513249Z"},"links":{"cited_paper":"/paper/2502.00892","citing_paper":"/paper/2512.21137"},"observation_digest":"sha256:a39ed946794071eef8be25cd7bb104da8659814d18243d16c56e24fcfedee8fd","observation_id":"c1d2d330-b3a1-48e5-9f50-4a3bc4f8ac38","resolution":{"observed_at":"2026-05-16T19:51:13.117761Z","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/2502.00892/citation-record","integrity":"/paper/2502.00892/integrity","json":"/paper/2502.00892/citation-record.json","paper":"/paper/2502.00892"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:29.157128Z","title":"1-3, 31–60","venue":null,"work_id":"de9f7233-8e96-42b7-a2bb-9b6254d6a9ab","year":2011},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.887880Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:109e6a8c3b20a186c79ea0c4d6224a030feb4550907e0b713efd3737fef10b58","observation_id":"5e32efc3-8c4e-4df3-aef1-55f9c1660650","resolution":{"observed_at":"2026-08-09T17:30:29.161623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:28.919050Z","title":"Gabbay, Semitopology: decentralised collaborative action via top ology, algebra, and logic, College Publications, August 2024, ISBN 9781848904651","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.919050Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:e5943c039868611c83b87099b4b97e2a260632d364250bb9c0af67dae2d90166","observation_id":"d1abd3cc-1010-4d5d-a84e-e7eac28a2fe9","resolution":{"observed_at":"2026-08-09T17:30:28.919050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:29.077152Z","title":"Reiter, Byzantine quorum systems , Distributed Comput","venue":null,"work_id":"7712d0dc-621b-4194-93f1-094a6699e078","year":1998},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.929516Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:551782c5e0b7c352f4650ea285aae50854e4d68169b31a31c38d1ad84a6233a8","observation_id":"09f0aebc-a93b-42c5-acc8-905663580501","resolution":{"observed_at":"2026-08-09T17:30:29.082975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:29.061561Z","title":"27, IEEE, 1994, pp","venue":null,"work_id":"0cfafa43-0afa-439a-8855-e267f0948daa","year":1994},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.934178Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:130126175391d52d9e6851296bc1cc2765143b4415f374bb6a46de3ceb34c2bb","observation_id":"78d4cb1e-275a-4e43-b4bd-855b5ebb863e","resolution":{"observed_at":"2026-08-09T17:30:29.066346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:29.046098Z","title":"2705–2718","venue":null,"work_id":"03f8f3e5-5cbe-42db-bbb3-e8e345c341a3","year":2022},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":1962,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.938884Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:8e93c5d1169f2de017d47e34971f07848b5c6b3b591b1c2460e818c56c7f7398","observation_id":"44bd6f23-09c8-48d6-8600-0e0537c01fa0","resolution":{"observed_at":"2026-08-09T17:30:29.050855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:29.110399Z","title":"Seltz er and Paul J","venue":null,"work_id":"7199da68-0e93-4cb2-8579-7a46d0e893b0","year":1999},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.908237Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:e5aef7ab3dea18c8abaa431c31cf364948fad569bfb1a7d1d9ac66de32c7aa74","observation_id":"3a94ed68-0e68-4d0f-805a-91f1b40529e6","resolution":{"observed_at":"2026-08-09T17:30:29.116206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:29.093775Z","title":"Korhonen, eds.), ACM, 2021, pp","venue":null,"work_id":"c845e9aa-fba5-4776-a49c-33bdb0d2ff40","year":1994},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.924679Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:36343d7d0a343fe560b76bc61f94f4f8def078220bee8154fb6783961dbb5528","observation_id":"1f858a19-6350-4388-a24d-a88c8ef3f0fc","resolution":{"observed_at":"2026-08-09T17:30:29.098737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2411.00558","last_updated":"2024-11-01T13:12:58Z","snapshot_observed_at":"2026-07-06T19:43:33.476795Z","submitted_at":"2024-11-01T13:12:58Z","title":"3-Slot-Finality Protocol for Ethereum","version":1},"cited_work":{"arxiv_id":"2411.00558","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.00558","snapshot_observed_at":"2026-08-09T17:30:28.992873Z","title":"3-Slot-Finality Protocol for Ethereum","venue":"cs.DC","work_id":"b1db4cf8-c80a-44c7-955b-32677992e83c","year":2024},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.913335Z"},"links":{"cited_paper":"/paper/2411.00558","citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:bad131aa41c47fe805c2fb4375ef82e71428e9aef583c84ab4db7232aa8a3a48","observation_id":"8dd1198d-593f-4f2b-ae47-8302c019bbbf","resolution":{"observed_at":"2026-08-09T17:30:29.001024Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2003.03052","last_updated":"2020-05-11T18:27:40Z","snapshot_observed_at":"2026-08-08T08:04:45.346264Z","submitted_at":"2020-03-06T06:39:10Z","title":"Combining GHOST and Casper","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.03052","snapshot_observed_at":"2026-08-09T17:30:28.893320Z","title":"Zhang, Combining GHOST and Casper , CoRR abs/2003.03052 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.893320Z"},"links":{"cited_paper":"/paper/2003.03052","citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:937108fc363f011a69123eae8198642b8d2a6ded29844411e1ff349e5c221ae8","observation_id":"5cc9a3d8-2e44-491d-82b6-aa1dea7afe89","resolution":{"observed_at":"2026-08-09T17:30:28.893320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:29.141792Z","title":null,"venue":null,"work_id":"456e8481-cef3-4995-9b8f-3c9f3465d15d","year":2012},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.898524Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:2fe916b2d0f55495b4810dc4529aeb14ba4b13165c65218e8931e7675d8c39db","observation_id":"cb682fc9-ea18-4713-afb3-5b47037bc508","resolution":{"observed_at":"2026-08-09T17:30:29.146536Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:29.127091Z","title":"7436, Springer, 2012, pp","venue":null,"work_id":"9508cf1e-56b5-407f-99fd-fd18d7d8678d","year":2012},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.903108Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:e471c43ec3a05d91eeb70a9dc8b66796e241f72a5eadec3425d9c4f2af0a1f9d","observation_id":"691cf0cc-a8e2-4e5e-a49f-d985d029a9d6","resolution":{"observed_at":"2026-08-09T17:30:29.131728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:30:29.029948Z","title":"Y akovenko, Solana: A new architecture for a high performance blockchain v0.8.13, Whitepa- per, 2018, https://solana.com/solana-whitepaper.pdf","venue":null,"work_id":"18dd9398-fc48-4177-b341-0f28a3b5519e","year":2018},"citing_paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-09T17:30:28.943717Z"},"links":{"citing_paper":"/paper/2502.00892"},"observation_digest":"sha256:32036e81d46ef7896de80db312128b85eb5085876827e1dc8483af94ebe06528","observation_id":"377133cf-f8d3-470e-87a6-eaac5abc68cb","resolution":{"observed_at":"2026-08-09T17:30:29.035058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2502.00892","last_updated":"2025-02-02T20:03:21Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-09T17:18:56.338435Z","submitted_at":"2025-02-02T20:03:21Z","title":"A declarative approach to specifying distributed algorithms using three-valued modal logic"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":12},"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 12 of 12 outbound references and 1 inbound Pith citation observation for arXiv:2502.00892."}