{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EWMZY43RTWLBOLKL3Z6PGVOFJP","short_pith_number":"pith:EWMZY43R","schema_version":"1.0","canonical_sha256":"25999c73719d96172d4bde7cf355c54bc5b7b75f933706ff588dbcefb739b366","source":{"kind":"arxiv","id":"1607.04002","version":2},"attestation_state":"computed","paper":{"title":"Directed Hamiltonicity and Out-Branchings via Generalized Laplacians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Ioannis Koutis, Petteri Kaski","submitted_at":"2016-07-14T06:06:39Z","abstract_excerpt":"We are motivated by a tantalizing open question in exact algorithms: can we detect whether an $n$-vertex directed graph $G$ has a Hamiltonian cycle in time significantly less than $2^n$? We present new randomized algorithms that improve upon several previous works:\n  1. We show that for any constant $0<\\lambda<1$ and prime $p$ we can count the Hamiltonian cycles modulo $p^{\\lfloor (1-\\lambda)\\frac{n}{3p}\\rfloor}$ in expected time less than $c^n$ for a constant $c<2$ that depends only on $p$ and $\\lambda$. Such an algorithm was previously known only for the case of counting modulo two [Bj\\\"orkl"},"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":"1607.04002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-14T06:06:39Z","cross_cats_sorted":[],"title_canon_sha256":"f6e9569279d4d281bb321fe6880448827c95c90547b71d9d1e68e71a23091f7d","abstract_canon_sha256":"da75aa2145e44233de65d014370cefc5bbfb7ba17d7bd29bb46d39bb7e0ede6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:48.998900Z","signature_b64":"9eZl2WnbtmNtbupLdlslPxObWSNHGJ1bU3AqFXhZlwE9DWmUV2w53M7SYot6AfyrwQO8jYn2I7t1crBcsbtqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25999c73719d96172d4bde7cf355c54bc5b7b75f933706ff588dbcefb739b366","last_reissued_at":"2026-05-18T00:45:48.998426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:48.998426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed Hamiltonicity and Out-Branchings via Generalized Laplacians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Ioannis Koutis, Petteri Kaski","submitted_at":"2016-07-14T06:06:39Z","abstract_excerpt":"We are motivated by a tantalizing open question in exact algorithms: can we detect whether an $n$-vertex directed graph $G$ has a Hamiltonian cycle in time significantly less than $2^n$? We present new randomized algorithms that improve upon several previous works:\n  1. We show that for any constant $0<\\lambda<1$ and prime $p$ we can count the Hamiltonian cycles modulo $p^{\\lfloor (1-\\lambda)\\frac{n}{3p}\\rfloor}$ in expected time less than $c^n$ for a constant $c<2$ that depends only on $p$ and $\\lambda$. Such an algorithm was previously known only for the case of counting modulo two [Bj\\\"orkl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04002","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":"1607.04002","created_at":"2026-05-18T00:45:48.998496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04002v2","created_at":"2026-05-18T00:45:48.998496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04002","created_at":"2026-05-18T00:45:48.998496+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWMZY43RTWLB","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWMZY43RTWLBOLKL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWMZY43R","created_at":"2026-05-18T12:30:15.759754+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/EWMZY43RTWLBOLKL3Z6PGVOFJP","json":"https://pith.science/pith/EWMZY43RTWLBOLKL3Z6PGVOFJP.json","graph_json":"https://pith.science/api/pith-number/EWMZY43RTWLBOLKL3Z6PGVOFJP/graph.json","events_json":"https://pith.science/api/pith-number/EWMZY43RTWLBOLKL3Z6PGVOFJP/events.json","paper":"https://pith.science/paper/EWMZY43R"},"agent_actions":{"view_html":"https://pith.science/pith/EWMZY43RTWLBOLKL3Z6PGVOFJP","download_json":"https://pith.science/pith/EWMZY43RTWLBOLKL3Z6PGVOFJP.json","view_paper":"https://pith.science/paper/EWMZY43R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04002&json=true","fetch_graph":"https://pith.science/api/pith-number/EWMZY43RTWLBOLKL3Z6PGVOFJP/graph.json","fetch_events":"https://pith.science/api/pith-number/EWMZY43RTWLBOLKL3Z6PGVOFJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWMZY43RTWLBOLKL3Z6PGVOFJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWMZY43RTWLBOLKL3Z6PGVOFJP/action/storage_attestation","attest_author":"https://pith.science/pith/EWMZY43RTWLBOLKL3Z6PGVOFJP/action/author_attestation","sign_citation":"https://pith.science/pith/EWMZY43RTWLBOLKL3Z6PGVOFJP/action/citation_signature","submit_replication":"https://pith.science/pith/EWMZY43RTWLBOLKL3Z6PGVOFJP/action/replication_record"}},"created_at":"2026-05-18T00:45:48.998496+00:00","updated_at":"2026-05-18T00:45:48.998496+00:00"}