{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EIXHMRR7VNWZJNPAS5MM2FQIRB","short_pith_number":"pith:EIXHMRR7","canonical_record":{"source":{"id":"2204.09076","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-04-19T18:04:12Z","cross_cats_sorted":[],"title_canon_sha256":"545b4f72fe335eee3e42d8992235a2c5de0c6a5a86f597569f78c5f1ccc6457f","abstract_canon_sha256":"8d9f2cfbd1c0db6e9919818cfe5981bae465d51485e39578d474a71473c76632"},"schema_version":"1.0"},"canonical_sha256":"222e76463fab6d94b5e09758cd16088875246ab11903159da8172ab937e167b0","source":{"kind":"arxiv","id":"2204.09076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.09076","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"2204.09076v1","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.09076","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"EIXHMRR7VNWZ","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"pith_short_16","alias_value":"EIXHMRR7VNWZJNPA","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"pith_short_8","alias_value":"EIXHMRR7","created_at":"2026-07-05T04:16:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EIXHMRR7VNWZJNPAS5MM2FQIRB","target":"record","payload":{"canonical_record":{"source":{"id":"2204.09076","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-04-19T18:04:12Z","cross_cats_sorted":[],"title_canon_sha256":"545b4f72fe335eee3e42d8992235a2c5de0c6a5a86f597569f78c5f1ccc6457f","abstract_canon_sha256":"8d9f2cfbd1c0db6e9919818cfe5981bae465d51485e39578d474a71473c76632"},"schema_version":"1.0"},"canonical_sha256":"222e76463fab6d94b5e09758cd16088875246ab11903159da8172ab937e167b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:20.478377Z","signature_b64":"btD3q7CGqxGKtRh37uGY1T+XFoHv7ritaqQubHhkgTldsxLytBmopetYXBdFghKwbc2hILd15zpoHF1Vk0LaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"222e76463fab6d94b5e09758cd16088875246ab11903159da8172ab937e167b0","last_reissued_at":"2026-07-05T04:16:20.477931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:20.477931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.09076","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-07-05T04:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CbE8Foxu20AoSNwitQz7LpfU6hxkecCyGmoNcSZNh4lBdLH0lxXcaOovnW6BKQDlEUi1q2HrM1slXnjW4iG3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T21:17:36.872114Z"},"content_sha256":"d6a7773d3c808aee1843cda1e85bef3c0e12db752cbfac13ee712ca02924ce18","schema_version":"1.0","event_id":"sha256:d6a7773d3c808aee1843cda1e85bef3c0e12db752cbfac13ee712ca02924ce18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EIXHMRR7VNWZJNPAS5MM2FQIRB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spatial Search via Memoryless Walk with Selfloop","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Janet Leahy, Peter H{\\o}yer","submitted_at":"2022-04-19T18:04:12Z","abstract_excerpt":"The defining feature of memoryless quantum walks is that they operate on the vertex space of a graph, and therefore can be used to produce search algorithms with minimal memory. We present a memoryless walk that can find a unique marked vertex on a two-dimensional grid. Our walk is based on the construction proposed by Falk, which tessellates the grid with squares of size $2 \\times 2$. Our walk uses minimal memory, $O(\\sqrt{N \\log N})$ applications of the walk operator, and outputs the marked vertex with vanishing error probability. To accomplish this, we apply a selfloop to the marked vertex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.09076","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.09076/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"},"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-07-05T04:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"In/OnbKvvyrSSJ0lkXxpMKXyCTXY5m973wTkN/M7VZIOINMDHiHO6SRglDXlCeVhkHrOJIQ8yZcC7mvc8vwIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T21:17:36.872521Z"},"content_sha256":"e7f066bb751fc6c0f1a073a9a768373b46c05e57afa76081a24f512e89168079","schema_version":"1.0","event_id":"sha256:e7f066bb751fc6c0f1a073a9a768373b46c05e57afa76081a24f512e89168079"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIXHMRR7VNWZJNPAS5MM2FQIRB/bundle.json","state_url":"https://pith.science/pith/EIXHMRR7VNWZJNPAS5MM2FQIRB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIXHMRR7VNWZJNPAS5MM2FQIRB/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-07-10T21:17:36Z","links":{"resolver":"https://pith.science/pith/EIXHMRR7VNWZJNPAS5MM2FQIRB","bundle":"https://pith.science/pith/EIXHMRR7VNWZJNPAS5MM2FQIRB/bundle.json","state":"https://pith.science/pith/EIXHMRR7VNWZJNPAS5MM2FQIRB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIXHMRR7VNWZJNPAS5MM2FQIRB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EIXHMRR7VNWZJNPAS5MM2FQIRB","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":"8d9f2cfbd1c0db6e9919818cfe5981bae465d51485e39578d474a71473c76632","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-04-19T18:04:12Z","title_canon_sha256":"545b4f72fe335eee3e42d8992235a2c5de0c6a5a86f597569f78c5f1ccc6457f"},"schema_version":"1.0","source":{"id":"2204.09076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.09076","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"2204.09076v1","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.09076","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"EIXHMRR7VNWZ","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"pith_short_16","alias_value":"EIXHMRR7VNWZJNPA","created_at":"2026-07-05T04:16:20Z"},{"alias_kind":"pith_short_8","alias_value":"EIXHMRR7","created_at":"2026-07-05T04:16:20Z"}],"graph_snapshots":[{"event_id":"sha256:e7f066bb751fc6c0f1a073a9a768373b46c05e57afa76081a24f512e89168079","target":"graph","created_at":"2026-07-05T04:16:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2204.09076/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The defining feature of memoryless quantum walks is that they operate on the vertex space of a graph, and therefore can be used to produce search algorithms with minimal memory. We present a memoryless walk that can find a unique marked vertex on a two-dimensional grid. Our walk is based on the construction proposed by Falk, which tessellates the grid with squares of size $2 \\times 2$. Our walk uses minimal memory, $O(\\sqrt{N \\log N})$ applications of the walk operator, and outputs the marked vertex with vanishing error probability. To accomplish this, we apply a selfloop to the marked vertex ","authors_text":"Janet Leahy, Peter H{\\o}yer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-04-19T18:04:12Z","title":"Spatial Search via Memoryless Walk with Selfloop"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.09076","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:d6a7773d3c808aee1843cda1e85bef3c0e12db752cbfac13ee712ca02924ce18","target":"record","created_at":"2026-07-05T04:16:20Z","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":"8d9f2cfbd1c0db6e9919818cfe5981bae465d51485e39578d474a71473c76632","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-04-19T18:04:12Z","title_canon_sha256":"545b4f72fe335eee3e42d8992235a2c5de0c6a5a86f597569f78c5f1ccc6457f"},"schema_version":"1.0","source":{"id":"2204.09076","kind":"arxiv","version":1}},"canonical_sha256":"222e76463fab6d94b5e09758cd16088875246ab11903159da8172ab937e167b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"222e76463fab6d94b5e09758cd16088875246ab11903159da8172ab937e167b0","first_computed_at":"2026-07-05T04:16:20.477931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:16:20.477931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"btD3q7CGqxGKtRh37uGY1T+XFoHv7ritaqQubHhkgTldsxLytBmopetYXBdFghKwbc2hILd15zpoHF1Vk0LaAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:16:20.478377Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.09076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6a7773d3c808aee1843cda1e85bef3c0e12db752cbfac13ee712ca02924ce18","sha256:e7f066bb751fc6c0f1a073a9a768373b46c05e57afa76081a24f512e89168079"],"state_sha256":"fba62cc9f75bbfa0617d6dbb89d5a3395d6f208dbfaa1c76464df76185cda897"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0pYf/5A31aprCNAEPSQF1fa17iLMH3YVEPoL5/AbPrAIkIIx2Gs6VdGbpcfPIrMpI3lbZWMJ/4n7rdTF8m3SAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T21:17:36.874696Z","bundle_sha256":"5bc06adfdfd28f25f2f5b731f4366ba3b8d8399d9a0d21e6ff194f92bf445152"}}