{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KK7OZQZIHJCKMG3AAPUF6VP5QR","short_pith_number":"pith:KK7OZQZI","canonical_record":{"source":{"id":"1602.08166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-26T01:31:56Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"cad2900c50222bf1cf5dccccfef4631f01c9a2aa1583fc8963969e6a1d429908","abstract_canon_sha256":"69151b05e5b7edbe9caedea209a514b11e47f3cd5bfd0bd8413117141d42faaf"},"schema_version":"1.0"},"canonical_sha256":"52beecc3283a44a61b6003e85f55fd847571b9f397c37f9591f437c4c8f6de82","source":{"kind":"arxiv","id":"1602.08166","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08166","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08166v2","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08166","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"KK7OZQZIHJCK","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KK7OZQZIHJCKMG3A","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KK7OZQZI","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KK7OZQZIHJCKMG3AAPUF6VP5QR","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-26T01:31:56Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"cad2900c50222bf1cf5dccccfef4631f01c9a2aa1583fc8963969e6a1d429908","abstract_canon_sha256":"69151b05e5b7edbe9caedea209a514b11e47f3cd5bfd0bd8413117141d42faaf"},"schema_version":"1.0"},"canonical_sha256":"52beecc3283a44a61b6003e85f55fd847571b9f397c37f9591f437c4c8f6de82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:36.755134Z","signature_b64":"R6P1vZo8A0WB4iPx9eNpdtuc0zL/ZqJw4izxfVaAv8wLoJsKX9HBbRYpioaajigNLVJOm1hvQAw99sS9iGkSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52beecc3283a44a61b6003e85f55fd847571b9f397c37f9591f437c4c8f6de82","last_reissued_at":"2026-05-18T01:17:36.754432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:36.754432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08166","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-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pooFKLjOhOMkJrlR0wQxMR6FJSCNclYxUusXXinOBiOeFLpuBmBsURYO4wrmNEVqkVUrmUZMJ8fSBrUgb37kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:53:03.172677Z"},"content_sha256":"483472d1a9a28d7acb418e535db5367085100267f29305744eb04b81f9cc27e4","schema_version":"1.0","event_id":"sha256:483472d1a9a28d7acb418e535db5367085100267f29305744eb04b81f9cc27e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KK7OZQZIHJCKMG3AAPUF6VP5QR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.CC","authors_text":"Seth Pettie, Tsvi Kopelowitz, Yi-Jun Chang","submitted_at":"2016-02-26T01:31:56Z","abstract_excerpt":"Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially faster than the best deterministic algorithm. In this paper we prove that these exponential gaps are necessary and establish connections between the deterministic and randomized complexities in the LOCAL model. Each result has a very compelling take-away message:\n  1. Fast $\\Delta$-coloring of trees requires random bits: Building on the recent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08166","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-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ALsPN2nP5HWwdOfECNHJWpxMl9Ehop5dWc8Y6jRaI7vppJXMP1TPGAs3swUzzDV2ePNzGz9SG9khsLVU0ZaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:53:03.173525Z"},"content_sha256":"0e0a1b219a0b5a1be32694a403275b69f8b70335efc80845e608788380e6ed9c","schema_version":"1.0","event_id":"sha256:0e0a1b219a0b5a1be32694a403275b69f8b70335efc80845e608788380e6ed9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KK7OZQZIHJCKMG3AAPUF6VP5QR/bundle.json","state_url":"https://pith.science/pith/KK7OZQZIHJCKMG3AAPUF6VP5QR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KK7OZQZIHJCKMG3AAPUF6VP5QR/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-30T15:53:03Z","links":{"resolver":"https://pith.science/pith/KK7OZQZIHJCKMG3AAPUF6VP5QR","bundle":"https://pith.science/pith/KK7OZQZIHJCKMG3AAPUF6VP5QR/bundle.json","state":"https://pith.science/pith/KK7OZQZIHJCKMG3AAPUF6VP5QR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KK7OZQZIHJCKMG3AAPUF6VP5QR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KK7OZQZIHJCKMG3AAPUF6VP5QR","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":"69151b05e5b7edbe9caedea209a514b11e47f3cd5bfd0bd8413117141d42faaf","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-26T01:31:56Z","title_canon_sha256":"cad2900c50222bf1cf5dccccfef4631f01c9a2aa1583fc8963969e6a1d429908"},"schema_version":"1.0","source":{"id":"1602.08166","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08166","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08166v2","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08166","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"KK7OZQZIHJCK","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KK7OZQZIHJCKMG3A","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KK7OZQZI","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:0e0a1b219a0b5a1be32694a403275b69f8b70335efc80845e608788380e6ed9c","target":"graph","created_at":"2026-05-18T01:17:36Z","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":"Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially faster than the best deterministic algorithm. In this paper we prove that these exponential gaps are necessary and establish connections between the deterministic and randomized complexities in the LOCAL model. Each result has a very compelling take-away message:\n  1. Fast $\\Delta$-coloring of trees requires random bits: Building on the recent ","authors_text":"Seth Pettie, Tsvi Kopelowitz, Yi-Jun Chang","cross_cats":["cs.DC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-26T01:31:56Z","title":"An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08166","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:483472d1a9a28d7acb418e535db5367085100267f29305744eb04b81f9cc27e4","target":"record","created_at":"2026-05-18T01:17:36Z","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":"69151b05e5b7edbe9caedea209a514b11e47f3cd5bfd0bd8413117141d42faaf","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-26T01:31:56Z","title_canon_sha256":"cad2900c50222bf1cf5dccccfef4631f01c9a2aa1583fc8963969e6a1d429908"},"schema_version":"1.0","source":{"id":"1602.08166","kind":"arxiv","version":2}},"canonical_sha256":"52beecc3283a44a61b6003e85f55fd847571b9f397c37f9591f437c4c8f6de82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52beecc3283a44a61b6003e85f55fd847571b9f397c37f9591f437c4c8f6de82","first_computed_at":"2026-05-18T01:17:36.754432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:36.754432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R6P1vZo8A0WB4iPx9eNpdtuc0zL/ZqJw4izxfVaAv8wLoJsKX9HBbRYpioaajigNLVJOm1hvQAw99sS9iGkSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:36.755134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08166","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:483472d1a9a28d7acb418e535db5367085100267f29305744eb04b81f9cc27e4","sha256:0e0a1b219a0b5a1be32694a403275b69f8b70335efc80845e608788380e6ed9c"],"state_sha256":"f1b2f32709b64e1a4abb3f5946cf6d479058c6a8757441a812088c67ffcec0a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSUC/4s6Q1rpQ/uFylGT7UOSwVB+dVIBnwh4+Cf9MagOSX5g008og3kf4plkD0dGKY+7cgmX4qDKk3JTLwHwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:53:03.177885Z","bundle_sha256":"83e01ef3f8f2e9bbc04dfa86237c67880c7060da9bddce70b792f00f0649c199"}}