{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JDVCF6AJ37LXH2TUJ5F7WJEACY","short_pith_number":"pith:JDVCF6AJ","schema_version":"1.0","canonical_sha256":"48ea22f809dfd773ea744f4bfb2480160f48aaa563a9576a44d571a6c1f1ecaf","source":{"kind":"arxiv","id":"1105.4402","version":2},"attestation_state":"computed","paper":{"title":"Mixing of the upper triangular matrix walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Allan Sly, Yuval Peres","submitted_at":"2011-05-23T04:59:09Z","abstract_excerpt":"We study a natural random walk over the upper triangular matrices, with entries in the field $\\Z_2$, generated by steps which add row $i+1$ to row $i$. We show that the mixing time of the lazy random walk is $O(n^2)$ which is optimal up to constants. Our proof makes key use of the linear structure of the group and extends to walks on the upper triangular matrices over the fields $\\Z_q$ for $q$ prime."},"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":"1105.4402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-05-23T04:59:09Z","cross_cats_sorted":[],"title_canon_sha256":"b2088a306e1934974aebcfc34075ab7bab1ec1a9991f218d22b39664aa812136","abstract_canon_sha256":"14409e5aed7f2c59ef2cd433cf08f27b61b3ceed0c3fdd8a66ab218870802af9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:10.348577Z","signature_b64":"iTvetjqq1w6/OzRox30iMWnFcscckWdMnKLpBmpOt+0vbxhx+Qk+Ml3O5T3E5o/qcxueyXQ+1oI0viGqEksEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48ea22f809dfd773ea744f4bfb2480160f48aaa563a9576a44d571a6c1f1ecaf","last_reissued_at":"2026-05-18T04:21:10.348076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:10.348076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing of the upper triangular matrix walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Allan Sly, Yuval Peres","submitted_at":"2011-05-23T04:59:09Z","abstract_excerpt":"We study a natural random walk over the upper triangular matrices, with entries in the field $\\Z_2$, generated by steps which add row $i+1$ to row $i$. We show that the mixing time of the lazy random walk is $O(n^2)$ which is optimal up to constants. Our proof makes key use of the linear structure of the group and extends to walks on the upper triangular matrices over the fields $\\Z_q$ for $q$ prime."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4402","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.4402","created_at":"2026-05-18T04:21:10.348165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4402v2","created_at":"2026-05-18T04:21:10.348165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4402","created_at":"2026-05-18T04:21:10.348165+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDVCF6AJ37LX","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDVCF6AJ37LXH2TU","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDVCF6AJ","created_at":"2026-05-18T12:26:32.869790+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/JDVCF6AJ37LXH2TUJ5F7WJEACY","json":"https://pith.science/pith/JDVCF6AJ37LXH2TUJ5F7WJEACY.json","graph_json":"https://pith.science/api/pith-number/JDVCF6AJ37LXH2TUJ5F7WJEACY/graph.json","events_json":"https://pith.science/api/pith-number/JDVCF6AJ37LXH2TUJ5F7WJEACY/events.json","paper":"https://pith.science/paper/JDVCF6AJ"},"agent_actions":{"view_html":"https://pith.science/pith/JDVCF6AJ37LXH2TUJ5F7WJEACY","download_json":"https://pith.science/pith/JDVCF6AJ37LXH2TUJ5F7WJEACY.json","view_paper":"https://pith.science/paper/JDVCF6AJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4402&json=true","fetch_graph":"https://pith.science/api/pith-number/JDVCF6AJ37LXH2TUJ5F7WJEACY/graph.json","fetch_events":"https://pith.science/api/pith-number/JDVCF6AJ37LXH2TUJ5F7WJEACY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDVCF6AJ37LXH2TUJ5F7WJEACY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDVCF6AJ37LXH2TUJ5F7WJEACY/action/storage_attestation","attest_author":"https://pith.science/pith/JDVCF6AJ37LXH2TUJ5F7WJEACY/action/author_attestation","sign_citation":"https://pith.science/pith/JDVCF6AJ37LXH2TUJ5F7WJEACY/action/citation_signature","submit_replication":"https://pith.science/pith/JDVCF6AJ37LXH2TUJ5F7WJEACY/action/replication_record"}},"created_at":"2026-05-18T04:21:10.348165+00:00","updated_at":"2026-05-18T04:21:10.348165+00:00"}