{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SPYYLHAITSIPSO3YGCQTQKGMN3","short_pith_number":"pith:SPYYLHAI","schema_version":"1.0","canonical_sha256":"93f1859c089c90f93b7830a13828cc6ed4d6119dd327c5b2f72c9695b4dd72b3","source":{"kind":"arxiv","id":"2606.22253","version":1},"attestation_state":"computed","paper":{"title":"On the number of perfect matchings in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carol T. Zamfirescu, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede","submitted_at":"2026-06-20T22:35:00Z","abstract_excerpt":"We investigate the minimum non-zero number of perfect matchings in planar graphs. We prove that this is a constant for 2-connected planar graphs of minimum degree 3 and 3-connected planar graphs. In the former case, the constant is 4 and this is best possible. In the 3-connected case, we give several infinite families, including nearly 3-regular graphs and triangulations with a constant number of perfect matchings. In contrast, it was known that in the 4-connected case the minimum non-zero number of perfect matchings is at least linear. For 5-connected triangulations, it follows from a result "},"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":"2606.22253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T22:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"dd0b13f66baa4d57f79965a133815795873d680af8f2e8272281dcdbccd4bb1a","abstract_canon_sha256":"4459bca8ddea2daf72b05a0fb2a722f5d520da2af48b51c3848291fc3c64a23b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:33.149460Z","signature_b64":"qSw4nnhczPJV4K9zsqB+esLgfsJ8qDKFXdH0Ju4YCTUttJnI6kaYKe87yMDjZOOU/Ubh3DqPmpKNbUJCC5EaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f1859c089c90f93b7830a13828cc6ed4d6119dd327c5b2f72c9695b4dd72b3","last_reissued_at":"2026-06-23T02:13:33.149061Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:33.149061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of perfect matchings in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carol T. Zamfirescu, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede","submitted_at":"2026-06-20T22:35:00Z","abstract_excerpt":"We investigate the minimum non-zero number of perfect matchings in planar graphs. We prove that this is a constant for 2-connected planar graphs of minimum degree 3 and 3-connected planar graphs. In the former case, the constant is 4 and this is best possible. In the 3-connected case, we give several infinite families, including nearly 3-regular graphs and triangulations with a constant number of perfect matchings. In contrast, it was known that in the 4-connected case the minimum non-zero number of perfect matchings is at least linear. For 5-connected triangulations, it follows from a result "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22253","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22253/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.22253","created_at":"2026-06-23T02:13:33.149127+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22253v1","created_at":"2026-06-23T02:13:33.149127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22253","created_at":"2026-06-23T02:13:33.149127+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPYYLHAITSIP","created_at":"2026-06-23T02:13:33.149127+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPYYLHAITSIPSO3Y","created_at":"2026-06-23T02:13:33.149127+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPYYLHAI","created_at":"2026-06-23T02:13:33.149127+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/SPYYLHAITSIPSO3YGCQTQKGMN3","json":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3.json","graph_json":"https://pith.science/api/pith-number/SPYYLHAITSIPSO3YGCQTQKGMN3/graph.json","events_json":"https://pith.science/api/pith-number/SPYYLHAITSIPSO3YGCQTQKGMN3/events.json","paper":"https://pith.science/paper/SPYYLHAI"},"agent_actions":{"view_html":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3","download_json":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3.json","view_paper":"https://pith.science/paper/SPYYLHAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22253&json=true","fetch_graph":"https://pith.science/api/pith-number/SPYYLHAITSIPSO3YGCQTQKGMN3/graph.json","fetch_events":"https://pith.science/api/pith-number/SPYYLHAITSIPSO3YGCQTQKGMN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/action/storage_attestation","attest_author":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/action/author_attestation","sign_citation":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/action/citation_signature","submit_replication":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/action/replication_record"}},"created_at":"2026-06-23T02:13:33.149127+00:00","updated_at":"2026-06-23T02:13:33.149127+00:00"}