{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2UIIC5EBNKW5QIAH4HXMM4MBPF","short_pith_number":"pith:2UIIC5EB","canonical_record":{"source":{"id":"1802.05623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T15:36:45Z","cross_cats_sorted":[],"title_canon_sha256":"4a52516469355563692487eb0a3be5b81687721a4df2ad253d03369c0fda7490","abstract_canon_sha256":"65b554d3ad2102337a26f8143a077a5fe7ecf84b0bd51a2d007e481efc71ae5e"},"schema_version":"1.0"},"canonical_sha256":"d5108174816aadd82007e1eec67181794f0d604d033d3ed0b1cb5cd58821092c","source":{"kind":"arxiv","id":"1802.05623","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05623","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05623v2","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05623","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"pith_short_12","alias_value":"2UIIC5EBNKW5","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UIIC5EBNKW5QIAH","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UIIC5EB","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2UIIC5EBNKW5QIAH4HXMM4MBPF","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T15:36:45Z","cross_cats_sorted":[],"title_canon_sha256":"4a52516469355563692487eb0a3be5b81687721a4df2ad253d03369c0fda7490","abstract_canon_sha256":"65b554d3ad2102337a26f8143a077a5fe7ecf84b0bd51a2d007e481efc71ae5e"},"schema_version":"1.0"},"canonical_sha256":"d5108174816aadd82007e1eec67181794f0d604d033d3ed0b1cb5cd58821092c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:54.408744Z","signature_b64":"3MVqaCmu8qM57dxnKPJPDyakouJJJaJkycpcI67szQTmQWu/uhxUrqH10ZxaAUHBsuso2C0eTu6YE3gWWDq+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5108174816aadd82007e1eec67181794f0d604d033d3ed0b1cb5cd58821092c","last_reissued_at":"2026-05-18T00:22:54.408205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:54.408205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05623","source_version":2,"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:22:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luzEjuUz9p3gwQIIKEZgTzuX7BJnTuOelywj0fdP80YKkCxzl7rwfETaui47pEFutFbfB+YrarT9O//mE9C+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:51:27.782074Z"},"content_sha256":"f66d9dadc740395d03f855c3be23440f24847c703a21be28e126ada0b986bf69","schema_version":"1.0","event_id":"sha256:f66d9dadc740395d03f855c3be23440f24847c703a21be28e126ada0b986bf69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2UIIC5EBNKW5QIAH4HXMM4MBPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An $O(1)$-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chung-Shou Liao, Hao-Ting Wei, Kunihiko Sadakane, Paul Horn, Wing-Kai Hon","submitted_at":"2018-02-15T15:36:45Z","abstract_excerpt":"This study considers the (soft) capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intensively studied in recent years. Given a dynamically changing vertex-weighted graph $G=(V,E)$, which allows edge insertions and edge deletions, the goal is to design a data structure that maintains an approximate minimum vertex cover while satisfying the capacity constraint of each vertex. That is, when picking a copy of a vertex $v$ in the cover, the number of $v$'s incident edges covered by the copy is up to a given "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05623","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"},"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:22:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0j4W0Ua9Sv/+RESXse4MltRI62QiKsEfTHVgZJttCMyael4ikj9ZJjLA0iEKYe/A6QKJCXYzEpPvGesTEUAYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:51:27.782437Z"},"content_sha256":"a521436a0cffdb0fd0df8361d43ad6622a4029ccfa5b3d8d6d23702cf915fc61","schema_version":"1.0","event_id":"sha256:a521436a0cffdb0fd0df8361d43ad6622a4029ccfa5b3d8d6d23702cf915fc61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UIIC5EBNKW5QIAH4HXMM4MBPF/bundle.json","state_url":"https://pith.science/pith/2UIIC5EBNKW5QIAH4HXMM4MBPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UIIC5EBNKW5QIAH4HXMM4MBPF/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-03T07:51:27Z","links":{"resolver":"https://pith.science/pith/2UIIC5EBNKW5QIAH4HXMM4MBPF","bundle":"https://pith.science/pith/2UIIC5EBNKW5QIAH4HXMM4MBPF/bundle.json","state":"https://pith.science/pith/2UIIC5EBNKW5QIAH4HXMM4MBPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UIIC5EBNKW5QIAH4HXMM4MBPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2UIIC5EBNKW5QIAH4HXMM4MBPF","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":"65b554d3ad2102337a26f8143a077a5fe7ecf84b0bd51a2d007e481efc71ae5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T15:36:45Z","title_canon_sha256":"4a52516469355563692487eb0a3be5b81687721a4df2ad253d03369c0fda7490"},"schema_version":"1.0","source":{"id":"1802.05623","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05623","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05623v2","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05623","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"pith_short_12","alias_value":"2UIIC5EBNKW5","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UIIC5EBNKW5QIAH","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UIIC5EB","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:a521436a0cffdb0fd0df8361d43ad6622a4029ccfa5b3d8d6d23702cf915fc61","target":"graph","created_at":"2026-05-18T00:22:54Z","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":"This study considers the (soft) capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intensively studied in recent years. Given a dynamically changing vertex-weighted graph $G=(V,E)$, which allows edge insertions and edge deletions, the goal is to design a data structure that maintains an approximate minimum vertex cover while satisfying the capacity constraint of each vertex. That is, when picking a copy of a vertex $v$ in the cover, the number of $v$'s incident edges covered by the copy is up to a given ","authors_text":"Chung-Shou Liao, Hao-Ting Wei, Kunihiko Sadakane, Paul Horn, Wing-Kai Hon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T15:36:45Z","title":"An $O(1)$-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05623","kind":"arxiv","version":2},"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:f66d9dadc740395d03f855c3be23440f24847c703a21be28e126ada0b986bf69","target":"record","created_at":"2026-05-18T00:22:54Z","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":"65b554d3ad2102337a26f8143a077a5fe7ecf84b0bd51a2d007e481efc71ae5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T15:36:45Z","title_canon_sha256":"4a52516469355563692487eb0a3be5b81687721a4df2ad253d03369c0fda7490"},"schema_version":"1.0","source":{"id":"1802.05623","kind":"arxiv","version":2}},"canonical_sha256":"d5108174816aadd82007e1eec67181794f0d604d033d3ed0b1cb5cd58821092c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5108174816aadd82007e1eec67181794f0d604d033d3ed0b1cb5cd58821092c","first_computed_at":"2026-05-18T00:22:54.408205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:54.408205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3MVqaCmu8qM57dxnKPJPDyakouJJJaJkycpcI67szQTmQWu/uhxUrqH10ZxaAUHBsuso2C0eTu6YE3gWWDq+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:54.408744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05623","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f66d9dadc740395d03f855c3be23440f24847c703a21be28e126ada0b986bf69","sha256:a521436a0cffdb0fd0df8361d43ad6622a4029ccfa5b3d8d6d23702cf915fc61"],"state_sha256":"da85735e775e091b6561b703530d8f9d7b18320b3e58a154dd2a9a93804fda7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0IJNSZpdkAbEMVCeNhGVsTMrKkRjaZ2x8ODlGQ6uZzpERmfA4c/f1HkKhhGYTrDVN9sU7ovhlDB8aNYh7KRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:51:27.784430Z","bundle_sha256":"1e36b225a4a3a8840c80a4f07d2082c47f4a811bba8bf94d449fb0b50099229a"}}