{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6VCYIJED5SDEUYR4IZDQV55VFO","short_pith_number":"pith:6VCYIJED","canonical_record":{"source":{"id":"1512.08147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-26T21:54:27Z","cross_cats_sorted":[],"title_canon_sha256":"c01e8fea84739adea9cad558ef3911ef7823b4dc78f71b010f1317f2e9fee53c","abstract_canon_sha256":"6da56e7dc78b81148f033d4ed6d0b55ac05625a7a485def3648fafec3e020fd9"},"schema_version":"1.0"},"canonical_sha256":"f545842483ec864a623c46470af7b52b8f96adceace30345cef9aef645ec5f06","source":{"kind":"arxiv","id":"1512.08147","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08147","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08147v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08147","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"6VCYIJED5SDE","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6VCYIJED5SDEUYR4","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6VCYIJED","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6VCYIJED5SDEUYR4IZDQV55VFO","target":"record","payload":{"canonical_record":{"source":{"id":"1512.08147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-26T21:54:27Z","cross_cats_sorted":[],"title_canon_sha256":"c01e8fea84739adea9cad558ef3911ef7823b4dc78f71b010f1317f2e9fee53c","abstract_canon_sha256":"6da56e7dc78b81148f033d4ed6d0b55ac05625a7a485def3648fafec3e020fd9"},"schema_version":"1.0"},"canonical_sha256":"f545842483ec864a623c46470af7b52b8f96adceace30345cef9aef645ec5f06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.530980Z","signature_b64":"K83/ZGI4vjalbs1VA6S7vkTTO6VjUh7QpQYk2vPm6vVOiJdVcWsy/9APHDi/5aJNV5uOcno7JX+FnPZHzEDODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f545842483ec864a623c46470af7b52b8f96adceace30345cef9aef645ec5f06","last_reissued_at":"2026-05-18T00:22:16.530299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.530299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.08147","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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gg3SJdlgaly8tcsAWcIiYvHvxtyNBWYtO69PjisTHn0AmEAqDZ2NnlyAIZL5TYHLJ1ShFEkYKs7s8QyDP/RwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:14.772150Z"},"content_sha256":"b6aedcace1f8ae6d162141c2f692b0173ef8bd8011ae8eb1072f2b4abe394cec","schema_version":"1.0","event_id":"sha256:b6aedcace1f8ae6d162141c2f692b0173ef8bd8011ae8eb1072f2b4abe394cec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6VCYIJED5SDEUYR4IZDQV55VFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","submitted_at":"2015-12-26T21:54:27Z","abstract_excerpt":"We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We present deterministic $(1+\\epsilon)$-approximation algorithms whose amortized time (over some number of link changes) is sublinear in $D$, the maximum diameter of the network.\n  Our technique also leads to a deterministic $(1+\\epsilon)$-approximate incremental algorithm for single-source shortest paths (SSSP) in the sequential (usual RAM) model. Prior to our work, the state of the art"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08147","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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/mKoCYyYBBOiSd8cPaC0tTdWXNKNjP0Sw+5pNeMVGeqqmVrNVaiQJ89SyhuSArq/qZ4RVXbQ9U1kk8gN2FbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:14.772747Z"},"content_sha256":"123333710334f712f78ddab637720f1bb0297b39aa28ec6036ac6d7047276cf5","schema_version":"1.0","event_id":"sha256:123333710334f712f78ddab637720f1bb0297b39aa28ec6036ac6d7047276cf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VCYIJED5SDEUYR4IZDQV55VFO/bundle.json","state_url":"https://pith.science/pith/6VCYIJED5SDEUYR4IZDQV55VFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VCYIJED5SDEUYR4IZDQV55VFO/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-27T10:35:14Z","links":{"resolver":"https://pith.science/pith/6VCYIJED5SDEUYR4IZDQV55VFO","bundle":"https://pith.science/pith/6VCYIJED5SDEUYR4IZDQV55VFO/bundle.json","state":"https://pith.science/pith/6VCYIJED5SDEUYR4IZDQV55VFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VCYIJED5SDEUYR4IZDQV55VFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6VCYIJED5SDEUYR4IZDQV55VFO","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":"6da56e7dc78b81148f033d4ed6d0b55ac05625a7a485def3648fafec3e020fd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-26T21:54:27Z","title_canon_sha256":"c01e8fea84739adea9cad558ef3911ef7823b4dc78f71b010f1317f2e9fee53c"},"schema_version":"1.0","source":{"id":"1512.08147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08147","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08147v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08147","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"6VCYIJED5SDE","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6VCYIJED5SDEUYR4","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6VCYIJED","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:123333710334f712f78ddab637720f1bb0297b39aa28ec6036ac6d7047276cf5","target":"graph","created_at":"2026-05-18T00:22:16Z","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 problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We present deterministic $(1+\\epsilon)$-approximation algorithms whose amortized time (over some number of link changes) is sublinear in $D$, the maximum diameter of the network.\n  Our technique also leads to a deterministic $(1+\\epsilon)$-approximate incremental algorithm for single-source shortest paths (SSSP) in the sequential (usual RAM) model. Prior to our work, the state of the art","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-26T21:54:27Z","title":"Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08147","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:b6aedcace1f8ae6d162141c2f692b0173ef8bd8011ae8eb1072f2b4abe394cec","target":"record","created_at":"2026-05-18T00:22:16Z","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":"6da56e7dc78b81148f033d4ed6d0b55ac05625a7a485def3648fafec3e020fd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-26T21:54:27Z","title_canon_sha256":"c01e8fea84739adea9cad558ef3911ef7823b4dc78f71b010f1317f2e9fee53c"},"schema_version":"1.0","source":{"id":"1512.08147","kind":"arxiv","version":2}},"canonical_sha256":"f545842483ec864a623c46470af7b52b8f96adceace30345cef9aef645ec5f06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f545842483ec864a623c46470af7b52b8f96adceace30345cef9aef645ec5f06","first_computed_at":"2026-05-18T00:22:16.530299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.530299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K83/ZGI4vjalbs1VA6S7vkTTO6VjUh7QpQYk2vPm6vVOiJdVcWsy/9APHDi/5aJNV5uOcno7JX+FnPZHzEDODg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.530980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6aedcace1f8ae6d162141c2f692b0173ef8bd8011ae8eb1072f2b4abe394cec","sha256:123333710334f712f78ddab637720f1bb0297b39aa28ec6036ac6d7047276cf5"],"state_sha256":"2af5f11e1a80c14f2c0eab4fcb221260c66afb6dd93d20e4ef71e621846d7425"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3/vj+o6NeFpiZG3GP+M+L7gQqmmyOItam+IThTrEKZcqj7pH+gNbAV+Q1pnFI659oXzzyW5t4YRjySaBE+SUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:35:14.775788Z","bundle_sha256":"19a502242a7743cd6e9c1c8201a511ad6715aeab6581d31cff37455e133f7c00"}}