{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:MAF4CKDZCA4RKUR3GOO5UM7B76","short_pith_number":"pith:MAF4CKDZ","canonical_record":{"source":{"id":"0811.0663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-05T07:52:12Z","cross_cats_sorted":[],"title_canon_sha256":"1d461ef07f7717ca9a25ffeb3a112c3f261c195e7d1e512ce73cd3784e884301","abstract_canon_sha256":"3d6dd91bfa88679610784f87b17275fb21195ff1d28a9ada9439e7ca2820bfae"},"schema_version":"1.0"},"canonical_sha256":"600bc12879103915523b339dda33e1ff80ffb0e5423715db445bed3726fd3513","source":{"kind":"arxiv","id":"0811.0663","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.0663","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"0811.0663v1","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0663","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"MAF4CKDZCA4R","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"MAF4CKDZCA4RKUR3","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"MAF4CKDZ","created_at":"2026-07-04T15:15:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:MAF4CKDZCA4RKUR3GOO5UM7B76","target":"record","payload":{"canonical_record":{"source":{"id":"0811.0663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-05T07:52:12Z","cross_cats_sorted":[],"title_canon_sha256":"1d461ef07f7717ca9a25ffeb3a112c3f261c195e7d1e512ce73cd3784e884301","abstract_canon_sha256":"3d6dd91bfa88679610784f87b17275fb21195ff1d28a9ada9439e7ca2820bfae"},"schema_version":"1.0"},"canonical_sha256":"600bc12879103915523b339dda33e1ff80ffb0e5423715db445bed3726fd3513","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:15:45.790146Z","signature_b64":"fxVvcxDkYKs6vrQVGDUKRwUn5X8B0gbrTO4Y9pNRYiuDsK6X8bt6AbV4vdzM6ENDyjT2mtVfd99iWcd+BsxpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"600bc12879103915523b339dda33e1ff80ffb0e5423715db445bed3726fd3513","last_reissued_at":"2026-07-04T15:15:45.789727Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:15:45.789727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.0663","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-04T15:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBQuDQtAU3j5gt7RhXm5h2X4bTel4+xjYigozMsaQ02NVrYSZKSFI7/OcLpzf8olZG5P9J9Z/GY25Y2WmaicCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:49:52.337789Z"},"content_sha256":"d1670e6c69c98fc86b7e4662ef5f200912c29030bca1079b278a7c06379883a3","schema_version":"1.0","event_id":"sha256:d1670e6c69c98fc86b7e4662ef5f200912c29030bca1079b278a7c06379883a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:MAF4CKDZCA4RKUR3GOO5UM7B76","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complete Adiabatic Quantum Search in Unsorted Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jiangfeng Du, Mingjun Shi, Nanyang Xu, Xinhua Peng","submitted_at":"2008-11-05T07:52:12Z","abstract_excerpt":"We propose a new adiabatic algorithm for the unsorted database search problem. This algorithm saves two thirds of qubits than Grover's algorithm in realizations. Meanwhile, we analyze the time complexity of the algorithm by both perturbative method and numerical simulation. The results show it provides a better speedup than the previous adiabatic search algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.0663","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/0811.0663/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-04T15:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B246EZOuEgMWsIz/xWv//E4WImG1p81tFKLKn+d59mwlXx690vh7zHPAdpAIE/hcFGZz3p/TFPs+qQT1suSnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:49:52.338748Z"},"content_sha256":"398a2749b6c6da04e08c5619b577ca3cf9f5efdc21d906eda6bea472491bd9dc","schema_version":"1.0","event_id":"sha256:398a2749b6c6da04e08c5619b577ca3cf9f5efdc21d906eda6bea472491bd9dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAF4CKDZCA4RKUR3GOO5UM7B76/bundle.json","state_url":"https://pith.science/pith/MAF4CKDZCA4RKUR3GOO5UM7B76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAF4CKDZCA4RKUR3GOO5UM7B76/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-07T03:49:52Z","links":{"resolver":"https://pith.science/pith/MAF4CKDZCA4RKUR3GOO5UM7B76","bundle":"https://pith.science/pith/MAF4CKDZCA4RKUR3GOO5UM7B76/bundle.json","state":"https://pith.science/pith/MAF4CKDZCA4RKUR3GOO5UM7B76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAF4CKDZCA4RKUR3GOO5UM7B76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:MAF4CKDZCA4RKUR3GOO5UM7B76","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":"3d6dd91bfa88679610784f87b17275fb21195ff1d28a9ada9439e7ca2820bfae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-05T07:52:12Z","title_canon_sha256":"1d461ef07f7717ca9a25ffeb3a112c3f261c195e7d1e512ce73cd3784e884301"},"schema_version":"1.0","source":{"id":"0811.0663","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.0663","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"0811.0663v1","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0663","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"MAF4CKDZCA4R","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"MAF4CKDZCA4RKUR3","created_at":"2026-07-04T15:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"MAF4CKDZ","created_at":"2026-07-04T15:15:45Z"}],"graph_snapshots":[{"event_id":"sha256:398a2749b6c6da04e08c5619b577ca3cf9f5efdc21d906eda6bea472491bd9dc","target":"graph","created_at":"2026-07-04T15:15:45Z","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/0811.0663/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new adiabatic algorithm for the unsorted database search problem. This algorithm saves two thirds of qubits than Grover's algorithm in realizations. Meanwhile, we analyze the time complexity of the algorithm by both perturbative method and numerical simulation. The results show it provides a better speedup than the previous adiabatic search algorithm.","authors_text":"Jiangfeng Du, Mingjun Shi, Nanyang Xu, Xinhua Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-05T07:52:12Z","title":"Complete Adiabatic Quantum Search in Unsorted Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.0663","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:d1670e6c69c98fc86b7e4662ef5f200912c29030bca1079b278a7c06379883a3","target":"record","created_at":"2026-07-04T15:15:45Z","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":"3d6dd91bfa88679610784f87b17275fb21195ff1d28a9ada9439e7ca2820bfae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-05T07:52:12Z","title_canon_sha256":"1d461ef07f7717ca9a25ffeb3a112c3f261c195e7d1e512ce73cd3784e884301"},"schema_version":"1.0","source":{"id":"0811.0663","kind":"arxiv","version":1}},"canonical_sha256":"600bc12879103915523b339dda33e1ff80ffb0e5423715db445bed3726fd3513","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"600bc12879103915523b339dda33e1ff80ffb0e5423715db445bed3726fd3513","first_computed_at":"2026-07-04T15:15:45.789727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:15:45.789727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fxVvcxDkYKs6vrQVGDUKRwUn5X8B0gbrTO4Y9pNRYiuDsK6X8bt6AbV4vdzM6ENDyjT2mtVfd99iWcd+BsxpDg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:15:45.790146Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.0663","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1670e6c69c98fc86b7e4662ef5f200912c29030bca1079b278a7c06379883a3","sha256:398a2749b6c6da04e08c5619b577ca3cf9f5efdc21d906eda6bea472491bd9dc"],"state_sha256":"93c35a6c5e7bbe2d85f9fbb89f4c0d9925e0207141b0cc5b2dfc8ded70ad70cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXMNI8COFcWMJ60BVSb8Nn1YDWG0L2YBAR3kRLy+Ptvn/UKiyoQWc9FMR5sh6hK0fp4cvYhjUexLf3zdki/cDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T03:49:52.346890Z","bundle_sha256":"6dd1b411506960caa943cf2a472241245f56bc8caf55c8bdd5e50910f13b2422"}}