{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:X2LU4YB7LIBIWQ4LF24BGAWEAW","short_pith_number":"pith:X2LU4YB7","schema_version":"1.0","canonical_sha256":"be974e603f5a028b438b2eb81302c40583bdc538f66ce41915e9e8c059b04d3a","source":{"kind":"arxiv","id":"1507.05690","version":3},"attestation_state":"computed","paper":{"title":"A non-local Random Walk on the Hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Evita Nestoridi","submitted_at":"2015-07-21T02:43:56Z","abstract_excerpt":"This paper studies the random walk on the hypercube $(\\mathbb{Z}/2\\mathbb{Z})^n$ which at each step flips $k$ randomly chosen coordinates. We prove that the mixing time for this walk is of order $\\frac{n}{k} \\log n$. We also prove that if $k=o(n)$, then the walk exhibits cutoff at $\\frac{n}{2k} \\log n$ with window $\\frac{n}{2k} $."},"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":"1507.05690","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-21T02:43:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6d27e56761870334dcfebd7bd71447c8d1967fff391a4cf044260d617ee5a817","abstract_canon_sha256":"e083aecd6f0b96415c81a8fffe532e9346b3f92d9ee10d9e7294bdb6b59fdb17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:45.049681Z","signature_b64":"gHnb+zpXpUUv+xqRz3rnqEve/PNjyhRiupeSy2w7Ci7X5dL5zplyWMak+BL3Bq6HkEnlGkhBWCpCOagWEtKmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be974e603f5a028b438b2eb81302c40583bdc538f66ce41915e9e8c059b04d3a","last_reissued_at":"2026-05-18T00:34:45.048973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:45.048973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A non-local Random Walk on the Hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Evita Nestoridi","submitted_at":"2015-07-21T02:43:56Z","abstract_excerpt":"This paper studies the random walk on the hypercube $(\\mathbb{Z}/2\\mathbb{Z})^n$ which at each step flips $k$ randomly chosen coordinates. We prove that the mixing time for this walk is of order $\\frac{n}{k} \\log n$. We also prove that if $k=o(n)$, then the walk exhibits cutoff at $\\frac{n}{2k} \\log n$ with window $\\frac{n}{2k} $."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05690","kind":"arxiv","version":3},"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":"1507.05690","created_at":"2026-05-18T00:34:45.049094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05690v3","created_at":"2026-05-18T00:34:45.049094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05690","created_at":"2026-05-18T00:34:45.049094+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2LU4YB7LIBI","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2LU4YB7LIBIWQ4L","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2LU4YB7","created_at":"2026-05-18T12:29:47.479230+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/X2LU4YB7LIBIWQ4LF24BGAWEAW","json":"https://pith.science/pith/X2LU4YB7LIBIWQ4LF24BGAWEAW.json","graph_json":"https://pith.science/api/pith-number/X2LU4YB7LIBIWQ4LF24BGAWEAW/graph.json","events_json":"https://pith.science/api/pith-number/X2LU4YB7LIBIWQ4LF24BGAWEAW/events.json","paper":"https://pith.science/paper/X2LU4YB7"},"agent_actions":{"view_html":"https://pith.science/pith/X2LU4YB7LIBIWQ4LF24BGAWEAW","download_json":"https://pith.science/pith/X2LU4YB7LIBIWQ4LF24BGAWEAW.json","view_paper":"https://pith.science/paper/X2LU4YB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05690&json=true","fetch_graph":"https://pith.science/api/pith-number/X2LU4YB7LIBIWQ4LF24BGAWEAW/graph.json","fetch_events":"https://pith.science/api/pith-number/X2LU4YB7LIBIWQ4LF24BGAWEAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2LU4YB7LIBIWQ4LF24BGAWEAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2LU4YB7LIBIWQ4LF24BGAWEAW/action/storage_attestation","attest_author":"https://pith.science/pith/X2LU4YB7LIBIWQ4LF24BGAWEAW/action/author_attestation","sign_citation":"https://pith.science/pith/X2LU4YB7LIBIWQ4LF24BGAWEAW/action/citation_signature","submit_replication":"https://pith.science/pith/X2LU4YB7LIBIWQ4LF24BGAWEAW/action/replication_record"}},"created_at":"2026-05-18T00:34:45.049094+00:00","updated_at":"2026-05-18T00:34:45.049094+00:00"}