{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PI46YP5CQVS64WIUHIXU5DYV34","short_pith_number":"pith:PI46YP5C","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"},"canonical_sha256":"7a39ec3fa28565ee59143a2f4e8f15df2f51196bbc85a29a55202c8482ceff0e","source":{"kind":"arxiv","id":"1409.6952","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6952","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6952v2","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6952","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"PI46YP5CQVS6","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PI46YP5CQVS64WIU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PI46YP5C","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PI46YP5CQVS64WIUHIXU5DYV34","target":"record","payload":{"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"},"canonical_sha256":"7a39ec3fa28565ee59143a2f4e8f15df2f51196bbc85a29a55202c8482ceff0e","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"},"source_kind":"arxiv","source_id":"1409.6952","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-18T02:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCd69LQuo90WzR9kbeG0fxxX/ualBs1pBZhXcKUIUlSXZkJzE2t0zk8YqvKFyqj/GXXbmpDjtF2OcLnlO/pOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:52:17.305906Z"},"content_sha256":"3278efc09e885658e562581a710585fe31ffde9a1f92a35ff298bf71747a8f8d","schema_version":"1.0","event_id":"sha256:3278efc09e885658e562581a710585fe31ffde9a1f92a35ff298bf71747a8f8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PI46YP5CQVS64WIUHIXU5DYV34","target":"graph","payload":{"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"},"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-18T02:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCErcBqcE8oKn5DrJqreqTQdTl35XYyC8eXuMsB5EAEp+5JjLIILPr9+9yvViJHh/A21BhOU1Q0ABMCJ84HYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:52:17.306520Z"},"content_sha256":"d3affc75024ea81afb2ecaaf0358df7e43a66619e0c052452f657b55af3a027b","schema_version":"1.0","event_id":"sha256:d3affc75024ea81afb2ecaaf0358df7e43a66619e0c052452f657b55af3a027b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34/bundle.json","state_url":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PI46YP5CQVS64WIUHIXU5DYV34/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-27T18:52:17Z","links":{"resolver":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34","bundle":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34/bundle.json","state":"https://pith.science/pith/PI46YP5CQVS64WIUHIXU5DYV34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PI46YP5CQVS64WIUHIXU5DYV34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PI46YP5CQVS64WIUHIXU5DYV34","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":"d230342a89659678912619b8fb74f5e7fa9921eb9d52d179f5a24974b12f5cd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-24T13:30:08Z","title_canon_sha256":"d2f0aa05f025064cc561925b5bcf4581de2b79f09be0848bedabfe502216dba5"},"schema_version":"1.0","source":{"id":"1409.6952","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6952","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6952v2","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6952","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"PI46YP5CQVS6","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PI46YP5CQVS64WIU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PI46YP5C","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:d3affc75024ea81afb2ecaaf0358df7e43a66619e0c052452f657b55af3a027b","target":"graph","created_at":"2026-05-18T02:19:36Z","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":"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.","authors_text":"Bruno Escoffier, Edouard Bonnet, Georgios Stamoulis, Vangelis Paschos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-24T13:30:08Z","title":"A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6952","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:3278efc09e885658e562581a710585fe31ffde9a1f92a35ff298bf71747a8f8d","target":"record","created_at":"2026-05-18T02:19:36Z","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":"d230342a89659678912619b8fb74f5e7fa9921eb9d52d179f5a24974b12f5cd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-24T13:30:08Z","title_canon_sha256":"d2f0aa05f025064cc561925b5bcf4581de2b79f09be0848bedabfe502216dba5"},"schema_version":"1.0","source":{"id":"1409.6952","kind":"arxiv","version":2}},"canonical_sha256":"7a39ec3fa28565ee59143a2f4e8f15df2f51196bbc85a29a55202c8482ceff0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a39ec3fa28565ee59143a2f4e8f15df2f51196bbc85a29a55202c8482ceff0e","first_computed_at":"2026-05-18T02:19:36.012103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:36.012103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BweameppMmS1cx7MThdvXs+6Om1GIqWDay9hEuhL4RpAPo5iQt4MBwak2YPeh3sYf4sestbDC+vZLVme28ERAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:36.012563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6952","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3278efc09e885658e562581a710585fe31ffde9a1f92a35ff298bf71747a8f8d","sha256:d3affc75024ea81afb2ecaaf0358df7e43a66619e0c052452f657b55af3a027b"],"state_sha256":"85c8321579899ba933a4b7648fdf0e873c36b282f6b3704a09782eb1a8b172ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqQMwVjjoR8Z+FNEvYF34JWdgU4Pfe1PXdNXmoiTtFJva9boZ1+Pd8178OOiuMYcZIZFqJX5I1u/r3xD4iIBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:52:17.309931Z","bundle_sha256":"97771961b2ec41c1f59d2a164db240097ac907cbf206f9cdb01365b7085a5c72"}}