{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5XQLPXMARJNXFDTE3ZA26BQT2S","short_pith_number":"pith:5XQLPXMA","schema_version":"1.0","canonical_sha256":"ede0b7dd808a5b728e64de41af0613d49b67d2dd8b57f60733a71dde99610886","source":{"kind":"arxiv","id":"1211.1506","version":1},"attestation_state":"computed","paper":{"title":"Fast Hamiltonicity checking via bases of perfect matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof, Marek Cygan, Stefan Kratsch","submitted_at":"2012-11-07T10:39:24Z","abstract_excerpt":"For an even integer t \\geq 2, the Matchings Connecivity matrix H_t is a matrix that has rows and columns both labeled by all perfect matchings of the complete graph K_t on t vertices; an entry H_t[M_1,M_2] is 1 if M_1\\cup M_2 is a Hamiltonian cycle and 0 otherwise. Motivated by the computational study of the Hamiltonicity problem, we present three results on the structure of H_t: We first show that H_t has rank at most 2^{t/2-1} over GF(2) via an appropriate factorization that explicitly provides families of matchings X_t forming bases for H_t. Second, we show how to quickly change representat"},"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":"1211.1506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:39:24Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"3d7ca3fc99cf851074da24f510581dbd5cab2a4283723f6034b91036f3cbb515","abstract_canon_sha256":"5978850892ee3a3afa059953d75f065eaf6d5d4462e6675755089dddcdf2b132"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:20.832295Z","signature_b64":"wgTr1kkXp8I8LX4XWgtgdsM49Tf1cCgWgpJxpW6d68M21Ic54z2frAz9qTKptqrz5gKZ8PMGSWWCv0kcLrhhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede0b7dd808a5b728e64de41af0613d49b67d2dd8b57f60733a71dde99610886","last_reissued_at":"2026-05-18T03:41:20.831936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:20.831936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Hamiltonicity checking via bases of perfect matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof, Marek Cygan, Stefan Kratsch","submitted_at":"2012-11-07T10:39:24Z","abstract_excerpt":"For an even integer t \\geq 2, the Matchings Connecivity matrix H_t is a matrix that has rows and columns both labeled by all perfect matchings of the complete graph K_t on t vertices; an entry H_t[M_1,M_2] is 1 if M_1\\cup M_2 is a Hamiltonian cycle and 0 otherwise. Motivated by the computational study of the Hamiltonicity problem, we present three results on the structure of H_t: We first show that H_t has rank at most 2^{t/2-1} over GF(2) via an appropriate factorization that explicitly provides families of matchings X_t forming bases for H_t. Second, we show how to quickly change representat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1506","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.1506","created_at":"2026-05-18T03:41:20.831991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1506v1","created_at":"2026-05-18T03:41:20.831991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1506","created_at":"2026-05-18T03:41:20.831991+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XQLPXMARJNX","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XQLPXMARJNXFDTE","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XQLPXMA","created_at":"2026-05-18T12:26:56.085431+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/5XQLPXMARJNXFDTE3ZA26BQT2S","json":"https://pith.science/pith/5XQLPXMARJNXFDTE3ZA26BQT2S.json","graph_json":"https://pith.science/api/pith-number/5XQLPXMARJNXFDTE3ZA26BQT2S/graph.json","events_json":"https://pith.science/api/pith-number/5XQLPXMARJNXFDTE3ZA26BQT2S/events.json","paper":"https://pith.science/paper/5XQLPXMA"},"agent_actions":{"view_html":"https://pith.science/pith/5XQLPXMARJNXFDTE3ZA26BQT2S","download_json":"https://pith.science/pith/5XQLPXMARJNXFDTE3ZA26BQT2S.json","view_paper":"https://pith.science/paper/5XQLPXMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1506&json=true","fetch_graph":"https://pith.science/api/pith-number/5XQLPXMARJNXFDTE3ZA26BQT2S/graph.json","fetch_events":"https://pith.science/api/pith-number/5XQLPXMARJNXFDTE3ZA26BQT2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XQLPXMARJNXFDTE3ZA26BQT2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XQLPXMARJNXFDTE3ZA26BQT2S/action/storage_attestation","attest_author":"https://pith.science/pith/5XQLPXMARJNXFDTE3ZA26BQT2S/action/author_attestation","sign_citation":"https://pith.science/pith/5XQLPXMARJNXFDTE3ZA26BQT2S/action/citation_signature","submit_replication":"https://pith.science/pith/5XQLPXMARJNXFDTE3ZA26BQT2S/action/replication_record"}},"created_at":"2026-05-18T03:41:20.831991+00:00","updated_at":"2026-05-18T03:41:20.831991+00:00"}