{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UV2LQMT5VE4JG6BJ55YM6YMAEQ","short_pith_number":"pith:UV2LQMT5","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"},"canonical_sha256":"a574b8327da938937829ef70cf6180241f34115fedc50ef95bc613656a8c723a","source":{"kind":"arxiv","id":"1805.06728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06728","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06728v1","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06728","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"UV2LQMT5VE4J","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UV2LQMT5VE4JG6BJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UV2LQMT5","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UV2LQMT5VE4JG6BJ55YM6YMAEQ","target":"record","payload":{"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"},"canonical_sha256":"a574b8327da938937829ef70cf6180241f34115fedc50ef95bc613656a8c723a","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"},"source_kind":"arxiv","source_id":"1805.06728","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:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7089dBnRHdJrcEReNrRi3YtF1iwjpMSytTOpOcZiNTXHRrIZ9W1+Bihbf7QdkrmyMGy5ljGhVhALikGWt7sEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:12:29.550664Z"},"content_sha256":"6da0085eb63fee3e55100df1fae255ebe46594762018ff564d4f50efe6405539","schema_version":"1.0","event_id":"sha256:6da0085eb63fee3e55100df1fae255ebe46594762018ff564d4f50efe6405539"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UV2LQMT5VE4JG6BJ55YM6YMAEQ","target":"graph","payload":{"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"},"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:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEWGkvkgn18kJ4XtA2x9GVVRFpvN/0d6XHbkgfs3KIGYZTTCXUkJkTc1ug1xnuDtikJEgw1h8WLo6qHhiRxeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:12:29.551012Z"},"content_sha256":"59866631dcc9cf64015ec5c75c417c6be0c022aa6161b0d65e711a8d002798ba","schema_version":"1.0","event_id":"sha256:59866631dcc9cf64015ec5c75c417c6be0c022aa6161b0d65e711a8d002798ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/bundle.json","state_url":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/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-25T17:12:29Z","links":{"resolver":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ","bundle":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/bundle.json","state":"https://pith.science/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UV2LQMT5VE4JG6BJ55YM6YMAEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UV2LQMT5VE4JG6BJ55YM6YMAEQ","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":"9dd981c4cc7c82dd47f90149cbed09b908da7fc1aef214878e256d8b24370b90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-17T12:38:15Z","title_canon_sha256":"04bcab2cad3d1739dcce20c51e245e548e3fce84d02791d69c2aadbe5f781761"},"schema_version":"1.0","source":{"id":"1805.06728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06728","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06728v1","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06728","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"UV2LQMT5VE4J","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UV2LQMT5VE4JG6BJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UV2LQMT5","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:59866631dcc9cf64015ec5c75c417c6be0c022aa6161b0d65e711a8d002798ba","target":"graph","created_at":"2026-05-18T00:15:43Z","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":"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","authors_text":"Volker Turau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-17T12:38:15Z","title":"A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06728","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:6da0085eb63fee3e55100df1fae255ebe46594762018ff564d4f50efe6405539","target":"record","created_at":"2026-05-18T00:15:43Z","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":"9dd981c4cc7c82dd47f90149cbed09b908da7fc1aef214878e256d8b24370b90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-17T12:38:15Z","title_canon_sha256":"04bcab2cad3d1739dcce20c51e245e548e3fce84d02791d69c2aadbe5f781761"},"schema_version":"1.0","source":{"id":"1805.06728","kind":"arxiv","version":1}},"canonical_sha256":"a574b8327da938937829ef70cf6180241f34115fedc50ef95bc613656a8c723a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a574b8327da938937829ef70cf6180241f34115fedc50ef95bc613656a8c723a","first_computed_at":"2026-05-18T00:15:43.512758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:43.512758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gF8Qz9SaXQqlZY9TqA0hhvFNavOfz5ZXw1kkTKXpqUPY+ZqOpgHyhi/bS0IKZT0a4KyWa422jxqhM/ptY9MgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:43.513243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6da0085eb63fee3e55100df1fae255ebe46594762018ff564d4f50efe6405539","sha256:59866631dcc9cf64015ec5c75c417c6be0c022aa6161b0d65e711a8d002798ba"],"state_sha256":"f85ef89391749fc9858b1c00bc9799abfb17c025f8adac88fe7e2266a1bd001d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BOYB4ky6iyDPPhITOfTcJbnzDOYT4TVscN01CcpJI/waCOf+PR4C1qx10MSvqLO2ZSIPa/4k2lJ+J9TRVFk8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:12:29.552996Z","bundle_sha256":"862fd1efd510e064e99bde91dd1ac950705cb0a86cec9fd027b09962bf1489a1"}}