{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AAD4PIBJGPFHM2K6D3CH3GMSBW","short_pith_number":"pith:AAD4PIBJ","schema_version":"1.0","canonical_sha256":"0007c7a02933ca76695e1ec47d99920da696a0bdc8d97cd1a87d5a51191647a0","source":{"kind":"arxiv","id":"2606.22831","version":1},"attestation_state":"computed","paper":{"title":"Learning-Augmented Algorithms for Online Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CC","authors_text":"Runtian Ren, Shengcai Liu, Tianhang Lu","submitted_at":"2026-06-22T04:14:12Z","abstract_excerpt":"This paper studies learning-augmented online weighted vertex cover with advice and a parameter $\\lambda \\in (0,1)$. We consider two graph cases: bipartite graphs and general graphs. In both settings, the online algorithm must maintain a feasible vertex cover under irrevocable decisions. We show that these problems admit the same robustness--consistency tradeoffs as learning-augmented ski rental. For the bipartite graph model, we give a randomized algorithm that is $\\frac{1}{1-e^{-\\lambda}}$-robust and $\\frac{\\lambda}{1-e^{-\\lambda}}$-consistent. For the general graph model, we give a determini"},"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":"2606.22831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-22T04:14:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7c84d491b900546ecca6c2978b0af1d1c1fc47f960c1cafa061078640a64fdd3","abstract_canon_sha256":"a897ccd9d2a4eb05e10cfb65562807a11a1720bedd047aaed6faf2b08701f937"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:14:00.636018Z","signature_b64":"MD12K89BH1HDi282B9idCwm9yx0owdU9jO6Y7TSdNfTn98dSlo/yXdKd2cYL9uE88Dyp3E4OPdLvf0t4Sm6wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0007c7a02933ca76695e1ec47d99920da696a0bdc8d97cd1a87d5a51191647a0","last_reissued_at":"2026-06-23T02:14:00.635626Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:14:00.635626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning-Augmented Algorithms for Online Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CC","authors_text":"Runtian Ren, Shengcai Liu, Tianhang Lu","submitted_at":"2026-06-22T04:14:12Z","abstract_excerpt":"This paper studies learning-augmented online weighted vertex cover with advice and a parameter $\\lambda \\in (0,1)$. We consider two graph cases: bipartite graphs and general graphs. In both settings, the online algorithm must maintain a feasible vertex cover under irrevocable decisions. We show that these problems admit the same robustness--consistency tradeoffs as learning-augmented ski rental. For the bipartite graph model, we give a randomized algorithm that is $\\frac{1}{1-e^{-\\lambda}}$-robust and $\\frac{\\lambda}{1-e^{-\\lambda}}$-consistent. For the general graph model, we give a determini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22831","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22831/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.22831","created_at":"2026-06-23T02:14:00.635684+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22831v1","created_at":"2026-06-23T02:14:00.635684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22831","created_at":"2026-06-23T02:14:00.635684+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAD4PIBJGPFH","created_at":"2026-06-23T02:14:00.635684+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAD4PIBJGPFHM2K6","created_at":"2026-06-23T02:14:00.635684+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAD4PIBJ","created_at":"2026-06-23T02:14:00.635684+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/AAD4PIBJGPFHM2K6D3CH3GMSBW","json":"https://pith.science/pith/AAD4PIBJGPFHM2K6D3CH3GMSBW.json","graph_json":"https://pith.science/api/pith-number/AAD4PIBJGPFHM2K6D3CH3GMSBW/graph.json","events_json":"https://pith.science/api/pith-number/AAD4PIBJGPFHM2K6D3CH3GMSBW/events.json","paper":"https://pith.science/paper/AAD4PIBJ"},"agent_actions":{"view_html":"https://pith.science/pith/AAD4PIBJGPFHM2K6D3CH3GMSBW","download_json":"https://pith.science/pith/AAD4PIBJGPFHM2K6D3CH3GMSBW.json","view_paper":"https://pith.science/paper/AAD4PIBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22831&json=true","fetch_graph":"https://pith.science/api/pith-number/AAD4PIBJGPFHM2K6D3CH3GMSBW/graph.json","fetch_events":"https://pith.science/api/pith-number/AAD4PIBJGPFHM2K6D3CH3GMSBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAD4PIBJGPFHM2K6D3CH3GMSBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAD4PIBJGPFHM2K6D3CH3GMSBW/action/storage_attestation","attest_author":"https://pith.science/pith/AAD4PIBJGPFHM2K6D3CH3GMSBW/action/author_attestation","sign_citation":"https://pith.science/pith/AAD4PIBJGPFHM2K6D3CH3GMSBW/action/citation_signature","submit_replication":"https://pith.science/pith/AAD4PIBJGPFHM2K6D3CH3GMSBW/action/replication_record"}},"created_at":"2026-06-23T02:14:00.635684+00:00","updated_at":"2026-06-23T02:14:00.635684+00:00"}