{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ABQJEVJ4EJWP7UPK6XYE3CH5GU","short_pith_number":"pith:ABQJEVJ4","schema_version":"1.0","canonical_sha256":"006092553c226cffd1eaf5f04d88fd350818362102cb9ea7c5c994e7409561e5","source":{"kind":"arxiv","id":"1301.7250","version":2},"attestation_state":"computed","paper":{"title":"The Parity of Directed Hamiltonian Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Thore Husfeldt","submitted_at":"2013-01-30T14:57:48Z","abstract_excerpt":"We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a positive integer."},"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":"1301.7250","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-30T14:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"bca5a7ec3845087639ed091bf21fed73e1a5d579bc21b7a87a4ada85f11e725f","abstract_canon_sha256":"52169136aba6ef145f20454847f4d7b2a4fcd70b0482d6af44c19fb8b19229cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:28.824970Z","signature_b64":"v5Ip57ue6cQ/WFClrvPpHbco2pLcgjLmWaqf6SE1zo5+TVpDc+L9NnWSLlFkWAyRN3FOyC7rF5OVandM0jE+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"006092553c226cffd1eaf5f04d88fd350818362102cb9ea7c5c994e7409561e5","last_reissued_at":"2026-05-18T03:16:28.824469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:28.824469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parity of Directed Hamiltonian Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Thore Husfeldt","submitted_at":"2013-01-30T14:57:48Z","abstract_excerpt":"We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a positive integer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7250","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":"1301.7250","created_at":"2026-05-18T03:16:28.824542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7250v2","created_at":"2026-05-18T03:16:28.824542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7250","created_at":"2026-05-18T03:16:28.824542+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABQJEVJ4EJWP","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABQJEVJ4EJWP7UPK","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABQJEVJ4","created_at":"2026-05-18T12:27:38.830355+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/ABQJEVJ4EJWP7UPK6XYE3CH5GU","json":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU.json","graph_json":"https://pith.science/api/pith-number/ABQJEVJ4EJWP7UPK6XYE3CH5GU/graph.json","events_json":"https://pith.science/api/pith-number/ABQJEVJ4EJWP7UPK6XYE3CH5GU/events.json","paper":"https://pith.science/paper/ABQJEVJ4"},"agent_actions":{"view_html":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU","download_json":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU.json","view_paper":"https://pith.science/paper/ABQJEVJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7250&json=true","fetch_graph":"https://pith.science/api/pith-number/ABQJEVJ4EJWP7UPK6XYE3CH5GU/graph.json","fetch_events":"https://pith.science/api/pith-number/ABQJEVJ4EJWP7UPK6XYE3CH5GU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/action/storage_attestation","attest_author":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/action/author_attestation","sign_citation":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/action/citation_signature","submit_replication":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/action/replication_record"}},"created_at":"2026-05-18T03:16:28.824542+00:00","updated_at":"2026-05-18T03:16:28.824542+00:00"}