{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V5SE3WPRCLMWWUGXWMASLEWXF4","short_pith_number":"pith:V5SE3WPR","schema_version":"1.0","canonical_sha256":"af644dd9f112d96b50d7b3012592d72f008c94e90cae85d29987f858b46207ff","source":{"kind":"arxiv","id":"1702.04871","version":1},"attestation_state":"computed","paper":{"title":"Online Constrained Forest and Prize-Collecting Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Williamson, Jiawei Qian, Seeun William Umboh","submitted_at":"2017-02-16T06:37:42Z","abstract_excerpt":"In this paper, we study a very general type of online network design problem, and generalize two different previous algorithms, one for an online network design problem due to Berman and Coulston [4] and one for (offline) general network design problems due to Goemans and Williamson [9]; we give an O(log k)-competitive algorithm, where k is the number of nodes that must be connected. We also consider a further generalization of the problem that allows us to pay penalties in exchange for violating connectivity constraints; we give an online O(log k)-competitive algorithm for this case as well."},"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":"1702.04871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-16T06:37:42Z","cross_cats_sorted":[],"title_canon_sha256":"b60d200cd87fc8b06e53b358ba0b9a789fbc1e365a11739ea9f5a8385b8c0884","abstract_canon_sha256":"66b8c7bb40ac84369e57f416a78091ca8a395cc954e0c033f8bf52a272d1004a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:36.941131Z","signature_b64":"wS8Bi/n9bVg9LXoEehnVufPRhR/oiHOVLd5Z/Jl9+nLX0f//hPmpOgJDidCbIcEwXsJ1A9GpQhzupc8rE46GDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af644dd9f112d96b50d7b3012592d72f008c94e90cae85d29987f858b46207ff","last_reissued_at":"2026-05-18T00:50:36.940431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:36.940431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Constrained Forest and Prize-Collecting Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Williamson, Jiawei Qian, Seeun William Umboh","submitted_at":"2017-02-16T06:37:42Z","abstract_excerpt":"In this paper, we study a very general type of online network design problem, and generalize two different previous algorithms, one for an online network design problem due to Berman and Coulston [4] and one for (offline) general network design problems due to Goemans and Williamson [9]; we give an O(log k)-competitive algorithm, where k is the number of nodes that must be connected. We also consider a further generalization of the problem that allows us to pay penalties in exchange for violating connectivity constraints; we give an online O(log k)-competitive algorithm for this case as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04871","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":"1702.04871","created_at":"2026-05-18T00:50:36.940535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04871v1","created_at":"2026-05-18T00:50:36.940535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04871","created_at":"2026-05-18T00:50:36.940535+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5SE3WPRCLMW","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5SE3WPRCLMWWUGX","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5SE3WPR","created_at":"2026-05-18T12:31:49.984773+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/V5SE3WPRCLMWWUGXWMASLEWXF4","json":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4.json","graph_json":"https://pith.science/api/pith-number/V5SE3WPRCLMWWUGXWMASLEWXF4/graph.json","events_json":"https://pith.science/api/pith-number/V5SE3WPRCLMWWUGXWMASLEWXF4/events.json","paper":"https://pith.science/paper/V5SE3WPR"},"agent_actions":{"view_html":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4","download_json":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4.json","view_paper":"https://pith.science/paper/V5SE3WPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04871&json=true","fetch_graph":"https://pith.science/api/pith-number/V5SE3WPRCLMWWUGXWMASLEWXF4/graph.json","fetch_events":"https://pith.science/api/pith-number/V5SE3WPRCLMWWUGXWMASLEWXF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/action/storage_attestation","attest_author":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/action/author_attestation","sign_citation":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/action/citation_signature","submit_replication":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/action/replication_record"}},"created_at":"2026-05-18T00:50:36.940535+00:00","updated_at":"2026-05-18T00:50:36.940535+00:00"}