{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ABQJEVJ4EJWP7UPK6XYE3CH5GU","short_pith_number":"pith:ABQJEVJ4","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"},"canonical_sha256":"006092553c226cffd1eaf5f04d88fd350818362102cb9ea7c5c994e7409561e5","source":{"kind":"arxiv","id":"1301.7250","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7250","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7250v2","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7250","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"ABQJEVJ4EJWP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ABQJEVJ4EJWP7UPK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ABQJEVJ4","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ABQJEVJ4EJWP7UPK6XYE3CH5GU","target":"record","payload":{"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"},"canonical_sha256":"006092553c226cffd1eaf5f04d88fd350818362102cb9ea7c5c994e7409561e5","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"},"source_kind":"arxiv","source_id":"1301.7250","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-18T03:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ir7qOPZ+KnDu24vJUAzTtFiUFEeb5cJCZ32wyV7SzlodyqQhH19GdxoxJvGqJ5iTcbNeSMpdzp+Er90itzpkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:59.029194Z"},"content_sha256":"6587bb24690da6aea887561b344dfdd31d7229d254b946535628495e137c5be3","schema_version":"1.0","event_id":"sha256:6587bb24690da6aea887561b344dfdd31d7229d254b946535628495e137c5be3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ABQJEVJ4EJWP7UPK6XYE3CH5GU","target":"graph","payload":{"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"},"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-18T03:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyHiAYWiLvEK/eSa6t6gMmOWSBF4UDLtP/cCOEDK62S02WPprSDLOGdQE0i9Yqk8HltNuDy5/OhUZ6AyKjMuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:59.029946Z"},"content_sha256":"8110e5f6218190e8474ba8984d086043d4ada64e5406b8c09dc33c5e60e25f18","schema_version":"1.0","event_id":"sha256:8110e5f6218190e8474ba8984d086043d4ada64e5406b8c09dc33c5e60e25f18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/bundle.json","state_url":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/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-05-25T20:16:59Z","links":{"resolver":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU","bundle":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/bundle.json","state":"https://pith.science/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABQJEVJ4EJWP7UPK6XYE3CH5GU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ABQJEVJ4EJWP7UPK6XYE3CH5GU","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":"52169136aba6ef145f20454847f4d7b2a4fcd70b0482d6af44c19fb8b19229cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-30T14:57:48Z","title_canon_sha256":"bca5a7ec3845087639ed091bf21fed73e1a5d579bc21b7a87a4ada85f11e725f"},"schema_version":"1.0","source":{"id":"1301.7250","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7250","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7250v2","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7250","created_at":"2026-05-18T03:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"ABQJEVJ4EJWP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ABQJEVJ4EJWP7UPK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ABQJEVJ4","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:8110e5f6218190e8474ba8984d086043d4ada64e5406b8c09dc33c5e60e25f18","target":"graph","created_at":"2026-05-18T03:16:28Z","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 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.","authors_text":"Andreas Bj\\\"orklund, Thore Husfeldt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-30T14:57:48Z","title":"The Parity of Directed Hamiltonian Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7250","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:6587bb24690da6aea887561b344dfdd31d7229d254b946535628495e137c5be3","target":"record","created_at":"2026-05-18T03:16:28Z","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":"52169136aba6ef145f20454847f4d7b2a4fcd70b0482d6af44c19fb8b19229cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-30T14:57:48Z","title_canon_sha256":"bca5a7ec3845087639ed091bf21fed73e1a5d579bc21b7a87a4ada85f11e725f"},"schema_version":"1.0","source":{"id":"1301.7250","kind":"arxiv","version":2}},"canonical_sha256":"006092553c226cffd1eaf5f04d88fd350818362102cb9ea7c5c994e7409561e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"006092553c226cffd1eaf5f04d88fd350818362102cb9ea7c5c994e7409561e5","first_computed_at":"2026-05-18T03:16:28.824469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:28.824469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v5Ip57ue6cQ/WFClrvPpHbco2pLcgjLmWaqf6SE1zo5+TVpDc+L9NnWSLlFkWAyRN3FOyC7rF5OVandM0jE+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:28.824970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7250","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6587bb24690da6aea887561b344dfdd31d7229d254b946535628495e137c5be3","sha256:8110e5f6218190e8474ba8984d086043d4ada64e5406b8c09dc33c5e60e25f18"],"state_sha256":"bc6fdc16ba7612c0093cf95b28534ff7a63873401e43efdb8c74a92c9e2c7f7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTNMg5nzCWJUMlKKgsajUYBrO/28xRflJ6D8pZ/qh3fjU56Vke0UvZvUSSIlTMlbY+rni8ACwaJDV59KfiViBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:16:59.033192Z","bundle_sha256":"439a7e4d01a47bdfa5263313b24d99d6ef3c6cee9fb1c19ac9ec21ed88469fe0"}}