{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:KCCUPRYHDH565GKENRWEYTY3SD","short_pith_number":"pith:KCCUPRYH","canonical_record":{"source":{"id":"quant-ph/0305179","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-29T16:20:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6498f8f8adab46b35a2a6985472ed893d4cb011f2da5fdcdb76a9ce7d47f69c6","abstract_canon_sha256":"5592061cdf07103885bb34f4eb0fe7f154c9d18bf53bc8a2b4e515759f5d42f0"},"schema_version":"1.0"},"canonical_sha256":"508547c70719fbee99446c6c4c4f1b90f530b79253dd865d6153e93675c1c5b8","source":{"kind":"arxiv","id":"quant-ph/0305179","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0305179","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0305179v3","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0305179","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"KCCUPRYHDH56","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"pith_short_16","alias_value":"KCCUPRYHDH565GKE","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"pith_short_8","alias_value":"KCCUPRYH","created_at":"2026-07-04T15:11:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:KCCUPRYHDH565GKENRWEYTY3SD","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0305179","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-29T16:20:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6498f8f8adab46b35a2a6985472ed893d4cb011f2da5fdcdb76a9ce7d47f69c6","abstract_canon_sha256":"5592061cdf07103885bb34f4eb0fe7f154c9d18bf53bc8a2b4e515759f5d42f0"},"schema_version":"1.0"},"canonical_sha256":"508547c70719fbee99446c6c4c4f1b90f530b79253dd865d6153e93675c1c5b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:29.005310Z","signature_b64":"0wIz/qb5kpDNjERDNo9FExGtCmfMsBcgbN83kCcONHukwr/gyrcKrKb4/QN5DdJ2ND5kofjyRNC4FcDW/5JCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"508547c70719fbee99446c6c4c4f1b90f530b79253dd865d6153e93675c1c5b8","last_reissued_at":"2026-07-04T15:11:29.004895Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:29.004895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0305179","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-07-04T15:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"volLH/2npHxa0XAxf3EHv1g6J6vPd6aTsyox4YjWqcHcLtd0LQBtSi0wC1LRMrAecQOv+qdM1iazIEVKfUjMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:02:37.342687Z"},"content_sha256":"e5ccceb336077e1b39b42efeb8a701364761e67c5726ecfe76e4b43ba398bc2a","schema_version":"1.0","event_id":"sha256:e5ccceb336077e1b39b42efeb8a701364761e67c5726ecfe76e4b43ba398bc2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:KCCUPRYHDH565GKENRWEYTY3SD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2003-05-29T16:20:35Z","abstract_excerpt":"We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\\{1, ..., N\\}\\to\\{1, ..., M\\}$, its polynomial degree is the same for all $M\\geq N$. Therefore, if we have a quantum lower bound for some (possibly, quite large) range $M$ which is shown using polynomials method, we immediately get the same lower bound for all ranges $M\\geq N$. In particular, we get $\\Omega(N^{1/3})$ and $\\Omega(N^{2/3})$ quantum lower bounds for collision and element distinctness with small range."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0305179","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0305179/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0m+KSVDAu0S/vXDfP/Sq+ZL6IevP1yur3RBDuVCS6gSkytyI5yfiLksIiJqJFhhPXhivWyvUrDwuNHV5bdkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:02:37.343206Z"},"content_sha256":"27dd6437fc0410ed504b6db42a333d2ec0f750e18fdceceba2811aaf17816af8","schema_version":"1.0","event_id":"sha256:27dd6437fc0410ed504b6db42a333d2ec0f750e18fdceceba2811aaf17816af8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD/bundle.json","state_url":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCCUPRYHDH565GKENRWEYTY3SD/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-08-07T06:02:37Z","links":{"resolver":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD","bundle":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD/bundle.json","state":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCCUPRYHDH565GKENRWEYTY3SD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:KCCUPRYHDH565GKENRWEYTY3SD","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":"5592061cdf07103885bb34f4eb0fe7f154c9d18bf53bc8a2b4e515759f5d42f0","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-29T16:20:35Z","title_canon_sha256":"6498f8f8adab46b35a2a6985472ed893d4cb011f2da5fdcdb76a9ce7d47f69c6"},"schema_version":"1.0","source":{"id":"quant-ph/0305179","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0305179","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0305179v3","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0305179","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"KCCUPRYHDH56","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"pith_short_16","alias_value":"KCCUPRYHDH565GKE","created_at":"2026-07-04T15:11:29Z"},{"alias_kind":"pith_short_8","alias_value":"KCCUPRYH","created_at":"2026-07-04T15:11:29Z"}],"graph_snapshots":[{"event_id":"sha256:27dd6437fc0410ed504b6db42a333d2ec0f750e18fdceceba2811aaf17816af8","target":"graph","created_at":"2026-07-04T15:11:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0305179/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\\{1, ..., N\\}\\to\\{1, ..., M\\}$, its polynomial degree is the same for all $M\\geq N$. Therefore, if we have a quantum lower bound for some (possibly, quite large) range $M$ which is shown using polynomials method, we immediately get the same lower bound for all ranges $M\\geq N$. In particular, we get $\\Omega(N^{1/3})$ and $\\Omega(N^{2/3})$ quantum lower bounds for collision and element distinctness with small range.","authors_text":"Andris Ambainis","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2003-05-29T16:20:35Z","title":"Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0305179","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:e5ccceb336077e1b39b42efeb8a701364761e67c5726ecfe76e4b43ba398bc2a","target":"record","created_at":"2026-07-04T15:11:29Z","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":"5592061cdf07103885bb34f4eb0fe7f154c9d18bf53bc8a2b4e515759f5d42f0","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-29T16:20:35Z","title_canon_sha256":"6498f8f8adab46b35a2a6985472ed893d4cb011f2da5fdcdb76a9ce7d47f69c6"},"schema_version":"1.0","source":{"id":"quant-ph/0305179","kind":"arxiv","version":3}},"canonical_sha256":"508547c70719fbee99446c6c4c4f1b90f530b79253dd865d6153e93675c1c5b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"508547c70719fbee99446c6c4c4f1b90f530b79253dd865d6153e93675c1c5b8","first_computed_at":"2026-07-04T15:11:29.004895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:11:29.004895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0wIz/qb5kpDNjERDNo9FExGtCmfMsBcgbN83kCcONHukwr/gyrcKrKb4/QN5DdJ2ND5kofjyRNC4FcDW/5JCCw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:11:29.005310Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0305179","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5ccceb336077e1b39b42efeb8a701364761e67c5726ecfe76e4b43ba398bc2a","sha256:27dd6437fc0410ed504b6db42a333d2ec0f750e18fdceceba2811aaf17816af8"],"state_sha256":"711f7f91c604d1acb7937096ceb3291b3fe130680d822f180f6c119231992d82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVz4P8EJkYbFAlUouR4Ss3dOnxPTlRe5wKHUxGA68ywdMV54A22gQIZ7X32lBHU9dwzTaQ16WJu2oWpoSUVBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:02:37.348959Z","bundle_sha256":"0e5fbb95bc07a839563330d53f30bdaedee0bf968348613063dfaff10ebc602b"}}