{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7ZKUOTYFOUF52QDIKLJBAQPGD4","short_pith_number":"pith:7ZKUOTYF","canonical_record":{"source":{"id":"1610.01920","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-06T16:08:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3d7102b2198099756d0ae73784c941bc16606c66e886ec13d2a7a9165290fb75","abstract_canon_sha256":"bbb64d73d1e0a6d926f9d5a7cf6ec2e737a04f372090501bdacd52a61b511c0e"},"schema_version":"1.0"},"canonical_sha256":"fe55474f05750bdd406852d21041e61f2c95af375e788e3e46fb23dd056631be","source":{"kind":"arxiv","id":"1610.01920","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01920","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01920v5","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01920","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"7ZKUOTYFOUF5","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7ZKUOTYFOUF52QDI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7ZKUOTYF","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7ZKUOTYFOUF52QDIKLJBAQPGD4","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01920","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-06T16:08:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3d7102b2198099756d0ae73784c941bc16606c66e886ec13d2a7a9165290fb75","abstract_canon_sha256":"bbb64d73d1e0a6d926f9d5a7cf6ec2e737a04f372090501bdacd52a61b511c0e"},"schema_version":"1.0"},"canonical_sha256":"fe55474f05750bdd406852d21041e61f2c95af375e788e3e46fb23dd056631be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:30.013113Z","signature_b64":"71C+5yMK/l7UY0Y5TmGWrwNIbKxZlVF5bJsRLDv7N1r7uzyuFpwI/enATSolFG9ld8RR0cMJb1XcbZZAGqHvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe55474f05750bdd406852d21041e61f2c95af375e788e3e46fb23dd056631be","last_reissued_at":"2026-05-18T00:53:30.012708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:30.012708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01920","source_version":5,"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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iWisHts8trhskC1eGlyLTt+eOag4bF1lYQJqE9o4fQlSw86fG62VARbztheVqkLtaTa5vfhgnnZzHwMqmASrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:36:24.404834Z"},"content_sha256":"2808e88658e7167f90e5028b0ab88896b1e46740a326f9a2d720be981b0fc64e","schema_version":"1.0","event_id":"sha256:2808e88658e7167f90e5028b0ab88896b1e46740a326f9a2d720be981b0fc64e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7ZKUOTYFOUF52QDIKLJBAQPGD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Separation in Exact Query Complexities for Simon's Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Guangya Cai","submitted_at":"2016-10-06T16:08:35Z","abstract_excerpt":"Simon's problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large separation between quantum and classical query complexities. However, Simon's discussion on his problem was limited to bounded-error setting, which means his algorithm can not always get the correct answer. Exact quantum algorithms for Simon's problem have also been proposed, which deterministically solve the problem with O(n) queries. Also the quantum lower bound \\Omega(n) for Simon's problem is known. Although these algorithms are either complicated or specialized, their"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01920","kind":"arxiv","version":5},"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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7X0ex3Bn10jI9ELCTAre4lwczT2VBOFhFBlkvCP0J7mCbKcXxUBZEyOU8YipwMBnjM186ziFXtALyJ6A1l4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:36:24.405172Z"},"content_sha256":"bc513176548902742a78f808bf49b1c66b9d6af49c87df7bdb57a842eb11d332","schema_version":"1.0","event_id":"sha256:bc513176548902742a78f808bf49b1c66b9d6af49c87df7bdb57a842eb11d332"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/bundle.json","state_url":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/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-04T05:36:24Z","links":{"resolver":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4","bundle":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/bundle.json","state":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7ZKUOTYFOUF52QDIKLJBAQPGD4","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":"bbb64d73d1e0a6d926f9d5a7cf6ec2e737a04f372090501bdacd52a61b511c0e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-06T16:08:35Z","title_canon_sha256":"3d7102b2198099756d0ae73784c941bc16606c66e886ec13d2a7a9165290fb75"},"schema_version":"1.0","source":{"id":"1610.01920","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01920","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01920v5","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01920","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"7ZKUOTYFOUF5","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7ZKUOTYFOUF52QDI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7ZKUOTYF","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:bc513176548902742a78f808bf49b1c66b9d6af49c87df7bdb57a842eb11d332","target":"graph","created_at":"2026-05-18T00:53:30Z","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":"Simon's problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large separation between quantum and classical query complexities. However, Simon's discussion on his problem was limited to bounded-error setting, which means his algorithm can not always get the correct answer. Exact quantum algorithms for Simon's problem have also been proposed, which deterministically solve the problem with O(n) queries. Also the quantum lower bound \\Omega(n) for Simon's problem is known. Although these algorithms are either complicated or specialized, their","authors_text":"Daowen Qiu, Guangya Cai","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-06T16:08:35Z","title":"Optimal Separation in Exact Query Complexities for Simon's Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01920","kind":"arxiv","version":5},"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:2808e88658e7167f90e5028b0ab88896b1e46740a326f9a2d720be981b0fc64e","target":"record","created_at":"2026-05-18T00:53:30Z","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":"bbb64d73d1e0a6d926f9d5a7cf6ec2e737a04f372090501bdacd52a61b511c0e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-06T16:08:35Z","title_canon_sha256":"3d7102b2198099756d0ae73784c941bc16606c66e886ec13d2a7a9165290fb75"},"schema_version":"1.0","source":{"id":"1610.01920","kind":"arxiv","version":5}},"canonical_sha256":"fe55474f05750bdd406852d21041e61f2c95af375e788e3e46fb23dd056631be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe55474f05750bdd406852d21041e61f2c95af375e788e3e46fb23dd056631be","first_computed_at":"2026-05-18T00:53:30.012708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:30.012708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"71C+5yMK/l7UY0Y5TmGWrwNIbKxZlVF5bJsRLDv7N1r7uzyuFpwI/enATSolFG9ld8RR0cMJb1XcbZZAGqHvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:30.013113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01920","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2808e88658e7167f90e5028b0ab88896b1e46740a326f9a2d720be981b0fc64e","sha256:bc513176548902742a78f808bf49b1c66b9d6af49c87df7bdb57a842eb11d332"],"state_sha256":"ba66abd67735539748fa6499d5b243425b69bd3a39b0b395740858d06dc93894"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NjFO1no4xr0bEOivDHgj9Wg5Gx5kITMOWk2qpoIlJofUK+z/GRW4ZKf6nlv2K9UpbEOr3iMhN6UEHVpCm8NHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:36:24.407104Z","bundle_sha256":"167dedea28bb61152874b42100b22ed736860af6c055921baf1312c94f5386f3"}}