{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2UURDK6DKFQAXQVVQ2SNIDQCHB","short_pith_number":"pith:2UURDK6D","schema_version":"1.0","canonical_sha256":"d52911abc351600bc2b586a4d40e02387c5aec4b97d6f0a22e0a05712a47a1af","source":{"kind":"arxiv","id":"1305.1694","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.1694","created_at":"2026-05-18T03:26:11.519088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1694v1","created_at":"2026-05-18T03:26:11.519088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1694","created_at":"2026-05-18T03:26:11.519088+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UURDK6DKFQA","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UURDK6DKFQAXQVV","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UURDK6D","created_at":"2026-05-18T12:27:32.513160+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/2UURDK6DKFQAXQVVQ2SNIDQCHB","json":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB.json","graph_json":"https://pith.science/api/pith-number/2UURDK6DKFQAXQVVQ2SNIDQCHB/graph.json","events_json":"https://pith.science/api/pith-number/2UURDK6DKFQAXQVVQ2SNIDQCHB/events.json","paper":"https://pith.science/paper/2UURDK6D"},"agent_actions":{"view_html":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB","download_json":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB.json","view_paper":"https://pith.science/paper/2UURDK6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1694&json=true","fetch_graph":"https://pith.science/api/pith-number/2UURDK6DKFQAXQVVQ2SNIDQCHB/graph.json","fetch_events":"https://pith.science/api/pith-number/2UURDK6DKFQAXQVVQ2SNIDQCHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/action/storage_attestation","attest_author":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/action/author_attestation","sign_citation":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/action/citation_signature","submit_replication":"https://pith.science/pith/2UURDK6DKFQAXQVVQ2SNIDQCHB/action/replication_record"}},"created_at":"2026-05-18T03:26:11.519088+00:00","updated_at":"2026-05-18T03:26:11.519088+00:00"}