{"as_of":"2026-08-14T17:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f629ac976a64f49f035642579c5bae24341cbffbe8e0305e868a7b273ab76171","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T02:34:12.606759Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T04:56:33.944199Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.27847","snapshot_observed_at":"2026-07-13T04:56:33.944199Z","title":"Halldórsson, Yannic Maus, and Alexandre Nolin.Robust Shattering Arguments","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-14T00:45:26.861343Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"cited_paper":"/paper/2606.27847","citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:3cf1a02009c0f37880277ebe31b3a7bdb6150e31e46315f86ee579856a520011","observation_id":"6efcc15e-8ecd-4c24-a201-58a1e24af49a","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.27847/citation-record","integrity":"/paper/2606.27847/integrity","json":"/paper/2606.27847/citation-record.json","paper":"/paper/2606.27847"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:34:12.606759Z","title":"Halld´ orsson, and Alexandre Nolin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:36e9fb5c4910501a0b5569ead805d647eca1ba3bacc20222c25c98e46fede0cf","observation_id":"db57cfaa-226f-4b6e-84fb-3f36b934d493","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Ziegler.Proofs from THE BOOK","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:ca33d33ebcc8bfa8aec6db2516d31fdae87e5137d4fa5aa078e7446033c2e90a","observation_id":"a5eec33d-9704-4d26-9d82-839271f752cf","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"A parallel algorithmic version of the local lemma.Random Struct","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:8daff66e545eebbda2e8bfceea9de96b451bc02afc4cb19a40d0d73ded34bbed","observation_id":"1af7fdef-0cd7-47ff-8ff8-ee6d582cc8ae","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Almost global prob- lems in the LOCAL model","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:0c9863c99281a15da5d7939455421415daebe153c72006ec0db42bceac9b5b8d","observation_id":"279e3d1e-f9e5-4a45-9c82-022ef738b391","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Korhonen, Tuomo Lempi¨ ainen, Dennis Olivetti, and Jukka Suomela","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:14a0782bf44e91c7de4f588b6e9c923f3a5bd335268f750bb7a434b78f4857af","observation_id":"065a0efd-de55-47c3-853e-d4eb413ae5c1","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"On the complexity of distributed splitting problems","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:0a95d6fd42cb7d3d7de74aa10a264eb90cb27fbd6118686c80e2a643868d7dbf","observation_id":"1e7ce085-97e5-43f8-837a-520f5f36ed07","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Barenboim","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:54deb24526583fd4df01e23249837771d68924c18af0c74ee4aa0f958c679923","observation_id":"a79d6c4e-093c-426e-b30b-3c6903c644de","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Morgan & Claypool Publishers, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:b29c723884196151afeba88c95f7e6935ef8fe2e9478c599823299bfb9ee833f","observation_id":"ebab423d-cba4-4876-ad38-984845926645","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Goldenberg","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:29f759f8ef2780db8266b8a8a5c631ffbeabac4effbc7468b990f021bffd0c9f","observation_id":"ce6b197c-5fb4-4a64-9502-658213cd40fe","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"The locality of distributed symmetry breaking.J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:5136284549e2d258987b0223a8ba79186ca046914fe19bec3f3a99e722df3422","observation_id":"869608d0-566a-4120-aa4e-c10c273e2f1d","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Nearly-optimal distributed ruling sets for trees and high-girth graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:a45ae94b22d0a3e9bfe62165c1c6c4442dcaa275a81aa47dcb355a8344ab581e","observation_id":"53f9ae4a-a80e-453a-83b0-38cc87a42534","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"An algorithmic approach to the Lov´ asz local lemma","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:7938a28ba7af1e0fcc3d842f9f008fda56f8ffe2fc84723dc15a6bc6220835ea","observation_id":"cb44a1c2-09e4-456d-a320-bfd95a7350a7","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"The randomized local compu- tation complexity of the Lov´ asz local lemma","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:afe16f8cf929ad0451cf3a847e36b74ecfa2d9c8b80398986b1ab62707a9edda","observation_id":"e8db6aea-997f-46c8-a8a6-eba43680f491","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"On the locality of Hall’s theorem","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:f3542bc8157b6c1c1b82f9276cb7bf267a05b628fbf7dfcd86b2a01ae4da0ffc","observation_id":"12f49e5c-4451-43ec-a2fe-8db39bb02282","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"PhD thesis, University of Michigan, USA, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:d3ae76dfc766dcd93673e9552f28130146d9227730aaabb0c784b7f7b45fdc10","observation_id":"5ef5eff9-fdb8-4dac-9bd4-f5adaf66aa43","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Distributed edge coloring and a special case of the constructive Lov´ asz local lemma.ACM Trans","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:4006c01df49add839bda4b81ffd2d541539821b50c5aa99fd9010af588a2e934","observation_id":"a6638b85-bccb-4cc0-a7e7-a6fa0d36f1ee","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"An exponential separation between ran- domized and deterministic complexity in the LOCAL model.SIAM J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:0312653ef87c981a8a21a63f8543337e2b6d045d31a9ba9fc31aaf225938429e","observation_id":"9677e11a-0b54-4c98-90b4-2aa46dc3fe43","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"An optimal distributed (∆+1)-coloring algorithm? InProc","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:e0cbc3356b0c3a5c854d9acbce3fa130000786bd692b5ce97bd1937c4f355bfd","observation_id":"671f8397-d5b7-4192-8bde-1d61e646359f","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Distributed (∆ + 1)-coloring via ultrafast graph shattering.SIAM Journal on Computing, 49(3):497–539, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:35239125f976bea023f27501b6a87fde26d93c105725d2ef9de88de7828811c9","observation_id":"ce072554-2437-4c4b-8cfd-75572d4dd677","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"A time hierarchy theorem for the LOCAL model.SIAM J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:49ce8bf60474844b4c0ee982a380279a60f249816d30112e01edca29763b4408","observation_id":"ce387ff6-f657-4078-966b-57a85f9df974","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Distributed algorithms for the Lov´ asz local lemma and graph coloring.Distributed Comput., 30(4):261–280, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:95e6cd3d9a2edf53e820e12106f055ec1da0cc758e71cafcc5ad9f7ef059c7fe","observation_id":"cfe030bc-178d-4c46-8200-f2bff455ee1f","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Component Stability in Low-Space Mas- sively Parallel Computation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:8de9f07fb525eb4affa6c230104f651e7dd68991586d799d2a871e0c0cd2fe1d","observation_id":"25f41327-99a5-4806-bff8-1b1f3d5caa29","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Improved deterministic (∆+1) coloring in low-space MPC","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:cacc6718a6e311bfe27eec46732145af92030444668259cb63dfec0ecbc9a856","observation_id":"580a99cd-b690-40a4-b7f8-8188fa463b7a","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Improved distributed algorithms for the lov´ asz local lemma and edge coloring","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:670df00895026addd32c0df7223cf4e3b247890a351d9e8b1cfc9f89cbac99ea","observation_id":"754e172f-0b69-4053-8680-56b52036266d","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Problems and Results on 3-chromatic Hypergraphs and some Related Questions.Colloquia Mathematica Societatis J´ anos Bolyai, pages 609–627, 1974","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:524a93e04187c4f2c08375a85e739816fcb8cac0d2edfc8cada71546cd4d891d","observation_id":"72e58f61-0cc0-457d-a89e-e0b3f9181f68","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Sublogarithmic distributed algorithms for Lov´ asz local lemma, and the complexity hierarchy","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:098640c0958be5db7b7248f8de613671a77c42bb46912003dd41f3efd40a4bb4","observation_id":"786152fc-7158-4931-a7bb-3deed6c5f5be","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Halld´ orsson, and Alexandre Nolin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:59858b2432da58a588599852596e5adc4168b92a6c27fa2840336b3ad36b4a1f","observation_id":"485565bf-e1e2-457f-895e-1a7c0514f579","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Halld´ orsson, and Alexandre Nolin","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:a746fbbb461fb90019ef38e099acc609e0309b42204d436229a29d120baacd94","observation_id":"a975ab73-6685-44b9-867d-2c785b7f9753","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Halld´ orsson, and Alexandre Nolin","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:1c4fa45527c301eb9afc4a12f8fa09a3aabf3bc49169737a6e9a91b8898c4c29","observation_id":"ce2b0cc0-2fbe-46f8-8672-05bb79a9ffa4","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Local conflict coloring","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:25e2a8f3cda8248a6def05885b30141d2e5c05d37f515f85fd2207b55fa9e8f7","observation_id":"20ec8d65-5321-491e-b319-3239ad015f0e","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"A randomized distributed algorithm for the maximal in- dependent set problem in growth-bounded graphs","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:dfac515f1b2fae94cd61e99f5478f09eb7e29fe4dbb845a063f4d956f04db390","observation_id":"6771f115-0da1-4a7d-9935-9c6f17a3aee5","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"An improved distributed algorithm for maximal independent set","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:7bc2cf08e9b17dbb72403a4b782fde64eb44ea3fe45d55dcbe0e2d296371e74e","observation_id":"3c866e9b-6cf1-47cf-8166-53a42a6c469b","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Distributed maximal independent set using small messages","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:4628223ee78dc1beabdab8a3a097bc492801755a2195e6dc0d6fff0af176e23c","observation_id":"2f621077-bdf0-4c90-aada-786da1d6a541","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Local computation of maximal independent set","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:1ccf39961b9ea04f9d9da660fbfe5cc50998b863d0292f15f03f2cc8c7027704","observation_id":"794875bd-d8f9-467c-afdb-ef6282714055","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Faster deterministic distributed MIS and approx- imate matching","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:0b161001fdc412e703afffcc7a5f1bfeaf1df949b6b160f7ecae0f4b5fbff2fc","observation_id":"74438edd-540f-43ac-b9e7-eb241eb5c3da","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Near-optimal network decomposition and ruling set, and improved mis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:7333fd3b2dc361d025eafa89ade107139af3577ac3eba39bb3876b4babc65aab","observation_id":"2d08cbd6-d6ca-4321-86ec-296f47868fcc","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Harris, and Fabian Kuhn","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:d36fb7247c65deacf86c49dc4a1c46a7721902e8b9415c3fd21df666aeb41c98","observation_id":"2f24b0cb-f670-41dc-a8b8-a2af183ea8fe","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Improved distributed delta-coloring","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:f00bc5981d72e614ba7390a6d1cb24a1858405bc1646181149ebb26f8f4320df","observation_id":"424b97a6-595c-4197-8074-5a44e507c150","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:ab5c2579fe0d28e7e3cd4ecafc6093e515502ba024051e7252c43697d3146324","observation_id":"b08cf6c1-a08f-4852-9340-d28228750025","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"On the complexity of local distributed graph problems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:fad8ccca6c4dbfaec65e1f92e84b7c53a4a3259d836ba90b8f7f1e249aa3fa1e","observation_id":"7b22f4c7-59b7-41ab-aee5-80eb0df023df","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Distributed degree splitting, edge coloring, and ori- entations","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:aa71c5e174b94e655b864f17c8ce19749e7387183622151d771bcecbe7873192","observation_id":"7aaec4df-50a4-4940-bba2-8be53963f29e","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:ad3348910a08072c954b8b6f1062ef66f4631c511bdead43320e9647dcb586c7","observation_id":"3cba9853-2c6b-45d5-886a-31cf9f1cb13c","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Halld´ orsson, Fabian Kuhn, Yannic Maus, and Alexandre Nolin","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:93f9d447f05864921cbdfcf77109ec4cb6cc14872220789cd6158587238c5558","observation_id":"8c81a940-dad0-46c4-b41a-c91fe5d301a5","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Halld´ orsson, Fabian Kuhn, Yannic Maus, and Tigran Tonoyan","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:1e2ab2e8899fd606cd02c163e61781193a4caaa050d70c4f5294819ef7d6930a","observation_id":"a9f529dd-3a01-4575-bb8e-ffe46b614c8e","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Halld´ orsson, Fabian Kuhn, Alexandre Nolin, and Tigran Tonoyan","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:76ce4f3bdf58b498dac974d77b2eccb366031b5dd4c2e1430b5de7f2dca2ca82","observation_id":"30b8e671-40f7-401b-af03-923ceee71164","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Halld´ orsson, Yannic Maus, and Alexandre Nolin","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:2efa93fec361ca85f6d432b4806ad6d47a642bc735dd34685c84e49948f1bd1c","observation_id":"f54e9749-ba80-4fbf-bed6-6c0548a3e4c3","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07353","last_updated":"2024-05-12T18:23:45Z","snapshot_observed_at":"2026-08-13T00:09:21.315405Z","submitted_at":"2024-05-12T18:23:45Z","title":"Distributed Lov\\'{a}sz Local Lemma under Bandwidth Limitations","version":1},"cited_work":{"arxiv_id":"2405.07353","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.07353","snapshot_observed_at":"2026-07-01T18:05:58.935715Z","title":"Halld´ orsson, Yannic Maus, and Saku Peltonen","venue":null,"work_id":"dd70259a-740e-4e97-8444-8970a5b32e31","year":2024},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"cited_paper":"/paper/2405.07353","citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:52b7cd036ee02a9c932f3bdc56032339909269251762cf589898e3e82450c46f","observation_id":"692d9402-0eb1-4851-b919-6428a0fa2b0d","resolution":{"observed_at":"2026-07-01T18:05:58.937205Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-29T02:34:12.606759Z","title":"Halld´ orsson and Alexandre Nolin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:c67576ba0d54b3b1ec0461d5e2a9e121d9f80b4ba036967918a62b47eccb14cd","observation_id":"907b94d1-3dbc-4f32-ab9c-30fc7eab9590","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Halld´ orsson, Alexandre Nolin, and Tigran Tonoyan","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:cf0c9923b05e543b42a9e910214f85b784567334a9407cd3d9795c567ccf224b","observation_id":"4c66f9db-afcd-421b-b6f0-114a333e13ff","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"A fast and simple randomized parallel algorithm for maximal matching.Inf","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:e07fecb49fdf9a7a7bfe2d06264bb09dabb78079776bf45a5906aa0b4af41b2d","observation_id":"fcc0dfd3-b05f-46eb-b33e-12c3bef173ad","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Feedback from nature: simple randomised dis- tributed algorithms for maximal independent set selection and greedy colouring.Distributed Comput., 29(5):377–393, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:76764749fe61de85afdfc234c405e2c5b8f827a2b604aeab237763cf0986893e","observation_id":"1317b5be-f853-4fbd-9bc7-4d3aca767a21","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Simple distributed ∆ + 1-coloring of graphs.Inf","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:7758753e8bb35732b6b559335e07bdef5f822da2bf75a66823a7f0ef2a514b2d","observation_id":"817068ec-e037-4cb0-ac9a-5d8d39c06aa8","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Locality in distributed graph algorithms.SIAM Journal on computing, 21(1):193–201, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:8128042d16d2eb9481ed61788a3caa26f49287954700af510e9323a60abcdac1","observation_id":"8d0bb0b2-33cb-4a7f-8dd3-d24584fbd4af","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Distributed graph coloring made easy","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:24d5804e155286005605221786a3a4400cfdc15ffa5e2469ee0f2215f076ff96","observation_id":"139884a3-cf89-41fa-84ed-1d68c4f0733d","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Distributed symmetry breaking on power graphs via sparsification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:8fe2833540f08e9645a1fc43b215a10c9f9d0ef40d41e2a08e2ee3822f001540","observation_id":"4ccd4a4e-3cc5-4c1d-9147-fdf160fa2ef3","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Distributed symmetry breaking on power graphs via sparsification.Distributed Comput., 38(3):261–296, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:c596f06f88707aab30a1de2412cfd465547f0d237aeaf7753e282ae61ae7dff2","observation_id":"2810dc90-9523-4a83-8a57-70b4e0c4dfdd","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Efficient CONGEST algorithms for the Lov´ asz local lemma","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:7b0d34e3adc8111ee83f2bf3e2a11bbf70bd3be7f850a7e5b917b6244fb8fcb0","observation_id":"2637055a-faa5-47d7-9c52-573867284551","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:137eab02917fe982d2fa099728078c3a9acc0d680e3398812968d0e4cd815015","observation_id":"355b7038-4f03-48e2-8d50-a81134af385f","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Moser and G´ abor Tardos","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:2dcb65dfd48d9e1f253c1035719aff8a2f25d86e7b7b4ebd438d9465eb20d686","observation_id":"4e938004-6778-48f5-9409-1a4fed91fa73","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Conflict-free colourings of graphs and hypergraphs.Comb","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:fb8ebe9ab89c7402e4466d1fb34f97337514076a390dd9197830b6087063dbee","observation_id":"2b872a7c-4eb2-4a51-a227-32acf8d8a88c","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Distributed coloring algorithms for triangle-free graphs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:f8fa4fb2739408d8161309ee050386551653de02331acc4857307e8ad7af5e71","observation_id":"276b5816-c4f5-4cc8-9b43-e748e9b18481","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Polylogarithmic-time deterministic network decom- position and distributed derandomization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:0c4b38b33690b6590e82ed5de5cc746b45931d2fe19cd00f7d0557c86eb138a4","observation_id":"8d80dd7e-458f-41b5-bcb5-6515d4611721","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Fast local computation algo- rithms","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:6c3ec224c04e2bc451e84e5b185d77ef9c50e366b7cc4cc2685579be8f7fd8aa","observation_id":"0dcd882b-058b-457c-ba7a-f807964de5c5","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Symmetry breaking depending on the chromatic number or the neighborhood growth.Theor","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:c53df0113e627b29bd7112c935f46f52b3fe94f6616ed6a797b4b7222a59deac","observation_id":"bd731659-49ce-4f60-8f04-de36b63ef4e7","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"It is the element ofRnearest tovinG c[B], with ties broken with IDs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:37c241796790c3467eda4c780b906debc6905dacaa62aa986db371bd14229f59","observation_id":"811a910c-01b5-4c00-8883-a3a9f5b3ef84","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","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-06-29T02:34:12.606759Z","title":"Note that given a setsRandBthe cost of computing a cluster graph essentially scales with how far a node inBcan be from the nearest node inR","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-29T02:34:12.606759Z"},"links":{"citing_paper":"/paper/2606.27847"},"observation_digest":"sha256:3aec6c7e52207f1acad397067c18d877842c21d9370fba5839122be39967e8c4","observation_id":"e90a0790-67dd-4a25-bada-67a2531f52dd","resolution":{"observed_at":"2026-06-29T02:34:12.606759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":65,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":66},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 1 inbound Pith citation observation for arXiv:2606.27847."}