{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G4TJFWHBNYF5DLLBQMJRAVTOEC","short_pith_number":"pith:G4TJFWHB","canonical_record":{"source":{"id":"1307.3757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T17:19:41Z","cross_cats_sorted":[],"title_canon_sha256":"34d6e9be78017bd1d8f289ca3eb267fe641fbc4238f03c02f80fb883eb2f8860","abstract_canon_sha256":"84d1fd315421cc3677c0e7e0da8162283eb193106a1ed2aadfa4979625795a41"},"schema_version":"1.0"},"canonical_sha256":"372692d8e16e0bd1ad61831310566e20a614f45e7c38ed78bdeb7fac4aa0f8af","source":{"kind":"arxiv","id":"1307.3757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3757","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3757v2","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3757","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"G4TJFWHBNYF5","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G4TJFWHBNYF5DLLB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G4TJFWHB","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G4TJFWHBNYF5DLLBQMJRAVTOEC","target":"record","payload":{"canonical_record":{"source":{"id":"1307.3757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T17:19:41Z","cross_cats_sorted":[],"title_canon_sha256":"34d6e9be78017bd1d8f289ca3eb267fe641fbc4238f03c02f80fb883eb2f8860","abstract_canon_sha256":"84d1fd315421cc3677c0e7e0da8162283eb193106a1ed2aadfa4979625795a41"},"schema_version":"1.0"},"canonical_sha256":"372692d8e16e0bd1ad61831310566e20a614f45e7c38ed78bdeb7fac4aa0f8af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:33.322125Z","signature_b64":"CiLPiiUQy9HJHKnxLi9HbsfxHyIJFFpdV5XDwCqtvJ2xKGFsGdD6WvOdLxXqC53ZEDJkxyBVPDOAXPhz1zGyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"372692d8e16e0bd1ad61831310566e20a614f45e7c38ed78bdeb7fac4aa0f8af","last_reissued_at":"2026-05-18T03:09:33.321357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:33.321357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.3757","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-18T03:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"so20Mv+k2HBKtsgLstGzBgou8LtE2RK+YSPrHDFQD+QZG2FPpyJvRoUUAbVZiCuh6PDIGrvqup436hbs4k9tDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:28:42.645803Z"},"content_sha256":"6cbade0460b72f2b40b32e2c5e45aa1a8ae8eccff7f5ea6e396d32dde44fe754","schema_version":"1.0","event_id":"sha256:6cbade0460b72f2b40b32e2c5e45aa1a8ae8eccff7f5ea6e396d32dde44fe754"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G4TJFWHBNYF5DLLBQMJRAVTOEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Albert Gu, Amit Kumar, Anupam Gupta","submitted_at":"2013-07-14T17:19:41Z","abstract_excerpt":"In the online Steiner tree problem, a sequence of points is revealed one-by-one: when a point arrives, we only have time to add a single edge connecting this point to the previous ones, and we want to minimize the total length of edges added. For two decades, we know that the greedy algorithm maintains a tree whose cost is O(log n) times the Steiner tree cost, and this is best possible. But suppose, in addition to the new edge we add, we can change a single edge from the previous set of edges: can we do much better? Can we maintain a tree that is constant-competitive?\n  We answer this question"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3757","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-18T03:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqnlplEhsrocmx9I3uaDtTrir+mSDGheLKIi3v5QzzBz5aAPhNkYGMfdyD6oNjcqvYKRuJRghqfbk0kubZAoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:28:42.646151Z"},"content_sha256":"4be6be9fdcbd3eb00ec5b5b0b99b422f6b6769382ada05d484f66c2480d0701c","schema_version":"1.0","event_id":"sha256:4be6be9fdcbd3eb00ec5b5b0b99b422f6b6769382ada05d484f66c2480d0701c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/bundle.json","state_url":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/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-03T11:28:42Z","links":{"resolver":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC","bundle":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/bundle.json","state":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G4TJFWHBNYF5DLLBQMJRAVTOEC","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":"84d1fd315421cc3677c0e7e0da8162283eb193106a1ed2aadfa4979625795a41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T17:19:41Z","title_canon_sha256":"34d6e9be78017bd1d8f289ca3eb267fe641fbc4238f03c02f80fb883eb2f8860"},"schema_version":"1.0","source":{"id":"1307.3757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3757","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3757v2","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3757","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"G4TJFWHBNYF5","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G4TJFWHBNYF5DLLB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G4TJFWHB","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:4be6be9fdcbd3eb00ec5b5b0b99b422f6b6769382ada05d484f66c2480d0701c","target":"graph","created_at":"2026-05-18T03:09:33Z","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, a sequence of points is revealed one-by-one: when a point arrives, we only have time to add a single edge connecting this point to the previous ones, and we want to minimize the total length of edges added. For two decades, we know that the greedy algorithm maintains a tree whose cost is O(log n) times the Steiner tree cost, and this is best possible. But suppose, in addition to the new edge we add, we can change a single edge from the previous set of edges: can we do much better? Can we maintain a tree that is constant-competitive?\n  We answer this question","authors_text":"Albert Gu, Amit Kumar, Anupam Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T17:19:41Z","title":"The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3757","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:6cbade0460b72f2b40b32e2c5e45aa1a8ae8eccff7f5ea6e396d32dde44fe754","target":"record","created_at":"2026-05-18T03:09:33Z","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":"84d1fd315421cc3677c0e7e0da8162283eb193106a1ed2aadfa4979625795a41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T17:19:41Z","title_canon_sha256":"34d6e9be78017bd1d8f289ca3eb267fe641fbc4238f03c02f80fb883eb2f8860"},"schema_version":"1.0","source":{"id":"1307.3757","kind":"arxiv","version":2}},"canonical_sha256":"372692d8e16e0bd1ad61831310566e20a614f45e7c38ed78bdeb7fac4aa0f8af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"372692d8e16e0bd1ad61831310566e20a614f45e7c38ed78bdeb7fac4aa0f8af","first_computed_at":"2026-05-18T03:09:33.321357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:33.321357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CiLPiiUQy9HJHKnxLi9HbsfxHyIJFFpdV5XDwCqtvJ2xKGFsGdD6WvOdLxXqC53ZEDJkxyBVPDOAXPhz1zGyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:33.322125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cbade0460b72f2b40b32e2c5e45aa1a8ae8eccff7f5ea6e396d32dde44fe754","sha256:4be6be9fdcbd3eb00ec5b5b0b99b422f6b6769382ada05d484f66c2480d0701c"],"state_sha256":"5be8ad241ef2a1e279d620b73c781cef10a90a26529382f101c9b7664997a944"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cGUjvJGmYNcNjNrTobisACHJF6KTUHXVWS2Eh1e/De3a+Lv92ml6hKAkt3LDP1P3ThmO1XVhyVQ0/Lx38TUzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:28:42.648116Z","bundle_sha256":"6b6740d59c5874d73dc1ef8ef69c4c4123a675d2899fe450cae88b0d10f78cfa"}}