{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6FI2MRX23TCGWQL4BIPONFK6HZ","short_pith_number":"pith:6FI2MRX2","schema_version":"1.0","canonical_sha256":"f151a646fadcc46b417c0a1ee6955e3e7d9f8e529270ab34d48f752a09b4ff5a","source":{"kind":"arxiv","id":"2212.06126","version":3},"attestation_state":"computed","paper":{"title":"On the quantum simulation of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bruno Coutinho, Duarte Magano, Jo\\~ao Moutinho","submitted_at":"2022-12-12T18:55:31Z","abstract_excerpt":"Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links. Continuous-time quantum walk algorithms assume that we can simulate the dynamics of quantum systems where the Hamiltonian is given by the adjacency matrix of the graph. It is known that such can be simulated efficiently if the underlying graph is row-sparse and efficiently row-computable. While this is sufficient for many applications, it limits the applicability for t"},"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":"2212.06126","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-12T18:55:31Z","cross_cats_sorted":[],"title_canon_sha256":"775ef21b38745250443366e0ff3ec836ba4a0f308ce094c6c6efa47ea19c440c","abstract_canon_sha256":"9e3938df9ce3638907d372390884aaf5cfb1247817122dba98348917ddf7c9c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:10.946112Z","signature_b64":"sjP6TgCkWzFRHD/Zt0pOVdJRXss7TlKwkdnojFhfkMVVc7tZzTeA58bCcfH9faByzWB07czn75kxFuLzZEhCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f151a646fadcc46b417c0a1ee6955e3e7d9f8e529270ab34d48f752a09b4ff5a","last_reissued_at":"2026-07-05T06:24:10.945663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:10.945663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the quantum simulation of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bruno Coutinho, Duarte Magano, Jo\\~ao Moutinho","submitted_at":"2022-12-12T18:55:31Z","abstract_excerpt":"Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links. Continuous-time quantum walk algorithms assume that we can simulate the dynamics of quantum systems where the Hamiltonian is given by the adjacency matrix of the graph. It is known that such can be simulated efficiently if the underlying graph is row-sparse and efficiently row-computable. While this is sufficient for many applications, it limits the applicability for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06126","kind":"arxiv","version":3},"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/2212.06126/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2212.06126","created_at":"2026-07-05T06:24:10.945721+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.06126v3","created_at":"2026-07-05T06:24:10.945721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06126","created_at":"2026-07-05T06:24:10.945721+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FI2MRX23TCG","created_at":"2026-07-05T06:24:10.945721+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FI2MRX23TCGWQL4","created_at":"2026-07-05T06:24:10.945721+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FI2MRX2","created_at":"2026-07-05T06:24:10.945721+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/6FI2MRX23TCGWQL4BIPONFK6HZ","json":"https://pith.science/pith/6FI2MRX23TCGWQL4BIPONFK6HZ.json","graph_json":"https://pith.science/api/pith-number/6FI2MRX23TCGWQL4BIPONFK6HZ/graph.json","events_json":"https://pith.science/api/pith-number/6FI2MRX23TCGWQL4BIPONFK6HZ/events.json","paper":"https://pith.science/paper/6FI2MRX2"},"agent_actions":{"view_html":"https://pith.science/pith/6FI2MRX23TCGWQL4BIPONFK6HZ","download_json":"https://pith.science/pith/6FI2MRX23TCGWQL4BIPONFK6HZ.json","view_paper":"https://pith.science/paper/6FI2MRX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.06126&json=true","fetch_graph":"https://pith.science/api/pith-number/6FI2MRX23TCGWQL4BIPONFK6HZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6FI2MRX23TCGWQL4BIPONFK6HZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FI2MRX23TCGWQL4BIPONFK6HZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FI2MRX23TCGWQL4BIPONFK6HZ/action/storage_attestation","attest_author":"https://pith.science/pith/6FI2MRX23TCGWQL4BIPONFK6HZ/action/author_attestation","sign_citation":"https://pith.science/pith/6FI2MRX23TCGWQL4BIPONFK6HZ/action/citation_signature","submit_replication":"https://pith.science/pith/6FI2MRX23TCGWQL4BIPONFK6HZ/action/replication_record"}},"created_at":"2026-07-05T06:24:10.945721+00:00","updated_at":"2026-07-05T06:24:10.945721+00:00"}