{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4SMV7TJBVIOS5PDRPLBFELL4R2","short_pith_number":"pith:4SMV7TJB","canonical_record":{"source":{"id":"1412.3445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-10T20:59:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"167a0b86bd6567760505bd87e454dd84edf04c8006f3be09086358b3ee0f7fc3","abstract_canon_sha256":"1bdde5cce0807cf218a8439672ebc8cd491558609d8027150069aeb8232c7898"},"schema_version":"1.0"},"canonical_sha256":"e4995fcd21aa1d2ebc717ac2522d7c8ebb5443976a6c57acf73d0c873822d597","source":{"kind":"arxiv","id":"1412.3445","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3445","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3445v2","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3445","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"4SMV7TJBVIOS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4SMV7TJBVIOS5PDR","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4SMV7TJB","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4SMV7TJBVIOS5PDRPLBFELL4R2","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-10T20:59:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"167a0b86bd6567760505bd87e454dd84edf04c8006f3be09086358b3ee0f7fc3","abstract_canon_sha256":"1bdde5cce0807cf218a8439672ebc8cd491558609d8027150069aeb8232c7898"},"schema_version":"1.0"},"canonical_sha256":"e4995fcd21aa1d2ebc717ac2522d7c8ebb5443976a6c57acf73d0c873822d597","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:29.630525Z","signature_b64":"4Wd9/LRix3r4RN7+glyOKZ4ouQgHMHjTOQ2BB+h+0Ml/Uc8+ELibex5JiIF21WEDZdresFRxRvr+dJgAN6NoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4995fcd21aa1d2ebc717ac2522d7c8ebb5443976a6c57acf73d0c873822d597","last_reissued_at":"2026-05-18T02:31:29.630039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:29.630039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3445","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-18T02:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFuzIjWQVz0W9hsmkQcEosml3JnwcxQSzRfm170mPFjQg3maIkP8INP6Jisgyq4q2iy/7pnLC1mMlueetipFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:57:25.614851Z"},"content_sha256":"a0ce8c52d321f465b7b4549a2506a2fd7ea1584e00e82e7c1637751cc2869111","schema_version":"1.0","event_id":"sha256:a0ce8c52d321f465b7b4549a2506a2fd7ea1584e00e82e7c1637751cc2869111"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4SMV7TJBVIOS5PDRPLBFELL4R2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation of Distances and Shortest Paths in the Broadcast Congest Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Nathan Pinsker, Stephan Holzer","submitted_at":"2014-12-10T20:59:11Z","abstract_excerpt":"We study the broadcast version of the CONGEST CLIQUE model of distributed computing. In this model, in each round, any node in a network of size $n$ can send the same message (i.e. broadcast a message) of limited size to every other node in the network. Nanongkai presented in [STOC'14] a randomized $(2+o(1))$-approximation algorithm to compute all pairs shortest paths (APSP) in time $\\tilde{O}(\\sqrt{n})$ on weighted graphs, where we use the convention that $\\tilde{\\Omega}(f(n))$ is essentially $\\Omega(f(n)/$polylog$f(n))$ and $\\tilde{O}(f(n))$ is essentially $O(f(n) $polylog$f(n))$. We complem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3445","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-18T02:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4JKkoJmKtTyuWhOnPg3cBS59tTHKoom8+3uYU3wryiYLe5NzLIxL7QxA+T6XaGjJz8FcbJFbw0K5rJpaGwnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:57:25.615195Z"},"content_sha256":"d4fd560d55b02c04df344c0a4b7651e2b421cc939d2a7e94575183a81f1e80ff","schema_version":"1.0","event_id":"sha256:d4fd560d55b02c04df344c0a4b7651e2b421cc939d2a7e94575183a81f1e80ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SMV7TJBVIOS5PDRPLBFELL4R2/bundle.json","state_url":"https://pith.science/pith/4SMV7TJBVIOS5PDRPLBFELL4R2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SMV7TJBVIOS5PDRPLBFELL4R2/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-06-24T19:57:25Z","links":{"resolver":"https://pith.science/pith/4SMV7TJBVIOS5PDRPLBFELL4R2","bundle":"https://pith.science/pith/4SMV7TJBVIOS5PDRPLBFELL4R2/bundle.json","state":"https://pith.science/pith/4SMV7TJBVIOS5PDRPLBFELL4R2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SMV7TJBVIOS5PDRPLBFELL4R2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4SMV7TJBVIOS5PDRPLBFELL4R2","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":"1bdde5cce0807cf218a8439672ebc8cd491558609d8027150069aeb8232c7898","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-10T20:59:11Z","title_canon_sha256":"167a0b86bd6567760505bd87e454dd84edf04c8006f3be09086358b3ee0f7fc3"},"schema_version":"1.0","source":{"id":"1412.3445","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3445","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3445v2","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3445","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"4SMV7TJBVIOS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4SMV7TJBVIOS5PDR","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4SMV7TJB","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:d4fd560d55b02c04df344c0a4b7651e2b421cc939d2a7e94575183a81f1e80ff","target":"graph","created_at":"2026-05-18T02:31:29Z","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":"We study the broadcast version of the CONGEST CLIQUE model of distributed computing. In this model, in each round, any node in a network of size $n$ can send the same message (i.e. broadcast a message) of limited size to every other node in the network. Nanongkai presented in [STOC'14] a randomized $(2+o(1))$-approximation algorithm to compute all pairs shortest paths (APSP) in time $\\tilde{O}(\\sqrt{n})$ on weighted graphs, where we use the convention that $\\tilde{\\Omega}(f(n))$ is essentially $\\Omega(f(n)/$polylog$f(n))$ and $\\tilde{O}(f(n))$ is essentially $O(f(n) $polylog$f(n))$. We complem","authors_text":"Nathan Pinsker, Stephan Holzer","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-10T20:59:11Z","title":"Approximation of Distances and Shortest Paths in the Broadcast Congest Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3445","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:a0ce8c52d321f465b7b4549a2506a2fd7ea1584e00e82e7c1637751cc2869111","target":"record","created_at":"2026-05-18T02:31:29Z","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":"1bdde5cce0807cf218a8439672ebc8cd491558609d8027150069aeb8232c7898","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-10T20:59:11Z","title_canon_sha256":"167a0b86bd6567760505bd87e454dd84edf04c8006f3be09086358b3ee0f7fc3"},"schema_version":"1.0","source":{"id":"1412.3445","kind":"arxiv","version":2}},"canonical_sha256":"e4995fcd21aa1d2ebc717ac2522d7c8ebb5443976a6c57acf73d0c873822d597","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4995fcd21aa1d2ebc717ac2522d7c8ebb5443976a6c57acf73d0c873822d597","first_computed_at":"2026-05-18T02:31:29.630039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:29.630039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Wd9/LRix3r4RN7+glyOKZ4ouQgHMHjTOQ2BB+h+0Ml/Uc8+ELibex5JiIF21WEDZdresFRxRvr+dJgAN6NoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:29.630525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3445","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0ce8c52d321f465b7b4549a2506a2fd7ea1584e00e82e7c1637751cc2869111","sha256:d4fd560d55b02c04df344c0a4b7651e2b421cc939d2a7e94575183a81f1e80ff"],"state_sha256":"093b620fec3be918e594f63578734c4bcc9e80f7ac4343f925e48e341a345846"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSnAk/c2CKchNZG/F3yHwtUkPSBCbcfwjN9yxxgp2T7whAoeV1Hmv/DrOrhTPZC4u1SWGFj/vwDUSkzObuACBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:57:25.617176Z","bundle_sha256":"a10cc24c6b884d4a2c509bf31f339f7eefc20f742483b3c9c650690ab1262a59"}}