{"as_of":"2026-08-08T06:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06e26474123f5aee6def4743022f2406879055901bc281f9d7eaef68c5a395ff","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:02:15.387341Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2505.20915/citation-record","integrity":"/paper/2505.20915/integrity","json":"/paper/2505.20915/citation-record.json","paper":"/paper/2505.20915"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2200/s00908ed1v01y201903dct015","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:17.894240Z","title":"Introduction to Distributed Self-Stabilizing Algorithms","venue":null,"work_id":"2bfa9eac-2e29-4b5f-bc46-d74d99ea57fe","year":2019},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:11.547231Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:f59e246f7be65c0257c9c9dd5114b4002a724be32005fb723f74d4748dfbc478","observation_id":"a8221d0e-19c1-40fe-92c5-b7a5e557f5ea","resolution":{"observed_at":"2026-08-07T14:02:18.002139Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:20.553675Z","title":"An introduction to population protocols","venue":null,"work_id":"b99f4160-a9e1-409c-bb64-64d017e5d607","year":2007},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:11.620897Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:2e0bb55681884cf7fdf1ca6c7303179b7facce6aede634e5da772506c474a6db","observation_id":"c298bc6c-7229-4cb4-9c93-1ddf61f56aef","resolution":{"observed_at":"2026-08-07T14:02:20.725276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:11.724568Z","title":"The distributed complexity of locally checkable problems on paths is decidable","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:11.724568Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:cfd4319d0ba126dade616df7c6bc577f5a8b3697052391b2ce0b247b97522413","observation_id":"bff872e6-7f49-4ad5-9367-152028f565b1","resolution":{"observed_at":"2026-08-07T14:02:11.724568Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:11.880687Z","title":"Efficient classification of locally checkable problems in regular trees","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:11.880687Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:8563538da3456995358a3dd811dc29904e3e4604cbfa952805880d4d607eea06","observation_id":"ea4a60c9-db64-4814-b3dc-8c2408668bde","resolution":{"observed_at":"2026-08-07T14:02:11.880687Z","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":"10.1007/s00446-022-00435-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:17.639589Z","title":"Locally checkable problems in rooted trees","venue":null,"work_id":"4ef66e55-69da-4d03-8919-85d887c2b5a3","year":2023},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:11.996617Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:fd6a1ea7f4744506e48b8e343bc2f5a7dee97ff4289cd8ca497ff916e426800f","observation_id":"ef0810d1-52f8-42fc-ad6a-7c5eab96610d","resolution":{"observed_at":"2026-08-07T14:02:17.752843Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:12.154909Z","title":"Almost global problems in the LOCAL model","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:12.154909Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:0be9fdd5f8b44b2d39612a36bc8fefd1b3081c2ec8981163a65550143bcc12b6","observation_id":"ed63a88a-5a02-4ffb-9053-3c69769f0278","resolution":{"observed_at":"2026-08-07T14:02:12.154909Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:12.265037Z","title":"Korhonen, Tuomo Lempi \\\" a inen, Dennis Olivetti, and Jukka Suomela","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:12.265037Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:8a17d7e1c2e11b276359876975e2635b9fda2c10dfd2687e4b320fda9d057f7f","observation_id":"c5292451-0934-4364-92fe-5c821fd11c0c","resolution":{"observed_at":"2026-08-07T14:02:12.265037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00676","last_updated":"2025-02-02T05:28:08Z","snapshot_observed_at":"2026-07-06T20:29:40.670401Z","submitted_at":"2025-02-02T05:28:08Z","title":"Optimal local certification on graphs of bounded pathwidth","version":1},"cited_work":{"arxiv_id":"2502.00676","doi":"10.48550/arxiv.2502.00676","metadata_source":"pith","pith_arxiv_id":"2502.00676","snapshot_observed_at":"2026-08-07T18:16:16.850658Z","title":"Optimal local certification on graphs of bounded pathwidth","venue":"cs.DC","work_id":"ad430c10-4927-46dd-8c0a-d547cc5be89f","year":2025},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:12.393126Z"},"links":{"cited_paper":"/paper/2502.00676","citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:6b45e81cb788307fe4b3e7bf39fd1a2496ff1b0a2fffac8fd81251c08a36a27b","observation_id":"9b8c2f22-b65b-41cd-9361-bf92864862ba","resolution":{"observed_at":"2026-08-07T14:02:17.503363Z","resolver_source":"local_arxiv","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":"1308.30135","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:18.723637Z","title":"Memory space requirements for self-stabilizing leader election protocols","venue":null,"work_id":"2ed39d87-2c99-45cb-92a8-6a6d05a7da40","year":1999},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:12.520747Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:15b7255a6336561c6786cb0d0613c61a2aead304b399c4bbff6568113ae007a6","observation_id":"0af5010d-4ddf-4197-860b-fb1963162fc9","resolution":{"observed_at":"2026-08-07T14:02:18.791467Z","resolver_source":"raw_fallback","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.1007/978-3-030-64348-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:17.231923Z","title":"Silent MST approximation for tiny memory","venue":null,"work_id":"4bab289f-1b37-4cc0-970d-b6efd2522b87","year":2020},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:12.644677Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:d37f08f646adfd860b1940cef1609756900737ba126ff66eea2580fb15851603","observation_id":"eec79c02-0249-453e-b4c3-62d2e61dea56","resolution":{"observed_at":"2026-08-07T14:02:17.312948Z","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/978-3-319-11764-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:17.096724Z","title":"On proof-labeling schemes versus silent self-stabilizing algorithms","venue":null,"work_id":"d16f30c4-3a93-46b5-85c3-c780668f39ba","year":2014},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:12.747695Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:d28af482e81aff6acc5c5b32de391b74f0830bed7279ffbcea745164e1d59bdd","observation_id":"c5db4194-36a9-446f-b18b-c52714323508","resolution":{"observed_at":"2026-08-07T14:02:17.144796Z","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":{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12148","snapshot_observed_at":"2026-08-07T14:02:12.839100Z","title":"Local certification of forbidden subgraphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:12.839100Z"},"links":{"cited_paper":"/paper/2402.12148","citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:363796e7bdb4d35261d4e4c1a38b65a6b553c12fcd373f67239aa82e24a25674","observation_id":"e93f2be1-212e-4b4b-b116-72fffe7ac5e6","resolution":{"observed_at":"2026-08-07T14:02:12.839100Z","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":"10.48550/arxiv.2409.15404","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:16.921703Z","title":"Renaming in distributed certification","venue":null,"work_id":"f3bb4232-7d60-40a9-baeb-ebdae857bf14","year":2024},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:12.968631Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:fa085b8b14aba94dd315a4109108cc61c38d791d428ed72ac34eb40c0e5c1a4d","observation_id":"952e48c6-5ac6-4224-aee1-57c8dd5b6d54","resolution":{"observed_at":"2026-08-07T14:02:17.002372Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:13.049731Z","title":"How local constraints influence network diameter and applications to LCL generalizations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.049731Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:e7264731af2c23f56c28768eb7e922e3368e4c105ab3766d801cd96137cecd24","observation_id":"44f70e1f-4cfa-4b10-a53a-dcfa2e15918f","resolution":{"observed_at":"2026-08-07T14:02:13.049731Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:13.098481Z","title":"Local certification of local properties: Tight bounds, trade-offs and new parameters","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.098481Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:7029f9e02f920d98750227e6da2b93aab5da64f379551da583ed6f5a765ec77a","observation_id":"4750f750-1e24-47df-9a2a-d82e11a9d11d","resolution":{"observed_at":"2026-08-07T14:02:13.098481Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:13.188116Z","title":"A lower bound for the distributed lov \\' a sz local lemma","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.188116Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:a8c786d9eff224ed7a4f377f461a04b8fb2b3b15d8b4d24add2758343d463134","observation_id":"111ffb0a-ba6d-45a6-9b19-fe422f111724","resolution":{"observed_at":"2026-08-07T14:02:13.188116Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:13.284438Z","title":"a inen, Patric R. J. \\","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.284438Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:97673bb784c53f300ee3b97155b60a413bf8c6f1c5663826bfc8cd8be8b4c069","observation_id":"8352614d-ddae-4225-80b7-1c8da0dde22f","resolution":{"observed_at":"2026-08-07T14:02:13.284438Z","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-07T14:02:20.225467Z","title":"On a problem of partitions","venue":null,"work_id":"c1b611b1-6a92-4aa9-b7e5-94121a5c36f8","year":1942},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.352679Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:1f7b78e6c0b7ede7f52eed42b52790b909fd43bc713ef9c6c909f1129ef330be","observation_id":"f7a382a6-c7ed-4a25-8c0f-3ae19ea37f8f","resolution":{"observed_at":"2026-08-07T14:02:20.371766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:13.471361Z","title":"Approximate proof-labeling schemes","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.471361Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:a4b8e4668c19784c36b4d11b69b6d86bb04b904e908db4e3b830b7b945cf86ef","observation_id":"1ba2c31c-c5fe-41ca-844d-45fcb471a8ae","resolution":{"observed_at":"2026-08-07T14:02:13.471361Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:13.556626Z","title":"The complexity landscape of distributed locally checkable problems on trees","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.556626Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:5be917715c2014141590f8e04c6617ce5e36ad4776c2ed0f7f0855a88508e0fc","observation_id":"63c61938-a292-410a-9d19-f908712a755d","resolution":{"observed_at":"2026-08-07T14:02:13.556626Z","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":"10.4230/lipics.itcs.2024.26","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:16.613297Z","title":"The distributed complexity of locally checkable labeling problems beyond paths and trees","venue":null,"work_id":"60ed6872-323e-4ae0-b98b-4afd3acdb993","year":2024},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.683362Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:7a690c68c32829988ce8024ba7b4c125d9f4e0424db69c1e4b341a8108ab0d59","observation_id":"7d4cbad5-012f-441d-9cef-4175778c3523","resolution":{"observed_at":"2026-08-07T14:02:16.649307Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:13.750950Z","title":"An exponential separation between randomized and deterministic complexity in the LOCAL model","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.750950Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:523e1c2d48bbb3241bcd22b4223229ae7e20fadb1a24b70c93849f61533f167c","observation_id":"dc46c972-d851-4111-96b8-1d480dd6c0c8","resolution":{"observed_at":"2026-08-07T14:02:13.750950Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:13.837080Z","title":"A time hierarchy theorem for the LOCAL model","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.837080Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:f8f73d7255d28fcfce575dbc90e1b0137e3ad7fb390cd30998ec5f0b35f634b7","observation_id":"b569e821-262e-4167-bced-758ad0210f9b","resolution":{"observed_at":"2026-08-07T14:02:13.837080Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:13.937501Z","title":"Distributed graph problems through an automata-theoretic lens","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:13.937501Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:a5be8be01e8fd43296ccf0d36d03e39ef61b4f8dddf828c3a071055c97ba4e0b","observation_id":"448f0fd0-ae30-42d4-b01a-f283a9ce2504","resolution":{"observed_at":"2026-08-07T14:02:13.937501Z","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":"10.48550/arxiv.2503.19671","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:16.375208Z","title":"A tight meta-theorem for LOCAL certification of mso\\( _ 2 \\) properties within bounded treewidth graphs","venue":null,"work_id":"d2e6e294-9317-4476-8364-53b3309c4410","year":2025},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.036990Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:88ae050acbd3f04b9854db304680581896dc98f7aefb4cec7ad8ff579b8f4608","observation_id":"b1bbf497-38c9-4b4c-a063-251242deb00a","resolution":{"observed_at":"2026-08-07T14:02:16.477957Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:19.937849Z","title":"Self-Stabilization","venue":null,"work_id":"dda6cd61-ac6e-4813-9a98-6e720e5e8525","year":2000},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.096710Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:c93752e9bb80951f09e9532ff3ee9f3000cc623a1462c53a9cc82ca807b9ad76","observation_id":"81dd18c9-604a-47a9-8da6-ba05525f3cbb","resolution":{"observed_at":"2026-08-07T14:02:20.082307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:14.284448Z","title":"Introduction to local certification","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.284448Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:51167c1475ca91cc346de96b90f87566911365804c0480f59d3c45bb1d80d34b","observation_id":"d5270ec4-4663-4280-b4a2-e0e5f7d73e12","resolution":{"observed_at":"2026-08-07T14:02:14.284448Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:14.349370Z","title":"What can be certified compactly? compact local certification of MSO properties in tree-like graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.349370Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:7a92cb2c36aa1969fe4a98a0c82bae144f817df69290ea0e513ea4bdb705508b","observation_id":"c1fc2f05-c480-4945-b588-35f7776bf5f9","resolution":{"observed_at":"2026-08-07T14:02:14.349370Z","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-07T14:02:19.631555Z","title":"Survey of distributed decision","venue":null,"work_id":"20d56c12-7f15-4250-ad42-acb7d2398a57","year":2016},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.415820Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:3fba7f6ed2d97884b8e5780cddaac0afacd213190bde0594f4172b8ac3e7b620","observation_id":"56b7deb4-34d9-48c4-b666-1f2c21e3b9e8","resolution":{"observed_at":"2026-08-07T14:02:19.793688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:14.497969Z","title":"What can be decided locally without identifiers? In ACM Symposium on Principles of Distributed Computing , pages 157--165","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.497969Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:72de7845126d2b742560c44ed13a78987b166f229139aaa1d03da0b663bc58ce","observation_id":"c29ad4a9-e52e-4580-888c-56476d6ea22f","resolution":{"observed_at":"2026-08-07T14:02:14.497969Z","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":"10.1007/978-3-642-35476-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:16.168647Z","title":"Halld \\' o rsson, and Amos Korman","venue":null,"work_id":"bc170489-ad3d-4171-b17f-b783224b5e83","year":2012},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.549642Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:aef864b036fbeb833063488bf87c88de0e76e7872c13ebcaa2bc6d26d644dde5","observation_id":"82bda2cd-c691-4118-9ce8-1cc1994e891d","resolution":{"observed_at":"2026-08-07T14:02:16.224949Z","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.1016/j.tcs.2017.01.011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:15.973471Z","title":"Node labels in local decision","venue":null,"work_id":"72ffc773-c047-4fe4-bb80-37921eab0e66","year":2018},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.659034Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:783c92d391d6b712e917464c2d58077021c5449dd008fe8bea219c17e9ad0989","observation_id":"3ee29c6c-fbb8-4471-ad7a-8e55c6c3e712","resolution":{"observed_at":"2026-08-07T14:02:16.049776Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:14.723281Z","title":"Towards a complexity theory for local distributed computing","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.723281Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:ce64e3a854fa22302cd13f9c80378ff41199ed749772896ffc91e95366e8a01d","observation_id":"65a39030-571b-4d46-ba9a-599c844d2f92","resolution":{"observed_at":"2026-08-07T14:02:14.723281Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:14.789280Z","title":"Distributed certification for classes of dense graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.789280Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:de8b311a49e0e833f701d6101786f84855d2f3eeea2f99109aea0da64dea8612","observation_id":"30f2c2f6-db93-4bcc-900f-80e9adad40de","resolution":{"observed_at":"2026-08-07T14:02:14.789280Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:14.854082Z","title":"A meta-theorem for distributed certification","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.854082Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:cd8c05821ea1fb563d992902024907786daf7c6ee58abcc47d8d3e7f50ab38ed","observation_id":"5252cca5-855f-4ada-beae-d1df39e72d99","resolution":{"observed_at":"2026-08-07T14:02:14.854082Z","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":"10.4086/toc.2016.v012a019","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:15.798819Z","title":"Locally checkable proofs in distributed computing","venue":null,"work_id":"9b794bc1-ceaa-46f9-a757-7508691a2dc8","year":2016},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:14.952659Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:446f0abaa076fd7356298e08b4c1c26f532d4746c285825a775fd7644a778c23","observation_id":"9fceff8e-bdd0-487f-a213-3863c5f2a05c","resolution":{"observed_at":"2026-08-07T14:02:15.863326Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:19.408993Z","title":"An introduction to the theory of numbers","venue":null,"work_id":"04a8d021-dd96-4a09-97ab-b2aad627da73","year":1979},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:15.025547Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:59820650b343ecbf7702a9194462121e1b135a4d1e44b7ccce9ce0014942ad09","observation_id":"634e71ff-425d-41cd-9a3f-e61dd6553105","resolution":{"observed_at":"2026-08-07T14:02:19.518075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:19.244304Z","title":"On the computational complexity of algorithms","venue":null,"work_id":"7e6f6f70-c808-49a9-9f66-15b165752ef5","year":1965},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:15.091200Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:eafb70b7811f2ff83d255f666f7cd048fb89634f1e9304efa1ae86e7a5848486","observation_id":"c70573e2-cc51-469f-890e-12ed1ef05d93","resolution":{"observed_at":"2026-08-07T14:02:19.314041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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.1561/2400000025","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:15.659046Z","title":"Massively parallel computation: Algorithms and applications","venue":null,"work_id":"db4103e2-909a-4ad1-af32-09662f8395a1","year":2023},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:15.136223Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:6a81b96c514cee3daeaaab1def9038f5919147d1202a288b853350c901a8e936","observation_id":"5c7f1b8d-305a-48a0-a404-23e7a7217cc3","resolution":{"observed_at":"2026-08-07T14:02:15.731082Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:15.188865Z","title":"Proof labeling schemes","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:15.188865Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:4e3821f78801ae935c7de16dfc3fe906194e9ecc7c3ad90b3b99ba81b5dacedb","observation_id":"72b90e2c-808e-47bd-a26c-fdaebbd331bb","resolution":{"observed_at":"2026-08-07T14:02:15.188865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20353","last_updated":"2024-10-27T06:53:16Z","snapshot_observed_at":"2026-08-05T22:55:31.794402Z","submitted_at":"2024-10-27T06:53:16Z","title":"Distributed Complexity of $P_k$-freeness: Decision and Certification","version":1},"cited_work":{"arxiv_id":"2410.20353","doi":"10.48550/arxiv.2410.20353","metadata_source":"pith","pith_arxiv_id":"2410.20353","snapshot_observed_at":"2026-08-07T18:16:16.850658Z","title":"Distributed Complexity of $P_k$-freeness: Decision and Certification","venue":"cs.DC","work_id":"e1773e48-3067-48c4-9c3c-c2a1401f23d1","year":2024},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:15.252335Z"},"links":{"cited_paper":"/paper/2410.20353","citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:53557cfdcb7a1330ecc319fca5fd601e8ba10dc5ab9bd587790435ab2c63cfc1","observation_id":"2a98667b-1080-499a-92f6-f25ed69be06d","resolution":{"observed_at":"2026-08-07T14:02:15.576167Z","resolver_source":"local_arxiv","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:15.315861Z","title":"Rabin and Dana S","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:15.315861Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:4cd770f2bcb844410f83489acc3cf27e1bac367d08f078e7c1c38627bb2b1677","observation_id":"141b3b53-d6ff-4638-8336-f36b3512b74d","resolution":{"observed_at":"2026-08-07T14:02:15.315861Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:02:15.387341Z","title":"Landscape of locality (invited talk)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T14:02:15.387341Z"},"links":{"citing_paper":"/paper/2505.20915"},"observation_digest":"sha256:0847f9bdb9c93bb1ea2606d42d2e22cbbfe8b154a468b2611aeb5ffc5a08285f","observation_id":"02eb1c5f-3844-4319-8a63-be7dbffff876","resolution":{"observed_at":"2026-08-07T14:02:15.387341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.20915","last_updated":"2025-05-27T09:08:00Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-07T13:41:36.330787Z","submitted_at":"2025-05-27T09:08:00Z","title":"Complexity landscape for local certification"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":23,"verified_exact":13,"verified_fuzzy":6},"total_outbound_references":43},"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 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2505.20915."}