{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GNOQWPEURQBULJBU4MQFE5BCFF","short_pith_number":"pith:GNOQWPEU","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"},"canonical_sha256":"335d0b3c948c0345a434e32052742229752c165261e1da5ff812c705632a905c","source":{"kind":"arxiv","id":"1804.08819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08819","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08819v1","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08819","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"GNOQWPEURQBU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GNOQWPEURQBULJBU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GNOQWPEU","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GNOQWPEURQBULJBU4MQFE5BCFF","target":"record","payload":{"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"},"canonical_sha256":"335d0b3c948c0345a434e32052742229752c165261e1da5ff812c705632a905c","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"},"source_kind":"arxiv","source_id":"1804.08819","source_version":1,"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-18T00:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLCflwe/Q5UKq54JWYCJehb0dBeUhcS+qWzUbDpGU/Q518XvfmPpY+zbSkoTP4PcUvyMYjO7V5nkFOhlsQoKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:30:12.075677Z"},"content_sha256":"259e5aa1492312af615d8ec64406c18be8af50a34e7a3ea39ce9ee403cd6ce69","schema_version":"1.0","event_id":"sha256:259e5aa1492312af615d8ec64406c18be8af50a34e7a3ea39ce9ee403cd6ce69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GNOQWPEURQBULJBU4MQFE5BCFF","target":"graph","payload":{"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"},"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-18T00:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwwGdsUygDhDDaMcz+7BF7oSte1/mPaitQO8ozYVw3bNr0m3oSvCsHE/8O6P39ZHjXmwYnV0Np2W8ZE+ll/IAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:30:12.076033Z"},"content_sha256":"edb289194c3ec388f792e783b81f64be7839178323b62e42697fb3233381067b","schema_version":"1.0","event_id":"sha256:edb289194c3ec388f792e783b81f64be7839178323b62e42697fb3233381067b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF/bundle.json","state_url":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNOQWPEURQBULJBU4MQFE5BCFF/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-06-30T20:30:12Z","links":{"resolver":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF","bundle":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF/bundle.json","state":"https://pith.science/pith/GNOQWPEURQBULJBU4MQFE5BCFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNOQWPEURQBULJBU4MQFE5BCFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GNOQWPEURQBULJBU4MQFE5BCFF","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":"3e05d0c8930f3d7abd82c76a0c311030aeaf72f722a045e30c98a158b8a923a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T02:45:19Z","title_canon_sha256":"e14b3c59f4ef8b248895215fd51ec22ac5202a34e5788d215bbae7c4cbbb7e39"},"schema_version":"1.0","source":{"id":"1804.08819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08819","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08819v1","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08819","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"GNOQWPEURQBU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GNOQWPEURQBULJBU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GNOQWPEU","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:edb289194c3ec388f792e783b81f64be7839178323b62e42697fb3233381067b","target":"graph","created_at":"2026-05-18T00:17:37Z","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 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","authors_text":"Gopal Pandurangan, Nguyen Dinh Pham, Reza Fathi, Soumyottam Chatterjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T02:45:19Z","title":"Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08819","kind":"arxiv","version":1},"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:259e5aa1492312af615d8ec64406c18be8af50a34e7a3ea39ce9ee403cd6ce69","target":"record","created_at":"2026-05-18T00:17:37Z","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":"3e05d0c8930f3d7abd82c76a0c311030aeaf72f722a045e30c98a158b8a923a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T02:45:19Z","title_canon_sha256":"e14b3c59f4ef8b248895215fd51ec22ac5202a34e5788d215bbae7c4cbbb7e39"},"schema_version":"1.0","source":{"id":"1804.08819","kind":"arxiv","version":1}},"canonical_sha256":"335d0b3c948c0345a434e32052742229752c165261e1da5ff812c705632a905c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"335d0b3c948c0345a434e32052742229752c165261e1da5ff812c705632a905c","first_computed_at":"2026-05-18T00:17:37.237282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:37.237282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a9mCIzeH60Jit+7LIFVPnmTc+HmT+K89u7neDzxxHAWTyIgjmYuwncrPFgDLnloH31in8oFvjYFzEIlKdTNYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:37.237952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:259e5aa1492312af615d8ec64406c18be8af50a34e7a3ea39ce9ee403cd6ce69","sha256:edb289194c3ec388f792e783b81f64be7839178323b62e42697fb3233381067b"],"state_sha256":"de9df1dd638fce82380aa959df0d53bb95751b1381b57f351e2b62a92776e762"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkdzt+9D2lTDpm0dLTeybM/lphYhelujkj+x9CkusQAPT08pVuc6lMe7QeaU/wpiSadQ2MSskpPeI+QWDw7wCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:30:12.078101Z","bundle_sha256":"44e7936bc014041dbf8b6bcb84a5c9d2d64569499e31d2e5357551574ef40866"}}