{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YOEHMPPRVX3HSO5FMLLXTE35HE","short_pith_number":"pith:YOEHMPPR","schema_version":"1.0","canonical_sha256":"c388763df1adf6793ba562d779937d391ac69aa288b82ae42947b7d9204001a5","source":{"kind":"arxiv","id":"2605.27212","version":1},"attestation_state":"computed","paper":{"title":"Mixing on $k$ Columns of the Transvection Walk","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Aaron Smith, Natesh Pillai","submitted_at":"2026-05-26T16:03:23Z","abstract_excerpt":"In Diaconis and Saloff-Coste (1996), the authors introduced the simple ``transvection\" walk on $\\mathrm{GL}_n(\\mathbb F_2)$: at each step, choose two distinct rows and add one to the other. In Ben-Hamou (2025), the author recently proved that this walk has mixing time $O(n^2\\log n)$. Inspired by applications in cryptography (see Sotiraki (2016)), Ben-Hamou and Peres (2018) conjectured that the first $k$ columns of this walk mixed in $O(nk \\log(n))$ steps. Our main result is a proof of this conjecture uniformly in $n$ and $k.$\n  Our proof is based on a local-to-global entropy estimate, in the s"},"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":"2605.27212","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-05-26T16:03:23Z","cross_cats_sorted":[],"title_canon_sha256":"2b5c4fadda15dcbcad0ae52b152507bf5d1e60a3fa5c7777a3dd572e8ce64f3f","abstract_canon_sha256":"c0299ae35c7ee4dcf458019c2b5982d5b2e0d4c2b8fa170594fa9fee03d0b886"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:05:48.310483Z","signature_b64":"r8h3OmZcISKtKz2+HKHkd6Bv/R9JVKFeteWkJnjPtzTzk8DXAEPmR/xPjASyNkdkYrGdT+Uu8T8+i4eTpwZQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c388763df1adf6793ba562d779937d391ac69aa288b82ae42947b7d9204001a5","last_reissued_at":"2026-05-27T02:05:48.309771Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:05:48.309771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing on $k$ Columns of the Transvection Walk","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Aaron Smith, Natesh Pillai","submitted_at":"2026-05-26T16:03:23Z","abstract_excerpt":"In Diaconis and Saloff-Coste (1996), the authors introduced the simple ``transvection\" walk on $\\mathrm{GL}_n(\\mathbb F_2)$: at each step, choose two distinct rows and add one to the other. In Ben-Hamou (2025), the author recently proved that this walk has mixing time $O(n^2\\log n)$. Inspired by applications in cryptography (see Sotiraki (2016)), Ben-Hamou and Peres (2018) conjectured that the first $k$ columns of this walk mixed in $O(nk \\log(n))$ steps. Our main result is a proof of this conjecture uniformly in $n$ and $k.$\n  Our proof is based on a local-to-global entropy estimate, in the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27212","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.27212/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":"2605.27212","created_at":"2026-05-27T02:05:48.309859+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27212v1","created_at":"2026-05-27T02:05:48.309859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27212","created_at":"2026-05-27T02:05:48.309859+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOEHMPPRVX3H","created_at":"2026-05-27T02:05:48.309859+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOEHMPPRVX3HSO5F","created_at":"2026-05-27T02:05:48.309859+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOEHMPPR","created_at":"2026-05-27T02:05:48.309859+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/YOEHMPPRVX3HSO5FMLLXTE35HE","json":"https://pith.science/pith/YOEHMPPRVX3HSO5FMLLXTE35HE.json","graph_json":"https://pith.science/api/pith-number/YOEHMPPRVX3HSO5FMLLXTE35HE/graph.json","events_json":"https://pith.science/api/pith-number/YOEHMPPRVX3HSO5FMLLXTE35HE/events.json","paper":"https://pith.science/paper/YOEHMPPR"},"agent_actions":{"view_html":"https://pith.science/pith/YOEHMPPRVX3HSO5FMLLXTE35HE","download_json":"https://pith.science/pith/YOEHMPPRVX3HSO5FMLLXTE35HE.json","view_paper":"https://pith.science/paper/YOEHMPPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27212&json=true","fetch_graph":"https://pith.science/api/pith-number/YOEHMPPRVX3HSO5FMLLXTE35HE/graph.json","fetch_events":"https://pith.science/api/pith-number/YOEHMPPRVX3HSO5FMLLXTE35HE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOEHMPPRVX3HSO5FMLLXTE35HE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOEHMPPRVX3HSO5FMLLXTE35HE/action/storage_attestation","attest_author":"https://pith.science/pith/YOEHMPPRVX3HSO5FMLLXTE35HE/action/author_attestation","sign_citation":"https://pith.science/pith/YOEHMPPRVX3HSO5FMLLXTE35HE/action/citation_signature","submit_replication":"https://pith.science/pith/YOEHMPPRVX3HSO5FMLLXTE35HE/action/replication_record"}},"created_at":"2026-05-27T02:05:48.309859+00:00","updated_at":"2026-05-27T02:05:48.309859+00:00"}