{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UE7GNP5WE5F5CWP6IT7THDGTVQ","short_pith_number":"pith:UE7GNP5W","canonical_record":{"source":{"id":"1007.2899","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-17T05:06:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f951f4e6aeeed38ccbe59031263f79464e9f12367f1be9de1cd5a8e9449a2b2b","abstract_canon_sha256":"bb7b34163c2a85b10d922593d39c49c674e909b010fe150cbc8592b833150a12"},"schema_version":"1.0"},"canonical_sha256":"a13e66bfb6274bd159fe44ff338cd3ac109b9f7b991893688c01d1da9a33617c","source":{"kind":"arxiv","id":"1007.2899","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2899","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2899v3","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2899","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"pith_short_12","alias_value":"UE7GNP5WE5F5","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UE7GNP5WE5F5CWP6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UE7GNP5W","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UE7GNP5WE5F5CWP6IT7THDGTVQ","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2899","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-17T05:06:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f951f4e6aeeed38ccbe59031263f79464e9f12367f1be9de1cd5a8e9449a2b2b","abstract_canon_sha256":"bb7b34163c2a85b10d922593d39c49c674e909b010fe150cbc8592b833150a12"},"schema_version":"1.0"},"canonical_sha256":"a13e66bfb6274bd159fe44ff338cd3ac109b9f7b991893688c01d1da9a33617c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:56.522696Z","signature_b64":"diuXmrGBdCp8ApLr4/YcpG0/lF6O18FLIbEc3SAjb/2ZLXFXPKRMiiSTtEFk6nVSSFfFzUQ6Q3MuDL0uOafODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a13e66bfb6274bd159fe44ff338cd3ac109b9f7b991893688c01d1da9a33617c","last_reissued_at":"2026-05-18T04:26:56.522228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:56.522228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2899","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-18T04:26:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HbI0x4NuYaCOZyyzX4IFEZc4z5UYv8s5uo1Q447cLXWUABEmL1pB6yccs9bAKIyxD0CLyWc0wF8J8g0UWjQgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:17:44.385673Z"},"content_sha256":"ed87598ec31251447db917ef7bcef83f6db817585c4852783e775d6ba50cfe79","schema_version":"1.0","event_id":"sha256:ed87598ec31251447db917ef7bcef83f6db817585c4852783e775d6ba50cfe79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UE7GNP5WE5F5CWP6IT7THDGTVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inverting a permutation is as hard as unordered search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ashwin Nayak","submitted_at":"2010-07-17T05:06:02Z","abstract_excerpt":"We show how an algorithm for the problem of inverting a permutation may be used to design one for the problem of unordered search (with a unique solution). Since there is a straightforward reduction in the reverse direction, the problems are essentially equivalent.\n  The reduction we present helps us bypass the hybrid argument due to Bennett, Bernstein, Brassard, and Vazirani (1997) and the quantum adversary method due to Ambainis (2002) that were earlier used to derive lower bounds on the quantum query complexity of the problem of inverting permutations. It directly implies that the quantum q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2899","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-18T04:26:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cNLgPMhsj5BVqeYVTm7LButolx/iOQ1GUQBL0J6jLLbXsjKh3TE3RgBFe5uBIG7ncE+KFtn2NzoJcI0swhDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:17:44.386099Z"},"content_sha256":"98a8ac685cee59846c27dd63bcc03a953d27c2c49a40a691c1b3be17924e1163","schema_version":"1.0","event_id":"sha256:98a8ac685cee59846c27dd63bcc03a953d27c2c49a40a691c1b3be17924e1163"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UE7GNP5WE5F5CWP6IT7THDGTVQ/bundle.json","state_url":"https://pith.science/pith/UE7GNP5WE5F5CWP6IT7THDGTVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UE7GNP5WE5F5CWP6IT7THDGTVQ/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-06-05T05:17:44Z","links":{"resolver":"https://pith.science/pith/UE7GNP5WE5F5CWP6IT7THDGTVQ","bundle":"https://pith.science/pith/UE7GNP5WE5F5CWP6IT7THDGTVQ/bundle.json","state":"https://pith.science/pith/UE7GNP5WE5F5CWP6IT7THDGTVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UE7GNP5WE5F5CWP6IT7THDGTVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UE7GNP5WE5F5CWP6IT7THDGTVQ","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":"bb7b34163c2a85b10d922593d39c49c674e909b010fe150cbc8592b833150a12","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-17T05:06:02Z","title_canon_sha256":"f951f4e6aeeed38ccbe59031263f79464e9f12367f1be9de1cd5a8e9449a2b2b"},"schema_version":"1.0","source":{"id":"1007.2899","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2899","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2899v3","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2899","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"pith_short_12","alias_value":"UE7GNP5WE5F5","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UE7GNP5WE5F5CWP6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UE7GNP5W","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:98a8ac685cee59846c27dd63bcc03a953d27c2c49a40a691c1b3be17924e1163","target":"graph","created_at":"2026-05-18T04:26:56Z","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 show how an algorithm for the problem of inverting a permutation may be used to design one for the problem of unordered search (with a unique solution). Since there is a straightforward reduction in the reverse direction, the problems are essentially equivalent.\n  The reduction we present helps us bypass the hybrid argument due to Bennett, Bernstein, Brassard, and Vazirani (1997) and the quantum adversary method due to Ambainis (2002) that were earlier used to derive lower bounds on the quantum query complexity of the problem of inverting permutations. It directly implies that the quantum q","authors_text":"Ashwin Nayak","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-17T05:06:02Z","title":"Inverting a permutation is as hard as unordered search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2899","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:ed87598ec31251447db917ef7bcef83f6db817585c4852783e775d6ba50cfe79","target":"record","created_at":"2026-05-18T04:26:56Z","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":"bb7b34163c2a85b10d922593d39c49c674e909b010fe150cbc8592b833150a12","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-17T05:06:02Z","title_canon_sha256":"f951f4e6aeeed38ccbe59031263f79464e9f12367f1be9de1cd5a8e9449a2b2b"},"schema_version":"1.0","source":{"id":"1007.2899","kind":"arxiv","version":3}},"canonical_sha256":"a13e66bfb6274bd159fe44ff338cd3ac109b9f7b991893688c01d1da9a33617c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a13e66bfb6274bd159fe44ff338cd3ac109b9f7b991893688c01d1da9a33617c","first_computed_at":"2026-05-18T04:26:56.522228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:56.522228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"diuXmrGBdCp8ApLr4/YcpG0/lF6O18FLIbEc3SAjb/2ZLXFXPKRMiiSTtEFk6nVSSFfFzUQ6Q3MuDL0uOafODw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:56.522696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2899","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed87598ec31251447db917ef7bcef83f6db817585c4852783e775d6ba50cfe79","sha256:98a8ac685cee59846c27dd63bcc03a953d27c2c49a40a691c1b3be17924e1163"],"state_sha256":"24ab7f38b784ff700f22b6d855b6d49fa8d09cebdfa0a486396d2d5446e95f80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5iqaqB8Z563f8BjYf7AWhA/pmj8vz3kjrdfU6RuD3/nSFxNVg3X9PSxuZGOSOdW+H47K0aYC+8vJqm6UD9oBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:17:44.389517Z","bundle_sha256":"d93c52564348825eb1b1e04182d6823afa0122603b77f1e12d842489ccf707b5"}}