{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TXJNVKFIUTOMYZLKNGWA5MFDZZ","short_pith_number":"pith:TXJNVKFI","schema_version":"1.0","canonical_sha256":"9dd2daa8a8a4dccc656a69ac0eb0a3ce56098253161aafc32d7b1007af156304","source":{"kind":"arxiv","id":"1601.04212","version":2},"attestation_state":"computed","paper":{"title":"Quantum Walk Search on Johnson Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Thomas G. Wong","submitted_at":"2016-01-16T21:27:26Z","abstract_excerpt":"The Johnson graph $J(n,k)$ is defined by $n$ symbols, where vertices are $k$-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, $J(n,1)$ is the complete graph $K_n$, and $J(n,2)$ is the strongly regular triangular graph $T_n$, both of which are known to support fast spatial search by continuous-time quantum walk. In this paper, we prove that $J(n,3)$, which is the $n$-tetrahedral graph, also supports fast search. In the process, we show that a change of basis is needed for degenerate perturbation theory to accurately describe the dyna"},"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":"1601.04212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-01-16T21:27:26Z","cross_cats_sorted":[],"title_canon_sha256":"1baac4e3ccf2db43d92b572c0985a01d1e061bb7c53e1049b0b5704c8849da24","abstract_canon_sha256":"086da175314fec99203e58e99985f7145e9f24d5b44117c2c21276765521086a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:17.755908Z","signature_b64":"TXnxLWf+MI+vAyrlqj2fwsteWe++8nXtbISUhOWzpgG/QQ2FiBHDuhZgwzGzQo5c18DX1EuAEfTLTe43Ug0kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd2daa8a8a4dccc656a69ac0eb0a3ce56098253161aafc32d7b1007af156304","last_reissued_at":"2026-05-18T01:17:17.755422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:17.755422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Walk Search on Johnson Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Thomas G. Wong","submitted_at":"2016-01-16T21:27:26Z","abstract_excerpt":"The Johnson graph $J(n,k)$ is defined by $n$ symbols, where vertices are $k$-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, $J(n,1)$ is the complete graph $K_n$, and $J(n,2)$ is the strongly regular triangular graph $T_n$, both of which are known to support fast spatial search by continuous-time quantum walk. In this paper, we prove that $J(n,3)$, which is the $n$-tetrahedral graph, also supports fast search. In the process, we show that a change of basis is needed for degenerate perturbation theory to accurately describe the dyna"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04212","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":"1601.04212","created_at":"2026-05-18T01:17:17.755511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04212v2","created_at":"2026-05-18T01:17:17.755511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04212","created_at":"2026-05-18T01:17:17.755511+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXJNVKFIUTOM","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXJNVKFIUTOMYZLK","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXJNVKFI","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16676","citing_title":"Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TXJNVKFIUTOMYZLKNGWA5MFDZZ","json":"https://pith.science/pith/TXJNVKFIUTOMYZLKNGWA5MFDZZ.json","graph_json":"https://pith.science/api/pith-number/TXJNVKFIUTOMYZLKNGWA5MFDZZ/graph.json","events_json":"https://pith.science/api/pith-number/TXJNVKFIUTOMYZLKNGWA5MFDZZ/events.json","paper":"https://pith.science/paper/TXJNVKFI"},"agent_actions":{"view_html":"https://pith.science/pith/TXJNVKFIUTOMYZLKNGWA5MFDZZ","download_json":"https://pith.science/pith/TXJNVKFIUTOMYZLKNGWA5MFDZZ.json","view_paper":"https://pith.science/paper/TXJNVKFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04212&json=true","fetch_graph":"https://pith.science/api/pith-number/TXJNVKFIUTOMYZLKNGWA5MFDZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TXJNVKFIUTOMYZLKNGWA5MFDZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXJNVKFIUTOMYZLKNGWA5MFDZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXJNVKFIUTOMYZLKNGWA5MFDZZ/action/storage_attestation","attest_author":"https://pith.science/pith/TXJNVKFIUTOMYZLKNGWA5MFDZZ/action/author_attestation","sign_citation":"https://pith.science/pith/TXJNVKFIUTOMYZLKNGWA5MFDZZ/action/citation_signature","submit_replication":"https://pith.science/pith/TXJNVKFIUTOMYZLKNGWA5MFDZZ/action/replication_record"}},"created_at":"2026-05-18T01:17:17.755511+00:00","updated_at":"2026-05-18T01:17:17.755511+00:00"}