{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VYH3LZSIJSDCG45XD42FXCVLL5","short_pith_number":"pith:VYH3LZSI","schema_version":"1.0","canonical_sha256":"ae0fb5e6484c862373b71f345b8aab5f5a6e4f41d7c72baabba1396460dbe701","source":{"kind":"arxiv","id":"1205.0529","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.0529","created_at":"2026-05-18T03:55:24.508533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0529v1","created_at":"2026-05-18T03:55:24.508533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0529","created_at":"2026-05-18T03:55:24.508533+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYH3LZSIJSDC","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYH3LZSIJSDCG45X","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYH3LZSI","created_at":"2026-05-18T12:27:25.539911+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/VYH3LZSIJSDCG45XD42FXCVLL5","json":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5.json","graph_json":"https://pith.science/api/pith-number/VYH3LZSIJSDCG45XD42FXCVLL5/graph.json","events_json":"https://pith.science/api/pith-number/VYH3LZSIJSDCG45XD42FXCVLL5/events.json","paper":"https://pith.science/paper/VYH3LZSI"},"agent_actions":{"view_html":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5","download_json":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5.json","view_paper":"https://pith.science/paper/VYH3LZSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0529&json=true","fetch_graph":"https://pith.science/api/pith-number/VYH3LZSIJSDCG45XD42FXCVLL5/graph.json","fetch_events":"https://pith.science/api/pith-number/VYH3LZSIJSDCG45XD42FXCVLL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5/action/storage_attestation","attest_author":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5/action/author_attestation","sign_citation":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5/action/citation_signature","submit_replication":"https://pith.science/pith/VYH3LZSIJSDCG45XD42FXCVLL5/action/replication_record"}},"created_at":"2026-05-18T03:55:24.508533+00:00","updated_at":"2026-05-18T03:55:24.508533+00:00"}