{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GNOQWPEURQBULJBU4MQFE5BCFF","short_pith_number":"pith:GNOQWPEU","schema_version":"1.0","canonical_sha256":"335d0b3c948c0345a434e32052742229752c165261e1da5ff812c705632a905c","source":{"kind":"arxiv","id":"1804.08819","version":1},"attestation_state":"computed","paper":{"title":"Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gopal Pandurangan, Nguyen Dinh Pham, Reza Fathi, Soumyottam Chatterjee","submitted_at":"2018-04-24T02:45:19Z","abstract_excerpt":"We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs. In particular, we present a randomized distributed algorithm for the $G(n,p)$ random graph model, with number of nodes $n$ and $p=\\frac{c\\ln n}{n^{\\delta}}$ (for any constant $0 < \\delta \\leq 1$ and for a suitably large constant $c > 0$), that finds a Hamiltonian cycle with high probability in $\\tilde{O}(n^{\\delta})$ rounds (the notation $\\tilde{O}$ hides a $\\text{polylog}(n)$ factor). Our algorithm works in the (synchronous) CONGEST model (i.e., only $O(\\log n)$-sized messages are comm"},"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":"1804.08819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T02:45:19Z","cross_cats_sorted":[],"title_canon_sha256":"e14b3c59f4ef8b248895215fd51ec22ac5202a34e5788d215bbae7c4cbbb7e39","abstract_canon_sha256":"3e05d0c8930f3d7abd82c76a0c311030aeaf72f722a045e30c98a158b8a923a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:37.237952Z","signature_b64":"a9mCIzeH60Jit+7LIFVPnmTc+HmT+K89u7neDzxxHAWTyIgjmYuwncrPFgDLnloH31in8oFvjYFzEIlKdTNYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"335d0b3c948c0345a434e32052742229752c165261e1da5ff812c705632a905c","last_reissued_at":"2026-05-18T00:17:37.237282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:37.237282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gopal Pandurangan, Nguyen Dinh Pham, Reza Fathi, Soumyottam Chatterjee","submitted_at":"2018-04-24T02:45:19Z","abstract_excerpt":"We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs. In particular, we present a randomized distributed algorithm for the $G(n,p)$ random graph model, with number of nodes $n$ and $p=\\frac{c\\ln n}{n^{\\delta}}$ (for any constant $0 < \\delta \\leq 1$ and for a suitably large constant $c > 0$), that finds a Hamiltonian cycle with high probability in $\\tilde{O}(n^{\\delta})$ rounds (the notation $\\tilde{O}$ hides a $\\text{polylog}(n)$ factor). Our algorithm works in the (synchronous) CONGEST model (i.e., only $O(\\log n)$-sized messages are comm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08819","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":"1804.08819","created_at":"2026-05-18T00:17:37.237411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08819v1","created_at":"2026-05-18T00:17:37.237411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08819","created_at":"2026-05-18T00:17:37.237411+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNOQWPEURQBU","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNOQWPEURQBULJBU","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNOQWPEU","created_at":"2026-05-18T12:32:25.280505+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/GNOQWPEURQBULJBU4MQFE5BCFF","json":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF.json","graph_json":"https://pith.science/api/pith-number/GNOQWPEURQBULJBU4MQFE5BCFF/graph.json","events_json":"https://pith.science/api/pith-number/GNOQWPEURQBULJBU4MQFE5BCFF/events.json","paper":"https://pith.science/paper/GNOQWPEU"},"agent_actions":{"view_html":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF","download_json":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF.json","view_paper":"https://pith.science/paper/GNOQWPEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08819&json=true","fetch_graph":"https://pith.science/api/pith-number/GNOQWPEURQBULJBU4MQFE5BCFF/graph.json","fetch_events":"https://pith.science/api/pith-number/GNOQWPEURQBULJBU4MQFE5BCFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF/action/storage_attestation","attest_author":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF/action/author_attestation","sign_citation":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF/action/citation_signature","submit_replication":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF/action/replication_record"}},"created_at":"2026-05-18T00:17:37.237411+00:00","updated_at":"2026-05-18T00:17:37.237411+00:00"}