{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SD66A4WRYW5Z2NDE4DDVF2NOWS","short_pith_number":"pith:SD66A4WR","canonical_record":{"source":{"id":"1902.07812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T23:39:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"53e150bcbdc599f5d4ca04b9fa8431b407e31f5a2e1729a20f1a8cd5267d0484","abstract_canon_sha256":"5cc189250067c33600b370d5a9ca67dc4aa1a500d674a44889a42970f3e988cc"},"schema_version":"1.0"},"canonical_sha256":"90fde072d1c5bb9d3464e0c752e9aeb4ac5f26c66d768543383813f12230c959","source":{"kind":"arxiv","id":"1902.07812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07812","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07812v1","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07812","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"SD66A4WRYW5Z","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SD66A4WRYW5Z2NDE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SD66A4WR","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SD66A4WRYW5Z2NDE4DDVF2NOWS","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T23:39:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"53e150bcbdc599f5d4ca04b9fa8431b407e31f5a2e1729a20f1a8cd5267d0484","abstract_canon_sha256":"5cc189250067c33600b370d5a9ca67dc4aa1a500d674a44889a42970f3e988cc"},"schema_version":"1.0"},"canonical_sha256":"90fde072d1c5bb9d3464e0c752e9aeb4ac5f26c66d768543383813f12230c959","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:03.822794Z","signature_b64":"VC3NKvk+mMps0eqLlC16OeRLCqBBn11xKZGNZ80641zjHep7oYsHNxm5GIXbgP/wgPhzlpQUP4+N+H5v3FMVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90fde072d1c5bb9d3464e0c752e9aeb4ac5f26c66d768543383813f12230c959","last_reissued_at":"2026-05-17T23:53:03.822123Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:03.822123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07812","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-17T23:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZZyuHWbxyLKgqKFDJl8MJGZ4/HxA+xkqFhfzfUiXGtVUxGRWrWEM0/ZInpKDVDsYfGfVVs7pEqhwc1BEs1nBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:33:27.767127Z"},"content_sha256":"de78c94e2bc9b09f9b30de6190e586ccb41851b728bed3c8fe5b425ef9511931","schema_version":"1.0","event_id":"sha256:de78c94e2bc9b09f9b30de6190e586ccb41851b728bed3c8fe5b425ef9511931"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SD66A4WRYW5Z2NDE4DDVF2NOWS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding big matchings in planar graphs quickly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Therese Biedl","submitted_at":"2019-02-20T23:39:40Z","abstract_excerpt":"It is well-known that every $n$-vertex planar graph with minimum degree 3 has a matching of size at least $\\frac{n}{3}$. But all proofs of this use the Tutte-Berge-formula for the size of a maximum matching. Hence these proofs are not directly algorithmic, and to find such a matching one must apply a general-purposes maximum matching algorithm, which has run-time $O(n^{1.5}\\alpha(n))$ for planar graphs. In contrast to this, this paper gives a linear-time algorithm that finds a matching of size at least $\\frac{n}{3}$ in any planar graph with minimum degree 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07812","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-17T23:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DyZmR+3P+yxqcZgc2ImSXbkBbRbgxcQv1lq11wNxGBYEhC7eC7xDIEvYz2ly8ZJ2Ui6ARwjNI+g7dlnycv+8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:33:27.767498Z"},"content_sha256":"2bcb7bdd3e49791cc3bb8b4c30eb5719b0f4b17290b9fa70b1c59fbf78679ffc","schema_version":"1.0","event_id":"sha256:2bcb7bdd3e49791cc3bb8b4c30eb5719b0f4b17290b9fa70b1c59fbf78679ffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/bundle.json","state_url":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/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-31T03:33:27Z","links":{"resolver":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS","bundle":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/bundle.json","state":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SD66A4WRYW5Z2NDE4DDVF2NOWS","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":"5cc189250067c33600b370d5a9ca67dc4aa1a500d674a44889a42970f3e988cc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T23:39:40Z","title_canon_sha256":"53e150bcbdc599f5d4ca04b9fa8431b407e31f5a2e1729a20f1a8cd5267d0484"},"schema_version":"1.0","source":{"id":"1902.07812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07812","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07812v1","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07812","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"SD66A4WRYW5Z","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SD66A4WRYW5Z2NDE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SD66A4WR","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:2bcb7bdd3e49791cc3bb8b4c30eb5719b0f4b17290b9fa70b1c59fbf78679ffc","target":"graph","created_at":"2026-05-17T23:53:03Z","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":"It is well-known that every $n$-vertex planar graph with minimum degree 3 has a matching of size at least $\\frac{n}{3}$. But all proofs of this use the Tutte-Berge-formula for the size of a maximum matching. Hence these proofs are not directly algorithmic, and to find such a matching one must apply a general-purposes maximum matching algorithm, which has run-time $O(n^{1.5}\\alpha(n))$ for planar graphs. In contrast to this, this paper gives a linear-time algorithm that finds a matching of size at least $\\frac{n}{3}$ in any planar graph with minimum degree 3.","authors_text":"Therese Biedl","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T23:39:40Z","title":"Finding big matchings in planar graphs quickly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07812","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:de78c94e2bc9b09f9b30de6190e586ccb41851b728bed3c8fe5b425ef9511931","target":"record","created_at":"2026-05-17T23:53:03Z","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":"5cc189250067c33600b370d5a9ca67dc4aa1a500d674a44889a42970f3e988cc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T23:39:40Z","title_canon_sha256":"53e150bcbdc599f5d4ca04b9fa8431b407e31f5a2e1729a20f1a8cd5267d0484"},"schema_version":"1.0","source":{"id":"1902.07812","kind":"arxiv","version":1}},"canonical_sha256":"90fde072d1c5bb9d3464e0c752e9aeb4ac5f26c66d768543383813f12230c959","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90fde072d1c5bb9d3464e0c752e9aeb4ac5f26c66d768543383813f12230c959","first_computed_at":"2026-05-17T23:53:03.822123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:03.822123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VC3NKvk+mMps0eqLlC16OeRLCqBBn11xKZGNZ80641zjHep7oYsHNxm5GIXbgP/wgPhzlpQUP4+N+H5v3FMVBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:03.822794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de78c94e2bc9b09f9b30de6190e586ccb41851b728bed3c8fe5b425ef9511931","sha256:2bcb7bdd3e49791cc3bb8b4c30eb5719b0f4b17290b9fa70b1c59fbf78679ffc"],"state_sha256":"5396b2378e4a77b8dcfe84a12aa88449277717ce91cc1df0c8090647b4268084"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6di4rgOdLzY5WjvMS8BlaGa6YmXlOUPXAhtz/Ox7x5l1Vg2llx8YJgwmgPkLb3m9DdyP5ynIegAm6h+mKL0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:33:27.769687Z","bundle_sha256":"37bdbcd0ba94d42347911ec3a00b590259b654ec8ca3d06bbed94c948a47807b"}}