{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VP2YANLPCXUFTIKCCQQUEY6UPL","short_pith_number":"pith:VP2YANLP","canonical_record":{"source":{"id":"1304.0845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-03T05:36:55Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"02fcfa0a1cffa02cc9dd4a8a1435a1c5c289eaebd0a0339f827ec14ee8657902","abstract_canon_sha256":"a92b0274feb27274f3b012b1ac16330f38542b0cdd1982aeb1946699d6fd6492"},"schema_version":"1.0"},"canonical_sha256":"abf580356f15e859a14214214263d47af88a455db679a5a97348286d6978bde5","source":{"kind":"arxiv","id":"1304.0845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0845","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0845v1","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0845","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"VP2YANLPCXUF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VP2YANLPCXUFTIKC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VP2YANLP","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VP2YANLPCXUFTIKCCQQUEY6UPL","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-03T05:36:55Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"02fcfa0a1cffa02cc9dd4a8a1435a1c5c289eaebd0a0339f827ec14ee8657902","abstract_canon_sha256":"a92b0274feb27274f3b012b1ac16330f38542b0cdd1982aeb1946699d6fd6492"},"schema_version":"1.0"},"canonical_sha256":"abf580356f15e859a14214214263d47af88a455db679a5a97348286d6978bde5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:05.964972Z","signature_b64":"8v3nJ73JDcIRuUJV/+BPlicwJVws3K/79+ROGdjTfhCpwljWrqVyavL7EajWXQJpPhCfvn9Zh30xAVauo8iIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abf580356f15e859a14214214263d47af88a455db679a5a97348286d6978bde5","last_reissued_at":"2026-05-18T03:29:05.964483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:05.964483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0845","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-05-18T03:29:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/21wBDcAfzFSMjJwHUJLXEZLzu5fTdMk/789OwMwpTA+3qO7WkcGf6QeqQ2uLMFInSAe3/dKNdSZz+8H5aqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:20:05.774269Z"},"content_sha256":"82d44a87aa7d4dfe1f185cce016fc0eee4070bfa2f392f66a3e0c34e5fbebcef","schema_version":"1.0","event_id":"sha256:82d44a87aa7d4dfe1f185cce016fc0eee4070bfa2f392f66a3e0c34e5fbebcef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VP2YANLPCXUFTIKCCQQUEY6UPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversary Lower Bound for the Orthogonal Array Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Robert Spalek (Google)","submitted_at":"2013-04-03T05:36:55Z","abstract_excerpt":"We prove a quantum query lower bound \\Omega(n^{(d+1)/(d+2)}) for the problem of deciding whether an input string of size n contains a k-tuple which belongs to a fixed orthogonal array on k factors of strength d<=k-1 and index 1, provided that the alphabet size is sufficiently large. Our lower bound is tight when d=k-1.\n  The orthogonal array problem includes the following problems as special cases: k-sum problem with d=k-1, k-distinctness problem with d=1, k-pattern problem with d=0, (d-1)-degree problem with 1<=d<=k-1, unordered search with d=0 and k=1, and graph collision with d=0 and k=2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0845","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":""},"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:29:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1abIK903AkzYD8JHLAUar9sqH3cBJ6cLEJMDSlnLX7Gz8pb9sZ58NxPHK/wTHaFxNFJp2eJ9lDGTaBGgYt2zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:20:05.774932Z"},"content_sha256":"3653f25c5a2f1102355efb5f49504311dc4407302e78c6af9e3c35de9030c4cd","schema_version":"1.0","event_id":"sha256:3653f25c5a2f1102355efb5f49504311dc4407302e78c6af9e3c35de9030c4cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VP2YANLPCXUFTIKCCQQUEY6UPL/bundle.json","state_url":"https://pith.science/pith/VP2YANLPCXUFTIKCCQQUEY6UPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VP2YANLPCXUFTIKCCQQUEY6UPL/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-06T00:20:05Z","links":{"resolver":"https://pith.science/pith/VP2YANLPCXUFTIKCCQQUEY6UPL","bundle":"https://pith.science/pith/VP2YANLPCXUFTIKCCQQUEY6UPL/bundle.json","state":"https://pith.science/pith/VP2YANLPCXUFTIKCCQQUEY6UPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VP2YANLPCXUFTIKCCQQUEY6UPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VP2YANLPCXUFTIKCCQQUEY6UPL","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":"a92b0274feb27274f3b012b1ac16330f38542b0cdd1982aeb1946699d6fd6492","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-03T05:36:55Z","title_canon_sha256":"02fcfa0a1cffa02cc9dd4a8a1435a1c5c289eaebd0a0339f827ec14ee8657902"},"schema_version":"1.0","source":{"id":"1304.0845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0845","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0845v1","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0845","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"VP2YANLPCXUF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VP2YANLPCXUFTIKC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VP2YANLP","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:3653f25c5a2f1102355efb5f49504311dc4407302e78c6af9e3c35de9030c4cd","target":"graph","created_at":"2026-05-18T03:29:05Z","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 prove a quantum query lower bound \\Omega(n^{(d+1)/(d+2)}) for the problem of deciding whether an input string of size n contains a k-tuple which belongs to a fixed orthogonal array on k factors of strength d<=k-1 and index 1, provided that the alphabet size is sufficiently large. Our lower bound is tight when d=k-1.\n  The orthogonal array problem includes the following problems as special cases: k-sum problem with d=k-1, k-distinctness problem with d=1, k-pattern problem with d=0, (d-1)-degree problem with 1<=d<=k-1, unordered search with d=0 and k=1, and graph collision with d=0 and k=2.","authors_text":"Robert Spalek (Google)","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-03T05:36:55Z","title":"Adversary Lower Bound for the Orthogonal Array Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0845","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:82d44a87aa7d4dfe1f185cce016fc0eee4070bfa2f392f66a3e0c34e5fbebcef","target":"record","created_at":"2026-05-18T03:29:05Z","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":"a92b0274feb27274f3b012b1ac16330f38542b0cdd1982aeb1946699d6fd6492","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-03T05:36:55Z","title_canon_sha256":"02fcfa0a1cffa02cc9dd4a8a1435a1c5c289eaebd0a0339f827ec14ee8657902"},"schema_version":"1.0","source":{"id":"1304.0845","kind":"arxiv","version":1}},"canonical_sha256":"abf580356f15e859a14214214263d47af88a455db679a5a97348286d6978bde5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abf580356f15e859a14214214263d47af88a455db679a5a97348286d6978bde5","first_computed_at":"2026-05-18T03:29:05.964483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:05.964483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8v3nJ73JDcIRuUJV/+BPlicwJVws3K/79+ROGdjTfhCpwljWrqVyavL7EajWXQJpPhCfvn9Zh30xAVauo8iIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:05.964972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82d44a87aa7d4dfe1f185cce016fc0eee4070bfa2f392f66a3e0c34e5fbebcef","sha256:3653f25c5a2f1102355efb5f49504311dc4407302e78c6af9e3c35de9030c4cd"],"state_sha256":"fd27bb0f12e01d371ce93d969585551bcc442e986ee7b165153806afef03a85b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvwjnbn6ZB4z46LBnL0H7rjHu7iTYPjaFf3wzKEd86kk8UDVMGJXYVwK3By/OORBf1BfcVGDfaeWNfbBldrNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:20:05.777272Z","bundle_sha256":"255d9f249efd533624d9bb33f2fc7a276852d7cc19a5345f716b3d888120cc61"}}