{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UGX7XIKYJFK4URKQFKOBSMDAS2","short_pith_number":"pith:UGX7XIKY","canonical_record":{"source":{"id":"1505.04198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-15T20:26:21Z","cross_cats_sorted":[],"title_canon_sha256":"4de15732d313731d703c4aed5e0d3b4b5bc21e986bf83fff7fbefb5159af3f4c","abstract_canon_sha256":"4c316835c6f3da444057cde460a204777b00b33dd9342bda901cc79d314ec770"},"schema_version":"1.0"},"canonical_sha256":"a1affba1584955ca45502a9c19306096a6bea5203895dd1d5ca3155a71057b6a","source":{"kind":"arxiv","id":"1505.04198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04198","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04198v1","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04198","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"UGX7XIKYJFK4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UGX7XIKYJFK4URKQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UGX7XIKY","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UGX7XIKYJFK4URKQFKOBSMDAS2","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-15T20:26:21Z","cross_cats_sorted":[],"title_canon_sha256":"4de15732d313731d703c4aed5e0d3b4b5bc21e986bf83fff7fbefb5159af3f4c","abstract_canon_sha256":"4c316835c6f3da444057cde460a204777b00b33dd9342bda901cc79d314ec770"},"schema_version":"1.0"},"canonical_sha256":"a1affba1584955ca45502a9c19306096a6bea5203895dd1d5ca3155a71057b6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:26.074744Z","signature_b64":"CFwqanLZ+TeumTsBg6jz7piZnxjbKGC4bgIk+rywLahLWzW/vH8XUlbqcTKAaxU0Ud4nXIjEIi2b3za7EluzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1affba1584955ca45502a9c19306096a6bea5203895dd1d5ca3155a71057b6a","last_reissued_at":"2026-05-18T02:07:26.074273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:26.074273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04198","source_version":1,"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:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKEkfbgfc/NZtrA9vZJRvJWH9+7G9THnB8Eamql3kG7DdfTvX9OeqwnKc7UjFNWLpkrnyaS1+1bHFp31FAU7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:03:03.934696Z"},"content_sha256":"222c295acba725a0e0abc1ebee9b96bb4fa9fc99d72d35ef139000e2a20dd41f","schema_version":"1.0","event_id":"sha256:222c295acba725a0e0abc1ebee9b96bb4fa9fc99d72d35ef139000e2a20dd41f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UGX7XIKYJFK4URKQFKOBSMDAS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Matching: Guarantees and Limitations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bert Besser, Matthias Poloczek","submitted_at":"2015-05-15T20:26:21Z","abstract_excerpt":"Since Tinhofer proposed the MinGreedy algorithm for maximum cardinality matching in 1984, several experimental studies found the randomized algorithm to perform excellently for various classes of random graphs and benchmark instances. In contrast, only few analytical results are known. We show that MinGreedy cannot improve on the trivial approximation ratio 1/2 whp., even for bipartite graphs. Our hard inputs seem to require a small number of high-degree nodes.\n  This motivates an investigation of greedy algorithms on graphs with maximum degree D: We show that MinGreedy achieves a (D-1)/(2D-3)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04198","kind":"arxiv","version":1},"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:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHmhBsScZjtlBLdvA+9524vyFVCe1GtlP3mmHhts8y56SB0fZmEDl5iD4jZ8kzS8cwe2Ue77KMPPylFW+H3DBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:03:03.935036Z"},"content_sha256":"6a1d0220a9daf77eabe4c75ef5b282b9b8cd37973c700444c6eea4f62841ac43","schema_version":"1.0","event_id":"sha256:6a1d0220a9daf77eabe4c75ef5b282b9b8cd37973c700444c6eea4f62841ac43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGX7XIKYJFK4URKQFKOBSMDAS2/bundle.json","state_url":"https://pith.science/pith/UGX7XIKYJFK4URKQFKOBSMDAS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGX7XIKYJFK4URKQFKOBSMDAS2/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-03T21:03:03Z","links":{"resolver":"https://pith.science/pith/UGX7XIKYJFK4URKQFKOBSMDAS2","bundle":"https://pith.science/pith/UGX7XIKYJFK4URKQFKOBSMDAS2/bundle.json","state":"https://pith.science/pith/UGX7XIKYJFK4URKQFKOBSMDAS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGX7XIKYJFK4URKQFKOBSMDAS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UGX7XIKYJFK4URKQFKOBSMDAS2","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":"4c316835c6f3da444057cde460a204777b00b33dd9342bda901cc79d314ec770","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-15T20:26:21Z","title_canon_sha256":"4de15732d313731d703c4aed5e0d3b4b5bc21e986bf83fff7fbefb5159af3f4c"},"schema_version":"1.0","source":{"id":"1505.04198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04198","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04198v1","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04198","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"UGX7XIKYJFK4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UGX7XIKYJFK4URKQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UGX7XIKY","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:6a1d0220a9daf77eabe4c75ef5b282b9b8cd37973c700444c6eea4f62841ac43","target":"graph","created_at":"2026-05-18T02:07:26Z","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":"Since Tinhofer proposed the MinGreedy algorithm for maximum cardinality matching in 1984, several experimental studies found the randomized algorithm to perform excellently for various classes of random graphs and benchmark instances. In contrast, only few analytical results are known. We show that MinGreedy cannot improve on the trivial approximation ratio 1/2 whp., even for bipartite graphs. Our hard inputs seem to require a small number of high-degree nodes.\n  This motivates an investigation of greedy algorithms on graphs with maximum degree D: We show that MinGreedy achieves a (D-1)/(2D-3)","authors_text":"Bert Besser, Matthias Poloczek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-15T20:26:21Z","title":"Greedy Matching: Guarantees and Limitations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04198","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:222c295acba725a0e0abc1ebee9b96bb4fa9fc99d72d35ef139000e2a20dd41f","target":"record","created_at":"2026-05-18T02:07:26Z","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":"4c316835c6f3da444057cde460a204777b00b33dd9342bda901cc79d314ec770","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-15T20:26:21Z","title_canon_sha256":"4de15732d313731d703c4aed5e0d3b4b5bc21e986bf83fff7fbefb5159af3f4c"},"schema_version":"1.0","source":{"id":"1505.04198","kind":"arxiv","version":1}},"canonical_sha256":"a1affba1584955ca45502a9c19306096a6bea5203895dd1d5ca3155a71057b6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1affba1584955ca45502a9c19306096a6bea5203895dd1d5ca3155a71057b6a","first_computed_at":"2026-05-18T02:07:26.074273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:26.074273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CFwqanLZ+TeumTsBg6jz7piZnxjbKGC4bgIk+rywLahLWzW/vH8XUlbqcTKAaxU0Ud4nXIjEIi2b3za7EluzAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:26.074744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:222c295acba725a0e0abc1ebee9b96bb4fa9fc99d72d35ef139000e2a20dd41f","sha256:6a1d0220a9daf77eabe4c75ef5b282b9b8cd37973c700444c6eea4f62841ac43"],"state_sha256":"68e3078b22035ea103830b1fd84c80597e282f7e05079e16291aa4896cdb59eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOtWK0bOvmuRpT9UXyk21Bb9pmU9RqJKDAuPJz1KBsKtqst5QRrDFQ+xm/4hUXbb9GBEWcztk9MvkxAqPB5XBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:03:03.936918Z","bundle_sha256":"d7e649c7d056f8753ecaf08ca19043561fb84d3ec3a1afca3ac7847711eee044"}}