{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V4MS7KF5W5UGI2OEICM2FMUW5J","short_pith_number":"pith:V4MS7KF5","schema_version":"1.0","canonical_sha256":"af192fa8bdb7686469c44099a2b296ea79656a77fc904ff246dba6f63dc60e02","source":{"kind":"arxiv","id":"1607.01672","version":3},"attestation_state":"computed","paper":{"title":"On sensitivity of uniform mixing times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jonathan Hermon","submitted_at":"2016-07-06T15:30:29Z","abstract_excerpt":"We show that the order of the $L_{\\infty}$-mixing time of simple random walks on a sequence of uniformly bounded degree graphs of size $n$ may increase by an optimal factor of $\\Theta( \\log \\log n)$ as a result of a bounded perturbation of the edge weights. This answers a question and a conjecture of Kozma."},"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":"1607.01672","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-06T15:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"4c451191e984b420e9c792c9a1f904f91385b2436bee57b9c5ce2dc887609470","abstract_canon_sha256":"06392ef9880ae1af4564eedb2a11edc1e4887fb25b73d085676d62efc6532e08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:40.442177Z","signature_b64":"WB2+3CprmFw3xPtzpNJQ1O2VEYWciatFj3Q5dAg7u9AeXG7cAVxHh3LoP1dAS+MkhJpLTjHZQIhC9fDqrBSmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af192fa8bdb7686469c44099a2b296ea79656a77fc904ff246dba6f63dc60e02","last_reissued_at":"2026-05-18T00:22:40.441747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:40.441747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sensitivity of uniform mixing times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jonathan Hermon","submitted_at":"2016-07-06T15:30:29Z","abstract_excerpt":"We show that the order of the $L_{\\infty}$-mixing time of simple random walks on a sequence of uniformly bounded degree graphs of size $n$ may increase by an optimal factor of $\\Theta( \\log \\log n)$ as a result of a bounded perturbation of the edge weights. This answers a question and a conjecture of Kozma."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01672","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":"1607.01672","created_at":"2026-05-18T00:22:40.441819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01672v3","created_at":"2026-05-18T00:22:40.441819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01672","created_at":"2026-05-18T00:22:40.441819+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4MS7KF5W5UG","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4MS7KF5W5UGI2OE","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4MS7KF5","created_at":"2026-05-18T12:30:46.583412+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/V4MS7KF5W5UGI2OEICM2FMUW5J","json":"https://pith.science/pith/V4MS7KF5W5UGI2OEICM2FMUW5J.json","graph_json":"https://pith.science/api/pith-number/V4MS7KF5W5UGI2OEICM2FMUW5J/graph.json","events_json":"https://pith.science/api/pith-number/V4MS7KF5W5UGI2OEICM2FMUW5J/events.json","paper":"https://pith.science/paper/V4MS7KF5"},"agent_actions":{"view_html":"https://pith.science/pith/V4MS7KF5W5UGI2OEICM2FMUW5J","download_json":"https://pith.science/pith/V4MS7KF5W5UGI2OEICM2FMUW5J.json","view_paper":"https://pith.science/paper/V4MS7KF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01672&json=true","fetch_graph":"https://pith.science/api/pith-number/V4MS7KF5W5UGI2OEICM2FMUW5J/graph.json","fetch_events":"https://pith.science/api/pith-number/V4MS7KF5W5UGI2OEICM2FMUW5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4MS7KF5W5UGI2OEICM2FMUW5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4MS7KF5W5UGI2OEICM2FMUW5J/action/storage_attestation","attest_author":"https://pith.science/pith/V4MS7KF5W5UGI2OEICM2FMUW5J/action/author_attestation","sign_citation":"https://pith.science/pith/V4MS7KF5W5UGI2OEICM2FMUW5J/action/citation_signature","submit_replication":"https://pith.science/pith/V4MS7KF5W5UGI2OEICM2FMUW5J/action/replication_record"}},"created_at":"2026-05-18T00:22:40.441819+00:00","updated_at":"2026-05-18T00:22:40.441819+00:00"}