{"as_of":"2026-08-08T18:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3d25ec062bf9aa4be7455f4ce420195c2a76121188e7e0d13de5973ef8ea98a5","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T04:22:53.777865Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-08-02T04:40:14.274726Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.04934","snapshot_observed_at":"2026-08-02T04:40:14.274726Z","title":"[BFZ25] Nicolas Bousquet, Laurent Feuilloley, and S´ ebastien Zeitoun","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-07T14:20:42.906294Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.274726Z"},"links":{"cited_paper":"/paper/2606.04934","citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:447d0503021054180a9417558ff10e2627d5d2d52bf0c9170b920cc7feebd04a","observation_id":"3f6e6814-4a1b-419e-ab4d-1ad1b01d082a","resolution":{"observed_at":"2026-08-02T04:40:14.274726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.04934/citation-record","integrity":"/paper/2606.04934/integrity","json":"/paper/2606.04934/citation-record.json","paper":"/paper/2606.04934"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2772.373350","doi":"10.1145/3732772.3733503","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimal local certification on graphs of bounded pathwidth","venue":null,"work_id":"8406677e-6efa-4b52-9ade-7698b6066caf","year":2025},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:c60a80ff4d0284560cc4b1154c58b1b387771fba352184f6cac99371144dc42d","observation_id":"0fab6974-12c8-46ed-93de-4e4fb325f5d7","resolution":{"observed_at":"2026-06-28T04:31:39.731146Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12148","last_updated":"2024-10-04T08:00:59Z","snapshot_observed_at":"2026-07-31T19:17:32.853590Z","submitted_at":"2024-02-19T14:01:34Z","title":"Local certification of forbidden subgraphs","version":2},"cited_work":{"arxiv_id":"2402.12148","doi":"10.48550/arxiv.2402.12148","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.12148","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Local certification of forbidden subgraphs.CoRR, abs/2402.12148,","venue":"arXiv (Cornell University)","work_id":"b69c406f-fdd0-4827-8f84-cc3dc33963e1","year":2025},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"cited_paper":"/paper/2402.12148","citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:b051bdec26d0fdae2dd0f3c3d35a18633e13304ac45a07c8253ff1f1c5e2d56c","observation_id":"df7e3091-f1c3-432d-bffd-d1770c187ea9","resolution":{"observed_at":"2026-07-02T11:16:53.438553Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12148","last_updated":"2024-10-04T08:00:59Z","snapshot_observed_at":"2026-07-31T19:17:32.853590Z","submitted_at":"2024-02-19T14:01:34Z","title":"Local certification of forbidden subgraphs","version":2},"cited_work":{"arxiv_id":"2402.12148","doi":"10.48550/arxiv.2402.12148","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.12148","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Local certification of forbidden subgraphs.CoRR, abs/2402.12148,","venue":"arXiv (Cornell University)","work_id":"b69c406f-fdd0-4827-8f84-cc3dc33963e1","year":2025},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"cited_paper":"/paper/2402.12148","citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:519441c5707c8af490f199a6e4f7d46b9c9314a80f2ada1b566dca81250361ff","observation_id":"fb8b28a4-a257-4275-9c44-ccd5db7b5cc4","resolution":{"observed_at":"2026-06-28T04:31:39.735835Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.disc.2025.18","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"5 Nicolas Bousquet, Laurent Feuilloley, and Sébastien Zeitoun","venue":"ArXiv.org","work_id":"ef301236-6bad-403a-8340-cda4bbf92faf","year":2025},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:8f0562397ceb2c23c49abc0ffd325976a56e4cf1d699d37e949e86165f28f029","observation_id":"f06449b2-8409-450c-afbb-5cac0a70b585","resolution":{"observed_at":"2026-06-28T04:31:39.737732Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/24m1650041","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters , journal =","venue":"SIAM Journal on Discrete Mathematics","work_id":"07f2e3f0-51f9-4460-8e19-e244f1ab175d","year":2025},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:c6732f92fef848a03a6a3d9ba803ecb45768376dcbeb1da8613cc1610f3798ee","observation_id":"beacfe74-ee76-4376-bd8e-7c07db3065a2","resolution":{"observed_at":"2026-06-28T04:31:39.719210Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-20T19:52:25.084213+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T19:52:25.084213+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.12894","doi":"10.48550/arxiv.2602.12894","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"7 LindaCook, EunJungKim, andTomásMasarík","venue":"Open MIND","work_id":"015d770d-f635-4c60-8c3b-4a9b33388a42","year":2025},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:f164bb8d3af862bcd49c8e6bb8bf68c4322edd7d7e165b633db4d34bcb4dca1b","observation_id":"ad0892cf-5673-4556-8ff5-77f1e2b5d0c3","resolution":{"observed_at":"2026-06-28T04:31:39.732647Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2772.373356","doi":"10.1145/3732772.3733562","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"8 Laurent Feuilloley","venue":null,"work_id":"b5edba9e-2659-4fe4-a3d4-dfc79bb13615","year":null},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:f56c41ac793d15717d116bc884847a3066ec9a38a56f795341472e323ac025f6","observation_id":"39acd43b-6fe6-4459-9e62-ec87aadba24e","resolution":{"observed_at":"2026-06-28T04:31:39.721786Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/dmtcs.6280","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"9 Laurent Feuilloley, Nicolas Bousquet, and Théo Pierron","venue":"Discrete Mathematics & Theoretical Computer Science","work_id":"45e77216-e3ab-450f-8b7d-a5567a43c2e4","year":2022},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:2676e656855ab991c0c1ecb968c926b1aa36c23474c6acef6784e33251289103","observation_id":"f0e45466-8e84-45f4-9652-e5b615e5dbfb","resolution":{"observed_at":"2026-06-28T04:31:39.723438Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-021-00823-w","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1007/S00453-021-00823-W","venue":"Algorithmica","work_id":"d57442b2-bc72-4570-b2c0-7efe6a42170a","year":null},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:96e1c9ded2abb4b11cb8f249e58862bafa1354f4f81fe5ecced5e0dc6f9ab3ca","observation_id":"61216f5f-1beb-4626-9d82-a99b38154aaf","resolution":{"observed_at":"2026-06-28T04:31:39.725123Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.15491","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T11:16:53.438646Z","title":"12 Arnold Filtser and Orr Fischer","venue":null,"work_id":"1b647870-9043-469a-856b-a39a4a1790e3","year":null},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:3fd03ca47ff11d21b8a9c34580d3815ac96ba670d15c06a758717cc33b87b3df","observation_id":"49faf6c4-938d-4c65-a123-8dbaab2f44cd","resolution":{"observed_at":"2026-07-02T11:16:53.440465Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.19078","last_updated":"2026-05-18T20:08:05Z","snapshot_observed_at":"2026-07-06T23:29:52.061489Z","submitted_at":"2026-05-18T20:08:05Z","title":"Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes","version":1},"cited_work":{"arxiv_id":"2605.19078","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.19078","snapshot_observed_at":"2026-07-02T11:16:53.439986Z","title":"Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes","venue":"cs.DS","work_id":"2993a5c1-3a33-480e-b247-e6a922544642","year":2026},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"cited_paper":"/paper/2605.19078","citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:ccb1eeaecc63b6cf402dd408e87a20ba21252ca8932103efadd2acd566e1137a","observation_id":"b4e0fc7d-e556-452f-9c8f-15bf0a978f4f","resolution":{"observed_at":"2026-07-02T11:16:53.442062Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.disc.2023.20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"14 Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, and Ioan Todinca","venue":"arXiv (Cornell University)","work_id":"821b7184-47b0-4683-8bc8-910ffa6569f3","year":2023},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:e852d573c0cf0a7b09471cdc20af87b0be9799e40ccecffb1a7b5750b63fb9dc","observation_id":"1f9a2635-59cb-495e-824e-6785a56e6b6c","resolution":{"observed_at":"2026-06-28T04:31:39.727981Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-023-01185-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1007/s00453-023-01185-1,doi:10.1007/S00453-023-01185-1","venue":"Algorithmica","work_id":"0de45e35-4dcf-4701-98b8-eb597ec42581","year":2016},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:918d56dc7dcd030533e55314c843a01a48ecd337f5b2a06d7f84bf9db5238979","observation_id":"629e6832-7602-49c4-b1c2-6111fbc57237","resolution":{"observed_at":"2026-06-28T04:31:39.729866Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00446-010-0095-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"19 Moni Naor and Larry J","venue":"Distributed Computing","work_id":"3fa670db-fbd5-4aab-ba84-e68a9cf7b6e6","year":1995},"citing_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T04:22:53.777865Z"},"links":{"citing_paper":"/paper/2606.04934"},"observation_digest":"sha256:8cd3284eb6d465d24762d160b839387ce82c592dc4b6e15c8733fee5ae34bac9","observation_id":"e6c9f18d-54bf-4f55-a961-f9e7b250a467","resolution":{"observed_at":"2026-06-28T04:31:39.726170Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-02T01:33:34.730294Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":0,"verified_exact":11,"verified_fuzzy":0},"total_outbound_references":14},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 1 inbound Pith citation observation for arXiv:2606.04934."}