{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SCBCUKKRV5NYP4WUWR33JVBJQ5","short_pith_number":"pith:SCBCUKKR","canonical_record":{"source":{"id":"1312.7296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T16:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"e202e32e3cdff56b7f8b4ac47326e49688da4c8877bc35d11ff8e8b9b0999d32","abstract_canon_sha256":"ee13565b2caebecc1509136a960937d22400b39d26ad7c03dcd1bbc8bafa121e"},"schema_version":"1.0"},"canonical_sha256":"90822a2951af5b87f2d4b477b4d42987574a096a7fe2f8284eb166af046f7733","source":{"kind":"arxiv","id":"1312.7296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7296","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7296v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7296","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"SCBCUKKRV5NY","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SCBCUKKRV5NYP4WU","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SCBCUKKR","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SCBCUKKRV5NYP4WUWR33JVBJQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T16:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"e202e32e3cdff56b7f8b4ac47326e49688da4c8877bc35d11ff8e8b9b0999d32","abstract_canon_sha256":"ee13565b2caebecc1509136a960937d22400b39d26ad7c03dcd1bbc8bafa121e"},"schema_version":"1.0"},"canonical_sha256":"90822a2951af5b87f2d4b477b4d42987574a096a7fe2f8284eb166af046f7733","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:45.226467Z","signature_b64":"vGF5M9hUJlBkD9Xr+IruaALJttzbLt2iuJd4/77t4xZNybkxMfeFQfovM4aniTBuV6ggwari0a3KvJChTimkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90822a2951af5b87f2d4b477b4d42987574a096a7fe2f8284eb166af046f7733","last_reissued_at":"2026-05-18T03:03:45.225851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:45.225851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7296","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-18T03:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YrrrnFyDHpTWg+mNq40g2MlSUFmX32xbh6AkUK0KCh3GpdFFCHs/1mcJXR1Me5I5n2QEmXTtYN5mYNTmsIU7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:06:56.711129Z"},"content_sha256":"33c549ef7e45794933333e8e4a5445c1c2876827f6f3e665cda85bdac25a19ca","schema_version":"1.0","event_id":"sha256:33c549ef7e45794933333e8e4a5445c1c2876827f6f3e665cda85bdac25a19ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SCBCUKKRV5NYP4WUWR33JVBJQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Steiner Tree with Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta","submitted_at":"2013-12-27T16:47:27Z","abstract_excerpt":"In the online Steiner tree problem, the input is a set of vertices that appear one-by-one, and we have to maintain a Steiner tree on the current set of vertices. The cost of the tree is the total length of edges in the tree, and we want this cost to be close to the cost of the optimal Steiner tree at all points in time. If we are allowed to only add edges, a tight bound of $\\Theta(\\log n)$ on the competitiveness is known. Recently it was shown that if we can add one new edge and make one edge swap upon every vertex arrival, we can maintain a constant-competitive tree online.\n  But what if the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7296","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-18T03:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jR9K30uaZKK9WMj7cP6diirCBTHOlioF6ZD22ogx4fFxOIGioCm3RaQB1kuet66FmSf9S0rCZXpTqFW3zvreCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:06:56.711483Z"},"content_sha256":"fb5196fd3087b8b01990981d60d77d6749238e260bcedcc0d65ca24d611b32aa","schema_version":"1.0","event_id":"sha256:fb5196fd3087b8b01990981d60d77d6749238e260bcedcc0d65ca24d611b32aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCBCUKKRV5NYP4WUWR33JVBJQ5/bundle.json","state_url":"https://pith.science/pith/SCBCUKKRV5NYP4WUWR33JVBJQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCBCUKKRV5NYP4WUWR33JVBJQ5/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-03T05:06:56Z","links":{"resolver":"https://pith.science/pith/SCBCUKKRV5NYP4WUWR33JVBJQ5","bundle":"https://pith.science/pith/SCBCUKKRV5NYP4WUWR33JVBJQ5/bundle.json","state":"https://pith.science/pith/SCBCUKKRV5NYP4WUWR33JVBJQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCBCUKKRV5NYP4WUWR33JVBJQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SCBCUKKRV5NYP4WUWR33JVBJQ5","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":"ee13565b2caebecc1509136a960937d22400b39d26ad7c03dcd1bbc8bafa121e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T16:47:27Z","title_canon_sha256":"e202e32e3cdff56b7f8b4ac47326e49688da4c8877bc35d11ff8e8b9b0999d32"},"schema_version":"1.0","source":{"id":"1312.7296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7296","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7296v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7296","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"SCBCUKKRV5NY","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SCBCUKKRV5NYP4WU","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SCBCUKKR","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:fb5196fd3087b8b01990981d60d77d6749238e260bcedcc0d65ca24d611b32aa","target":"graph","created_at":"2026-05-18T03:03:45Z","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 the online Steiner tree problem, the input is a set of vertices that appear one-by-one, and we have to maintain a Steiner tree on the current set of vertices. The cost of the tree is the total length of edges in the tree, and we want this cost to be close to the cost of the optimal Steiner tree at all points in time. If we are allowed to only add edges, a tight bound of $\\Theta(\\log n)$ on the competitiveness is known. Recently it was shown that if we can add one new edge and make one edge swap upon every vertex arrival, we can maintain a constant-competitive tree online.\n  But what if the ","authors_text":"Amit Kumar, Anupam Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T16:47:27Z","title":"Online Steiner Tree with Deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7296","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:33c549ef7e45794933333e8e4a5445c1c2876827f6f3e665cda85bdac25a19ca","target":"record","created_at":"2026-05-18T03:03:45Z","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":"ee13565b2caebecc1509136a960937d22400b39d26ad7c03dcd1bbc8bafa121e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T16:47:27Z","title_canon_sha256":"e202e32e3cdff56b7f8b4ac47326e49688da4c8877bc35d11ff8e8b9b0999d32"},"schema_version":"1.0","source":{"id":"1312.7296","kind":"arxiv","version":1}},"canonical_sha256":"90822a2951af5b87f2d4b477b4d42987574a096a7fe2f8284eb166af046f7733","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90822a2951af5b87f2d4b477b4d42987574a096a7fe2f8284eb166af046f7733","first_computed_at":"2026-05-18T03:03:45.225851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:45.225851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vGF5M9hUJlBkD9Xr+IruaALJttzbLt2iuJd4/77t4xZNybkxMfeFQfovM4aniTBuV6ggwari0a3KvJChTimkDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:45.226467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33c549ef7e45794933333e8e4a5445c1c2876827f6f3e665cda85bdac25a19ca","sha256:fb5196fd3087b8b01990981d60d77d6749238e260bcedcc0d65ca24d611b32aa"],"state_sha256":"5198afa4e76bc2b0fbf594a6a46767ba46945a3fcad88a7e873203d13f2c4c75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iW7Sd/hhlDhd3OK+1um+XWJhJ2kARwg33OhRfZyU++qSiv3K03OWMKXhAITXd+1rQ9Prc4WSByGFdPtWR8QCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:06:56.713390Z","bundle_sha256":"99464ef30f525f2e827d95a7c02ef482f55ae95cd6fbb8438d93455742e645de"}}