{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SSU6XOCJ6N2XXSVGGTUM2LW4GW","short_pith_number":"pith:SSU6XOCJ","schema_version":"1.0","canonical_sha256":"94a9ebb849f3757bcaa634e8cd2edc35bd2bc5c3ace241af0ef101d39c8b58c8","source":{"kind":"arxiv","id":"2606.27847","version":1},"attestation_state":"computed","paper":{"title":"Robust Shattering Arguments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandre Nolin, Magn\\'us M. Halld\\'orsson, Mohsen Ghaffari, Yannic Maus","submitted_at":"2026-06-26T08:41:17Z","abstract_excerpt":"Graph shattering is a central technique underlying sublogarithmic-time distributed algorithms in the LOCAL model. Its analysis typically relies on bounding the probability that large sets of distant nodes remain unresolved, often via independence assumptions justified by locality.\n  We show that these assumptions fail for pre-shattering procedures that run for super-constant rounds, where dependencies accumulate over time. As a result, several standard shattering arguments in the literature are incomplete, including those for maximal independent set, $(\\Delta+1)$-coloring, and the distributed "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.27847","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-26T08:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"7e782377b5f6331b7a4b14cc8318c875b0559fe9fe9847b32e93d9883ac792b7","abstract_canon_sha256":"138694e4b131d40613622c0b0c9592d914608cc3d16da7a748c4d9d09491016f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:50.265626Z","signature_b64":"EUi7LAMOMPqKCdSSwVyYuMqGpxL7r+3bLoGirHuMlALoHappLpsRy4mQpxWZP1mUvDwkGRccYaV3DmdkMIVyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a9ebb849f3757bcaa634e8cd2edc35bd2bc5c3ace241af0ef101d39c8b58c8","last_reissued_at":"2026-06-29T01:14:50.265207Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:50.265207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Shattering Arguments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandre Nolin, Magn\\'us M. Halld\\'orsson, Mohsen Ghaffari, Yannic Maus","submitted_at":"2026-06-26T08:41:17Z","abstract_excerpt":"Graph shattering is a central technique underlying sublogarithmic-time distributed algorithms in the LOCAL model. Its analysis typically relies on bounding the probability that large sets of distant nodes remain unresolved, often via independence assumptions justified by locality.\n  We show that these assumptions fail for pre-shattering procedures that run for super-constant rounds, where dependencies accumulate over time. As a result, several standard shattering arguments in the literature are incomplete, including those for maximal independent set, $(\\Delta+1)$-coloring, and the distributed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27847","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.27847/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.27847","created_at":"2026-06-29T01:14:50.265266+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.27847v1","created_at":"2026-06-29T01:14:50.265266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27847","created_at":"2026-06-29T01:14:50.265266+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSU6XOCJ6N2X","created_at":"2026-06-29T01:14:50.265266+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSU6XOCJ6N2XXSVG","created_at":"2026-06-29T01:14:50.265266+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSU6XOCJ","created_at":"2026-06-29T01:14:50.265266+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSU6XOCJ6N2XXSVGGTUM2LW4GW","json":"https://pith.science/pith/SSU6XOCJ6N2XXSVGGTUM2LW4GW.json","graph_json":"https://pith.science/api/pith-number/SSU6XOCJ6N2XXSVGGTUM2LW4GW/graph.json","events_json":"https://pith.science/api/pith-number/SSU6XOCJ6N2XXSVGGTUM2LW4GW/events.json","paper":"https://pith.science/paper/SSU6XOCJ"},"agent_actions":{"view_html":"https://pith.science/pith/SSU6XOCJ6N2XXSVGGTUM2LW4GW","download_json":"https://pith.science/pith/SSU6XOCJ6N2XXSVGGTUM2LW4GW.json","view_paper":"https://pith.science/paper/SSU6XOCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.27847&json=true","fetch_graph":"https://pith.science/api/pith-number/SSU6XOCJ6N2XXSVGGTUM2LW4GW/graph.json","fetch_events":"https://pith.science/api/pith-number/SSU6XOCJ6N2XXSVGGTUM2LW4GW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSU6XOCJ6N2XXSVGGTUM2LW4GW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSU6XOCJ6N2XXSVGGTUM2LW4GW/action/storage_attestation","attest_author":"https://pith.science/pith/SSU6XOCJ6N2XXSVGGTUM2LW4GW/action/author_attestation","sign_citation":"https://pith.science/pith/SSU6XOCJ6N2XXSVGGTUM2LW4GW/action/citation_signature","submit_replication":"https://pith.science/pith/SSU6XOCJ6N2XXSVGGTUM2LW4GW/action/replication_record"}},"created_at":"2026-06-29T01:14:50.265266+00:00","updated_at":"2026-06-29T01:14:50.265266+00:00"}