{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VT7YG55FKN3MPWY63BPV4PVVMH","short_pith_number":"pith:VT7YG55F","schema_version":"1.0","canonical_sha256":"acff8377a55376c7db1ed85f5e3eb561ddeca0a53106113ec7260d7a5fb0905b","source":{"kind":"arxiv","id":"1508.01977","version":2},"attestation_state":"computed","paper":{"title":"The Mixing Time of the Dikin Walk in a Polytope - A Simple Proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Nisheeth K. Vishnoi, Sushant Sachdeva","submitted_at":"2015-08-09T02:55:52Z","abstract_excerpt":"We study the mixing time of the Dikin walk in a polytope - a random walk based on the log-barrier from the interior point method literature. This walk, and a close variant, were studied by Narayanan (2016) and Kannan-Narayanan (2012). Bounds on its mixing time are important for algorithms for sampling and optimization over polytopes. Here, we provide a simple proof of their result that this random walk mixes in time O(mn) for an n-dimensional polytope described using m inequalities."},"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":"1508.01977","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-09T02:55:52Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ebd2bff9f16fefc185d5fcaceae08b0d1bde7f0277eca21a6fe0737c4011ff58","abstract_canon_sha256":"b057715c20a6d4220dd0e32d493d0d9bc6461f15b468eb4d92e31a8c1eaa9f23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:36.536221Z","signature_b64":"hLa8o9ko4uZHnGBa5T2b2BxRElaA85/X4J13fJNLekv9qO8NJOI9BmKCo0uphInjve5WFCfYVq9IS7QwNXscDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acff8377a55376c7db1ed85f5e3eb561ddeca0a53106113ec7260d7a5fb0905b","last_reissued_at":"2026-05-18T01:09:36.535831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:36.535831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Mixing Time of the Dikin Walk in a Polytope - A Simple Proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Nisheeth K. Vishnoi, Sushant Sachdeva","submitted_at":"2015-08-09T02:55:52Z","abstract_excerpt":"We study the mixing time of the Dikin walk in a polytope - a random walk based on the log-barrier from the interior point method literature. This walk, and a close variant, were studied by Narayanan (2016) and Kannan-Narayanan (2012). Bounds on its mixing time are important for algorithms for sampling and optimization over polytopes. Here, we provide a simple proof of their result that this random walk mixes in time O(mn) for an n-dimensional polytope described using m inequalities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01977","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":"1508.01977","created_at":"2026-05-18T01:09:36.535889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01977v2","created_at":"2026-05-18T01:09:36.535889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01977","created_at":"2026-05-18T01:09:36.535889+00:00"},{"alias_kind":"pith_short_12","alias_value":"VT7YG55FKN3M","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VT7YG55FKN3MPWY6","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VT7YG55F","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/VT7YG55FKN3MPWY63BPV4PVVMH","json":"https://pith.science/pith/VT7YG55FKN3MPWY63BPV4PVVMH.json","graph_json":"https://pith.science/api/pith-number/VT7YG55FKN3MPWY63BPV4PVVMH/graph.json","events_json":"https://pith.science/api/pith-number/VT7YG55FKN3MPWY63BPV4PVVMH/events.json","paper":"https://pith.science/paper/VT7YG55F"},"agent_actions":{"view_html":"https://pith.science/pith/VT7YG55FKN3MPWY63BPV4PVVMH","download_json":"https://pith.science/pith/VT7YG55FKN3MPWY63BPV4PVVMH.json","view_paper":"https://pith.science/paper/VT7YG55F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01977&json=true","fetch_graph":"https://pith.science/api/pith-number/VT7YG55FKN3MPWY63BPV4PVVMH/graph.json","fetch_events":"https://pith.science/api/pith-number/VT7YG55FKN3MPWY63BPV4PVVMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VT7YG55FKN3MPWY63BPV4PVVMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VT7YG55FKN3MPWY63BPV4PVVMH/action/storage_attestation","attest_author":"https://pith.science/pith/VT7YG55FKN3MPWY63BPV4PVVMH/action/author_attestation","sign_citation":"https://pith.science/pith/VT7YG55FKN3MPWY63BPV4PVVMH/action/citation_signature","submit_replication":"https://pith.science/pith/VT7YG55FKN3MPWY63BPV4PVVMH/action/replication_record"}},"created_at":"2026-05-18T01:09:36.535889+00:00","updated_at":"2026-05-18T01:09:36.535889+00:00"}