{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZC6R7GEFX7Q5MBRHMNGJJFDMLM","short_pith_number":"pith:ZC6R7GEF","schema_version":"1.0","canonical_sha256":"c8bd1f9885bfe1d60627634c94946c5b06edeb1c9b21a58be46f3408b15a397a","source":{"kind":"arxiv","id":"1504.05830","version":2},"attestation_state":"computed","paper":{"title":"On the Approximation Performance of Degree Heuristics for Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bastian Werth, Bert Besser","submitted_at":"2015-04-22T14:45:32Z","abstract_excerpt":"In the design of greedy algorithms for the maximum cardinality matching problem the utilization of degree information when selecting the next edge is a well established and successful approach.\n  We define the class of \"degree sensitive\" greedy matching algorithms, which allows us to analyze many well-known heuristics, and provide tight approximation guarantees under worst case tie breaking. We exhibit algorithms in this class with optimal approximation guarantee for bipartite graphs. In particular the Karp-Sipser algorithm, which picks an edge incident with a degree-1 node if possible and oth"},"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":"1504.05830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-22T14:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"0f954bdcf83ddb99c8ca101b2f73334a146004fae13baa41bb37a001a45efe19","abstract_canon_sha256":"a0d246cc2aa5ce568e2774890813c9b4298d23d30c8df3f6f926fc45b6367a78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:41.656763Z","signature_b64":"aoSFjSOIwQUpQ/E0xZqijor4Zutbud/uuz67dBQ/r5+RwXmd/Lej5Q+xERG3/b/70BimQ4eQT/gu3OAG9sz+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8bd1f9885bfe1d60627634c94946c5b06edeb1c9b21a58be46f3408b15a397a","last_reissued_at":"2026-05-18T00:54:41.656378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:41.656378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Approximation Performance of Degree Heuristics for Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bastian Werth, Bert Besser","submitted_at":"2015-04-22T14:45:32Z","abstract_excerpt":"In the design of greedy algorithms for the maximum cardinality matching problem the utilization of degree information when selecting the next edge is a well established and successful approach.\n  We define the class of \"degree sensitive\" greedy matching algorithms, which allows us to analyze many well-known heuristics, and provide tight approximation guarantees under worst case tie breaking. We exhibit algorithms in this class with optimal approximation guarantee for bipartite graphs. In particular the Karp-Sipser algorithm, which picks an edge incident with a degree-1 node if possible and oth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05830","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":"1504.05830","created_at":"2026-05-18T00:54:41.656440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05830v2","created_at":"2026-05-18T00:54:41.656440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05830","created_at":"2026-05-18T00:54:41.656440+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZC6R7GEFX7Q5","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZC6R7GEFX7Q5MBRH","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZC6R7GEF","created_at":"2026-05-18T12:29:52.810259+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/ZC6R7GEFX7Q5MBRHMNGJJFDMLM","json":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM.json","graph_json":"https://pith.science/api/pith-number/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/graph.json","events_json":"https://pith.science/api/pith-number/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/events.json","paper":"https://pith.science/paper/ZC6R7GEF"},"agent_actions":{"view_html":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM","download_json":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM.json","view_paper":"https://pith.science/paper/ZC6R7GEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05830&json=true","fetch_graph":"https://pith.science/api/pith-number/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/action/storage_attestation","attest_author":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/action/author_attestation","sign_citation":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/action/citation_signature","submit_replication":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/action/replication_record"}},"created_at":"2026-05-18T00:54:41.656440+00:00","updated_at":"2026-05-18T00:54:41.656440+00:00"}