{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RIM7R5IFHDCRX7WRRRZGSMYODI","short_pith_number":"pith:RIM7R5IF","canonical_record":{"source":{"id":"1810.12030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-29T09:47:30Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"bdbce1c9c1513bf67d5f51beb8afafac8398157f80d425b1dd1f90b3e7326289","abstract_canon_sha256":"f242cbe58c92a928e41ec2c7ea095808ab27cec593a9454895fdfa9f347a7ef9"},"schema_version":"1.0"},"canonical_sha256":"8a19f8f50538c51bfed18c7269330e1a2147963b63da8b51708897a8fb29dc28","source":{"kind":"arxiv","id":"1810.12030","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12030","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12030v2","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12030","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"RIM7R5IFHDCR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIM7R5IFHDCRX7WR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIM7R5IF","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RIM7R5IFHDCRX7WRRRZGSMYODI","target":"record","payload":{"canonical_record":{"source":{"id":"1810.12030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-29T09:47:30Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"bdbce1c9c1513bf67d5f51beb8afafac8398157f80d425b1dd1f90b3e7326289","abstract_canon_sha256":"f242cbe58c92a928e41ec2c7ea095808ab27cec593a9454895fdfa9f347a7ef9"},"schema_version":"1.0"},"canonical_sha256":"8a19f8f50538c51bfed18c7269330e1a2147963b63da8b51708897a8fb29dc28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:02.516670Z","signature_b64":"iN2utvRtgT9ts+tGgJPKtDqzepVNEX+v8oS/x9N2lwRXvzhQHwyBfZthqU2X09rCEJDQS0Lfu/84tE9XxpqvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a19f8f50538c51bfed18c7269330e1a2147963b63da8b51708897a8fb29dc28","last_reissued_at":"2026-05-17T23:57:02.516264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:02.516264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.12030","source_version":2,"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-17T23:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuhFgUjDJ5FZQpTCTts6821bYPTBwi+3ju82xMaYF7JZ9ItJ0qRyPBvzXRYgAN76qrK95lRhVwVvhjaqtGQNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:31:44.930954Z"},"content_sha256":"40951143141e26eb0679ba6541c3c8246762d6b8daaaceab45ef2fa447307dbf","schema_version":"1.0","event_id":"sha256:40951143141e26eb0679ba6541c3c8246762d6b8daaaceab45ef2fa447307dbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RIM7R5IFHDCRX7WRRRZGSMYODI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simon's problem for linear functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Joran van Apeldoorn, Sander Gribling","submitted_at":"2018-10-29T09:47:30Z","abstract_excerpt":"Simon's problem asks the following: determine if a function $f: \\{0,1\\}^n \\rightarrow \\{0,1\\}^n$ is one-to-one or if there exists a unique $s \\in \\{0,1\\}^n$ such that $f(x) = f(x \\oplus s)$ for all $x \\in \\{0,1\\}^n$, given the promise that exactly one of the two holds. A classical algorithm that can solve this problem for every $f$ requires $2^{\\Omega(n)}$ queries to $f$. Simon showed that there is a quantum algorithm that can solve this promise problem for every $f$ using only $\\mathcal O(n)$ quantum queries to $f$. A matching lower bound on the number of quantum queries was given by Koiran e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12030","kind":"arxiv","version":2},"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-17T23:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBhFn3AujzcTbyS4yy7Dbbd01k0BaCS+h2R/IUNxgF0GuBCEUnTopvvMIz3a/bw81S+foj/+bTP87Eh0rCSrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:31:44.931298Z"},"content_sha256":"07ac4e5d8b36700488db0ea4c370f63d9156d917c3ff02e7075ff63881f28704","schema_version":"1.0","event_id":"sha256:07ac4e5d8b36700488db0ea4c370f63d9156d917c3ff02e7075ff63881f28704"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIM7R5IFHDCRX7WRRRZGSMYODI/bundle.json","state_url":"https://pith.science/pith/RIM7R5IFHDCRX7WRRRZGSMYODI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIM7R5IFHDCRX7WRRRZGSMYODI/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-21T02:31:44Z","links":{"resolver":"https://pith.science/pith/RIM7R5IFHDCRX7WRRRZGSMYODI","bundle":"https://pith.science/pith/RIM7R5IFHDCRX7WRRRZGSMYODI/bundle.json","state":"https://pith.science/pith/RIM7R5IFHDCRX7WRRRZGSMYODI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIM7R5IFHDCRX7WRRRZGSMYODI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RIM7R5IFHDCRX7WRRRZGSMYODI","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":"f242cbe58c92a928e41ec2c7ea095808ab27cec593a9454895fdfa9f347a7ef9","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-29T09:47:30Z","title_canon_sha256":"bdbce1c9c1513bf67d5f51beb8afafac8398157f80d425b1dd1f90b3e7326289"},"schema_version":"1.0","source":{"id":"1810.12030","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12030","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12030v2","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12030","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"RIM7R5IFHDCR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIM7R5IFHDCRX7WR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIM7R5IF","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:07ac4e5d8b36700488db0ea4c370f63d9156d917c3ff02e7075ff63881f28704","target":"graph","created_at":"2026-05-17T23:57:02Z","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 asks the following: determine if a function $f: \\{0,1\\}^n \\rightarrow \\{0,1\\}^n$ is one-to-one or if there exists a unique $s \\in \\{0,1\\}^n$ such that $f(x) = f(x \\oplus s)$ for all $x \\in \\{0,1\\}^n$, given the promise that exactly one of the two holds. A classical algorithm that can solve this problem for every $f$ requires $2^{\\Omega(n)}$ queries to $f$. Simon showed that there is a quantum algorithm that can solve this promise problem for every $f$ using only $\\mathcal O(n)$ quantum queries to $f$. A matching lower bound on the number of quantum queries was given by Koiran e","authors_text":"Joran van Apeldoorn, Sander Gribling","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-29T09:47:30Z","title":"Simon's problem for linear functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12030","kind":"arxiv","version":2},"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:40951143141e26eb0679ba6541c3c8246762d6b8daaaceab45ef2fa447307dbf","target":"record","created_at":"2026-05-17T23:57:02Z","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":"f242cbe58c92a928e41ec2c7ea095808ab27cec593a9454895fdfa9f347a7ef9","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-29T09:47:30Z","title_canon_sha256":"bdbce1c9c1513bf67d5f51beb8afafac8398157f80d425b1dd1f90b3e7326289"},"schema_version":"1.0","source":{"id":"1810.12030","kind":"arxiv","version":2}},"canonical_sha256":"8a19f8f50538c51bfed18c7269330e1a2147963b63da8b51708897a8fb29dc28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a19f8f50538c51bfed18c7269330e1a2147963b63da8b51708897a8fb29dc28","first_computed_at":"2026-05-17T23:57:02.516264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:02.516264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iN2utvRtgT9ts+tGgJPKtDqzepVNEX+v8oS/x9N2lwRXvzhQHwyBfZthqU2X09rCEJDQS0Lfu/84tE9XxpqvCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:02.516670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12030","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40951143141e26eb0679ba6541c3c8246762d6b8daaaceab45ef2fa447307dbf","sha256:07ac4e5d8b36700488db0ea4c370f63d9156d917c3ff02e7075ff63881f28704"],"state_sha256":"999639a9b6e26249610b772ad5ecb12db50ccdd52dbf9bd0b32915ff10987e88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1p9xqRLe3ZZl73d2fjZOvfkAu5XONZmrCE+N5neH5kaOsMqr4bJ8WPnTURbUzHtrdYa4zCnZkEx26+YKlIHhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T02:31:44.933481Z","bundle_sha256":"73c23ddde7664f13e267f476555ec13140cf9d2583a73693a47cdd1ff98a0b4b"}}