{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MQGEJYGJPB4AHV6CDIZI65TCBO","short_pith_number":"pith:MQGEJYGJ","schema_version":"1.0","canonical_sha256":"640c44e0c9787803d7c21a328f76620b95160ccd7c117e8af5d87f376caa31d2","source":{"kind":"arxiv","id":"2608.03777","version":1},"attestation_state":"computed","paper":{"title":"Optimal and Deterministic Quantum Search on the Simplex of Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kiyoji Huang Fujiwara, Thomas G. Wong, Yujia Shi","submitted_at":"2026-08-04T15:00:39Z","abstract_excerpt":"The simplex of complete graphs, also known as the first-order truncated simplex lattice, is a network of $M+1$ identical complete graphs, each with $M$ vertices, such that each clique contains an edge or bridge to every other clique. It contains $N = M(M+1)$ vertices, and previous asymptotic results using a continuous-time quantum walk to search this graph for a single marked vertex have either numerically demonstrated an optimal runtime of $O(\\sqrt{N})$, or analytically proved a deterministic success probability of 1, but not both, even when the bridges are weighted. In this paper, we give th"},"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":"2608.03777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T15:00:39Z","cross_cats_sorted":[],"title_canon_sha256":"833e45284c61f9202cffec5fe6b156e90245c33943aa772bfc8b7fc6570b6783","abstract_canon_sha256":"e7c74666b0772487e06d4fbaf97a83a73d2778fb8f762e8b0deeeb28b67dba52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T01:37:04.972167Z","signature_b64":"vHzH7u9Jz13pYVLEDvPf06sFanF3VoMg87VI82+jIlGKKY8D+f2BZ6hoR32X1P5ETqhGgTmX/JifY5ZaK5UtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"640c44e0c9787803d7c21a328f76620b95160ccd7c117e8af5d87f376caa31d2","last_reissued_at":"2026-08-05T01:37:04.970656Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T01:37:04.970656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal and Deterministic Quantum Search on the Simplex of Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kiyoji Huang Fujiwara, Thomas G. Wong, Yujia Shi","submitted_at":"2026-08-04T15:00:39Z","abstract_excerpt":"The simplex of complete graphs, also known as the first-order truncated simplex lattice, is a network of $M+1$ identical complete graphs, each with $M$ vertices, such that each clique contains an edge or bridge to every other clique. It contains $N = M(M+1)$ vertices, and previous asymptotic results using a continuous-time quantum walk to search this graph for a single marked vertex have either numerically demonstrated an optimal runtime of $O(\\sqrt{N})$, or analytically proved a deterministic success probability of 1, but not both, even when the bridges are weighted. In this paper, we give th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03777","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.03777/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.03777","created_at":"2026-08-05T01:37:04.971189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.03777v1","created_at":"2026-08-05T01:37:04.971189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03777","created_at":"2026-08-05T01:37:04.971189+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQGEJYGJPB4A","created_at":"2026-08-05T01:37:04.971189+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQGEJYGJPB4AHV6C","created_at":"2026-08-05T01:37:04.971189+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQGEJYGJ","created_at":"2026-08-05T01:37:04.971189+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/MQGEJYGJPB4AHV6CDIZI65TCBO","json":"https://pith.science/pith/MQGEJYGJPB4AHV6CDIZI65TCBO.json","graph_json":"https://pith.science/api/pith-number/MQGEJYGJPB4AHV6CDIZI65TCBO/graph.json","events_json":"https://pith.science/api/pith-number/MQGEJYGJPB4AHV6CDIZI65TCBO/events.json","paper":"https://pith.science/paper/MQGEJYGJ"},"agent_actions":{"view_html":"https://pith.science/pith/MQGEJYGJPB4AHV6CDIZI65TCBO","download_json":"https://pith.science/pith/MQGEJYGJPB4AHV6CDIZI65TCBO.json","view_paper":"https://pith.science/paper/MQGEJYGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.03777&json=true","fetch_graph":"https://pith.science/api/pith-number/MQGEJYGJPB4AHV6CDIZI65TCBO/graph.json","fetch_events":"https://pith.science/api/pith-number/MQGEJYGJPB4AHV6CDIZI65TCBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQGEJYGJPB4AHV6CDIZI65TCBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQGEJYGJPB4AHV6CDIZI65TCBO/action/storage_attestation","attest_author":"https://pith.science/pith/MQGEJYGJPB4AHV6CDIZI65TCBO/action/author_attestation","sign_citation":"https://pith.science/pith/MQGEJYGJPB4AHV6CDIZI65TCBO/action/citation_signature","submit_replication":"https://pith.science/pith/MQGEJYGJPB4AHV6CDIZI65TCBO/action/replication_record"}},"created_at":"2026-08-05T01:37:04.971189+00:00","updated_at":"2026-08-05T01:37:04.971189+00:00"}