{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WL5UHSUYKF7D27BYRCQBWN4MLF","short_pith_number":"pith:WL5UHSUY","schema_version":"1.0","canonical_sha256":"b2fb43ca98517e3d7c3888a01b378c5969440218342d6b81eddbb92eef2aee7c","source":{"kind":"arxiv","id":"1709.02311","version":2},"attestation_state":"computed","paper":{"title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","math.RT"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof, Nathan Lindzey, Radu Curticapean","submitted_at":"2017-09-07T15:29:11Z","abstract_excerpt":"For even $k$, the matchings connectivity matrix $\\mathbf{M}_k$ encodes which pairs of perfect matchings on $k$ vertices form a single cycle. Cygan et al. (STOC 2013) showed that the rank of $\\mathbf{M}_k$ over $\\mathbb{Z}_2$ is $\\Theta(\\sqrt 2^k)$ and used this to give an $O^*((2+\\sqrt{2})^{\\mathsf{pw}})$ time algorithm for counting Hamiltonian cycles modulo $2$ on graphs of pathwidth $\\mathsf{pw}$. The same authors complemented their algorithm by an essentially tight lower bound under the Strong Exponential Time Hypothesis (SETH). This bound crucially relied on a large permutation submatrix w"},"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":"1709.02311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T15:29:11Z","cross_cats_sorted":["cs.CC","math.CO","math.RT"],"title_canon_sha256":"f5d74ba6e61a65988fb48c7e79edaa787ff18103934e9c5bc67dd843e18247e2","abstract_canon_sha256":"49def50da08ce3ef3e6c3d11ca7a656a9e5f278a364d9f0dfeb5762ef1720d32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:00.174123Z","signature_b64":"akW3uaDdjNoqest6zsgFa9FTPLSbFP9aSfuO5cNEDjBVmy93n363UwAE7tscQLQebShIs078zT2t8ackiHFtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2fb43ca98517e3d7c3888a01b378c5969440218342d6b81eddbb92eef2aee7c","last_reissued_at":"2026-05-18T00:30:00.173604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:00.173604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","math.RT"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof, Nathan Lindzey, Radu Curticapean","submitted_at":"2017-09-07T15:29:11Z","abstract_excerpt":"For even $k$, the matchings connectivity matrix $\\mathbf{M}_k$ encodes which pairs of perfect matchings on $k$ vertices form a single cycle. Cygan et al. (STOC 2013) showed that the rank of $\\mathbf{M}_k$ over $\\mathbb{Z}_2$ is $\\Theta(\\sqrt 2^k)$ and used this to give an $O^*((2+\\sqrt{2})^{\\mathsf{pw}})$ time algorithm for counting Hamiltonian cycles modulo $2$ on graphs of pathwidth $\\mathsf{pw}$. The same authors complemented their algorithm by an essentially tight lower bound under the Strong Exponential Time Hypothesis (SETH). This bound crucially relied on a large permutation submatrix w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02311","kind":"arxiv","version":2},"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":"1709.02311","created_at":"2026-05-18T00:30:00.173687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02311v2","created_at":"2026-05-18T00:30:00.173687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02311","created_at":"2026-05-18T00:30:00.173687+00:00"},{"alias_kind":"pith_short_12","alias_value":"WL5UHSUYKF7D","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WL5UHSUYKF7D27BY","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WL5UHSUY","created_at":"2026-05-18T12:31:53.515858+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/WL5UHSUYKF7D27BYRCQBWN4MLF","json":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF.json","graph_json":"https://pith.science/api/pith-number/WL5UHSUYKF7D27BYRCQBWN4MLF/graph.json","events_json":"https://pith.science/api/pith-number/WL5UHSUYKF7D27BYRCQBWN4MLF/events.json","paper":"https://pith.science/paper/WL5UHSUY"},"agent_actions":{"view_html":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF","download_json":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF.json","view_paper":"https://pith.science/paper/WL5UHSUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02311&json=true","fetch_graph":"https://pith.science/api/pith-number/WL5UHSUYKF7D27BYRCQBWN4MLF/graph.json","fetch_events":"https://pith.science/api/pith-number/WL5UHSUYKF7D27BYRCQBWN4MLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/action/storage_attestation","attest_author":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/action/author_attestation","sign_citation":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/action/citation_signature","submit_replication":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/action/replication_record"}},"created_at":"2026-05-18T00:30:00.173687+00:00","updated_at":"2026-05-18T00:30:00.173687+00:00"}