{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZC6R7GEFX7Q5MBRHMNGJJFDMLM","short_pith_number":"pith:ZC6R7GEF","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"},"canonical_sha256":"c8bd1f9885bfe1d60627634c94946c5b06edeb1c9b21a58be46f3408b15a397a","source":{"kind":"arxiv","id":"1504.05830","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05830","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05830v2","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05830","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZC6R7GEFX7Q5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZC6R7GEFX7Q5MBRH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZC6R7GEF","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZC6R7GEFX7Q5MBRHMNGJJFDMLM","target":"record","payload":{"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"},"canonical_sha256":"c8bd1f9885bfe1d60627634c94946c5b06edeb1c9b21a58be46f3408b15a397a","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"},"source_kind":"arxiv","source_id":"1504.05830","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-18T00:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kucguuXdYL83eabwWWLkWkSGwLXILG7fNRv7fXNzxC6BIAZHpHxsqhO0Zm7Kwcs1dsOEN25CT24b27Q6oFv+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:15:40.387761Z"},"content_sha256":"0b34f6f5b09a7ce7dbe2453e7299062f866bb5284726d656144fb9c7a23f38bc","schema_version":"1.0","event_id":"sha256:0b34f6f5b09a7ce7dbe2453e7299062f866bb5284726d656144fb9c7a23f38bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZC6R7GEFX7Q5MBRHMNGJJFDMLM","target":"graph","payload":{"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"},"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-18T00:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9J+Xv9/10uBVizCPv50D0grlrg39sz8xheH//SQcb0bINssJinBE/tErLAWAlK1KY3zleU7+/DfhpQ+IEZWGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:15:40.388410Z"},"content_sha256":"0332f4be931e58ff40bd0d964c5187c1eaced5b5f143c3ebb8b7210d867c2efa","schema_version":"1.0","event_id":"sha256:0332f4be931e58ff40bd0d964c5187c1eaced5b5f143c3ebb8b7210d867c2efa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/bundle.json","state_url":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/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-06-04T02:15:40Z","links":{"resolver":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM","bundle":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/bundle.json","state":"https://pith.science/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZC6R7GEFX7Q5MBRHMNGJJFDMLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZC6R7GEFX7Q5MBRHMNGJJFDMLM","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":"a0d246cc2aa5ce568e2774890813c9b4298d23d30c8df3f6f926fc45b6367a78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-22T14:45:32Z","title_canon_sha256":"0f954bdcf83ddb99c8ca101b2f73334a146004fae13baa41bb37a001a45efe19"},"schema_version":"1.0","source":{"id":"1504.05830","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05830","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05830v2","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05830","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZC6R7GEFX7Q5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZC6R7GEFX7Q5MBRH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZC6R7GEF","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:0332f4be931e58ff40bd0d964c5187c1eaced5b5f143c3ebb8b7210d867c2efa","target":"graph","created_at":"2026-05-18T00:54:41Z","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":"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","authors_text":"Bastian Werth, Bert Besser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-22T14:45:32Z","title":"On the Approximation Performance of Degree Heuristics for Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05830","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:0b34f6f5b09a7ce7dbe2453e7299062f866bb5284726d656144fb9c7a23f38bc","target":"record","created_at":"2026-05-18T00:54:41Z","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":"a0d246cc2aa5ce568e2774890813c9b4298d23d30c8df3f6f926fc45b6367a78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-22T14:45:32Z","title_canon_sha256":"0f954bdcf83ddb99c8ca101b2f73334a146004fae13baa41bb37a001a45efe19"},"schema_version":"1.0","source":{"id":"1504.05830","kind":"arxiv","version":2}},"canonical_sha256":"c8bd1f9885bfe1d60627634c94946c5b06edeb1c9b21a58be46f3408b15a397a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8bd1f9885bfe1d60627634c94946c5b06edeb1c9b21a58be46f3408b15a397a","first_computed_at":"2026-05-18T00:54:41.656378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:41.656378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aoSFjSOIwQUpQ/E0xZqijor4Zutbud/uuz67dBQ/r5+RwXmd/Lej5Q+xERG3/b/70BimQ4eQT/gu3OAG9sz+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:41.656763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05830","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b34f6f5b09a7ce7dbe2453e7299062f866bb5284726d656144fb9c7a23f38bc","sha256:0332f4be931e58ff40bd0d964c5187c1eaced5b5f143c3ebb8b7210d867c2efa"],"state_sha256":"61675eebc5d84356aeac41212513af572df349ca624d936d8e2838eedf925893"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqSJkfYvBOXsGxP/8XCJsIvrfrjeMHqX6YIfaErhKvO8J+xMZf3WpYH0/s+aVRtVeVmk6/7VRtPCvDSaozAWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:15:40.391866Z","bundle_sha256":"1f3b2c9e8bfa612992edd5f54275fd36cac86b4435121c46135e0f7eca6d4b90"}}