{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VCQHUOQORG2LJVYUV4UN37ZFYU","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":"158e7a1be24c49fac04207173a42e0b142917312664a3f7b7a1d152f28c2ab6a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-27T17:42:52Z","title_canon_sha256":"5aaa38f7d8383f04ff02046428cc0dee0936adade5bb2bea4f776b3b0e37d7df"},"schema_version":"1.0","source":{"id":"1607.08192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08192","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08192v1","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08192","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"VCQHUOQORG2L","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VCQHUOQORG2LJVYU","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VCQHUOQO","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:6b78a9c1099553ee9c80d4cc52dd949a941196e8a61cf0532e9d847826491908","target":"graph","created_at":"2026-05-18T01:10:20Z","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":"We consider the problem of counting matchings in planar graphs. While perfect matchings in planar graphs can be counted by a classical polynomial-time algorithm, the problem of counting all matchings (possibly containing unmatched vertices, also known as defects) is known to be #P-complete on planar graphs. To interpolate between the hard case of counting matchings and the easy case of counting perfect matchings, we study the parameterized problem of counting matchings with exactly k unmatched vertices in a planar graph G, on input G and k. This setting has a natural interpretation in statisti","authors_text":"Radu Curticapean","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-27T17:42:52Z","title":"Counting matchings with k unmatched vertices in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08192","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:9cdb567c58bd45b8c98d96e1e61f5bbb231c9b1907842c7d56f06dca76adce6e","target":"record","created_at":"2026-05-18T01:10:20Z","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":"158e7a1be24c49fac04207173a42e0b142917312664a3f7b7a1d152f28c2ab6a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-27T17:42:52Z","title_canon_sha256":"5aaa38f7d8383f04ff02046428cc0dee0936adade5bb2bea4f776b3b0e37d7df"},"schema_version":"1.0","source":{"id":"1607.08192","kind":"arxiv","version":1}},"canonical_sha256":"a8a07a3a0e89b4b4d714af28ddff25c51dd26c4ba6076ef3fc8c1742bc5585b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8a07a3a0e89b4b4d714af28ddff25c51dd26c4ba6076ef3fc8c1742bc5585b2","first_computed_at":"2026-05-18T01:10:20.797115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:20.797115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MgjI0RSTkjQbILrWvl10iZ7DyJGwdBJxQhtNJ5iNiDGkApvL+JyDNJRHJlfpgvpDZMggyUypDcNUfpoROuveDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:20.797578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cdb567c58bd45b8c98d96e1e61f5bbb231c9b1907842c7d56f06dca76adce6e","sha256:6b78a9c1099553ee9c80d4cc52dd949a941196e8a61cf0532e9d847826491908"],"state_sha256":"53477dfa45770016632dd703256195bfdeb78b852babf6fe29d751f20f65eb30"}