{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5EV2RVZLXXV3NX66R25WFUZP4L","short_pith_number":"pith:5EV2RVZL","schema_version":"1.0","canonical_sha256":"e92ba8d72bbdebb6dfde8ebb62d32fe2eef56ed6af860cc690f456cac7cb1a36","source":{"kind":"arxiv","id":"1704.05430","version":1},"attestation_state":"computed","paper":{"title":"Online Degree-Bounded Steiner Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harald Racke, MohammadTaghi Hajiaghayi, Sina Dahghani, Soheil Ehsani, Vahid Liaghat","submitted_at":"2017-04-18T17:13:20Z","abstract_excerpt":"We initiate the study of degree-bounded network design problems in the online setting. The degree-bounded Steiner tree problem { which asks for a subgraph with minimum degree that connects a given set of vertices { is perhaps one of the most representative problems in this class. This paper deals with its well-studied generalization called the degree-bounded Steiner forest problem where the connectivity demands are represented by vertex pairs that need to be individually connected. In the classical online model, the input graph is given online but the demand pairs arrive sequentially in online"},"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.05430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-18T17:13:20Z","cross_cats_sorted":[],"title_canon_sha256":"eee151598a9e2bffbb121ec39cc6e4a09d01b7b56c3076cea4a90d599e9a42e4","abstract_canon_sha256":"84d043d503286cd02bd523b8b7a8784aa378c4e46e842ea723339f73756ae18c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:09.237656Z","signature_b64":"sGd86FHCYv/87gxYMc4RuRy5m78b2PHwifFe9NDb+MhbgvdQEt4b8nykqrDT2LWHABzf3yEG5/WV5oO4TZDXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e92ba8d72bbdebb6dfde8ebb62d32fe2eef56ed6af860cc690f456cac7cb1a36","last_reissued_at":"2026-05-18T00:46:09.237035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:09.237035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Degree-Bounded Steiner Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harald Racke, MohammadTaghi Hajiaghayi, Sina Dahghani, Soheil Ehsani, Vahid Liaghat","submitted_at":"2017-04-18T17:13:20Z","abstract_excerpt":"We initiate the study of degree-bounded network design problems in the online setting. The degree-bounded Steiner tree problem { which asks for a subgraph with minimum degree that connects a given set of vertices { is perhaps one of the most representative problems in this class. This paper deals with its well-studied generalization called the degree-bounded Steiner forest problem where the connectivity demands are represented by vertex pairs that need to be individually connected. In the classical online model, the input graph is given online but the demand pairs arrive sequentially in online"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05430","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.05430","created_at":"2026-05-18T00:46:09.237136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05430v1","created_at":"2026-05-18T00:46:09.237136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05430","created_at":"2026-05-18T00:46:09.237136+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EV2RVZLXXV3","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EV2RVZLXXV3NX66","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EV2RVZL","created_at":"2026-05-18T12:31:00.734936+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/5EV2RVZLXXV3NX66R25WFUZP4L","json":"https://pith.science/pith/5EV2RVZLXXV3NX66R25WFUZP4L.json","graph_json":"https://pith.science/api/pith-number/5EV2RVZLXXV3NX66R25WFUZP4L/graph.json","events_json":"https://pith.science/api/pith-number/5EV2RVZLXXV3NX66R25WFUZP4L/events.json","paper":"https://pith.science/paper/5EV2RVZL"},"agent_actions":{"view_html":"https://pith.science/pith/5EV2RVZLXXV3NX66R25WFUZP4L","download_json":"https://pith.science/pith/5EV2RVZLXXV3NX66R25WFUZP4L.json","view_paper":"https://pith.science/paper/5EV2RVZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05430&json=true","fetch_graph":"https://pith.science/api/pith-number/5EV2RVZLXXV3NX66R25WFUZP4L/graph.json","fetch_events":"https://pith.science/api/pith-number/5EV2RVZLXXV3NX66R25WFUZP4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EV2RVZLXXV3NX66R25WFUZP4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EV2RVZLXXV3NX66R25WFUZP4L/action/storage_attestation","attest_author":"https://pith.science/pith/5EV2RVZLXXV3NX66R25WFUZP4L/action/author_attestation","sign_citation":"https://pith.science/pith/5EV2RVZLXXV3NX66R25WFUZP4L/action/citation_signature","submit_replication":"https://pith.science/pith/5EV2RVZLXXV3NX66R25WFUZP4L/action/replication_record"}},"created_at":"2026-05-18T00:46:09.237136+00:00","updated_at":"2026-05-18T00:46:09.237136+00:00"}