{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2O2GCEDH5S4Y3ZURS23336GE3X","short_pith_number":"pith:2O2GCEDH","schema_version":"1.0","canonical_sha256":"d3b4611067ecb98de69196b7bdf8c4dded510bb10a295d86236ed42e11508721","source":{"kind":"arxiv","id":"1704.05811","version":1},"attestation_state":"computed","paper":{"title":"Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harald Racke, MohammadTaghi Hajiaghayi, Saeed Seddighin, Sina Dehghani, Soheil Ehsani, Vahid Liaghat","submitted_at":"2017-04-19T16:39:25Z","abstract_excerpt":"We design the first online algorithm with poly-logarithmic competitive ratio for the edge-weighted degree-bounded Steiner forest(EW-DB-SF) problem and its generalized variant. We obtain our result by demonstrating a new generic approach for solving mixed packing/covering integer programs in the online paradigm. In EW-DB-SF we are given an edge-weighted graph with a degree bound for every vertex. Given a root vertex in advance we receive a sequence of terminal vertices in an online manner. Upon the arrival of a terminal we need to augment our solution subgraph to connect the new terminal to the"},"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":"1704.05811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T16:39:25Z","cross_cats_sorted":[],"title_canon_sha256":"1470de5d3151a4020a023d727c77714983c987b79ecf76f69b02d55054c1b63c","abstract_canon_sha256":"9eb5ff05e399b9e5b1a14bbcb29f328dbea16a21c6de5777b77636a4f55973d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:04.874065Z","signature_b64":"gEtZdALDECH6VJrCl5JXz4AQhWVeLTJ76WqZD1pWNw6buVYY1ApcQSOijeyr9qeTrgmOFfPKGGVFNlFKATx7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3b4611067ecb98de69196b7bdf8c4dded510bb10a295d86236ed42e11508721","last_reissued_at":"2026-05-18T00:46:04.872791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:04.872791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harald Racke, MohammadTaghi Hajiaghayi, Saeed Seddighin, Sina Dehghani, Soheil Ehsani, Vahid Liaghat","submitted_at":"2017-04-19T16:39:25Z","abstract_excerpt":"We design the first online algorithm with poly-logarithmic competitive ratio for the edge-weighted degree-bounded Steiner forest(EW-DB-SF) problem and its generalized variant. We obtain our result by demonstrating a new generic approach for solving mixed packing/covering integer programs in the online paradigm. In EW-DB-SF we are given an edge-weighted graph with a degree bound for every vertex. Given a root vertex in advance we receive a sequence of terminal vertices in an online manner. Upon the arrival of a terminal we need to augment our solution subgraph to connect the new terminal to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05811","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.05811","created_at":"2026-05-18T00:46:04.872921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05811v1","created_at":"2026-05-18T00:46:04.872921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05811","created_at":"2026-05-18T00:46:04.872921+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O2GCEDH5S4Y","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O2GCEDH5S4Y3ZUR","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O2GCEDH","created_at":"2026-05-18T12:30:55.937587+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/2O2GCEDH5S4Y3ZURS23336GE3X","json":"https://pith.science/pith/2O2GCEDH5S4Y3ZURS23336GE3X.json","graph_json":"https://pith.science/api/pith-number/2O2GCEDH5S4Y3ZURS23336GE3X/graph.json","events_json":"https://pith.science/api/pith-number/2O2GCEDH5S4Y3ZURS23336GE3X/events.json","paper":"https://pith.science/paper/2O2GCEDH"},"agent_actions":{"view_html":"https://pith.science/pith/2O2GCEDH5S4Y3ZURS23336GE3X","download_json":"https://pith.science/pith/2O2GCEDH5S4Y3ZURS23336GE3X.json","view_paper":"https://pith.science/paper/2O2GCEDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05811&json=true","fetch_graph":"https://pith.science/api/pith-number/2O2GCEDH5S4Y3ZURS23336GE3X/graph.json","fetch_events":"https://pith.science/api/pith-number/2O2GCEDH5S4Y3ZURS23336GE3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O2GCEDH5S4Y3ZURS23336GE3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O2GCEDH5S4Y3ZURS23336GE3X/action/storage_attestation","attest_author":"https://pith.science/pith/2O2GCEDH5S4Y3ZURS23336GE3X/action/author_attestation","sign_citation":"https://pith.science/pith/2O2GCEDH5S4Y3ZURS23336GE3X/action/citation_signature","submit_replication":"https://pith.science/pith/2O2GCEDH5S4Y3ZURS23336GE3X/action/replication_record"}},"created_at":"2026-05-18T00:46:04.872921+00:00","updated_at":"2026-05-18T00:46:04.872921+00:00"}