{"as_of":"2026-08-12T05:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8a29a8cb9a11091b5e380a6618887aaaf752aeea0ef340097c61fc66ed8bd53d","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-11T06:34:44.6726+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-04T10:05:32.738079Z","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-08T20:37:28.838822Z","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:e51e77277e99fb8200e8e20ea16029c9eacb51deea261b31eb42154ce2b45d11","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-08T20:37:28.838822Z","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:87884ab2698d70db154b3a1b6e120ff65742f38c22c06a405df5c7400d5729f3","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-09T21:09:23.157918Z","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-08T20:37:28.838822Z","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:a247f1e71a8d8c9558b4abd213f442d4a58352f8257fb4fdd1ac9bcd1dc5ac14","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-07-31T19:04:03.015389Z","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-08T20:37:28.838822Z","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:3f506d09ec50e50fb0135876505fa43e822f3ddd3fa9235b53af41350a20ada1","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-08T20:37:28.838822Z","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:f667b36b70b44f7d44893348e7bf36ed459df496a581c866477fb1700730af18","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-07-06T06:38:46.066644Z","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-08T20:37:28.838822Z","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:47c4097a983e027d0e370b1735964a85d781d8a1572938449ed576a7d490204f","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-08T20:37:28.838822Z","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:1b6f75cf9680c7574e62fce41b9dbb2dab2b8be79a493e60969e53d78e6ecd87","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-07-06T11:08:42.400145Z","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-08T20:37:28.838822Z","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:6f2925024f73479d48e678a6b0ba9791307b9017d3c064141b900d9fce3c89e1","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-08T20:37:28.838822Z","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:a62d8ee3e8f4f9884e84f55d8b417b78d7cca1f88fad00139f705b9532d63d47","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-10T04:41:37.150050Z","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-08T20:37:28.838822Z","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:468df3ee7c0e002013f24e34f22edcdeaccb586c73d9c38165cb4fbb5cafa7a6","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-11T17:34:00.079000Z","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-08T20:37:28.838822Z","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:47040187ce9dc346b2ffacd13d291323c4b20132c7c681a2b94c4b73b7955da0","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-11T22:21:57.894731Z","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-08T20:37:28.838822Z","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:e1a1cc6b1eb9c62ab2c45b92c861fe51109d092c49f2d6fafbf4a4cda7692b94","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-08T20:37:28.838822Z","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:4f95dcc5d65746c8ca02ed8939dab4e721ac9ab6aec40028eefe5aa5f2a5028d","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-07-06T09:57:15.968544Z","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-08T20:37:28.838822Z","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:9e8b97f6abddaa6c9adf516dc36881addde581d2915f86709224c4a34e880b2d","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-05T12:48:49.282544Z","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-08T20:37:28.838822Z","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:8d13ec017d0cb37c0033c69035c0e9f167ea37e13a13e09cd636765d60fd5301","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-12T03:41:56.285565Z","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-08T20:37:28.838822Z","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:df05f31b760a7ab51e920a3342fa7aa5793b6dda99e63fa658a1389e41fe778f","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-10T19:06:28.012727Z","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-08T20:37:28.838822Z","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:48569baf07e3dec6943c803421d433b289f9c81bb582e3787e06a662e246b47d","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-08T20:37:28.838822Z","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:72c7744e27f3def459e2e0d930829d01ab2053ade20d69f1cc0907f61b8078e2","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-08T20:37:28.838822Z","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:38d7226907bb52ddcd9b5113fa49a5e56e5720149257000b8b4a3fa1ee2877af","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-08T20:37:28.838822Z","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:62640b4c25428135e7405a09e0734d8a871748ccec017a9b292177ff24ab8347","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-07-06T02:25:59.890776Z","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-08T20:37:28.838822Z","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:e0d99bf2116397f26d2373dbb3aba901516c79de17dab4971f0d10fafab1f2c9","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-08T20:37:28.838822Z","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:df705738eb8e9edd0025f96b89782642fe33d067eaeb54667dec75ce7b137f31","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-07-06T12:55:01.603047Z","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-08T20:37:28.838822Z","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:3e52106ff935927f0ec994cd638e74bee109b92feeec815e63f2e986799bbc8d","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-08T20:37:28.838822Z","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:9b9fe690ad93db3e56832da9afda711a4acf708e66a81980c85920f7b7093a48","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-08T20:37:28.838822Z","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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2607.09626."}