{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RJX5R5MF2ZW22MCDY75334Z7MT","short_pith_number":"pith:RJX5R5MF","canonical_record":{"source":{"id":"1709.06829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T12:24:20Z","cross_cats_sorted":[],"title_canon_sha256":"ac4042f1ce4b5109aeaedf657683da32fcc7cbb8da6d900da1f2f7b99a3be33e","abstract_canon_sha256":"1d682fe26ef00619dedde6f2dbe145e6f819c4a555361f10a7d1b1dce5ff3d4b"},"schema_version":"1.0"},"canonical_sha256":"8a6fd8f585d66dad3043c7fbbdf33f64ec7866ba8dcb49e4aca56efe98f4d3a5","source":{"kind":"arxiv","id":"1709.06829","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06829","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06829v2","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06829","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"RJX5R5MF2ZW2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJX5R5MF2ZW22MCD","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJX5R5MF","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RJX5R5MF2ZW22MCDY75334Z7MT","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T12:24:20Z","cross_cats_sorted":[],"title_canon_sha256":"ac4042f1ce4b5109aeaedf657683da32fcc7cbb8da6d900da1f2f7b99a3be33e","abstract_canon_sha256":"1d682fe26ef00619dedde6f2dbe145e6f819c4a555361f10a7d1b1dce5ff3d4b"},"schema_version":"1.0"},"canonical_sha256":"8a6fd8f585d66dad3043c7fbbdf33f64ec7866ba8dcb49e4aca56efe98f4d3a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:10.721283Z","signature_b64":"2x2L1AcFcUexDUvPMv2+NQfLUr76KSEFxWCTlDvOfVE3UmzVoyQOyXgtjIXj79VTbhE8/8gU4HkTo6FBL31vBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a6fd8f585d66dad3043c7fbbdf33f64ec7866ba8dcb49e4aca56efe98f4d3a5","last_reissued_at":"2026-05-18T00:22:10.720626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:10.720626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06829","source_version":2,"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-18T00:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1CWFv+zHhM6F6ZCx/gQfys2XwzB8mspCzWr+PmrA5hUhven/zKX1cpYujgU6AQwNQV3pXw5EGOzxHtYB0YbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:32:17.202952Z"},"content_sha256":"660939bb6f99721a02ed0ea03722f7bf94520fbd59ca2c83b02f4f1c14508052","schema_version":"1.0","event_id":"sha256:660939bb6f99721a02ed0ea03722f7bf94520fbd59ca2c83b02f4f1c14508052"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RJX5R5MF2ZW22MCDY75334Z7MT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertices cannot be hidden from quantum spatial search for almost all random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Glos, Aleksandra Krawiec, Ryszard Kukulski, Zbigniew Pucha{\\l}a","submitted_at":"2017-09-20T12:24:20Z","abstract_excerpt":"In this paper we show that all nodes can be found optimally for almost all random Erd\\H{o}s-R\\'enyi ${\\mathcal G}(n,p)$ graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices, though under different conditions. The first one requires $p=\\omega(\\log^8(n)/n)$, while the seconds requires $p\\geq(1+\\varepsilon)\\log (n)/n$, where $\\varepsilon>0$. The proof was made by analyzing the convergence of eigenvectors corresponding to outlying eigenvalues in the $\\|\\cdot\\|_\\infty $ norm. At the same time for $p<(1-\\varepsilon)\\log(n)/n$, the proper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06829","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"},"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-18T00:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9EKeV03dAufLMjmIPgzS/DGIPqdpD2phjBhC3UAPpJ7MdWWGT6crbF+UgZqCB9QmHWkIl/FdtPDP7tI9569iBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:32:17.203305Z"},"content_sha256":"99bfdbcdc0526c37ae053b4e593e8284064b98cee760e8d06b2528b5f66d95d0","schema_version":"1.0","event_id":"sha256:99bfdbcdc0526c37ae053b4e593e8284064b98cee760e8d06b2528b5f66d95d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJX5R5MF2ZW22MCDY75334Z7MT/bundle.json","state_url":"https://pith.science/pith/RJX5R5MF2ZW22MCDY75334Z7MT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJX5R5MF2ZW22MCDY75334Z7MT/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-05-28T02:32:17Z","links":{"resolver":"https://pith.science/pith/RJX5R5MF2ZW22MCDY75334Z7MT","bundle":"https://pith.science/pith/RJX5R5MF2ZW22MCDY75334Z7MT/bundle.json","state":"https://pith.science/pith/RJX5R5MF2ZW22MCDY75334Z7MT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJX5R5MF2ZW22MCDY75334Z7MT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RJX5R5MF2ZW22MCDY75334Z7MT","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":"1d682fe26ef00619dedde6f2dbe145e6f819c4a555361f10a7d1b1dce5ff3d4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T12:24:20Z","title_canon_sha256":"ac4042f1ce4b5109aeaedf657683da32fcc7cbb8da6d900da1f2f7b99a3be33e"},"schema_version":"1.0","source":{"id":"1709.06829","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06829","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06829v2","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06829","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"RJX5R5MF2ZW2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJX5R5MF2ZW22MCD","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJX5R5MF","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:99bfdbcdc0526c37ae053b4e593e8284064b98cee760e8d06b2528b5f66d95d0","target":"graph","created_at":"2026-05-18T00:22:10Z","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":"In this paper we show that all nodes can be found optimally for almost all random Erd\\H{o}s-R\\'enyi ${\\mathcal G}(n,p)$ graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices, though under different conditions. The first one requires $p=\\omega(\\log^8(n)/n)$, while the seconds requires $p\\geq(1+\\varepsilon)\\log (n)/n$, where $\\varepsilon>0$. The proof was made by analyzing the convergence of eigenvectors corresponding to outlying eigenvalues in the $\\|\\cdot\\|_\\infty $ norm. At the same time for $p<(1-\\varepsilon)\\log(n)/n$, the proper","authors_text":"Adam Glos, Aleksandra Krawiec, Ryszard Kukulski, Zbigniew Pucha{\\l}a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T12:24:20Z","title":"Vertices cannot be hidden from quantum spatial search for almost all random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06829","kind":"arxiv","version":2},"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:660939bb6f99721a02ed0ea03722f7bf94520fbd59ca2c83b02f4f1c14508052","target":"record","created_at":"2026-05-18T00:22:10Z","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":"1d682fe26ef00619dedde6f2dbe145e6f819c4a555361f10a7d1b1dce5ff3d4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T12:24:20Z","title_canon_sha256":"ac4042f1ce4b5109aeaedf657683da32fcc7cbb8da6d900da1f2f7b99a3be33e"},"schema_version":"1.0","source":{"id":"1709.06829","kind":"arxiv","version":2}},"canonical_sha256":"8a6fd8f585d66dad3043c7fbbdf33f64ec7866ba8dcb49e4aca56efe98f4d3a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a6fd8f585d66dad3043c7fbbdf33f64ec7866ba8dcb49e4aca56efe98f4d3a5","first_computed_at":"2026-05-18T00:22:10.720626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:10.720626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2x2L1AcFcUexDUvPMv2+NQfLUr76KSEFxWCTlDvOfVE3UmzVoyQOyXgtjIXj79VTbhE8/8gU4HkTo6FBL31vBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:10.721283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06829","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:660939bb6f99721a02ed0ea03722f7bf94520fbd59ca2c83b02f4f1c14508052","sha256:99bfdbcdc0526c37ae053b4e593e8284064b98cee760e8d06b2528b5f66d95d0"],"state_sha256":"9c45f679dfa7f531044368ab376f0c4e00f0947f61330853da9be3869a8276d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hX7aJ4DzPCGiyV4yRtdfImR2sRlwNqkoZ4p9r4xE48+qzdD5tXIg9cr9SS7liYO/0B4Xuf0HtoEz1GRiCLeXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:32:17.205335Z","bundle_sha256":"2fc9530bb2002a4c4e07256b18db65b74d0dd010bdf8b37b6d5cd9beb255188b"}}