{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:B4DLFJNM6H6K5A7Z2TYFXU5HBP","short_pith_number":"pith:B4DLFJNM","schema_version":"1.0","canonical_sha256":"0f06b2a5acf1fcae83f9d4f05bd3a70be42b5aa70c74d27eea32113e2536376a","source":{"kind":"arxiv","id":"1202.3471","version":2},"attestation_state":"computed","paper":{"title":"Quantum Navigation and Ranking in Complex Networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"primary_cat":"quant-ph","authors_text":"David Zueco, Eduardo S\\'anchez-Burillo, Jes\\'us G\\'omez-Gardenes, Jordi Duch","submitted_at":"2012-02-15T23:15:19Z","abstract_excerpt":"Complex networks are formal frameworks capturing the interdependencies between the elements of large systems and databases. This formalism allows to use network navigation methods to rank the importance that each constituent has on the global organization of the system. A key example is Pagerank navigation which is at the core of the most used search engine of the World Wide Web. Inspired in this classical algorithm, we define a quantum navigation method providing a unique ranking of the elements of a network. We analyze the convergence of quantum navigation to the stationary rank of networks "},"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":"1202.3471","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"quant-ph","submitted_at":"2012-02-15T23:15:19Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"title_canon_sha256":"604210ecb3135e204d6a0fd2aff28dbcf314bf26e36cf848769dc64168d7883f","abstract_canon_sha256":"39afe491088f8abc787192370a95858c5784103d51430899e7380d321b58e2cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:15.141658Z","signature_b64":"95ETjKonuAYriOWTUQ0It9Q0GPR+ABKd/S48Zo1kfSraSW5WhqQooqxSrW1tpO8XemuDa+PJTjd48OMl7oD0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f06b2a5acf1fcae83f9d4f05bd3a70be42b5aa70c74d27eea32113e2536376a","last_reissued_at":"2026-05-18T03:46:15.140876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:15.140876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Navigation and Ranking in Complex Networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"primary_cat":"quant-ph","authors_text":"David Zueco, Eduardo S\\'anchez-Burillo, Jes\\'us G\\'omez-Gardenes, Jordi Duch","submitted_at":"2012-02-15T23:15:19Z","abstract_excerpt":"Complex networks are formal frameworks capturing the interdependencies between the elements of large systems and databases. This formalism allows to use network navigation methods to rank the importance that each constituent has on the global organization of the system. A key example is Pagerank navigation which is at the core of the most used search engine of the World Wide Web. Inspired in this classical algorithm, we define a quantum navigation method providing a unique ranking of the elements of a network. We analyze the convergence of quantum navigation to the stationary rank of networks "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3471","kind":"arxiv","version":2},"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":"1202.3471","created_at":"2026-05-18T03:46:15.141010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3471v2","created_at":"2026-05-18T03:46:15.141010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3471","created_at":"2026-05-18T03:46:15.141010+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4DLFJNM6H6K","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4DLFJNM6H6K5A7Z","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4DLFJNM","created_at":"2026-05-18T12:26:58.693483+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/B4DLFJNM6H6K5A7Z2TYFXU5HBP","json":"https://pith.science/pith/B4DLFJNM6H6K5A7Z2TYFXU5HBP.json","graph_json":"https://pith.science/api/pith-number/B4DLFJNM6H6K5A7Z2TYFXU5HBP/graph.json","events_json":"https://pith.science/api/pith-number/B4DLFJNM6H6K5A7Z2TYFXU5HBP/events.json","paper":"https://pith.science/paper/B4DLFJNM"},"agent_actions":{"view_html":"https://pith.science/pith/B4DLFJNM6H6K5A7Z2TYFXU5HBP","download_json":"https://pith.science/pith/B4DLFJNM6H6K5A7Z2TYFXU5HBP.json","view_paper":"https://pith.science/paper/B4DLFJNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3471&json=true","fetch_graph":"https://pith.science/api/pith-number/B4DLFJNM6H6K5A7Z2TYFXU5HBP/graph.json","fetch_events":"https://pith.science/api/pith-number/B4DLFJNM6H6K5A7Z2TYFXU5HBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4DLFJNM6H6K5A7Z2TYFXU5HBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4DLFJNM6H6K5A7Z2TYFXU5HBP/action/storage_attestation","attest_author":"https://pith.science/pith/B4DLFJNM6H6K5A7Z2TYFXU5HBP/action/author_attestation","sign_citation":"https://pith.science/pith/B4DLFJNM6H6K5A7Z2TYFXU5HBP/action/citation_signature","submit_replication":"https://pith.science/pith/B4DLFJNM6H6K5A7Z2TYFXU5HBP/action/replication_record"}},"created_at":"2026-05-18T03:46:15.141010+00:00","updated_at":"2026-05-18T03:46:15.141010+00:00"}