{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VYH3LZSIJSDCG45XD42FXCVLL5","short_pith_number":"pith:VYH3LZSI","canonical_record":{"source":{"id":"1205.0529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-02T19:27:08Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"fc42021aab4183cea287df3a56f78e66f41c1950ca28dc51ead93e42e0808145","abstract_canon_sha256":"9a86f477a9f24b04d8f618fa876dec8007f6eecdf854e7fda6443ac70e7d4177"},"schema_version":"1.0"},"canonical_sha256":"ae0fb5e6484c862373b71f345b8aab5f5a6e4f41d7c72baabba1396460dbe701","source":{"kind":"arxiv","id":"1205.0529","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0529","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0529v1","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0529","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"VYH3LZSIJSDC","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VYH3LZSIJSDCG45X","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VYH3LZSI","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VYH3LZSIJSDCG45XD42FXCVLL5","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-02T19:27:08Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"fc42021aab4183cea287df3a56f78e66f41c1950ca28dc51ead93e42e0808145","abstract_canon_sha256":"9a86f477a9f24b04d8f618fa876dec8007f6eecdf854e7fda6443ac70e7d4177"},"schema_version":"1.0"},"canonical_sha256":"ae0fb5e6484c862373b71f345b8aab5f5a6e4f41d7c72baabba1396460dbe701","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:24.509256Z","signature_b64":"BkRo6x1GDnmWIbnFJFGpf6/4top/NzvApnNSfwzHLPtbskjCoyGA60nCCfBtdM4bCTu6MCv13FUPZLj7SiDuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0fb5e6484c862373b71f345b8aab5f5a6e4f41d7c72baabba1396460dbe701","last_reissued_at":"2026-05-18T03:55:24.508362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:24.508362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0529","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-05-18T03:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kwegp/wqOE93hu9OR+6csR7Q9Pr5aBIGqALir18gX5No08HIH33Hsi3YCIvHNUeKoqgsgNSpxAB2IYwD/XDlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:23:57.511227Z"},"content_sha256":"6e668bec8da1d4cb16f98276d61317b71a57fc5d46afe25774a170652016dad6","schema_version":"1.0","event_id":"sha256:6e668bec8da1d4cb16f98276d61317b71a57fc5d46afe25774a170652016dad6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VYH3LZSIJSDCG45XD42FXCVLL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Search Algorithms on Hierarchical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"F. L. Marquezino, R. Portugal, S. Boettcher","submitted_at":"2012-05-02T19:27:08Z","abstract_excerpt":"The \"abstract search algorithm\" is a well known quantum method to find a marked vertex in a graph. It has been applied with success to searching algorithms for the hypercube and the two-dimensional grid. In this work we provide an example for which that method fails to provide the best algorithm in terms of time complexity. We analyze search algorithms in degree-3 hierarchical networks using quantum walks driven by non-groverian coins. Our conclusions are based on numerical simulations, but the hierarchical structures of the graphs seems to allow analytical results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0529","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":""},"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-05-18T03:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5dJf1z1bnq7pVvU+LA/zk6XoiUiqyaq5SKZ8HQpoCbzTcbeJ8yeyAYzVb/ihwzzFSKfK6iUFM/4INS9MTFgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:23:57.511925Z"},"content_sha256":"93def0dd9fe49355115e0c7056cf7c699c4af41f679d45860163bb81962afd8e","schema_version":"1.0","event_id":"sha256:93def0dd9fe49355115e0c7056cf7c699c4af41f679d45860163bb81962afd8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5/bundle.json","state_url":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYH3LZSIJSDCG45XD42FXCVLL5/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-06-06T17:23:57Z","links":{"resolver":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5","bundle":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5/bundle.json","state":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYH3LZSIJSDCG45XD42FXCVLL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VYH3LZSIJSDCG45XD42FXCVLL5","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":"9a86f477a9f24b04d8f618fa876dec8007f6eecdf854e7fda6443ac70e7d4177","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-02T19:27:08Z","title_canon_sha256":"fc42021aab4183cea287df3a56f78e66f41c1950ca28dc51ead93e42e0808145"},"schema_version":"1.0","source":{"id":"1205.0529","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0529","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0529v1","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0529","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"VYH3LZSIJSDC","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VYH3LZSIJSDCG45X","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VYH3LZSI","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:93def0dd9fe49355115e0c7056cf7c699c4af41f679d45860163bb81962afd8e","target":"graph","created_at":"2026-05-18T03:55:24Z","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"},"paper":{"abstract_excerpt":"The \"abstract search algorithm\" is a well known quantum method to find a marked vertex in a graph. It has been applied with success to searching algorithms for the hypercube and the two-dimensional grid. In this work we provide an example for which that method fails to provide the best algorithm in terms of time complexity. We analyze search algorithms in degree-3 hierarchical networks using quantum walks driven by non-groverian coins. Our conclusions are based on numerical simulations, but the hierarchical structures of the graphs seems to allow analytical results.","authors_text":"F. L. Marquezino, R. Portugal, S. Boettcher","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-02T19:27:08Z","title":"Quantum Search Algorithms on Hierarchical Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0529","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:6e668bec8da1d4cb16f98276d61317b71a57fc5d46afe25774a170652016dad6","target":"record","created_at":"2026-05-18T03:55:24Z","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":"9a86f477a9f24b04d8f618fa876dec8007f6eecdf854e7fda6443ac70e7d4177","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-02T19:27:08Z","title_canon_sha256":"fc42021aab4183cea287df3a56f78e66f41c1950ca28dc51ead93e42e0808145"},"schema_version":"1.0","source":{"id":"1205.0529","kind":"arxiv","version":1}},"canonical_sha256":"ae0fb5e6484c862373b71f345b8aab5f5a6e4f41d7c72baabba1396460dbe701","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae0fb5e6484c862373b71f345b8aab5f5a6e4f41d7c72baabba1396460dbe701","first_computed_at":"2026-05-18T03:55:24.508362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:24.508362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BkRo6x1GDnmWIbnFJFGpf6/4top/NzvApnNSfwzHLPtbskjCoyGA60nCCfBtdM4bCTu6MCv13FUPZLj7SiDuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:24.509256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0529","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e668bec8da1d4cb16f98276d61317b71a57fc5d46afe25774a170652016dad6","sha256:93def0dd9fe49355115e0c7056cf7c699c4af41f679d45860163bb81962afd8e"],"state_sha256":"d2a2987699d2a10c90e3d2b2f3b33659610871e049e2d99a15332de568a7866e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q85r1VtWliriAyV+xbdqAD6b/lGz6UYHWHJXfj5GcR+Dk8Ek4SsLE6zKDLgATtuVsnv2JlJq4Sn/aS4TuYXWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:23:57.515544Z","bundle_sha256":"e38c422790aa4e8e49a85d37af2382a3eb5e4196046b4103ee5710cf7d98fefb"}}