{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:25MT7X52URNWEVP3QALGS43J2F","short_pith_number":"pith:25MT7X52","canonical_record":{"source":{"id":"1406.4056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-16T16:06:46Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"62fe11419a7e762e3a129409f7e69ae76430469596ddea3648903b8e59c583fd","abstract_canon_sha256":"884c928909cb1f3ec4a72943884de57731fca0ca177c3531bce13ee2c7eb7212"},"schema_version":"1.0"},"canonical_sha256":"d7593fdfbaa45b6255fb8016697369d14cbcd94ff9061b724874d4597ccdbf31","source":{"kind":"arxiv","id":"1406.4056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4056","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4056v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4056","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"25MT7X52URNW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"25MT7X52URNWEVP3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"25MT7X52","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:25MT7X52URNWEVP3QALGS43J2F","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-16T16:06:46Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"62fe11419a7e762e3a129409f7e69ae76430469596ddea3648903b8e59c583fd","abstract_canon_sha256":"884c928909cb1f3ec4a72943884de57731fca0ca177c3531bce13ee2c7eb7212"},"schema_version":"1.0"},"canonical_sha256":"d7593fdfbaa45b6255fb8016697369d14cbcd94ff9061b724874d4597ccdbf31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.305343Z","signature_b64":"xyBsyzWMRfpRjs2bvPMwXVa21eHkKhvXxc3ju5nboNHmH11M0/ZcgQgJZKGIdHdm2kbgsnDPhCK+i0/pAwLWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7593fdfbaa45b6255fb8016697369d14cbcd94ff9061b724874d4597ccdbf31","last_reissued_at":"2026-05-18T02:49:39.305016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.305016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4056","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:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20EKlaLcEro/3yhmOvtfglGdt2sCIvIVHF2YfVS6V2FdwLjdw7BDe5SI3pZ7W2VfvC8d7r4mQMFvThgsyLwGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:46:15.555605Z"},"content_sha256":"908c20ad2288d7cf2c8c312fa90e10578d5a8e978fb5d192c54e0bffad2ba5f9","schema_version":"1.0","event_id":"sha256:908c20ad2288d7cf2c8c312fa90e10578d5a8e978fb5d192c54e0bffad2ba5f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:25MT7X52URNWEVP3QALGS43J2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting perfect matchings in graphs that exclude a single-crossing minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Radu Curticapean","submitted_at":"2014-06-16T16:06:46Z","abstract_excerpt":"A graph $H$ is single-crossing if it can be drawn in the plane with at most one crossing. For any single-crossing graph $H$, we give an $O(n^4)$ time algorithm for counting perfect matchings in graphs excluding $H$ as a minor. The runtime can be lowered to $O(n^{1.5})$ when $G$ excludes $K_5$ or $K_{3,3}$ as a minor. This is the first generalization of an algorithm for counting perfect matchings in $K_{3,3}$-free graphs (Little 1974, Vazirani 1989). Our algorithm uses black-boxes for counting perfect matchings in planar graphs and for computing certain graph decompositions. Together with an in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4056","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:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoaiDPiUKRS2bYDYzl/ezWttw07Oj63KttzQEH9V0oE/4JhU412DhV2YJdOWhfxLhJs/cO2FT6bwEg6zgqqRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:46:15.555972Z"},"content_sha256":"77c38101424c214a111c3dbe984dd4a1d22cd05bf43260b6e7fbdb81c7d7b1c6","schema_version":"1.0","event_id":"sha256:77c38101424c214a111c3dbe984dd4a1d22cd05bf43260b6e7fbdb81c7d7b1c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25MT7X52URNWEVP3QALGS43J2F/bundle.json","state_url":"https://pith.science/pith/25MT7X52URNWEVP3QALGS43J2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25MT7X52URNWEVP3QALGS43J2F/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-26T09:46:15Z","links":{"resolver":"https://pith.science/pith/25MT7X52URNWEVP3QALGS43J2F","bundle":"https://pith.science/pith/25MT7X52URNWEVP3QALGS43J2F/bundle.json","state":"https://pith.science/pith/25MT7X52URNWEVP3QALGS43J2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25MT7X52URNWEVP3QALGS43J2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:25MT7X52URNWEVP3QALGS43J2F","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":"884c928909cb1f3ec4a72943884de57731fca0ca177c3531bce13ee2c7eb7212","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-16T16:06:46Z","title_canon_sha256":"62fe11419a7e762e3a129409f7e69ae76430469596ddea3648903b8e59c583fd"},"schema_version":"1.0","source":{"id":"1406.4056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4056","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4056v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4056","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"25MT7X52URNW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"25MT7X52URNWEVP3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"25MT7X52","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:77c38101424c214a111c3dbe984dd4a1d22cd05bf43260b6e7fbdb81c7d7b1c6","target":"graph","created_at":"2026-05-18T02:49:39Z","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":"A graph $H$ is single-crossing if it can be drawn in the plane with at most one crossing. For any single-crossing graph $H$, we give an $O(n^4)$ time algorithm for counting perfect matchings in graphs excluding $H$ as a minor. The runtime can be lowered to $O(n^{1.5})$ when $G$ excludes $K_5$ or $K_{3,3}$ as a minor. This is the first generalization of an algorithm for counting perfect matchings in $K_{3,3}$-free graphs (Little 1974, Vazirani 1989). Our algorithm uses black-boxes for counting perfect matchings in planar graphs and for computing certain graph decompositions. Together with an in","authors_text":"Radu Curticapean","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-16T16:06:46Z","title":"Counting perfect matchings in graphs that exclude a single-crossing minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4056","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:908c20ad2288d7cf2c8c312fa90e10578d5a8e978fb5d192c54e0bffad2ba5f9","target":"record","created_at":"2026-05-18T02:49:39Z","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":"884c928909cb1f3ec4a72943884de57731fca0ca177c3531bce13ee2c7eb7212","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-16T16:06:46Z","title_canon_sha256":"62fe11419a7e762e3a129409f7e69ae76430469596ddea3648903b8e59c583fd"},"schema_version":"1.0","source":{"id":"1406.4056","kind":"arxiv","version":1}},"canonical_sha256":"d7593fdfbaa45b6255fb8016697369d14cbcd94ff9061b724874d4597ccdbf31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7593fdfbaa45b6255fb8016697369d14cbcd94ff9061b724874d4597ccdbf31","first_computed_at":"2026-05-18T02:49:39.305016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.305016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xyBsyzWMRfpRjs2bvPMwXVa21eHkKhvXxc3ju5nboNHmH11M0/ZcgQgJZKGIdHdm2kbgsnDPhCK+i0/pAwLWAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.305343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:908c20ad2288d7cf2c8c312fa90e10578d5a8e978fb5d192c54e0bffad2ba5f9","sha256:77c38101424c214a111c3dbe984dd4a1d22cd05bf43260b6e7fbdb81c7d7b1c6"],"state_sha256":"fd48a985caa24bc9f3c9c3dbee2f30287db7843d613c3d0d14c88c4e76779e1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23LkTKJHYb4tgJQVrclKfQR2rDk3CQrwuB5lImYJgNW+6Fs0fdFAkatwp4q/GnepwyEyxADskh7bH+ZP6IpNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:46:15.557918Z","bundle_sha256":"823b87cc0ef19ac9709fa4ee3713493da41cf351628adf339dbf86a76191218f"}}