{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2UURDK6DKFQAXQVVQ2SNIDQCHB","short_pith_number":"pith:2UURDK6D","canonical_record":{"source":{"id":"1305.1694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-08T02:18:28Z","cross_cats_sorted":[],"title_canon_sha256":"3d4a0e8cf3ccf381ac5fe76f86d891f02fc6c07530e1bd260c21d11e5d01967e","abstract_canon_sha256":"2970f7e8ae1cd9117b9b28459fd8c2c4448ecc2602e8b7d2d2aec95cebdfffeb"},"schema_version":"1.0"},"canonical_sha256":"d52911abc351600bc2b586a4d40e02387c5aec4b97d6f0a22e0a05712a47a1af","source":{"kind":"arxiv","id":"1305.1694","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1694","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1694v1","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1694","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"2UURDK6DKFQA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2UURDK6DKFQAXQVV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2UURDK6D","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2UURDK6DKFQAXQVVQ2SNIDQCHB","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-08T02:18:28Z","cross_cats_sorted":[],"title_canon_sha256":"3d4a0e8cf3ccf381ac5fe76f86d891f02fc6c07530e1bd260c21d11e5d01967e","abstract_canon_sha256":"2970f7e8ae1cd9117b9b28459fd8c2c4448ecc2602e8b7d2d2aec95cebdfffeb"},"schema_version":"1.0"},"canonical_sha256":"d52911abc351600bc2b586a4d40e02387c5aec4b97d6f0a22e0a05712a47a1af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:11.519668Z","signature_b64":"ONxXP2Ox2r/kUlFYoUkuzLblzc9AJsVBJLVlJtp8yvQR9mi57M11zbDCZ2xrc7C2g9CbVYSbtW3aiEfpd8FqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d52911abc351600bc2b586a4d40e02387c5aec4b97d6f0a22e0a05712a47a1af","last_reissued_at":"2026-05-18T03:26:11.518984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:11.518984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1694","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-18T03:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiYCj9uEuoEV4fQRylRmbeHsqGMjHIHS7Exg4t7V7dA+pa3lxDuSCNGWfTR3AgJIMOzzCmwsCclmbgL4ilYODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:06:22.663841Z"},"content_sha256":"89cbfbfbb6cfd96b8499192d5a817f84c7042ce10a7ac71d15593099ba0862ad","schema_version":"1.0","event_id":"sha256:89cbfbfbb6cfd96b8499192d5a817f84c7042ce10a7ac71d15593099ba0862ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2UURDK6DKFQAXQVVQ2SNIDQCHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Vertex Cover and Matching: Beating the Greedy Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sam Chiu-wai Wong, Yajun Wang","submitted_at":"2013-05-08T02:18:28Z","abstract_excerpt":"In this paper, we explicitly study the online vertex cover problem, which is a natural generalization of the well-studied ski-rental problem. In the online vertex cover problem, we are required to maintain a monotone vertex cover in a graph whose vertices arrive online. When a vertex arrives, all its incident edges to previously arrived vertices are revealed to the algorithm. For bipartite graphs with the left vertices offline (i.e. all of the left vertices arrive first before any right vertex), there are algorithms achieving the optimal competitive ratio of $\\frac{1}{1-1/e}\\approx 1.582$.\n  O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1694","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-18T03:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1PaZelLRZSIBJsAnaucnAJyNFyKA5E/SOoFJQnT1Z2ykQmwSrgVHZO3xUYqOx/bqLfXmD7RtP//UK5Iq+8EDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:06:22.664573Z"},"content_sha256":"f1593ba3ba89cc8fe6a9c10f2f096af3320e7c3414a557fca5de3e077a91d45f","schema_version":"1.0","event_id":"sha256:f1593ba3ba89cc8fe6a9c10f2f096af3320e7c3414a557fca5de3e077a91d45f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/bundle.json","state_url":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/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-05-26T23:06:22Z","links":{"resolver":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB","bundle":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/bundle.json","state":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2UURDK6DKFQAXQVVQ2SNIDQCHB","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":"2970f7e8ae1cd9117b9b28459fd8c2c4448ecc2602e8b7d2d2aec95cebdfffeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-08T02:18:28Z","title_canon_sha256":"3d4a0e8cf3ccf381ac5fe76f86d891f02fc6c07530e1bd260c21d11e5d01967e"},"schema_version":"1.0","source":{"id":"1305.1694","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1694","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1694v1","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1694","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"2UURDK6DKFQA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2UURDK6DKFQAXQVV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2UURDK6D","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:f1593ba3ba89cc8fe6a9c10f2f096af3320e7c3414a557fca5de3e077a91d45f","target":"graph","created_at":"2026-05-18T03:26:11Z","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 explicitly study the online vertex cover problem, which is a natural generalization of the well-studied ski-rental problem. In the online vertex cover problem, we are required to maintain a monotone vertex cover in a graph whose vertices arrive online. When a vertex arrives, all its incident edges to previously arrived vertices are revealed to the algorithm. For bipartite graphs with the left vertices offline (i.e. all of the left vertices arrive first before any right vertex), there are algorithms achieving the optimal competitive ratio of $\\frac{1}{1-1/e}\\approx 1.582$.\n  O","authors_text":"Sam Chiu-wai Wong, Yajun Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-08T02:18:28Z","title":"Online Vertex Cover and Matching: Beating the Greedy Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1694","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:89cbfbfbb6cfd96b8499192d5a817f84c7042ce10a7ac71d15593099ba0862ad","target":"record","created_at":"2026-05-18T03:26:11Z","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":"2970f7e8ae1cd9117b9b28459fd8c2c4448ecc2602e8b7d2d2aec95cebdfffeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-08T02:18:28Z","title_canon_sha256":"3d4a0e8cf3ccf381ac5fe76f86d891f02fc6c07530e1bd260c21d11e5d01967e"},"schema_version":"1.0","source":{"id":"1305.1694","kind":"arxiv","version":1}},"canonical_sha256":"d52911abc351600bc2b586a4d40e02387c5aec4b97d6f0a22e0a05712a47a1af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d52911abc351600bc2b586a4d40e02387c5aec4b97d6f0a22e0a05712a47a1af","first_computed_at":"2026-05-18T03:26:11.518984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:11.518984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ONxXP2Ox2r/kUlFYoUkuzLblzc9AJsVBJLVlJtp8yvQR9mi57M11zbDCZ2xrc7C2g9CbVYSbtW3aiEfpd8FqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:11.519668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1694","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89cbfbfbb6cfd96b8499192d5a817f84c7042ce10a7ac71d15593099ba0862ad","sha256:f1593ba3ba89cc8fe6a9c10f2f096af3320e7c3414a557fca5de3e077a91d45f"],"state_sha256":"61471fe98178a4a4b558af8e691195a948c5e667e76d1805904159448cacada2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgaIliFrjK0z7JXR+yz3oq5k3ycRX9Lzbmv1UcxYRgeAwZEFSaHuUZ22dTNcLT3qf+44sxvSsbl+VtbGUpcGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:06:22.668454Z","bundle_sha256":"da3d6338a7d89b5969e23d8d59d8a001c04cb51a49c6f3752fc2a312811117e9"}}