{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V5SE3WPRCLMWWUGXWMASLEWXF4","short_pith_number":"pith:V5SE3WPR","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"},"canonical_sha256":"af644dd9f112d96b50d7b3012592d72f008c94e90cae85d29987f858b46207ff","source":{"kind":"arxiv","id":"1702.04871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04871","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04871v1","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04871","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"V5SE3WPRCLMW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5SE3WPRCLMWWUGX","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5SE3WPR","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V5SE3WPRCLMWWUGXWMASLEWXF4","target":"record","payload":{"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"},"canonical_sha256":"af644dd9f112d96b50d7b3012592d72f008c94e90cae85d29987f858b46207ff","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"},"source_kind":"arxiv","source_id":"1702.04871","source_version":1,"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-18T00:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIWn3af/S+QH/kSBBCn0fN7YfNdKTbFQavFDIh0HHFPomom8taWk3Ug4FJz7WWLcb4rMC34W18sGG5F9ayEzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:11:53.387563Z"},"content_sha256":"0759cadbdb72c55d77e9d48404137d34cc0f741cfe7bc95aa3533e3eb2707cbb","schema_version":"1.0","event_id":"sha256:0759cadbdb72c55d77e9d48404137d34cc0f741cfe7bc95aa3533e3eb2707cbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V5SE3WPRCLMWWUGXWMASLEWXF4","target":"graph","payload":{"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"},"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-18T00:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ablVio7IimwZptf5Vtgb69chWnTk5u0Z6LKTdKLtbn1P+iD08kWqfq9V8a1OeLXLRp+Z0jlIDUS3p1s5fidQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:11:53.387902Z"},"content_sha256":"e1076db7f01c8e4b3bdba19a14ff11eb02e220d29060579f88ab299ffd731e4a","schema_version":"1.0","event_id":"sha256:e1076db7f01c8e4b3bdba19a14ff11eb02e220d29060579f88ab299ffd731e4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/bundle.json","state_url":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/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-02T16:11:53Z","links":{"resolver":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4","bundle":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/bundle.json","state":"https://pith.science/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5SE3WPRCLMWWUGXWMASLEWXF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V5SE3WPRCLMWWUGXWMASLEWXF4","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":"66b8c7bb40ac84369e57f416a78091ca8a395cc954e0c033f8bf52a272d1004a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-16T06:37:42Z","title_canon_sha256":"b60d200cd87fc8b06e53b358ba0b9a789fbc1e365a11739ea9f5a8385b8c0884"},"schema_version":"1.0","source":{"id":"1702.04871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04871","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04871v1","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04871","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"V5SE3WPRCLMW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5SE3WPRCLMWWUGX","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5SE3WPR","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:e1076db7f01c8e4b3bdba19a14ff11eb02e220d29060579f88ab299ffd731e4a","target":"graph","created_at":"2026-05-18T00:50:36Z","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 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.","authors_text":"David P. Williamson, Jiawei Qian, Seeun William Umboh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-16T06:37:42Z","title":"Online Constrained Forest and Prize-Collecting Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04871","kind":"arxiv","version":1},"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:0759cadbdb72c55d77e9d48404137d34cc0f741cfe7bc95aa3533e3eb2707cbb","target":"record","created_at":"2026-05-18T00:50:36Z","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":"66b8c7bb40ac84369e57f416a78091ca8a395cc954e0c033f8bf52a272d1004a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-16T06:37:42Z","title_canon_sha256":"b60d200cd87fc8b06e53b358ba0b9a789fbc1e365a11739ea9f5a8385b8c0884"},"schema_version":"1.0","source":{"id":"1702.04871","kind":"arxiv","version":1}},"canonical_sha256":"af644dd9f112d96b50d7b3012592d72f008c94e90cae85d29987f858b46207ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af644dd9f112d96b50d7b3012592d72f008c94e90cae85d29987f858b46207ff","first_computed_at":"2026-05-18T00:50:36.940431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:36.940431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wS8Bi/n9bVg9LXoEehnVufPRhR/oiHOVLd5Z/Jl9+nLX0f//hPmpOgJDidCbIcEwXsJ1A9GpQhzupc8rE46GDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:36.941131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0759cadbdb72c55d77e9d48404137d34cc0f741cfe7bc95aa3533e3eb2707cbb","sha256:e1076db7f01c8e4b3bdba19a14ff11eb02e220d29060579f88ab299ffd731e4a"],"state_sha256":"40772c268f9f20725514ddc99ca55ad8a94fe6f01c13d2ae77310f08694970ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iS1LpQyAsSomv4AQ9if5jdonQI5iPEEnYunMixkWyBjyvo/axFbcDilOP+0+bYAOObuh/9Wi7KC1Z3mD779HDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:11:53.389753Z","bundle_sha256":"4ba46cc7036a5401f6b3a1a3bb36d9044e42fa809620d20982e3c1df05fd66b7"}}