{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EHOHGHYHVV44VUHNFTDBIAWMVG","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":"d724848c576216e9ce5a856ce32ce196803f2c3bcfce4545ac844cd74ae3e30c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-19T14:27:00Z","title_canon_sha256":"bdcc140ea4136f5f33eee472dafc8ede039f1aeb5afaf7d8513b13d3b1768bc5"},"schema_version":"1.0","source":{"id":"1203.4117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4117","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4117v1","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4117","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"EHOHGHYHVV44","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EHOHGHYHVV44VUHN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EHOHGHYH","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:33789bb51efb511fdc7765f789c74aea07dcdd76dd10bb0b5119145cd6ca029f","target":"graph","created_at":"2026-05-18T03:59:48Z","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":"We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random graphs with constant expected degree c>0, independent of the value of c. This is contrary to the behavior of commonly used greedy matching heuristics which are known to have some range of c where they probably fail to compute a maximum matching.","authors_text":"Hendrik Peilke, Martin Dietzfelbinger, Michael Rink","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-19T14:27:00Z","title":"A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4117","kind":"arxiv","version":1},"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:79830dbf2845bfd6f39fc61c190b98ac1993fa9eaca10ae98fbd71a5c639bf00","target":"record","created_at":"2026-05-18T03:59:48Z","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":"d724848c576216e9ce5a856ce32ce196803f2c3bcfce4545ac844cd74ae3e30c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-19T14:27:00Z","title_canon_sha256":"bdcc140ea4136f5f33eee472dafc8ede039f1aeb5afaf7d8513b13d3b1768bc5"},"schema_version":"1.0","source":{"id":"1203.4117","kind":"arxiv","version":1}},"canonical_sha256":"21dc731f07ad79cad0ed2cc61402cca9979d9c2377b5090bec35878722906df5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21dc731f07ad79cad0ed2cc61402cca9979d9c2377b5090bec35878722906df5","first_computed_at":"2026-05-18T03:59:48.268473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:48.268473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6NiaQMIvAmQUUre/mfduvFWlPm4/5rZmFe8HQnOOyT9Wtkap5fnp0kX81Y1dfd0JGUbFL5BFJCB4bhb10qC8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:48.268853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79830dbf2845bfd6f39fc61c190b98ac1993fa9eaca10ae98fbd71a5c639bf00","sha256:33789bb51efb511fdc7765f789c74aea07dcdd76dd10bb0b5119145cd6ca029f"],"state_sha256":"5b6d12ae851928a941c4aee5ab09a4c99994963094a681bc12884b9e5e56eb2d"}