{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G4TJFWHBNYF5DLLBQMJRAVTOEC","short_pith_number":"pith:G4TJFWHB","schema_version":"1.0","canonical_sha256":"372692d8e16e0bd1ad61831310566e20a614f45e7c38ed78bdeb7fac4aa0f8af","source":{"kind":"arxiv","id":"1307.3757","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.3757","created_at":"2026-05-18T03:09:33.321504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3757v2","created_at":"2026-05-18T03:09:33.321504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3757","created_at":"2026-05-18T03:09:33.321504+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4TJFWHBNYF5","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4TJFWHBNYF5DLLB","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4TJFWHB","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC","json":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC.json","graph_json":"https://pith.science/api/pith-number/G4TJFWHBNYF5DLLBQMJRAVTOEC/graph.json","events_json":"https://pith.science/api/pith-number/G4TJFWHBNYF5DLLBQMJRAVTOEC/events.json","paper":"https://pith.science/paper/G4TJFWHB"},"agent_actions":{"view_html":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC","download_json":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC.json","view_paper":"https://pith.science/paper/G4TJFWHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3757&json=true","fetch_graph":"https://pith.science/api/pith-number/G4TJFWHBNYF5DLLBQMJRAVTOEC/graph.json","fetch_events":"https://pith.science/api/pith-number/G4TJFWHBNYF5DLLBQMJRAVTOEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/action/storage_attestation","attest_author":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/action/author_attestation","sign_citation":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/action/citation_signature","submit_replication":"https://pith.science/pith/G4TJFWHBNYF5DLLBQMJRAVTOEC/action/replication_record"}},"created_at":"2026-05-18T03:09:33.321504+00:00","updated_at":"2026-05-18T03:09:33.321504+00:00"}