{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DKI5AYIO3WZ7EOCQ2KWR4X6PBC","short_pith_number":"pith:DKI5AYIO","canonical_record":{"source":{"id":"1611.02663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-08T19:28:01Z","cross_cats_sorted":[],"title_canon_sha256":"03163bd76e64bb37c5dabfe839822c9460821553f65bcddf4a8d6a1e6874f398","abstract_canon_sha256":"78b28d981681b4baf552d6e3bcfdd69e595c0e6cc4287d0ae5069ad0729af9f9"},"schema_version":"1.0"},"canonical_sha256":"1a91d0610eddb3f23850d2ad1e5fcf089e124e731f7c3def5066746b9b867cb6","source":{"kind":"arxiv","id":"1611.02663","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02663","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02663v2","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02663","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"DKI5AYIO3WZ7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKI5AYIO3WZ7EOCQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKI5AYIO","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DKI5AYIO3WZ7EOCQ2KWR4X6PBC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-08T19:28:01Z","cross_cats_sorted":[],"title_canon_sha256":"03163bd76e64bb37c5dabfe839822c9460821553f65bcddf4a8d6a1e6874f398","abstract_canon_sha256":"78b28d981681b4baf552d6e3bcfdd69e595c0e6cc4287d0ae5069ad0729af9f9"},"schema_version":"1.0"},"canonical_sha256":"1a91d0610eddb3f23850d2ad1e5fcf089e124e731f7c3def5066746b9b867cb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:51.779837Z","signature_b64":"5jf2f4dEEguAyf9p/U1KhAyyDeIu7c40QUvFFCP2Gc36sWuNyfMOXcKg72u/eQrD5yehz89kUqz4U9gkKrrADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a91d0610eddb3f23850d2ad1e5fcf089e124e731f7c3def5066746b9b867cb6","last_reissued_at":"2026-05-18T00:31:51.779393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:51.779393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02663","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vy/Af/nWzMp9FLG4wemHuJIWWby558q/Xtrmuegzi7mEE1ozB0UWA5P2EPaTaPwdLD7GEOhLbTcvtkxkE/NZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:34:18.669807Z"},"content_sha256":"616fbc9c1de8ac72f7d4242f6cf0ba76b772287c2185015fb9f67ffa5e019c30","schema_version":"1.0","event_id":"sha256:616fbc9c1de8ac72f7d4242f6cf0ba76b772287c2185015fb9f67ffa5e019c30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DKI5AYIO3WZ7EOCQ2KWR4X6PBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Local Distributed Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Mohsen Ghaffari, Yannic Maus","submitted_at":"2016-11-08T19:28:01Z","abstract_excerpt":"This paper is centered on the complexity of graph problems in the well-studied LOCAL model of distributed computing, introduced by Linial [FOCS '87]. It is widely known that for many of the classic distributed graph problems (including maximal independent set (MIS) and $(\\Delta+1)$-vertex coloring), the randomized complexity is at most polylogarithmic in the size $n$ of the network, while the best deterministic complexity is typically $2^{O(\\sqrt{\\log n})}$. Understanding and narrowing down this exponential gap is considered to be one of the central long-standing open questions in the area of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02663","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZY4uRzL60m6Nft7KZ0w6xpzbpX1A1nOUbiubhWAoJx8GAGAD3SzkGcTFkEshOhCZ+XtVdyMcIMioMSp45w5iBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:34:18.670169Z"},"content_sha256":"2cbc0b420710d5cdfa12eef56bb948983a48cb258fe930fbec96a1ef515fd456","schema_version":"1.0","event_id":"sha256:2cbc0b420710d5cdfa12eef56bb948983a48cb258fe930fbec96a1ef515fd456"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/bundle.json","state_url":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T16:34:18Z","links":{"resolver":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC","bundle":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/bundle.json","state":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DKI5AYIO3WZ7EOCQ2KWR4X6PBC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"78b28d981681b4baf552d6e3bcfdd69e595c0e6cc4287d0ae5069ad0729af9f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-08T19:28:01Z","title_canon_sha256":"03163bd76e64bb37c5dabfe839822c9460821553f65bcddf4a8d6a1e6874f398"},"schema_version":"1.0","source":{"id":"1611.02663","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02663","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02663v2","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02663","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"DKI5AYIO3WZ7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKI5AYIO3WZ7EOCQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKI5AYIO","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:2cbc0b420710d5cdfa12eef56bb948983a48cb258fe930fbec96a1ef515fd456","target":"graph","created_at":"2026-05-18T00:31:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper is centered on the complexity of graph problems in the well-studied LOCAL model of distributed computing, introduced by Linial [FOCS '87]. It is widely known that for many of the classic distributed graph problems (including maximal independent set (MIS) and $(\\Delta+1)$-vertex coloring), the randomized complexity is at most polylogarithmic in the size $n$ of the network, while the best deterministic complexity is typically $2^{O(\\sqrt{\\log n})}$. Understanding and narrowing down this exponential gap is considered to be one of the central long-standing open questions in the area of ","authors_text":"Fabian Kuhn, Mohsen Ghaffari, Yannic Maus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-08T19:28:01Z","title":"On the Complexity of Local Distributed Graph Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02663","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:616fbc9c1de8ac72f7d4242f6cf0ba76b772287c2185015fb9f67ffa5e019c30","target":"record","created_at":"2026-05-18T00:31:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"78b28d981681b4baf552d6e3bcfdd69e595c0e6cc4287d0ae5069ad0729af9f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-08T19:28:01Z","title_canon_sha256":"03163bd76e64bb37c5dabfe839822c9460821553f65bcddf4a8d6a1e6874f398"},"schema_version":"1.0","source":{"id":"1611.02663","kind":"arxiv","version":2}},"canonical_sha256":"1a91d0610eddb3f23850d2ad1e5fcf089e124e731f7c3def5066746b9b867cb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a91d0610eddb3f23850d2ad1e5fcf089e124e731f7c3def5066746b9b867cb6","first_computed_at":"2026-05-18T00:31:51.779393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:51.779393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5jf2f4dEEguAyf9p/U1KhAyyDeIu7c40QUvFFCP2Gc36sWuNyfMOXcKg72u/eQrD5yehz89kUqz4U9gkKrrADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:51.779837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02663","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:616fbc9c1de8ac72f7d4242f6cf0ba76b772287c2185015fb9f67ffa5e019c30","sha256:2cbc0b420710d5cdfa12eef56bb948983a48cb258fe930fbec96a1ef515fd456"],"state_sha256":"f435cbaccde9743925a0378475b2617204eb5152871ff15112d732810c7fc2b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRgNlrebxcxXQtr3CsnLZxaBUyXb9aEkP0hBymdnOphFfDPjXfbMbbM0ti1MWZ1KD9i8hXkfTkTBIMnhdKfnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:34:18.672592Z","bundle_sha256":"444070589d48f47f22cbec8b56152e94d8adc4e6eccbd37606de221b5884f7be"}}