{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KVPGCFBJYOG7X76JR26GHYKYLM","short_pith_number":"pith:KVPGCFBJ","canonical_record":{"source":{"id":"1308.3336","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-15T08:32:39Z","cross_cats_sorted":[],"title_canon_sha256":"cb96291008e04461dcb79d4f76528e1865a05d2ecebe0b3ea9f67674854546ed","abstract_canon_sha256":"d9bac7037836359066d7855b7f2935abdc30138274668f8c93e2c3e6d964d8ad"},"schema_version":"1.0"},"canonical_sha256":"555e611429c38dfbffc98ebc63e1585b13c4008447b16e359bb6d1f34f1f366d","source":{"kind":"arxiv","id":"1308.3336","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3336","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3336v5","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3336","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"KVPGCFBJYOG7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KVPGCFBJYOG7X76J","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KVPGCFBJ","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KVPGCFBJYOG7X76JR26GHYKYLM","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3336","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-15T08:32:39Z","cross_cats_sorted":[],"title_canon_sha256":"cb96291008e04461dcb79d4f76528e1865a05d2ecebe0b3ea9f67674854546ed","abstract_canon_sha256":"d9bac7037836359066d7855b7f2935abdc30138274668f8c93e2c3e6d964d8ad"},"schema_version":"1.0"},"canonical_sha256":"555e611429c38dfbffc98ebc63e1585b13c4008447b16e359bb6d1f34f1f366d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.002164Z","signature_b64":"KRacLpi7hl1JYoOSDERy7khdYrrQZTH5ITNjONY4gZtsURnNqvVwoId9M9OHZZKa3E1wH1Dr6B6C8jwTOls2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"555e611429c38dfbffc98ebc63e1585b13c4008447b16e359bb6d1f34f1f366d","last_reissued_at":"2026-05-18T01:11:58.001828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.001828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3336","source_version":5,"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:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jnmYZrUopbvhV5ds4n7x7sJlnAahJxobp0cxdoqjxoXZQw2+AyI6IejYXbFE2IX2nKMxXc0IMZk3wQ1TZGxBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:19:11.896605Z"},"content_sha256":"7a1fab7cc2861d02156bcedd12ee031aa103ba52b698f07276d3eb7c8d3eb272","schema_version":"1.0","event_id":"sha256:7a1fab7cc2861d02156bcedd12ee031aa103ba52b698f07276d3eb7c8d3eb272"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KVPGCFBJYOG7X76JR26GHYKYLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych, Jakub {\\L}\\k{a}cki, Jakub O\\'cwieja, Marcin Pilipczuk, Piotr Sankowski","submitted_at":"2013-08-15T08:32:39Z","abstract_excerpt":"In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an $n$-vertex graph $G=(V,E,w)$ with positive real edge weights, and our goal is to maintain a tree which is a good approximation of the minimum Steiner tree spanning a terminal set $S \\subseteq V$, which changes over time. The changes applied to the terminal set are either terminal additions (incremental scenario), terminal removals (decremental scenario), or both (fully dynamic scenario). Our task here is twofold. We want to support updates in sublinear $o(n)$ time, and k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3336","kind":"arxiv","version":5},"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:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aaP8rvLR+zcfSYoKcwHllgCrfU2JpYlxkIm4RnKf/PQHhOB7k7d2yZbK+M0uPzNFPn0w9F6SkTeHhqQuXj4OCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:19:11.897363Z"},"content_sha256":"d56b7e6dfebf5178a4094d8d9b03083cce8c5fe8d48303952b29d8b8c0ded80d","schema_version":"1.0","event_id":"sha256:d56b7e6dfebf5178a4094d8d9b03083cce8c5fe8d48303952b29d8b8c0ded80d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVPGCFBJYOG7X76JR26GHYKYLM/bundle.json","state_url":"https://pith.science/pith/KVPGCFBJYOG7X76JR26GHYKYLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVPGCFBJYOG7X76JR26GHYKYLM/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-25T23:19:11Z","links":{"resolver":"https://pith.science/pith/KVPGCFBJYOG7X76JR26GHYKYLM","bundle":"https://pith.science/pith/KVPGCFBJYOG7X76JR26GHYKYLM/bundle.json","state":"https://pith.science/pith/KVPGCFBJYOG7X76JR26GHYKYLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVPGCFBJYOG7X76JR26GHYKYLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KVPGCFBJYOG7X76JR26GHYKYLM","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":"d9bac7037836359066d7855b7f2935abdc30138274668f8c93e2c3e6d964d8ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-15T08:32:39Z","title_canon_sha256":"cb96291008e04461dcb79d4f76528e1865a05d2ecebe0b3ea9f67674854546ed"},"schema_version":"1.0","source":{"id":"1308.3336","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3336","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3336v5","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3336","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"KVPGCFBJYOG7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KVPGCFBJYOG7X76J","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KVPGCFBJ","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:d56b7e6dfebf5178a4094d8d9b03083cce8c5fe8d48303952b29d8b8c0ded80d","target":"graph","created_at":"2026-05-18T01:11:58Z","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":"In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an $n$-vertex graph $G=(V,E,w)$ with positive real edge weights, and our goal is to maintain a tree which is a good approximation of the minimum Steiner tree spanning a terminal set $S \\subseteq V$, which changes over time. The changes applied to the terminal set are either terminal additions (incremental scenario), terminal removals (decremental scenario), or both (fully dynamic scenario). Our task here is twofold. We want to support updates in sublinear $o(n)$ time, and k","authors_text":"Anna Zych, Jakub {\\L}\\k{a}cki, Jakub O\\'cwieja, Marcin Pilipczuk, Piotr Sankowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-15T08:32:39Z","title":"The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3336","kind":"arxiv","version":5},"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:7a1fab7cc2861d02156bcedd12ee031aa103ba52b698f07276d3eb7c8d3eb272","target":"record","created_at":"2026-05-18T01:11:58Z","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":"d9bac7037836359066d7855b7f2935abdc30138274668f8c93e2c3e6d964d8ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-15T08:32:39Z","title_canon_sha256":"cb96291008e04461dcb79d4f76528e1865a05d2ecebe0b3ea9f67674854546ed"},"schema_version":"1.0","source":{"id":"1308.3336","kind":"arxiv","version":5}},"canonical_sha256":"555e611429c38dfbffc98ebc63e1585b13c4008447b16e359bb6d1f34f1f366d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"555e611429c38dfbffc98ebc63e1585b13c4008447b16e359bb6d1f34f1f366d","first_computed_at":"2026-05-18T01:11:58.001828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:58.001828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KRacLpi7hl1JYoOSDERy7khdYrrQZTH5ITNjONY4gZtsURnNqvVwoId9M9OHZZKa3E1wH1Dr6B6C8jwTOls2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:58.002164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3336","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a1fab7cc2861d02156bcedd12ee031aa103ba52b698f07276d3eb7c8d3eb272","sha256:d56b7e6dfebf5178a4094d8d9b03083cce8c5fe8d48303952b29d8b8c0ded80d"],"state_sha256":"ca7d76d5c28249b26b81c40e5a6338055b5ebde4d030b3047ed13b56639ce17b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjZdfTUtFA4KSQtTQ4KcYe7DttepzFNvATNKXEkdEIOQeR/X3t9pp743vBDDIyabQN5h1/mKtOHz59yiHtOFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:19:11.901438Z","bundle_sha256":"bf3346ced2869f15ddcb47c3ae22360a0d9feed83ac5f02e9d9e50621b4141a7"}}