{"as_of":"2026-08-22T05:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a1a274ab8808805b3954bb9547e685746537d7ff4f0e705dd3e0a10dafa1892b","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T01:39:09.857731Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2607.09626/citation-record","integrity":"/paper/2607.09626/integrity","json":"/paper/2607.09626/citation-record.json","paper":"/paper/2607.09626"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.06593","last_updated":"2022-11-12T21:43:51Z","snapshot_observed_at":"2026-08-16T17:56:45.162818Z","submitted_at":"2021-09-14T11:29:42Z","title":"Locality in online, dynamic, sequential, and distributed graph algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.06593","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Locality in online, dynamic, sequential, and distributed graph algorithms.arXiv preprint arXiv:2109.06593,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2109.06593","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:2df330a558575077c17340c5ac6bd425880218f6948699c72c0cda4b5f59c7f1","observation_id":"2193240d-23b2-42c7-8354-d7c1bd473861","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","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-07-13T01:39:09.857731Z","title":"The distributed complexity of locally checkable problems on paths is decidable","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:a517ea37a4199922bbe633a08d0c954e069904443a8878df4ead2e44af80c5c4","observation_id":"eba3ff1d-dc64-4c10-b829-060a3610e2a2","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.08544","last_updated":"2022-09-02T15:49:05Z","snapshot_observed_at":"2026-08-16T17:20:37.917635Z","submitted_at":"2022-02-17T09:39:26Z","title":"Efficient Classification of Locally Checkable Problems in Regular Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.08544","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Efficient classification of locally checkable problems in regular trees.arXiv preprint arXiv:2202.08544,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2202.08544","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:33050c4c488746b3e101fa12d20a68896eed2f7c27f89c83a3c0a593a014542f","observation_id":"2db79d65-350f-4732-81ab-b0727646204f","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.12787","last_updated":"2026-05-12T22:02:21Z","snapshot_observed_at":"2026-08-12T14:17:33.205519Z","submitted_at":"2026-05-12T22:02:21Z","title":"The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.12787","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"The distributed complexity landscape on trees depends on the knowledge about the network size.arXiv preprint arXiv:2605.12787,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2605.12787","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:6f01ca2e242ac02df0577f85eaa11ee3bf9ef6391dad89fa1f06fb257678bd00","observation_id":"5bcbccda-cda9-4331-9d10-04cb8e357125","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","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-07-13T01:39:09.857731Z","title":"Locally checkable problems in rooted trees","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:39e9a024f55ef71b56a077201c9b501a658d1353d5c0e8d43be16ceee8d977f7","observation_id":"e7740964-fedc-469d-abd0-a489eb68def5","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.04776","last_updated":"2020-03-25T15:48:11Z","snapshot_observed_at":"2026-08-14T19:16:03.152020Z","submitted_at":"2018-05-12T20:25:59Z","title":"Almost Global Problems in the LOCAL Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.04776","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Almost global problems in the local model.arXiv preprint arXiv:1805.04776,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/1805.04776","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:24d94990fca4fb727a3910d9302a7e7295f69ce8dc2b0b58528ff8cfa4ecc757","observation_id":"8b4a80d2-58e5-48b0-bc78-2998530eb9c3","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","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-07-13T01:39:09.857731Z","title":"Distributedquantumadvantage in locally checkable labeling problems","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:8b1f81ec116b2d2162f063e12320ef7846abb5dc8a5de3e0c707e76b626b7f56","observation_id":"65ba15f4-0af5-4487-8e55-1b34867029a0","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.05574","last_updated":"2021-05-16T09:47:30Z","snapshot_observed_at":"2026-08-16T18:25:17.757628Z","submitted_at":"2021-05-12T10:50:43Z","title":"Locally Checkable Labelings with Small Messages","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.05574","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Locally checkable labelings with small messages.arXiv preprint arXiv:2105.05574,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2105.05574","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:ddd062d16b21ee68da1c640d85071e9ba970b3c03b75304a88034db1e3a1548b","observation_id":"15262655-0181-4d27-adaa-ce9240bc42da","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","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-07-13T01:39:09.857731Z","title":"Shared randomness helps with local distributed problems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:46fce63f2ba936427e69ce4b7566f607ab940ddb08c6843c6140293b631124da","observation_id":"a60fdeab-689e-4116-8e21-99694935840a","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17445","last_updated":"2025-05-06T22:06:42Z","snapshot_observed_at":"2026-08-16T12:58:26.895536Z","submitted_at":"2025-01-29T07:05:21Z","title":"Separating complexity classes of LCL problems on grids","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17445","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Separating complexity classes of lcl problems on grids.arXiv preprint arXiv:2501.17445,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2501.17445","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:f89080e6d16b3763ad35b3d632ee14c26fc6870fd3a8a4ac0c4fdea07a2dd57b","observation_id":"3c772bd2-83b9-4f63-b2fc-ea157fba4dcd","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01305","last_updated":"2024-09-02T14:55:28Z","snapshot_observed_at":"2026-08-16T13:22:02.352143Z","submitted_at":"2024-09-02T14:55:28Z","title":"How local constraints influence network diameter and applications to LCL generalizations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.01305","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Peng 45 19 Nicolas Bousquet, Laurent Feuilloley, and Théo Pierron","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2409.01305","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:dc07a87fc0130cea915ef24e6bcf1b3f258cc6abe90b2541a97a89381e99fef3","observation_id":"293f9105-6482-4b5b-8a1c-edbaf5a8476c","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02066","last_updated":"2021-06-03T18:15:07Z","snapshot_observed_at":"2026-08-16T18:19:50.955073Z","submitted_at":"2021-06-03T18:15:07Z","title":"Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.02066","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics.arXiv preprint arXiv:2106.02066,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2106.02066","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:4f1e40eeb9d7a88ac1d351d860668b973bbbb9e286b6583e6cfa85c728cf01ce","observation_id":"f825d36a-0ea4-47d6-838a-1dcdaa9076c7","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","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-07-13T01:39:09.857731Z","title":"The randomized local computation complexity of the lovász local lemma","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:0197f28cef52da84de267729bd0c22c87f7c695a7f39c30fc9ada6b231251c75","observation_id":"ba55ad96-29e8-4d4f-b05d-19b1404f0e1e","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.09645","last_updated":"2026-06-20T02:35:26Z","snapshot_observed_at":"2026-08-17T23:34:31.243220Z","submitted_at":"2020-09-21T07:07:55Z","title":"The Complexity Landscape of Distributed Locally Checkable Problems on Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.09645","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"The complexity landscape of distributed locally checkable problems on trees","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2009.09645","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:b1f9a61de70f0d6587baf2f840a9d439ef9f3c19c5cfb345eb213d649681fdea","observation_id":"7af68541-c19f-4c74-b998-0beb9cc1285e","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.06726","last_updated":"2023-11-12T03:57:22Z","snapshot_observed_at":"2026-08-20T08:09:43.352251Z","submitted_at":"2023-11-12T03:57:22Z","title":"The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06726","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"The distributed complexity of locally checkable labeling problems beyond paths and trees.arXiv preprint arXiv:2311.06726,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2311.06726","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:09416ab8730a53012b321dcf449ab5391966c716d5d0bb104845c9ff4ae95361","observation_id":"f8219df6-3dd1-4003-a318-7c85449a1b34","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13795","last_updated":"2024-12-18T14:37:36Z","snapshot_observed_at":"2026-08-16T13:16:53.396847Z","submitted_at":"2024-09-20T12:34:21Z","title":"Local problems in trees across a wide range of distributed models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.13795","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Local problems in trees across a wide range of distributed models.arXiv preprint arXiv:2409.13795,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2409.13795","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:4a2af6eaa44c888145d5d130efa0144ebf8546ab2af207bf98431b422e85ab83","observation_id":"648cfaf6-8f46-4493-8682-a9b3a4bd8215","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.05411","last_updated":"2015-12-16T23:31:25Z","snapshot_observed_at":"2026-08-14T22:18:10.153123Z","submitted_at":"2015-12-16T23:31:25Z","title":"Non-Local Probes Do Not Help with Graph Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.05411","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Non-local probes do not help with graph problems.arXiv preprint arXiv:1512.05411,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/1512.05411","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:1bc4def55590deb8f8c037e25645b8353e4dbfedcff651f587cf4294eb22f861","observation_id":"0ecd357e-97e6-4059-a783-7e3b8d48a06f","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","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-07-13T01:39:09.857731Z","title":"The landscape of distributed complexities on trees and beyond","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:b9d7131269ec9e2ab8f5cb5af3f403fb66c47b63f78e527bcb9db704506e52ef","observation_id":"28b24577-c4e2-464f-bda9-1b7834753785","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","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-07-13T01:39:09.857731Z","title":"Shared randomness in locally checkable problems: The role of computational assumptions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:584e63ca49268571c8dad4464a6931c01374327487e35c94fcf5ba3b38e57447","observation_id":"05200251-cff1-4e04-b78e-054dcf4a1f25","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","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-07-13T01:39:09.857731Z","title":"Constructing low-redundancy codes via distributed graph coloring.arXiv preprint arXiv:2512.04197,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:2f899c5cfb5e8aa82a9c598e1f1fae2bc10f4be35ff7b9a8d78aaee8fc1b8aaf","observation_id":"dc48f19a-3da6-4031-a54c-34c70cfd870f","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1104.1377","last_updated":"2011-04-07T16:55:23Z","snapshot_observed_at":"2026-08-15T04:49:57.298963Z","submitted_at":"2011-04-07T16:55:23Z","title":"Fast Local Computation Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1104.1377","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Fast local computation algorithms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/1104.1377","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:43447c111958df2419165db3ae336fa50ff4870173246580fe369483c9956c7f","observation_id":"665f732e-6103-467a-8a82-45f24f06ebb8","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.02340","last_updated":"2026-06-10T12:20:56Z","snapshot_observed_at":"2026-08-03T18:10:32.373601Z","submitted_at":"2026-02-02T17:00:58Z","title":"LCLs Beyond Bounded Degrees","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.02340","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Lcls beyond bounded degrees.arXiv preprint arXiv:2602.02340,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2602.02340","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:811963350a6d407cbf3709aa17212e086fd7df9a82fd15784aff294051394d97","observation_id":"c9d85870-5099-4762-961a-ccd9f4f247e0","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.16712","last_updated":"2022-03-30T23:25:28Z","snapshot_observed_at":"2026-08-16T17:10:25.207311Z","submitted_at":"2022-03-30T23:25:28Z","title":"An algebraic approach to Borel CSPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.16712","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"An algebraic approach to borel csps.arXiv preprint arXiv:2203.16712,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2203.16712","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:545136d6052ca3bcd0246ce14a5aa768fd006e1016162c8036dda35c927a0575","observation_id":"eacc410e-bfca-4721-92d9-3d93ab8915b0","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","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-07-13T01:39:09.857731Z","title":"Distributedconstraint satisfaction for formalizing distributed problem solving","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:6bc52a171caa502de5a7c81c9af07cb726208c0024fd6542194a5ccd25872a7e","observation_id":"1ea562f8-4eaa-4d7f-afcf-4bdae56e8011","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":24},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2607.09626."}