{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AWVDMVIFKD7IA2NJ6OVHZ56RYZ","short_pith_number":"pith:AWVDMVIF","schema_version":"1.0","canonical_sha256":"05aa36550550fe8069a9f3aa7cf7d1c64cdf60dcf1c6ab135f68b961a83f2619","source":{"kind":"arxiv","id":"1702.08034","version":3},"attestation_state":"computed","paper":{"title":"Cutoff for Ramanujan graphs via degree inflation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Jonathan Hermon","submitted_at":"2017-02-26T14:01:02Z","abstract_excerpt":"Recently Lubetzky and Peres showed that simple random walks on a sequence of $d$-regular Ramanujan graphs $G_n=(V_n,E_n)$ of increasing sizes exhibit cutoff in total variation around the diameter lower bound $\\frac{d}{d-2}\\log_{d-1}|V_n| $. We provide a different argument under the assumption that for some $r(n) \\gg 1$ the maximal number of simple cycles in a ball of radius $r(n)$ in $G_n$ is uniformly bounded in $n$."},"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":"1702.08034","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-26T14:01:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8d3897111f37b39997c69a4f178e87e4bbccf34c27f8db143dafc3c9763c67e1","abstract_canon_sha256":"2daa325763b00b9e699551e75ac75a20ce72d432a6e70f596344abc75b1a09a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:01.062416Z","signature_b64":"tfttPd65pKo6pXPJJ1r5JEwZgyHRa0ZrC3gz/r9nTJQxC3+dwrKSBfTAJ3gLYNm/EnLTW8RZTBy9VDg/+SXDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05aa36550550fe8069a9f3aa7cf7d1c64cdf60dcf1c6ab135f68b961a83f2619","last_reissued_at":"2026-05-18T00:26:01.061801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:01.061801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutoff for Ramanujan graphs via degree inflation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Jonathan Hermon","submitted_at":"2017-02-26T14:01:02Z","abstract_excerpt":"Recently Lubetzky and Peres showed that simple random walks on a sequence of $d$-regular Ramanujan graphs $G_n=(V_n,E_n)$ of increasing sizes exhibit cutoff in total variation around the diameter lower bound $\\frac{d}{d-2}\\log_{d-1}|V_n| $. We provide a different argument under the assumption that for some $r(n) \\gg 1$ the maximal number of simple cycles in a ball of radius $r(n)$ in $G_n$ is uniformly bounded in $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08034","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":"1702.08034","created_at":"2026-05-18T00:26:01.061883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08034v3","created_at":"2026-05-18T00:26:01.061883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08034","created_at":"2026-05-18T00:26:01.061883+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWVDMVIFKD7I","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWVDMVIFKD7IA2NJ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWVDMVIF","created_at":"2026-05-18T12:31:08.081275+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/AWVDMVIFKD7IA2NJ6OVHZ56RYZ","json":"https://pith.science/pith/AWVDMVIFKD7IA2NJ6OVHZ56RYZ.json","graph_json":"https://pith.science/api/pith-number/AWVDMVIFKD7IA2NJ6OVHZ56RYZ/graph.json","events_json":"https://pith.science/api/pith-number/AWVDMVIFKD7IA2NJ6OVHZ56RYZ/events.json","paper":"https://pith.science/paper/AWVDMVIF"},"agent_actions":{"view_html":"https://pith.science/pith/AWVDMVIFKD7IA2NJ6OVHZ56RYZ","download_json":"https://pith.science/pith/AWVDMVIFKD7IA2NJ6OVHZ56RYZ.json","view_paper":"https://pith.science/paper/AWVDMVIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08034&json=true","fetch_graph":"https://pith.science/api/pith-number/AWVDMVIFKD7IA2NJ6OVHZ56RYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/AWVDMVIFKD7IA2NJ6OVHZ56RYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWVDMVIFKD7IA2NJ6OVHZ56RYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWVDMVIFKD7IA2NJ6OVHZ56RYZ/action/storage_attestation","attest_author":"https://pith.science/pith/AWVDMVIFKD7IA2NJ6OVHZ56RYZ/action/author_attestation","sign_citation":"https://pith.science/pith/AWVDMVIFKD7IA2NJ6OVHZ56RYZ/action/citation_signature","submit_replication":"https://pith.science/pith/AWVDMVIFKD7IA2NJ6OVHZ56RYZ/action/replication_record"}},"created_at":"2026-05-18T00:26:01.061883+00:00","updated_at":"2026-05-18T00:26:01.061883+00:00"}