{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:CYIL25NUIHQTL3JINJNNPPBPWX","short_pith_number":"pith:CYIL25NU","canonical_record":{"source":{"id":"quant-ph/0311038","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-06T20:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"e7ad1eb319a342b8803f5daad2e286d74cc3b9b3bcdd41a17893387e53a8b8f4","abstract_canon_sha256":"940d6921a1748c73399ae71f415feb6f3a6a28e10477e338f7af90a2c49a04d8"},"schema_version":"1.0"},"canonical_sha256":"1610bd75b441e135ed286a5ad7bc2fb5cca18bee4c22c31e0d99e9c651db9cb9","source":{"kind":"arxiv","id":"quant-ph/0311038","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0311038","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0311038v2","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0311038","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"pith_short_12","alias_value":"CYIL25NUIHQT","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"CYIL25NUIHQTL3JI","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"CYIL25NU","created_at":"2026-05-18T12:25:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:CYIL25NUIHQTL3JINJNNPPBPWX","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0311038","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-06T20:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"e7ad1eb319a342b8803f5daad2e286d74cc3b9b3bcdd41a17893387e53a8b8f4","abstract_canon_sha256":"940d6921a1748c73399ae71f415feb6f3a6a28e10477e338f7af90a2c49a04d8"},"schema_version":"1.0"},"canonical_sha256":"1610bd75b441e135ed286a5ad7bc2fb5cca18bee4c22c31e0d99e9c651db9cb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:54.626872Z","signature_b64":"bBOd9ZRHVobdawfHcpvrxCGdm0H+Jzw/5AbCRjn8tHl3O6BDlG9wMrE3sIgXk3Zxe8El+MkznmLQoAwIXt4vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1610bd75b441e135ed286a5ad7bc2fb5cca18bee4c22c31e0d99e9c651db9cb9","last_reissued_at":"2026-05-17T23:57:54.626336Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:54.626336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0311038","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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIHEVF7OqRVxG7JAJgIOMOQ9CaNNUcFwm0LfHG+kxPs/Nf/jxX/e6WowVwQqvqkgvCN7RplDY5cRlSLjyFvlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:51:20.951992Z"},"content_sha256":"fa077be4ca0e34e19b83f7613a64d0b6463b48fe8ef42f5c744481d2fe323084","schema_version":"1.0","event_id":"sha256:fa077be4ca0e34e19b83f7613a64d0b6463b48fe8ef42f5c744481d2fe323084"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:CYIL25NUIHQTL3JINJNNPPBPWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum algorithms for subset finding","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Jason M. Eisenberg","submitted_at":"2003-11-06T20:54:06Z","abstract_excerpt":"Recently, Ambainis gave an O(N^(2/3))-query quantum walk algorithm for element distinctness, and more generally, an O(N^(L/(L+1)))-query algorithm for finding L equal numbers. We point out that this algorithm actually solves a much more general problem, the problem of finding a subset of size L that satisfies any given property. We review the algorithm and give a considerably simplified analysis of its query complexity. We present several applications, including two algorithms for the problem of finding an L-clique in an N-vertex graph. One of these algorithms uses O(N^(2L/(L+1))) edge queries"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0311038","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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8KGtRSYSyKxBj9YXyl09RWRd9EdM4u9MwDlBi/On9rsinNTVscu9yYTirbOwkdtOqHwb4aLo/tfeTuxa336AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:51:20.952497Z"},"content_sha256":"6e544b072bfb69ba54789ea25552422a0fb8f84710cc5469d441b2b5710f41ed","schema_version":"1.0","event_id":"sha256:6e544b072bfb69ba54789ea25552422a0fb8f84710cc5469d441b2b5710f41ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX/bundle.json","state_url":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYIL25NUIHQTL3JINJNNPPBPWX/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-18T20:51:20Z","links":{"resolver":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX","bundle":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX/bundle.json","state":"https://pith.science/pith/CYIL25NUIHQTL3JINJNNPPBPWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYIL25NUIHQTL3JINJNNPPBPWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:CYIL25NUIHQTL3JINJNNPPBPWX","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":"940d6921a1748c73399ae71f415feb6f3a6a28e10477e338f7af90a2c49a04d8","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-06T20:54:06Z","title_canon_sha256":"e7ad1eb319a342b8803f5daad2e286d74cc3b9b3bcdd41a17893387e53a8b8f4"},"schema_version":"1.0","source":{"id":"quant-ph/0311038","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0311038","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0311038v2","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0311038","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"pith_short_12","alias_value":"CYIL25NUIHQT","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"CYIL25NUIHQTL3JI","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"CYIL25NU","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:6e544b072bfb69ba54789ea25552422a0fb8f84710cc5469d441b2b5710f41ed","target":"graph","created_at":"2026-05-17T23:57:54Z","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":"Recently, Ambainis gave an O(N^(2/3))-query quantum walk algorithm for element distinctness, and more generally, an O(N^(L/(L+1)))-query algorithm for finding L equal numbers. We point out that this algorithm actually solves a much more general problem, the problem of finding a subset of size L that satisfies any given property. We review the algorithm and give a considerably simplified analysis of its query complexity. We present several applications, including two algorithms for the problem of finding an L-clique in an N-vertex graph. One of these algorithms uses O(N^(2L/(L+1))) edge queries","authors_text":"Andrew M. Childs, Jason M. Eisenberg","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2003-11-06T20:54:06Z","title":"Quantum algorithms for subset finding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0311038","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:fa077be4ca0e34e19b83f7613a64d0b6463b48fe8ef42f5c744481d2fe323084","target":"record","created_at":"2026-05-17T23:57:54Z","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":"940d6921a1748c73399ae71f415feb6f3a6a28e10477e338f7af90a2c49a04d8","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-06T20:54:06Z","title_canon_sha256":"e7ad1eb319a342b8803f5daad2e286d74cc3b9b3bcdd41a17893387e53a8b8f4"},"schema_version":"1.0","source":{"id":"quant-ph/0311038","kind":"arxiv","version":2}},"canonical_sha256":"1610bd75b441e135ed286a5ad7bc2fb5cca18bee4c22c31e0d99e9c651db9cb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1610bd75b441e135ed286a5ad7bc2fb5cca18bee4c22c31e0d99e9c651db9cb9","first_computed_at":"2026-05-17T23:57:54.626336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:54.626336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bBOd9ZRHVobdawfHcpvrxCGdm0H+Jzw/5AbCRjn8tHl3O6BDlG9wMrE3sIgXk3Zxe8El+MkznmLQoAwIXt4vCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:54.626872Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0311038","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa077be4ca0e34e19b83f7613a64d0b6463b48fe8ef42f5c744481d2fe323084","sha256:6e544b072bfb69ba54789ea25552422a0fb8f84710cc5469d441b2b5710f41ed"],"state_sha256":"be9875bd4db1d336e2689b227ea531dc3c488ed466d9c42fb811af7702665a8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWKvRDMcfnfTZGhLUiyfE7ge420zgC2ch9lUSbLgj9oPyluuMn1yr+kcBtszIysjrVK/DuDfv7ujb5wr96aeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T20:51:20.955756Z","bundle_sha256":"9a4748a4f930765c26e33080e1157e0038e038017f255afb6183a5980936e309"}}