{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WL5UHSUYKF7D27BYRCQBWN4MLF","short_pith_number":"pith:WL5UHSUY","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"},"canonical_sha256":"b2fb43ca98517e3d7c3888a01b378c5969440218342d6b81eddbb92eef2aee7c","source":{"kind":"arxiv","id":"1709.02311","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02311","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02311v2","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02311","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"WL5UHSUYKF7D","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WL5UHSUYKF7D27BY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WL5UHSUY","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WL5UHSUYKF7D27BYRCQBWN4MLF","target":"record","payload":{"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"},"canonical_sha256":"b2fb43ca98517e3d7c3888a01b378c5969440218342d6b81eddbb92eef2aee7c","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"},"source_kind":"arxiv","source_id":"1709.02311","source_version":2,"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-18T00:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UwZUJAmEQ75BFgcKzVmjjLPoo0ve4of1PWeoHsLwEXz8w472VLa2J9OVTZXy7UFZCHeRd7VvoJVyE5TtUDbFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:00.567069Z"},"content_sha256":"95c255430bb3bd5bd12381d05244531c8b9529498380cbd3ff488bab4a38f226","schema_version":"1.0","event_id":"sha256:95c255430bb3bd5bd12381d05244531c8b9529498380cbd3ff488bab4a38f226"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WL5UHSUYKF7D27BYRCQBWN4MLF","target":"graph","payload":{"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"},"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-18T00:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2drQor/7CAF4rPzNDru+XU9Ye/3WRgQksnbFZ9zK/wVk7oI4xYG2T5FTZTjZr2T1SKaT8wI3fojHJ+jldaOADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:00.567433Z"},"content_sha256":"6fa9534306aebd0cb80c9348e3fe634d1ada6a87624adb0ddc55b67f265d172b","schema_version":"1.0","event_id":"sha256:6fa9534306aebd0cb80c9348e3fe634d1ada6a87624adb0ddc55b67f265d172b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/bundle.json","state_url":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/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-05T12:47:00Z","links":{"resolver":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF","bundle":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/bundle.json","state":"https://pith.science/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WL5UHSUYKF7D27BYRCQBWN4MLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WL5UHSUYKF7D27BYRCQBWN4MLF","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":"49def50da08ce3ef3e6c3d11ca7a656a9e5f278a364d9f0dfeb5762ef1720d32","cross_cats_sorted":["cs.CC","math.CO","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T15:29:11Z","title_canon_sha256":"f5d74ba6e61a65988fb48c7e79edaa787ff18103934e9c5bc67dd843e18247e2"},"schema_version":"1.0","source":{"id":"1709.02311","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02311","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02311v2","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02311","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"WL5UHSUYKF7D","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WL5UHSUYKF7D27BY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WL5UHSUY","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:6fa9534306aebd0cb80c9348e3fe634d1ada6a87624adb0ddc55b67f265d172b","target":"graph","created_at":"2026-05-18T00:30:00Z","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":"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","authors_text":"Jesper Nederlof, Nathan Lindzey, Radu Curticapean","cross_cats":["cs.CC","math.CO","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T15:29:11Z","title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02311","kind":"arxiv","version":2},"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:95c255430bb3bd5bd12381d05244531c8b9529498380cbd3ff488bab4a38f226","target":"record","created_at":"2026-05-18T00:30:00Z","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":"49def50da08ce3ef3e6c3d11ca7a656a9e5f278a364d9f0dfeb5762ef1720d32","cross_cats_sorted":["cs.CC","math.CO","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T15:29:11Z","title_canon_sha256":"f5d74ba6e61a65988fb48c7e79edaa787ff18103934e9c5bc67dd843e18247e2"},"schema_version":"1.0","source":{"id":"1709.02311","kind":"arxiv","version":2}},"canonical_sha256":"b2fb43ca98517e3d7c3888a01b378c5969440218342d6b81eddbb92eef2aee7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2fb43ca98517e3d7c3888a01b378c5969440218342d6b81eddbb92eef2aee7c","first_computed_at":"2026-05-18T00:30:00.173604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:00.173604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"akW3uaDdjNoqest6zsgFa9FTPLSbFP9aSfuO5cNEDjBVmy93n363UwAE7tscQLQebShIs078zT2t8ackiHFtCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:00.174123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02311","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95c255430bb3bd5bd12381d05244531c8b9529498380cbd3ff488bab4a38f226","sha256:6fa9534306aebd0cb80c9348e3fe634d1ada6a87624adb0ddc55b67f265d172b"],"state_sha256":"d5205c530bf7500bbd3371447b875865a1a5b07cd5b8e6c9e9cf98d621ae8c30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3EAEel7d7v/mDRyEcbFRvB1F7vLp+thfppL9RXN5Wo0vvQjS3lhYpdaExhLQG3vce/RB4mh82Cfzz5SuStd9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:47:00.569808Z","bundle_sha256":"fc46e68554b2c4dc33c88bc6bac1c4aceca562ed0f73bf41ccaa642a5dd260b3"}}