{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:T3MLXGEKNMAPZ6IPK3X7GWQ3AF","short_pith_number":"pith:T3MLXGEK","canonical_record":{"source":{"id":"2506.21108","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-26T09:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"b47061179732115010e646c967bd6a5a9188e227ccd9efa4cedc8d34a374b0be","abstract_canon_sha256":"bf7f9c58b443d46bead94384f260c6a9a4a6fc56b77adda01572c2950c634b06"},"schema_version":"1.0"},"canonical_sha256":"9ed8bb988a6b00fcf90f56eff35a1b014e3c5c90114f515b52bddb667f3a56ae","source":{"kind":"arxiv","id":"2506.21108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.21108","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"2506.21108v1","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21108","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"T3MLXGEKNMAP","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"T3MLXGEKNMAPZ6IP","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"T3MLXGEK","created_at":"2026-07-05T11:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:T3MLXGEKNMAPZ6IPK3X7GWQ3AF","target":"record","payload":{"canonical_record":{"source":{"id":"2506.21108","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-26T09:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"b47061179732115010e646c967bd6a5a9188e227ccd9efa4cedc8d34a374b0be","abstract_canon_sha256":"bf7f9c58b443d46bead94384f260c6a9a4a6fc56b77adda01572c2950c634b06"},"schema_version":"1.0"},"canonical_sha256":"9ed8bb988a6b00fcf90f56eff35a1b014e3c5c90114f515b52bddb667f3a56ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:40.228035Z","signature_b64":"vICjJubW7GPgb1jzH7L03eI1/41NoviZrp/TPUchp8aUVrFOAmmlfB5KyCkrey78yZ/HthrPtY52XEty8AscAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed8bb988a6b00fcf90f56eff35a1b014e3c5c90114f515b52bddb667f3a56ae","last_reissued_at":"2026-07-05T11:27:40.227559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:40.227559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.21108","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tAFgSuMrDpX3gdZpe5EYXqR0CTsK7U9aTuQGCfChiWmWGq9axJtr1nNLdOXAP9tWRCECGIvuqUNEugeQRi32BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:28:22.773857Z"},"content_sha256":"92376912f24e91eeeed4282776a2689b15bc7c7889ae6ea4b77890757b9ff757","schema_version":"1.0","event_id":"sha256:92376912f24e91eeeed4282776a2689b15bc7c7889ae6ea4b77890757b9ff757"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:T3MLXGEKNMAPZ6IPK3X7GWQ3AF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic quantum search on all Laplacian integral graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guanzhong Li, Jingquan Luo, Lvzhou Li, Shiguang Feng","submitted_at":"2025-06-26T09:06:08Z","abstract_excerpt":"Searching for an unknown marked vertex on a given graph (also known as spatial search) is an extensively discussed topic in the area of quantum algorithms, with a plethora of results based on different quantum walk models and targeting various types of graphs. Most of these algorithms have a non-zero probability of failure. In recent years, there have been some efforts to design quantum spatial search algorithms with $100\\%$ success probability. However, these works either only work for very special graphs or only for the case where there is only one marked vertex. In this work, we propose a d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21108","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/2506.21108/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qh4EE4pccGN5qGMETfiwFJ1ELCFbbxITEspWfAaHNFU8YJPZkNmJeniq3w/svNMFONATuwFck3wLFi7i7ngIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:28:22.774371Z"},"content_sha256":"e05cdf4a412264231e632bb1070ac63cde8bce26194122be2f091bfab6cad0d3","schema_version":"1.0","event_id":"sha256:e05cdf4a412264231e632bb1070ac63cde8bce26194122be2f091bfab6cad0d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3MLXGEKNMAPZ6IPK3X7GWQ3AF/bundle.json","state_url":"https://pith.science/pith/T3MLXGEKNMAPZ6IPK3X7GWQ3AF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3MLXGEKNMAPZ6IPK3X7GWQ3AF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T04:28:22Z","links":{"resolver":"https://pith.science/pith/T3MLXGEKNMAPZ6IPK3X7GWQ3AF","bundle":"https://pith.science/pith/T3MLXGEKNMAPZ6IPK3X7GWQ3AF/bundle.json","state":"https://pith.science/pith/T3MLXGEKNMAPZ6IPK3X7GWQ3AF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3MLXGEKNMAPZ6IPK3X7GWQ3AF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:T3MLXGEKNMAPZ6IPK3X7GWQ3AF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bf7f9c58b443d46bead94384f260c6a9a4a6fc56b77adda01572c2950c634b06","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-26T09:06:08Z","title_canon_sha256":"b47061179732115010e646c967bd6a5a9188e227ccd9efa4cedc8d34a374b0be"},"schema_version":"1.0","source":{"id":"2506.21108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.21108","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"2506.21108v1","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21108","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"T3MLXGEKNMAP","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"T3MLXGEKNMAPZ6IP","created_at":"2026-07-05T11:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"T3MLXGEK","created_at":"2026-07-05T11:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:e05cdf4a412264231e632bb1070ac63cde8bce26194122be2f091bfab6cad0d3","target":"graph","created_at":"2026-07-05T11:27:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.21108/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Searching for an unknown marked vertex on a given graph (also known as spatial search) is an extensively discussed topic in the area of quantum algorithms, with a plethora of results based on different quantum walk models and targeting various types of graphs. Most of these algorithms have a non-zero probability of failure. In recent years, there have been some efforts to design quantum spatial search algorithms with $100\\%$ success probability. However, these works either only work for very special graphs or only for the case where there is only one marked vertex. In this work, we propose a d","authors_text":"Guanzhong Li, Jingquan Luo, Lvzhou Li, Shiguang Feng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-26T09:06:08Z","title":"Deterministic quantum search on all Laplacian integral graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21108","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:92376912f24e91eeeed4282776a2689b15bc7c7889ae6ea4b77890757b9ff757","target":"record","created_at":"2026-07-05T11:27:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bf7f9c58b443d46bead94384f260c6a9a4a6fc56b77adda01572c2950c634b06","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-26T09:06:08Z","title_canon_sha256":"b47061179732115010e646c967bd6a5a9188e227ccd9efa4cedc8d34a374b0be"},"schema_version":"1.0","source":{"id":"2506.21108","kind":"arxiv","version":1}},"canonical_sha256":"9ed8bb988a6b00fcf90f56eff35a1b014e3c5c90114f515b52bddb667f3a56ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ed8bb988a6b00fcf90f56eff35a1b014e3c5c90114f515b52bddb667f3a56ae","first_computed_at":"2026-07-05T11:27:40.227559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:27:40.227559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vICjJubW7GPgb1jzH7L03eI1/41NoviZrp/TPUchp8aUVrFOAmmlfB5KyCkrey78yZ/HthrPtY52XEty8AscAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:27:40.228035Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.21108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92376912f24e91eeeed4282776a2689b15bc7c7889ae6ea4b77890757b9ff757","sha256:e05cdf4a412264231e632bb1070ac63cde8bce26194122be2f091bfab6cad0d3"],"state_sha256":"01974c123c7be7d7879ebdb0aa0648b340af0cb63bb47006c8613bfce8c572f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SbaV5rTdvanWlYn5tKTkqGH4LmUWiJEj7heKd5pP5cxEdQZDqfRbYEouE7m4Msb8+f4bWS0KKgF7gaE5CdaOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T04:28:22.779680Z","bundle_sha256":"03591881241f7df635c859317176564211dbca1c010c7faaefd562a9543748d2"}}