{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G5REPRISVAGUCLVH7S3HQACLF2","short_pith_number":"pith:G5REPRIS","schema_version":"1.0","canonical_sha256":"376247c512a80d412ea7fcb678004b2ea179ab1816bf33c481871eb7630bb173","source":{"kind":"arxiv","id":"1605.04585","version":2},"attestation_state":"computed","paper":{"title":"Small subgraphs in the trace of a random walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich, Peleg Michaeli","submitted_at":"2016-05-15T18:03:56Z","abstract_excerpt":"We consider the combinatorial properties of the trace of a random walk on the complete graph and on the random graph $G(n,p)$. In particular, we study the appearance of a fixed subgraph in the trace. We prove that for a subgraph containing a cycle, the threshold for its appearance in the trace of a random walk of length $m$ is essentially equal to the threshold for its appearance in the random graph drawn from $G(n,m)$. In the case where the base graph is the complete graph, we show that a fixed forest appears in the trace typically much earlier than it appears in $G(n,m)$."},"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":"1605.04585","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-15T18:03:56Z","cross_cats_sorted":[],"title_canon_sha256":"7ca2d68a8d60ba1cd12d065a88fa5faf1e1e0bd92a6b85a58246e23ae0c21964","abstract_canon_sha256":"2cc9fa392b083ed4db0cc4b81fdd347687f2f1e4912352094627075a56327aa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:47:27.870659Z","signature_b64":"c6B4Bz6pdZWK+hvSnMM+Zva4HZBiOp+KnX4u8kCUB4n0bi2ahaUY1Q23csHxACl20Yw/5WU14NLFZZ74i8bgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"376247c512a80d412ea7fcb678004b2ea179ab1816bf33c481871eb7630bb173","last_reissued_at":"2026-07-05T01:47:27.870053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:47:27.870053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small subgraphs in the trace of a random walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich, Peleg Michaeli","submitted_at":"2016-05-15T18:03:56Z","abstract_excerpt":"We consider the combinatorial properties of the trace of a random walk on the complete graph and on the random graph $G(n,p)$. In particular, we study the appearance of a fixed subgraph in the trace. We prove that for a subgraph containing a cycle, the threshold for its appearance in the trace of a random walk of length $m$ is essentially equal to the threshold for its appearance in the random graph drawn from $G(n,m)$. In the case where the base graph is the complete graph, we show that a fixed forest appears in the trace typically much earlier than it appears in $G(n,m)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04585","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1605.04585/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1605.04585","created_at":"2026-07-05T01:47:27.870183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04585v2","created_at":"2026-07-05T01:47:27.870183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04585","created_at":"2026-07-05T01:47:27.870183+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5REPRISVAGU","created_at":"2026-07-05T01:47:27.870183+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5REPRISVAGUCLVH","created_at":"2026-07-05T01:47:27.870183+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5REPRIS","created_at":"2026-07-05T01:47:27.870183+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/G5REPRISVAGUCLVH7S3HQACLF2","json":"https://pith.science/pith/G5REPRISVAGUCLVH7S3HQACLF2.json","graph_json":"https://pith.science/api/pith-number/G5REPRISVAGUCLVH7S3HQACLF2/graph.json","events_json":"https://pith.science/api/pith-number/G5REPRISVAGUCLVH7S3HQACLF2/events.json","paper":"https://pith.science/paper/G5REPRIS"},"agent_actions":{"view_html":"https://pith.science/pith/G5REPRISVAGUCLVH7S3HQACLF2","download_json":"https://pith.science/pith/G5REPRISVAGUCLVH7S3HQACLF2.json","view_paper":"https://pith.science/paper/G5REPRIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04585&json=true","fetch_graph":"https://pith.science/api/pith-number/G5REPRISVAGUCLVH7S3HQACLF2/graph.json","fetch_events":"https://pith.science/api/pith-number/G5REPRISVAGUCLVH7S3HQACLF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5REPRISVAGUCLVH7S3HQACLF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5REPRISVAGUCLVH7S3HQACLF2/action/storage_attestation","attest_author":"https://pith.science/pith/G5REPRISVAGUCLVH7S3HQACLF2/action/author_attestation","sign_citation":"https://pith.science/pith/G5REPRISVAGUCLVH7S3HQACLF2/action/citation_signature","submit_replication":"https://pith.science/pith/G5REPRISVAGUCLVH7S3HQACLF2/action/replication_record"}},"created_at":"2026-07-05T01:47:27.870183+00:00","updated_at":"2026-07-05T01:47:27.870183+00:00"}