{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PI46YP5CQVS64WIUHIXU5DYV34","short_pith_number":"pith:PI46YP5C","schema_version":"1.0","canonical_sha256":"7a39ec3fa28565ee59143a2f4e8f15df2f51196bbc85a29a55202c8482ceff0e","source":{"kind":"arxiv","id":"1409.6952","version":2},"attestation_state":"computed","paper":{"title":"A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bruno Escoffier, Edouard Bonnet, Georgios Stamoulis, Vangelis Paschos","submitted_at":"2014-09-24T13:30:08Z","abstract_excerpt":"Our goal in this paper is to propose a \\textit{combinatorial algorithm} that beats the only such algorithm known previously, the greedy one. We study the polynomial approximation of the Maximum Vertex Cover Problem in bipartite graphs by a purely combinatorial algorithm and present a computer assisted analysis of it, that finds the worst case approximation guarantee that is bounded below by~0.821."},"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":"1409.6952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-24T13:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"d2f0aa05f025064cc561925b5bcf4581de2b79f09be0848bedabfe502216dba5","abstract_canon_sha256":"d230342a89659678912619b8fb74f5e7fa9921eb9d52d179f5a24974b12f5cd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:36.012563Z","signature_b64":"BweameppMmS1cx7MThdvXs+6Om1GIqWDay9hEuhL4RpAPo5iQt4MBwak2YPeh3sYf4sestbDC+vZLVme28ERAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a39ec3fa28565ee59143a2f4e8f15df2f51196bbc85a29a55202c8482ceff0e","last_reissued_at":"2026-05-18T02:19:36.012103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:36.012103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bruno Escoffier, Edouard Bonnet, Georgios Stamoulis, Vangelis Paschos","submitted_at":"2014-09-24T13:30:08Z","abstract_excerpt":"Our goal in this paper is to propose a \\textit{combinatorial algorithm} that beats the only such algorithm known previously, the greedy one. We study the polynomial approximation of the Maximum Vertex Cover Problem in bipartite graphs by a purely combinatorial algorithm and present a computer assisted analysis of it, that finds the worst case approximation guarantee that is bounded below by~0.821."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6952","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.6952","created_at":"2026-05-18T02:19:36.012165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6952v2","created_at":"2026-05-18T02:19:36.012165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6952","created_at":"2026-05-18T02:19:36.012165+00:00"},{"alias_kind":"pith_short_12","alias_value":"PI46YP5CQVS6","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PI46YP5CQVS64WIU","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PI46YP5C","created_at":"2026-05-18T12:28:43.426989+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/PI46YP5CQVS64WIUHIXU5DYV34","json":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34.json","graph_json":"https://pith.science/api/pith-number/PI46YP5CQVS64WIUHIXU5DYV34/graph.json","events_json":"https://pith.science/api/pith-number/PI46YP5CQVS64WIUHIXU5DYV34/events.json","paper":"https://pith.science/paper/PI46YP5C"},"agent_actions":{"view_html":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34","download_json":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34.json","view_paper":"https://pith.science/paper/PI46YP5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6952&json=true","fetch_graph":"https://pith.science/api/pith-number/PI46YP5CQVS64WIUHIXU5DYV34/graph.json","fetch_events":"https://pith.science/api/pith-number/PI46YP5CQVS64WIUHIXU5DYV34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34/action/storage_attestation","attest_author":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34/action/author_attestation","sign_citation":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34/action/citation_signature","submit_replication":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34/action/replication_record"}},"created_at":"2026-05-18T02:19:36.012165+00:00","updated_at":"2026-05-18T02:19:36.012165+00:00"}