{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AYBUW4BCQK3WFPPXEYVZYJPQ6V","short_pith_number":"pith:AYBUW4BC","canonical_record":{"source":{"id":"1905.11573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T02:18:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a825e206e8fa652ab07bb3b8cbbf9779446111d363f797e4010be80141e72271","abstract_canon_sha256":"a7ecd51e985c6d32b26d09ef2510137981daa0045dfad20a6e742a72dccca66f"},"schema_version":"1.0"},"canonical_sha256":"06034b702282b762bdf7262b9c25f0f560cfb3926303156c3e04a237a55208df","source":{"kind":"arxiv","id":"1905.11573","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11573","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11573v1","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11573","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"AYBUW4BCQK3W","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AYBUW4BCQK3WFPPX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AYBUW4BC","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AYBUW4BCQK3WFPPXEYVZYJPQ6V","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T02:18:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a825e206e8fa652ab07bb3b8cbbf9779446111d363f797e4010be80141e72271","abstract_canon_sha256":"a7ecd51e985c6d32b26d09ef2510137981daa0045dfad20a6e742a72dccca66f"},"schema_version":"1.0"},"canonical_sha256":"06034b702282b762bdf7262b9c25f0f560cfb3926303156c3e04a237a55208df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:52.970383Z","signature_b64":"GLYSX4oDvMAM4uK+QVyqtbqT7XEb3kNP5A6PHJ+jKP9kUeoi8YFLO82qlRTGQTkyCOsM7l3y7JpRA73DZ+b2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06034b702282b762bdf7262b9c25f0f560cfb3926303156c3e04a237a55208df","last_reissued_at":"2026-05-17T23:44:52.969785Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:52.969785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11573","source_version":1,"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-17T23:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlIWS3FhIFQ0u5leH2nWVLXqBxhUXSiPCjcKOqd+G2FiGa2CL0R6JI4uzwmvxtajmdAidjwGn18G+oqGhJM8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:14:45.024519Z"},"content_sha256":"09224088a9a933d68c2893dffb257702b474c39c6c30e07da8778fc7d4a57811","schema_version":"1.0","event_id":"sha256:09224088a9a933d68c2893dffb257702b474c39c6c30e07da8778fc7d4a57811"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AYBUW4BCQK3WFPPXEYVZYJPQ6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Distributed Splitting Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Fabian Kuhn, Jara Uitto, Mohsen Ghaffari, Philipp Bamberger, Yannic Maus","submitted_at":"2019-05-28T02:18:53Z","abstract_excerpt":"One of the fundamental open problems in the area of distributed graph algorithms is the question of whether randomization is needed for efficient symmetry breaking. While there are fast, $\\text{poly}\\log n$-time randomized distributed algorithms for all of the classic symmetry breaking problems, for many of them, the best deterministic algorithms are almost exponentially slower. The following basic local splitting problem, which is known as the \\emph{weak splitting} problem takes a central role in this context: Each node of a graph $G=(V,E)$ has to be colored red or blue such that each node of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11573","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":""},"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-17T23:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z9w8OgIYNJal/SXw6DKUe+RnDuCIp0+TyYnJUXIzwBy85cTEPCiKlD2FCRf8DyhKIG8PAxOlzAmoJ3H6cSA8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:14:45.024889Z"},"content_sha256":"1a5267e33feab6ab74c80394c5759d1ab6b44b0beec506423bd58d2d7fda174f","schema_version":"1.0","event_id":"sha256:1a5267e33feab6ab74c80394c5759d1ab6b44b0beec506423bd58d2d7fda174f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYBUW4BCQK3WFPPXEYVZYJPQ6V/bundle.json","state_url":"https://pith.science/pith/AYBUW4BCQK3WFPPXEYVZYJPQ6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYBUW4BCQK3WFPPXEYVZYJPQ6V/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-26T14:14:45Z","links":{"resolver":"https://pith.science/pith/AYBUW4BCQK3WFPPXEYVZYJPQ6V","bundle":"https://pith.science/pith/AYBUW4BCQK3WFPPXEYVZYJPQ6V/bundle.json","state":"https://pith.science/pith/AYBUW4BCQK3WFPPXEYVZYJPQ6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYBUW4BCQK3WFPPXEYVZYJPQ6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AYBUW4BCQK3WFPPXEYVZYJPQ6V","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":"a7ecd51e985c6d32b26d09ef2510137981daa0045dfad20a6e742a72dccca66f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T02:18:53Z","title_canon_sha256":"a825e206e8fa652ab07bb3b8cbbf9779446111d363f797e4010be80141e72271"},"schema_version":"1.0","source":{"id":"1905.11573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11573","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11573v1","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11573","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"AYBUW4BCQK3W","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AYBUW4BCQK3WFPPX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AYBUW4BC","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:1a5267e33feab6ab74c80394c5759d1ab6b44b0beec506423bd58d2d7fda174f","target":"graph","created_at":"2026-05-17T23:44:52Z","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":"One of the fundamental open problems in the area of distributed graph algorithms is the question of whether randomization is needed for efficient symmetry breaking. While there are fast, $\\text{poly}\\log n$-time randomized distributed algorithms for all of the classic symmetry breaking problems, for many of them, the best deterministic algorithms are almost exponentially slower. The following basic local splitting problem, which is known as the \\emph{weak splitting} problem takes a central role in this context: Each node of a graph $G=(V,E)$ has to be colored red or blue such that each node of","authors_text":"Fabian Kuhn, Jara Uitto, Mohsen Ghaffari, Philipp Bamberger, Yannic Maus","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T02:18:53Z","title":"On the Complexity of Distributed Splitting Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11573","kind":"arxiv","version":1},"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:09224088a9a933d68c2893dffb257702b474c39c6c30e07da8778fc7d4a57811","target":"record","created_at":"2026-05-17T23:44:52Z","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":"a7ecd51e985c6d32b26d09ef2510137981daa0045dfad20a6e742a72dccca66f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T02:18:53Z","title_canon_sha256":"a825e206e8fa652ab07bb3b8cbbf9779446111d363f797e4010be80141e72271"},"schema_version":"1.0","source":{"id":"1905.11573","kind":"arxiv","version":1}},"canonical_sha256":"06034b702282b762bdf7262b9c25f0f560cfb3926303156c3e04a237a55208df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06034b702282b762bdf7262b9c25f0f560cfb3926303156c3e04a237a55208df","first_computed_at":"2026-05-17T23:44:52.969785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:52.969785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GLYSX4oDvMAM4uK+QVyqtbqT7XEb3kNP5A6PHJ+jKP9kUeoi8YFLO82qlRTGQTkyCOsM7l3y7JpRA73DZ+b2AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:52.970383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09224088a9a933d68c2893dffb257702b474c39c6c30e07da8778fc7d4a57811","sha256:1a5267e33feab6ab74c80394c5759d1ab6b44b0beec506423bd58d2d7fda174f"],"state_sha256":"1476c745e1750208913cf22e14a7b29798f8ab75b097b30d53fe5003316ce151"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gfh7NviGv0zt8FpbFqUrcIKD6SFf9Wa5qn3ZKgcgjLtxoPIsMAF6glqKw3vdI8Zl4hTmLqEOOQyuYN+VwbOfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:14:45.028328Z","bundle_sha256":"7733a036a5a9a8ee8c1557b2d9fbd7dc567daad9f453a863c9f9e558390ea8e3"}}