{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:25OKPOCUTBERI3456WFINKNJXY","short_pith_number":"pith:25OKPOCU","canonical_record":{"source":{"id":"1312.0172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-01T01:57:20Z","cross_cats_sorted":[],"title_canon_sha256":"694436b64762d37dba149dfc844ce40033181442f6c6c543d11727af5912bd38","abstract_canon_sha256":"ea4d26351306fe411adc91aae914d151ff52190a091d358d0b444be66a8c8ed6"},"schema_version":"1.0"},"canonical_sha256":"d75ca7b8549849146f9df58a86a9a9be3cbeffdebf779df89cc60a8d914c1f41","source":{"kind":"arxiv","id":"1312.0172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0172","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0172v1","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0172","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"pith_short_12","alias_value":"25OKPOCUTBER","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"25OKPOCUTBERI345","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"25OKPOCU","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:25OKPOCUTBERI3456WFINKNJXY","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-01T01:57:20Z","cross_cats_sorted":[],"title_canon_sha256":"694436b64762d37dba149dfc844ce40033181442f6c6c543d11727af5912bd38","abstract_canon_sha256":"ea4d26351306fe411adc91aae914d151ff52190a091d358d0b444be66a8c8ed6"},"schema_version":"1.0"},"canonical_sha256":"d75ca7b8549849146f9df58a86a9a9be3cbeffdebf779df89cc60a8d914c1f41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:26.027896Z","signature_b64":"rN9Ee1uORFcs73VhQKIvizIbn+16HEIdDsxzrpyiQtLWIovrry0QTPHUyH9kLYcQJ6nHhApGPvYmiIbvUuDYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d75ca7b8549849146f9df58a86a9a9be3cbeffdebf779df89cc60a8d914c1f41","last_reissued_at":"2026-05-18T01:30:26.027172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:26.027172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0172","source_version":1,"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-18T01:30:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVKOx2w9sZFnaF6fiapmoWjbE0khiqSvUvaQmLpM7YpL07Yc3FP4Lq5DtRMcn7v+qWS3E9VOfkoP6wzZTCqHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:14:47.070128Z"},"content_sha256":"6c091f758639f7f8691394e16e03b634f8b2999fdd6da7b5b124d52f7a8d8b6a","schema_version":"1.0","event_id":"sha256:6c091f758639f7f8691394e16e03b634f8b2999fdd6da7b5b124d52f7a8d8b6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:25OKPOCUTBERI3456WFINKNJXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spatial Search on Grids with Minimum Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Nikolay Nahimov, Renato Portugal","submitted_at":"2013-12-01T01:57:20Z","abstract_excerpt":"We study quantum algorithms for spatial search on finite dimensional grids. Patel et al. and Falk have proposed algorithms based on a quantum walk without a coin, with different operators applied at even and odd steps. Until now, such algorithms have been studied only using numerical simulations. In this paper, we present the first rigorous analysis for an algorithm of this type, showing that the optimal number of steps is $O(\\sqrt{N\\log N})$ and the success probability is $O(1/\\log N)$, where $N$ is the number of vertices. This matches the performance achieved by algorithms that use other for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0172","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"},"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-18T01:30:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbT4TQZsrnTiaeawoFMQtZTYtRbT4+V5aU5Z2IcoPvxMYVaYXcHgw/3DsA/MlQt9T3jnShCVfrDcVlkE6XrRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:14:47.070772Z"},"content_sha256":"f289609cbab18b18c94dae997611bdbfe4361afba2c6f6b184057507de8d8950","schema_version":"1.0","event_id":"sha256:f289609cbab18b18c94dae997611bdbfe4361afba2c6f6b184057507de8d8950"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25OKPOCUTBERI3456WFINKNJXY/bundle.json","state_url":"https://pith.science/pith/25OKPOCUTBERI3456WFINKNJXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25OKPOCUTBERI3456WFINKNJXY/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-25T22:14:47Z","links":{"resolver":"https://pith.science/pith/25OKPOCUTBERI3456WFINKNJXY","bundle":"https://pith.science/pith/25OKPOCUTBERI3456WFINKNJXY/bundle.json","state":"https://pith.science/pith/25OKPOCUTBERI3456WFINKNJXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25OKPOCUTBERI3456WFINKNJXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:25OKPOCUTBERI3456WFINKNJXY","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":"ea4d26351306fe411adc91aae914d151ff52190a091d358d0b444be66a8c8ed6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-01T01:57:20Z","title_canon_sha256":"694436b64762d37dba149dfc844ce40033181442f6c6c543d11727af5912bd38"},"schema_version":"1.0","source":{"id":"1312.0172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0172","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0172v1","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0172","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"pith_short_12","alias_value":"25OKPOCUTBER","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"25OKPOCUTBERI345","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"25OKPOCU","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:f289609cbab18b18c94dae997611bdbfe4361afba2c6f6b184057507de8d8950","target":"graph","created_at":"2026-05-18T01:30:26Z","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":"We study quantum algorithms for spatial search on finite dimensional grids. Patel et al. and Falk have proposed algorithms based on a quantum walk without a coin, with different operators applied at even and odd steps. Until now, such algorithms have been studied only using numerical simulations. In this paper, we present the first rigorous analysis for an algorithm of this type, showing that the optimal number of steps is $O(\\sqrt{N\\log N})$ and the success probability is $O(1/\\log N)$, where $N$ is the number of vertices. This matches the performance achieved by algorithms that use other for","authors_text":"Andris Ambainis, Nikolay Nahimov, Renato Portugal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-01T01:57:20Z","title":"Spatial Search on Grids with Minimum Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0172","kind":"arxiv","version":1},"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:6c091f758639f7f8691394e16e03b634f8b2999fdd6da7b5b124d52f7a8d8b6a","target":"record","created_at":"2026-05-18T01:30:26Z","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":"ea4d26351306fe411adc91aae914d151ff52190a091d358d0b444be66a8c8ed6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-01T01:57:20Z","title_canon_sha256":"694436b64762d37dba149dfc844ce40033181442f6c6c543d11727af5912bd38"},"schema_version":"1.0","source":{"id":"1312.0172","kind":"arxiv","version":1}},"canonical_sha256":"d75ca7b8549849146f9df58a86a9a9be3cbeffdebf779df89cc60a8d914c1f41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d75ca7b8549849146f9df58a86a9a9be3cbeffdebf779df89cc60a8d914c1f41","first_computed_at":"2026-05-18T01:30:26.027172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:26.027172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rN9Ee1uORFcs73VhQKIvizIbn+16HEIdDsxzrpyiQtLWIovrry0QTPHUyH9kLYcQJ6nHhApGPvYmiIbvUuDYCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:26.027896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c091f758639f7f8691394e16e03b634f8b2999fdd6da7b5b124d52f7a8d8b6a","sha256:f289609cbab18b18c94dae997611bdbfe4361afba2c6f6b184057507de8d8950"],"state_sha256":"66142f33578bf3ac643cd9d547981df658bda658f99171732cb8b403782ba0f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5J6rK/j4r4NZF9riCHNZ8MDXTXCndZ4adZcoS8TqF4038OEA5BL54yCuEBezKppN9IyCtafVuX1AvOz1zRcnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:14:47.074426Z","bundle_sha256":"927c8686b60d666e36a8d40b54f147a400b2a7e828ab6ba45792b38c78962ba4"}}