{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SPYYLHAITSIPSO3YGCQTQKGMN3","short_pith_number":"pith:SPYYLHAI","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"},"canonical_sha256":"93f1859c089c90f93b7830a13828cc6ed4d6119dd327c5b2f72c9695b4dd72b3","source":{"kind":"arxiv","id":"2606.22253","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22253","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22253v1","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22253","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"pith_short_12","alias_value":"SPYYLHAITSIP","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"pith_short_16","alias_value":"SPYYLHAITSIPSO3Y","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"pith_short_8","alias_value":"SPYYLHAI","created_at":"2026-06-23T02:13:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SPYYLHAITSIPSO3YGCQTQKGMN3","target":"record","payload":{"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"},"canonical_sha256":"93f1859c089c90f93b7830a13828cc6ed4d6119dd327c5b2f72c9695b4dd72b3","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"},"source_kind":"arxiv","source_id":"2606.22253","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-06-23T02:13:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYjirkYcvEjXxxVMxjKPGPOZ7HqgZGPfuA4/oKwRemwuJ5Tof6y7J90jCTkVZXCMyL4IqEnQ+7TIvJoZHm2qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:58:49.526376Z"},"content_sha256":"115c39e4a02f2944f3d490165eeae9b3520759fa7dd46103a5abfb6a77951cd9","schema_version":"1.0","event_id":"sha256:115c39e4a02f2944f3d490165eeae9b3520759fa7dd46103a5abfb6a77951cd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SPYYLHAITSIPSO3YGCQTQKGMN3","target":"graph","payload":{"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"},"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-06-23T02:13:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AawHiOqLw2zvAMXNiaIRkm8JzhxO0bRNAdn/yel1Uomyis8tZe/ghHTbh5b0F7nVr+5y1QwmrXY3I32u/pukDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:58:49.526759Z"},"content_sha256":"1a73580343f4edcb10f2505d7d76f1f42e96f9a7d8d3935101c25951006269a2","schema_version":"1.0","event_id":"sha256:1a73580343f4edcb10f2505d7d76f1f42e96f9a7d8d3935101c25951006269a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/bundle.json","state_url":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/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-26T16:58:49Z","links":{"resolver":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3","bundle":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/bundle.json","state":"https://pith.science/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPYYLHAITSIPSO3YGCQTQKGMN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SPYYLHAITSIPSO3YGCQTQKGMN3","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":"4459bca8ddea2daf72b05a0fb2a722f5d520da2af48b51c3848291fc3c64a23b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T22:35:00Z","title_canon_sha256":"dd0b13f66baa4d57f79965a133815795873d680af8f2e8272281dcdbccd4bb1a"},"schema_version":"1.0","source":{"id":"2606.22253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22253","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22253v1","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22253","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"pith_short_12","alias_value":"SPYYLHAITSIP","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"pith_short_16","alias_value":"SPYYLHAITSIPSO3Y","created_at":"2026-06-23T02:13:33Z"},{"alias_kind":"pith_short_8","alias_value":"SPYYLHAI","created_at":"2026-06-23T02:13:33Z"}],"graph_snapshots":[{"event_id":"sha256:1a73580343f4edcb10f2505d7d76f1f42e96f9a7d8d3935101c25951006269a2","target":"graph","created_at":"2026-06-23T02:13:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.22253/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Carol T. Zamfirescu, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T22:35:00Z","title":"On the number of perfect matchings in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22253","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:115c39e4a02f2944f3d490165eeae9b3520759fa7dd46103a5abfb6a77951cd9","target":"record","created_at":"2026-06-23T02:13:33Z","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":"4459bca8ddea2daf72b05a0fb2a722f5d520da2af48b51c3848291fc3c64a23b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T22:35:00Z","title_canon_sha256":"dd0b13f66baa4d57f79965a133815795873d680af8f2e8272281dcdbccd4bb1a"},"schema_version":"1.0","source":{"id":"2606.22253","kind":"arxiv","version":1}},"canonical_sha256":"93f1859c089c90f93b7830a13828cc6ed4d6119dd327c5b2f72c9695b4dd72b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93f1859c089c90f93b7830a13828cc6ed4d6119dd327c5b2f72c9695b4dd72b3","first_computed_at":"2026-06-23T02:13:33.149061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:33.149061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qSw4nnhczPJV4K9zsqB+esLgfsJ8qDKFXdH0Ju4YCTUttJnI6kaYKe87yMDjZOOU/Ubh3DqPmpKNbUJCC5EaCA==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:33.149460Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:115c39e4a02f2944f3d490165eeae9b3520759fa7dd46103a5abfb6a77951cd9","sha256:1a73580343f4edcb10f2505d7d76f1f42e96f9a7d8d3935101c25951006269a2"],"state_sha256":"9ee884f05fb20501ce3abd38ca3e40d5a49d1a743e36b588d00dc7811955707c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZSKeobCVcnAsjH6LFJgYj76ZLxehm3ml63VtztukaUZTiiX16xmq3w6Zpqannmcgu7HjPF+Sy0r3+lHBb8DAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T16:58:49.528852Z","bundle_sha256":"bfb5b14aca1a62862db47f9fa3ce1070e538d037c4356391c2a0addf1386f25e"}}