{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3LUKZMIW2NNYHILO6BIW3WYDI5","short_pith_number":"pith:3LUKZMIW","canonical_record":{"source":{"id":"1001.1139","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-01-07T19:22:59Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"f3e9412763b69ba8d7b1bf9b1b1fc39a3afc5dce0e9008f0aebe6fec2ea5a8f3","abstract_canon_sha256":"1ceedf4d70a67ad211f569b3fd34ddc10b6826f9daf9652be64c489a4a478d54"},"schema_version":"1.0"},"canonical_sha256":"dae8acb116d35b83a16ef0516ddb03474cdeefdc4ad09ac1c86b87f4fbdaa125","source":{"kind":"arxiv","id":"1001.1139","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1139","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1139v3","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1139","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"3LUKZMIW2NNY","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3LUKZMIW2NNYHILO","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3LUKZMIW","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3LUKZMIW2NNYHILO6BIW3WYDI5","target":"record","payload":{"canonical_record":{"source":{"id":"1001.1139","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-01-07T19:22:59Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"f3e9412763b69ba8d7b1bf9b1b1fc39a3afc5dce0e9008f0aebe6fec2ea5a8f3","abstract_canon_sha256":"1ceedf4d70a67ad211f569b3fd34ddc10b6826f9daf9652be64c489a4a478d54"},"schema_version":"1.0"},"canonical_sha256":"dae8acb116d35b83a16ef0516ddb03474cdeefdc4ad09ac1c86b87f4fbdaa125","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:25.172254Z","signature_b64":"sxFkSr5JyESDKrFaMUL7ZgO67ZOT81Tg84jQs5YFZtNd3hTxjA/5r4vWzP/h9CqKNxfOEREdlW42MH02KPsXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dae8acb116d35b83a16ef0516ddb03474cdeefdc4ad09ac1c86b87f4fbdaa125","last_reissued_at":"2026-05-18T03:55:25.171581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:25.171581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.1139","source_version":3,"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-18T03:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AF+XH9eaZE8Ipr1ewe1l2Oq02rxqZYMzjk6GqYgoQwFekf+vIk4qlpdZmnTvK8KkxZjCCpQrF1NZJbdAUkVjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:55:34.620784Z"},"content_sha256":"87b75fcc427966404e222ed09f66c7566e4f6ed3c747d853063257d1bd8216ae","schema_version":"1.0","event_id":"sha256:87b75fcc427966404e222ed09f66c7566e4f6ed3c747d853063257d1bd8216ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3LUKZMIW2NNYHILO6BIW3WYDI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spatial search in a honeycomb network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"F.L. Marquezino, G. Abal, R. Donangelo, R. Portugal","submitted_at":"2010-01-07T19:22:59Z","abstract_excerpt":"The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. In this paper, a quantum algorithm for the spatial search problem on a honeycomb lattice with $N$ sites and torus-like boundary conditions. The search algorithm is based on a modified quantum walk on a hexagonal lattice and the general framework proposed by Ambainis, Kempe and Rivosh is used to show that the time complexity of this quantum search algorithm is $O(\\sqrt{N \\log N})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1139","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"},"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-18T03:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QoJZe3W08n7o4Lh08MIWFTwerqYX4ExaiG31nhwIpnFy3E3HJRYYlOBG/iKLUo8A+YGisY3QU0YFXVvEl97BBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:55:34.621129Z"},"content_sha256":"1549e6e65f4b00164511a916be7ef6aec7aadd5e9b3718b76aeea0b7dfac9435","schema_version":"1.0","event_id":"sha256:1549e6e65f4b00164511a916be7ef6aec7aadd5e9b3718b76aeea0b7dfac9435"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LUKZMIW2NNYHILO6BIW3WYDI5/bundle.json","state_url":"https://pith.science/pith/3LUKZMIW2NNYHILO6BIW3WYDI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LUKZMIW2NNYHILO6BIW3WYDI5/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-30T15:55:34Z","links":{"resolver":"https://pith.science/pith/3LUKZMIW2NNYHILO6BIW3WYDI5","bundle":"https://pith.science/pith/3LUKZMIW2NNYHILO6BIW3WYDI5/bundle.json","state":"https://pith.science/pith/3LUKZMIW2NNYHILO6BIW3WYDI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LUKZMIW2NNYHILO6BIW3WYDI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3LUKZMIW2NNYHILO6BIW3WYDI5","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":"1ceedf4d70a67ad211f569b3fd34ddc10b6826f9daf9652be64c489a4a478d54","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-01-07T19:22:59Z","title_canon_sha256":"f3e9412763b69ba8d7b1bf9b1b1fc39a3afc5dce0e9008f0aebe6fec2ea5a8f3"},"schema_version":"1.0","source":{"id":"1001.1139","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1139","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1139v3","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1139","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"3LUKZMIW2NNY","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3LUKZMIW2NNYHILO","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3LUKZMIW","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:1549e6e65f4b00164511a916be7ef6aec7aadd5e9b3718b76aeea0b7dfac9435","target":"graph","created_at":"2026-05-18T03:55:25Z","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":"The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. In this paper, a quantum algorithm for the spatial search problem on a honeycomb lattice with $N$ sites and torus-like boundary conditions. The search algorithm is based on a modified quantum walk on a hexagonal lattice and the general framework proposed by Ambainis, Kempe and Rivosh is used to show that the time complexity of this quantum search algorithm is $O(\\sqrt{N \\log N})$.","authors_text":"F.L. Marquezino, G. Abal, R. Donangelo, R. Portugal","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-01-07T19:22:59Z","title":"Spatial search in a honeycomb network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1139","kind":"arxiv","version":3},"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:87b75fcc427966404e222ed09f66c7566e4f6ed3c747d853063257d1bd8216ae","target":"record","created_at":"2026-05-18T03:55:25Z","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":"1ceedf4d70a67ad211f569b3fd34ddc10b6826f9daf9652be64c489a4a478d54","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-01-07T19:22:59Z","title_canon_sha256":"f3e9412763b69ba8d7b1bf9b1b1fc39a3afc5dce0e9008f0aebe6fec2ea5a8f3"},"schema_version":"1.0","source":{"id":"1001.1139","kind":"arxiv","version":3}},"canonical_sha256":"dae8acb116d35b83a16ef0516ddb03474cdeefdc4ad09ac1c86b87f4fbdaa125","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dae8acb116d35b83a16ef0516ddb03474cdeefdc4ad09ac1c86b87f4fbdaa125","first_computed_at":"2026-05-18T03:55:25.171581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:25.171581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sxFkSr5JyESDKrFaMUL7ZgO67ZOT81Tg84jQs5YFZtNd3hTxjA/5r4vWzP/h9CqKNxfOEREdlW42MH02KPsXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:25.172254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.1139","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87b75fcc427966404e222ed09f66c7566e4f6ed3c747d853063257d1bd8216ae","sha256:1549e6e65f4b00164511a916be7ef6aec7aadd5e9b3718b76aeea0b7dfac9435"],"state_sha256":"18a50bf5ee835e93942b0da324a359bbe20d714cb10a46f4d6bbb53c37b482c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IbPaoscC78RcK0qS93py6a9SyCM1mojMMVck1P/e7OnS7+kqyj9+o7iiN6nRKpdDejr4qP9jQ3ZXLUPXe+gOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:55:34.623233Z","bundle_sha256":"528c175b7a5b06aa509be5244493088c8c025380daef6de3bca356104fe1b6f4"}}