{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CKAWRWXBOMOSNDGZASJ7SESUXH","short_pith_number":"pith:CKAWRWXB","canonical_record":{"source":{"id":"1508.07355","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-28T21:33:19Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"aa4238dade03fe7eb4f839e2bc4a83368dc7ad9cbb4aea043e4a9aa160d1bf77","abstract_canon_sha256":"4f69d0b71ccd1da45f1865aff288a4260bd37e1f61fdcbd5ef0710ea9fdcef77"},"schema_version":"1.0"},"canonical_sha256":"128168dae1731d268cd90493f91254b9c47c8b03eaea5feab57df72b6c7cc986","source":{"kind":"arxiv","id":"1508.07355","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07355","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07355v2","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07355","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"CKAWRWXBOMOS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CKAWRWXBOMOSNDGZ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CKAWRWXB","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CKAWRWXBOMOSNDGZASJ7SESUXH","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07355","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-28T21:33:19Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"aa4238dade03fe7eb4f839e2bc4a83368dc7ad9cbb4aea043e4a9aa160d1bf77","abstract_canon_sha256":"4f69d0b71ccd1da45f1865aff288a4260bd37e1f61fdcbd5ef0710ea9fdcef77"},"schema_version":"1.0"},"canonical_sha256":"128168dae1731d268cd90493f91254b9c47c8b03eaea5feab57df72b6c7cc986","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:19.200297Z","signature_b64":"QIJnwSq5nWbVxVxeL+Fmv/p1dOopeApeghS3O1lY+tkknhjEOa/4iJ96i0NhNu/QNVxdW04f3ZYXzSzQBLpbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"128168dae1731d268cd90493f91254b9c47c8b03eaea5feab57df72b6c7cc986","last_reissued_at":"2026-05-18T00:28:19.199529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:19.199529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07355","source_version":2,"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:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XiVH48GBw4ap64fpxMqFmRo/dI9JYxdVXW4lBIrpwBSl9mWu4hSqD9gdx7osVmgRR0ytfzY8loCvuztian8OAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:57:44.267414Z"},"content_sha256":"40a5e41f98f754ba74558f2d282ffb92e3f59d533ae17a39c40e6483feb49e04","schema_version":"1.0","event_id":"sha256:40a5e41f98f754ba74558f2d282ffb92e3f59d533ae17a39c40e6483feb49e04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CKAWRWXBOMOSNDGZASJ7SESUXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the trace of random walks on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Michael Krivelevich, Peleg Michaeli, Ron Peled","submitted_at":"2015-08-28T21:33:19Z","abstract_excerpt":"We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\\varepsilon)n\\ln{n}$ on the random graph $G\\sim G(n,p)$ for $p>C\\ln{n}/n$ is, with high probability, Hamiltonian and $\\Theta(\\ln{n})$-connected. In the special case $p=1$ (i.e. when $G=K_n$), we show a hitting time result according to which, with high probability, exactly one step after the last vertex has been visited, the trace becomes Hamiltonian, and one step after the last vertex has been vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07355","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"},"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:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0f5f/Q2e5qnVYnx134lp3aVWIfgdde6f756goo4IvWNT5DWR/G5z3tkk5yM7WACa8rAjogj6BtguAURt3NriDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:57:44.268092Z"},"content_sha256":"43257f420d7f55c4b369d9458a882928e73ce8bdb2f30ef5219748a212750e93","schema_version":"1.0","event_id":"sha256:43257f420d7f55c4b369d9458a882928e73ce8bdb2f30ef5219748a212750e93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKAWRWXBOMOSNDGZASJ7SESUXH/bundle.json","state_url":"https://pith.science/pith/CKAWRWXBOMOSNDGZASJ7SESUXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKAWRWXBOMOSNDGZASJ7SESUXH/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-05-25T21:57:44Z","links":{"resolver":"https://pith.science/pith/CKAWRWXBOMOSNDGZASJ7SESUXH","bundle":"https://pith.science/pith/CKAWRWXBOMOSNDGZASJ7SESUXH/bundle.json","state":"https://pith.science/pith/CKAWRWXBOMOSNDGZASJ7SESUXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKAWRWXBOMOSNDGZASJ7SESUXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CKAWRWXBOMOSNDGZASJ7SESUXH","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":"4f69d0b71ccd1da45f1865aff288a4260bd37e1f61fdcbd5ef0710ea9fdcef77","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-28T21:33:19Z","title_canon_sha256":"aa4238dade03fe7eb4f839e2bc4a83368dc7ad9cbb4aea043e4a9aa160d1bf77"},"schema_version":"1.0","source":{"id":"1508.07355","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07355","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07355v2","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07355","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"CKAWRWXBOMOS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CKAWRWXBOMOSNDGZ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CKAWRWXB","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:43257f420d7f55c4b369d9458a882928e73ce8bdb2f30ef5219748a212750e93","target":"graph","created_at":"2026-05-18T00:28:19Z","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 study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\\varepsilon)n\\ln{n}$ on the random graph $G\\sim G(n,p)$ for $p>C\\ln{n}/n$ is, with high probability, Hamiltonian and $\\Theta(\\ln{n})$-connected. In the special case $p=1$ (i.e. when $G=K_n$), we show a hitting time result according to which, with high probability, exactly one step after the last vertex has been visited, the trace becomes Hamiltonian, and one step after the last vertex has been vi","authors_text":"Alan Frieze, Michael Krivelevich, Peleg Michaeli, Ron Peled","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-28T21:33:19Z","title":"On the trace of random walks on random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07355","kind":"arxiv","version":2},"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:40a5e41f98f754ba74558f2d282ffb92e3f59d533ae17a39c40e6483feb49e04","target":"record","created_at":"2026-05-18T00:28:19Z","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":"4f69d0b71ccd1da45f1865aff288a4260bd37e1f61fdcbd5ef0710ea9fdcef77","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-28T21:33:19Z","title_canon_sha256":"aa4238dade03fe7eb4f839e2bc4a83368dc7ad9cbb4aea043e4a9aa160d1bf77"},"schema_version":"1.0","source":{"id":"1508.07355","kind":"arxiv","version":2}},"canonical_sha256":"128168dae1731d268cd90493f91254b9c47c8b03eaea5feab57df72b6c7cc986","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"128168dae1731d268cd90493f91254b9c47c8b03eaea5feab57df72b6c7cc986","first_computed_at":"2026-05-18T00:28:19.199529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:19.199529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QIJnwSq5nWbVxVxeL+Fmv/p1dOopeApeghS3O1lY+tkknhjEOa/4iJ96i0NhNu/QNVxdW04f3ZYXzSzQBLpbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:19.200297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07355","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40a5e41f98f754ba74558f2d282ffb92e3f59d533ae17a39c40e6483feb49e04","sha256:43257f420d7f55c4b369d9458a882928e73ce8bdb2f30ef5219748a212750e93"],"state_sha256":"12d8e20b20047b020f332a04f67f8bb093fa9617a0db3eb4ce6d4917a30b5832"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOTfKeU/A5si33JPyWIUyTdERVBvyVGPV4uwEAD6N+pPKLMXCrUXhMiC8f7QH7ceiL/JYgYZCiozXK059la3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:57:44.271575Z","bundle_sha256":"1df78dcc598a9e773ba05b9824ab6ff6cf235248284589b87e51cde330edd039"}}