{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7IWYK23FGKX53QDZ3WRAQVQNKL","short_pith_number":"pith:7IWYK23F","schema_version":"1.0","canonical_sha256":"fa2d856b6532afddc079dda208560d52db897a84944431639ce6473d76040055","source":{"kind":"arxiv","id":"2605.04414","version":2},"attestation_state":"computed","paper":{"title":"Uniform Mixing in Chiral Quantum Walks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Unitary signings allow complete graphs to achieve probabilistic uniform mixing in continuous-time quantum walks.","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Benjamin Mustico, Christino Tamon, Gabriel Tucker, Hanmeng Zhan, Jessy Jacob Mesapam, Luke Levine","submitted_at":"2026-05-06T02:12:09Z","abstract_excerpt":"This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing $\\sigma$, the complete graph $K^\\sigma_n$ has probabilistic uniform mixing. In contrast, Ahmadi \\etal (2003) proved that no complete graph has uniform mixing except for $K_2$, $K_3$, and $K_4$. Our technique is based on a stopping rule for quantum walks which reduces global to local uniform mixing. As a corollary, we found an orientation of $H(n,4)$ that mixes to uniform faster than any other Hamming graphs, which improves a result of Godsil and Zhan (2019). We also show that there are inf"},"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.04414","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-06T02:12:09Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"7152a3b56ddde927f1058083f51b5b1af41f47e88ed6534f5068222cbff04a2e","abstract_canon_sha256":"5f2ddded99182a35d6ccc4539c4bec21fd5a802b7b45c7566b30f8cb366be641"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:34.269845Z","signature_b64":"1pSHXPuHYdeiidIxlodq5Eg5C2Ha6Y6zLnPIrfFXwc2sjDnrlDvOT34FmAezl8KZWCBsGAIm5vaXUfYtUI/lAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa2d856b6532afddc079dda208560d52db897a84944431639ce6473d76040055","last_reissued_at":"2026-05-20T00:04:34.269044Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:34.269044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform Mixing in Chiral Quantum Walks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Unitary signings allow complete graphs to achieve probabilistic uniform mixing in continuous-time quantum walks.","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Benjamin Mustico, Christino Tamon, Gabriel Tucker, Hanmeng Zhan, Jessy Jacob Mesapam, Luke Levine","submitted_at":"2026-05-06T02:12:09Z","abstract_excerpt":"This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing $\\sigma$, the complete graph $K^\\sigma_n$ has probabilistic uniform mixing. In contrast, Ahmadi \\etal (2003) proved that no complete graph has uniform mixing except for $K_2$, $K_3$, and $K_4$. Our technique is based on a stopping rule for quantum walks which reduces global to local uniform mixing. As a corollary, we found an orientation of $H(n,4)$ that mixes to uniform faster than any other Hamming graphs, which improves a result of Godsil and Zhan (2019). We also show that there are inf"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For some unitary signing σ the complete graph K^σ_n has probabilistic uniform mixing. There are infinite families of oriented circulants with average uniform mixing, a chiral violation of Godsil's No-Go theorem.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The existence of a suitable unitary signing σ or orientation that satisfies the local uniform mixing condition via the stopping rule technique; the paper assumes the quantum walk model on these signed graphs behaves as described without additional decoherence or implementation constraints.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Signed complete graphs and oriented circulants exhibit uniform mixing in quantum walks, providing a chiral violation of Godsil's no-go theorem for average mixing.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Unitary signings allow complete graphs to achieve probabilistic uniform mixing in continuous-time quantum walks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ea7ffd5c248a966cf1ddf61eca0ba1edfc04656201113960cbd057dbee7d8f8c"},"source":{"id":"2605.04414","kind":"arxiv","version":2},"verdict":{"id":"6b0466a2-ee24-48b9-8df5-0f49bd435840","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T16:03:59.252476Z","strongest_claim":"For some unitary signing σ the complete graph K^σ_n has probabilistic uniform mixing. There are infinite families of oriented circulants with average uniform mixing, a chiral violation of Godsil's No-Go theorem.","one_line_summary":"Signed complete graphs and oriented circulants exhibit uniform mixing in quantum walks, providing a chiral violation of Godsil's no-go theorem for average mixing.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The existence of a suitable unitary signing σ or orientation that satisfies the local uniform mixing condition via the stopping rule technique; the paper assumes the quantum walk model on these signed graphs behaves as described without additional decoherence or implementation constraints.","pith_extraction_headline":"Unitary signings allow complete graphs to achieve probabilistic uniform mixing in continuous-time quantum walks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.04414/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.981542Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:29:07.660970Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7c49514849906d1808c890e0814840512b07d3ffe67f1f294438dbffa9408812"},"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.04414","created_at":"2026-05-20T00:04:34.269158+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.04414v2","created_at":"2026-05-20T00:04:34.269158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04414","created_at":"2026-05-20T00:04:34.269158+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IWYK23FGKX5","created_at":"2026-05-20T00:04:34.269158+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IWYK23FGKX53QDZ","created_at":"2026-05-20T00:04:34.269158+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IWYK23F","created_at":"2026-05-20T00:04:34.269158+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/7IWYK23FGKX53QDZ3WRAQVQNKL","json":"https://pith.science/pith/7IWYK23FGKX53QDZ3WRAQVQNKL.json","graph_json":"https://pith.science/api/pith-number/7IWYK23FGKX53QDZ3WRAQVQNKL/graph.json","events_json":"https://pith.science/api/pith-number/7IWYK23FGKX53QDZ3WRAQVQNKL/events.json","paper":"https://pith.science/paper/7IWYK23F"},"agent_actions":{"view_html":"https://pith.science/pith/7IWYK23FGKX53QDZ3WRAQVQNKL","download_json":"https://pith.science/pith/7IWYK23FGKX53QDZ3WRAQVQNKL.json","view_paper":"https://pith.science/paper/7IWYK23F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.04414&json=true","fetch_graph":"https://pith.science/api/pith-number/7IWYK23FGKX53QDZ3WRAQVQNKL/graph.json","fetch_events":"https://pith.science/api/pith-number/7IWYK23FGKX53QDZ3WRAQVQNKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IWYK23FGKX53QDZ3WRAQVQNKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IWYK23FGKX53QDZ3WRAQVQNKL/action/storage_attestation","attest_author":"https://pith.science/pith/7IWYK23FGKX53QDZ3WRAQVQNKL/action/author_attestation","sign_citation":"https://pith.science/pith/7IWYK23FGKX53QDZ3WRAQVQNKL/action/citation_signature","submit_replication":"https://pith.science/pith/7IWYK23FGKX53QDZ3WRAQVQNKL/action/replication_record"}},"created_at":"2026-05-20T00:04:34.269158+00:00","updated_at":"2026-05-20T00:04:34.269158+00:00"}