{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UV2LQMT5VE4JG6BJ55YM6YMAEQ","short_pith_number":"pith:UV2LQMT5","schema_version":"1.0","canonical_sha256":"a574b8327da938937829ef70cf6180241f34115fedc50ef95bc613656a8c723a","source":{"kind":"arxiv","id":"1805.06728","version":1},"attestation_state":"computed","paper":{"title":"A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Volker Turau","submitted_at":"2018-05-17T12:38:15Z","abstract_excerpt":"It is known for some time that a random graph $G(n,p)$ contains w.h.p. a Hamiltonian cycle if $p$ is larger than the critical value $p_{crit}= (\\log n + \\log \\log n + \\omega_n)/n$. The determination of a concrete Hamiltonian cycle is even for values much larger than $p_{crit}$ a nontrivial task. In this paper we consider random graphs $G(n,p)$ with $p$ in $\\tilde{\\Omega}(1/\\sqrt{n})$, where $\\tilde{\\Omega}$ hides poly-logarithmic factors in $n$. For this range of $p$ we present a distributed algorithm ${\\cal A}_{HC}$ that finds w.h.p. a Hamiltonian cycle in $O(\\log n)$ rounds. The algorithm wo"},"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":"1805.06728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-17T12:38:15Z","cross_cats_sorted":[],"title_canon_sha256":"04bcab2cad3d1739dcce20c51e245e548e3fce84d02791d69c2aadbe5f781761","abstract_canon_sha256":"9dd981c4cc7c82dd47f90149cbed09b908da7fc1aef214878e256d8b24370b90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:43.513243Z","signature_b64":"gF8Qz9SaXQqlZY9TqA0hhvFNavOfz5ZXw1kkTKXpqUPY+ZqOpgHyhi/bS0IKZT0a4KyWa422jxqhM/ptY9MgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a574b8327da938937829ef70cf6180241f34115fedc50ef95bc613656a8c723a","last_reissued_at":"2026-05-18T00:15:43.512758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:43.512758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Volker Turau","submitted_at":"2018-05-17T12:38:15Z","abstract_excerpt":"It is known for some time that a random graph $G(n,p)$ contains w.h.p. a Hamiltonian cycle if $p$ is larger than the critical value $p_{crit}= (\\log n + \\log \\log n + \\omega_n)/n$. The determination of a concrete Hamiltonian cycle is even for values much larger than $p_{crit}$ a nontrivial task. In this paper we consider random graphs $G(n,p)$ with $p$ in $\\tilde{\\Omega}(1/\\sqrt{n})$, where $\\tilde{\\Omega}$ hides poly-logarithmic factors in $n$. For this range of $p$ we present a distributed algorithm ${\\cal A}_{HC}$ that finds w.h.p. a Hamiltonian cycle in $O(\\log n)$ rounds. The algorithm wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06728","kind":"arxiv","version":1},"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":"1805.06728","created_at":"2026-05-18T00:15:43.512836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06728v1","created_at":"2026-05-18T00:15:43.512836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06728","created_at":"2026-05-18T00:15:43.512836+00:00"},{"alias_kind":"pith_short_12","alias_value":"UV2LQMT5VE4J","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UV2LQMT5VE4JG6BJ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UV2LQMT5","created_at":"2026-05-18T12:32:56.356000+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/UV2LQMT5VE4JG6BJ55YM6YMAEQ","json":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ.json","graph_json":"https://pith.science/api/pith-number/UV2LQMT5VE4JG6BJ55YM6YMAEQ/graph.json","events_json":"https://pith.science/api/pith-number/UV2LQMT5VE4JG6BJ55YM6YMAEQ/events.json","paper":"https://pith.science/paper/UV2LQMT5"},"agent_actions":{"view_html":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ","download_json":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ.json","view_paper":"https://pith.science/paper/UV2LQMT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06728&json=true","fetch_graph":"https://pith.science/api/pith-number/UV2LQMT5VE4JG6BJ55YM6YMAEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UV2LQMT5VE4JG6BJ55YM6YMAEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/action/storage_attestation","attest_author":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/action/author_attestation","sign_citation":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/action/citation_signature","submit_replication":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/action/replication_record"}},"created_at":"2026-05-18T00:15:43.512836+00:00","updated_at":"2026-05-18T00:15:43.512836+00:00"}