{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7QLQSTPMR22ELPAVCHX2BULZSW","short_pith_number":"pith:7QLQSTPM","schema_version":"1.0","canonical_sha256":"fc17094dec8eb445bc1511efa0d17995b5fedd100352350b991330e68de6994b","source":{"kind":"arxiv","id":"1701.04392","version":3},"attestation_state":"computed","paper":{"title":"Optimal quantum spatial search on random temporal networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Leonardo Novo, Serena Di Giorgio, Shantanav Chakraborty, Yasser Omar","submitted_at":"2017-01-16T18:49:19Z","abstract_excerpt":"To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of $n$ nodes constituted by a time-ordered sequence of Erd\\\"os-R\\'enyi random graphs $G(n,p)$, where $p$ is the probability that any two given nodes are connected: after every time interval $\\tau$, a new graph $G(n,p)$ replaces the previous one. We prove analytically that for any given $p$, there is always a range of values of $\\tau$ for which the ru"},"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":"1701.04392","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-16T18:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"e846db7431733e25c5d48518d99b89e1c3b3c11db782ff854116c181ae1f706c","abstract_canon_sha256":"9db0ca00e9313b4bac256d959c096677a678cc1bed650a8b441b90b23e33d993"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:21.012540Z","signature_b64":"MxmGVuozKhDky/0GCkkaqoCkhI4Ub6tdq5w9ALN2cX0QuPwacUkwUfDIcJzZ0hwGqlrZMePRdfagY/8nJtFiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc17094dec8eb445bc1511efa0d17995b5fedd100352350b991330e68de6994b","last_reissued_at":"2026-05-18T00:29:21.011858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:21.011858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal quantum spatial search on random temporal networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Leonardo Novo, Serena Di Giorgio, Shantanav Chakraborty, Yasser Omar","submitted_at":"2017-01-16T18:49:19Z","abstract_excerpt":"To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of $n$ nodes constituted by a time-ordered sequence of Erd\\\"os-R\\'enyi random graphs $G(n,p)$, where $p$ is the probability that any two given nodes are connected: after every time interval $\\tau$, a new graph $G(n,p)$ replaces the previous one. We prove analytically that for any given $p$, there is always a range of values of $\\tau$ for which the ru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04392","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":""},"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":"1701.04392","created_at":"2026-05-18T00:29:21.011947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04392v3","created_at":"2026-05-18T00:29:21.011947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04392","created_at":"2026-05-18T00:29:21.011947+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QLQSTPMR22E","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QLQSTPMR22ELPAV","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QLQSTPM","created_at":"2026-05-18T12:31:05.417338+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/7QLQSTPMR22ELPAVCHX2BULZSW","json":"https://pith.science/pith/7QLQSTPMR22ELPAVCHX2BULZSW.json","graph_json":"https://pith.science/api/pith-number/7QLQSTPMR22ELPAVCHX2BULZSW/graph.json","events_json":"https://pith.science/api/pith-number/7QLQSTPMR22ELPAVCHX2BULZSW/events.json","paper":"https://pith.science/paper/7QLQSTPM"},"agent_actions":{"view_html":"https://pith.science/pith/7QLQSTPMR22ELPAVCHX2BULZSW","download_json":"https://pith.science/pith/7QLQSTPMR22ELPAVCHX2BULZSW.json","view_paper":"https://pith.science/paper/7QLQSTPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04392&json=true","fetch_graph":"https://pith.science/api/pith-number/7QLQSTPMR22ELPAVCHX2BULZSW/graph.json","fetch_events":"https://pith.science/api/pith-number/7QLQSTPMR22ELPAVCHX2BULZSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QLQSTPMR22ELPAVCHX2BULZSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QLQSTPMR22ELPAVCHX2BULZSW/action/storage_attestation","attest_author":"https://pith.science/pith/7QLQSTPMR22ELPAVCHX2BULZSW/action/author_attestation","sign_citation":"https://pith.science/pith/7QLQSTPMR22ELPAVCHX2BULZSW/action/citation_signature","submit_replication":"https://pith.science/pith/7QLQSTPMR22ELPAVCHX2BULZSW/action/replication_record"}},"created_at":"2026-05-18T00:29:21.011947+00:00","updated_at":"2026-05-18T00:29:21.011947+00:00"}