{"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"}