{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:U6LUCSEFRAMKE4VCEV6OH6LDFM","short_pith_number":"pith:U6LUCSEF","canonical_record":{"source":{"id":"1205.1534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-07T20:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"a380e757e0f047b2d80af8469c382bfd4184df9e04dffd73e2e29417107072a7","abstract_canon_sha256":"f273780a064d086c392dd2fccb1646a208921b6beb475e4bf0932fad28877f8e"},"schema_version":"1.0"},"canonical_sha256":"a7974148858818a272a2257ce3f9632b0b3a8fbf01d27b047a488215b3ee593d","source":{"kind":"arxiv","id":"1205.1534","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1534","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1534v2","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1534","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"U6LUCSEFRAMK","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U6LUCSEFRAMKE4VC","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U6LUCSEF","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:U6LUCSEFRAMKE4VCEV6OH6LDFM","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-07T20:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"a380e757e0f047b2d80af8469c382bfd4184df9e04dffd73e2e29417107072a7","abstract_canon_sha256":"f273780a064d086c392dd2fccb1646a208921b6beb475e4bf0932fad28877f8e"},"schema_version":"1.0"},"canonical_sha256":"a7974148858818a272a2257ce3f9632b0b3a8fbf01d27b047a488215b3ee593d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:10.172515Z","signature_b64":"tWHgWTVUZbO1G7krrz4Hm7MJ7iV6wQ+F/oI+fUxt0g8lOXzSweIegdGQ0VYxooOCJ94Vwrn4EKi/0ttj5Ve+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7974148858818a272a2257ce3f9632b0b3a8fbf01d27b047a488215b3ee593d","last_reissued_at":"2026-05-18T03:49:10.172072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:10.172072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1534","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQUYuPrCUH7IzEL5hQOswmcQPLpdfxqhRb5XcoVyljSQodEB5TuwlTzwSDvh0ueMYtVZcuPG0Wz1ZZI0yfpVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:11:27.279772Z"},"content_sha256":"e83c9907efb349015de4e2700dc39a3ebf9cb4dfa3a3c97957eba7cfbe34b7f1","schema_version":"1.0","event_id":"sha256:e83c9907efb349015de4e2700dc39a3ebf9cb4dfa3a3c97957eba7cfbe34b7f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:U6LUCSEFRAMKE4VCEV6OH6LDFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-Graph-Based Quantum Algorithm for k-distinctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs","submitted_at":"2012-05-07T20:26:44Z","abstract_excerpt":"We present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee arXiv:1108.3022, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler.\n  Additionally, we introduce an $O(\\sqrt{n}\\alpha^{1/6})$ algorithm for the graph collision problem where $\\alpha$ is the independence number of the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1534","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tev1i2T6qSTOMqXQT9uiZrHZ5aAuYs0T6ezDiXJHvxf1D1Dn9p2S5lDcnbLfsrM/aEwBPFasO5iFihbKq/+iDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:11:27.280275Z"},"content_sha256":"8084e4737c2c29597bcd4d5f93bf2199592291ba2ec334b60de1405d92c06578","schema_version":"1.0","event_id":"sha256:8084e4737c2c29597bcd4d5f93bf2199592291ba2ec334b60de1405d92c06578"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/bundle.json","state_url":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/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-09T11:11:27Z","links":{"resolver":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM","bundle":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/bundle.json","state":"https://pith.science/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6LUCSEFRAMKE4VCEV6OH6LDFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:U6LUCSEFRAMKE4VCEV6OH6LDFM","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":"f273780a064d086c392dd2fccb1646a208921b6beb475e4bf0932fad28877f8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-07T20:26:44Z","title_canon_sha256":"a380e757e0f047b2d80af8469c382bfd4184df9e04dffd73e2e29417107072a7"},"schema_version":"1.0","source":{"id":"1205.1534","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1534","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1534v2","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1534","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"U6LUCSEFRAMK","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U6LUCSEFRAMKE4VC","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U6LUCSEF","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:8084e4737c2c29597bcd4d5f93bf2199592291ba2ec334b60de1405d92c06578","target":"graph","created_at":"2026-05-18T03:49:10Z","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 present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee arXiv:1108.3022, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler.\n  Additionally, we introduce an $O(\\sqrt{n}\\alpha^{1/6})$ algorithm for the graph collision problem where $\\alpha$ is the independence number of the graph.","authors_text":"Aleksandrs Belovs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-07T20:26:44Z","title":"Learning-Graph-Based Quantum Algorithm for k-distinctness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1534","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:e83c9907efb349015de4e2700dc39a3ebf9cb4dfa3a3c97957eba7cfbe34b7f1","target":"record","created_at":"2026-05-18T03:49:10Z","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":"f273780a064d086c392dd2fccb1646a208921b6beb475e4bf0932fad28877f8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-07T20:26:44Z","title_canon_sha256":"a380e757e0f047b2d80af8469c382bfd4184df9e04dffd73e2e29417107072a7"},"schema_version":"1.0","source":{"id":"1205.1534","kind":"arxiv","version":2}},"canonical_sha256":"a7974148858818a272a2257ce3f9632b0b3a8fbf01d27b047a488215b3ee593d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7974148858818a272a2257ce3f9632b0b3a8fbf01d27b047a488215b3ee593d","first_computed_at":"2026-05-18T03:49:10.172072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:10.172072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWHgWTVUZbO1G7krrz4Hm7MJ7iV6wQ+F/oI+fUxt0g8lOXzSweIegdGQ0VYxooOCJ94Vwrn4EKi/0ttj5Ve+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:10.172515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1534","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e83c9907efb349015de4e2700dc39a3ebf9cb4dfa3a3c97957eba7cfbe34b7f1","sha256:8084e4737c2c29597bcd4d5f93bf2199592291ba2ec334b60de1405d92c06578"],"state_sha256":"41ef85617795a32ae689dd6d45df5c95a7e5f010520dc94ca200069ed5fb9e48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qPQnc2cPQYSzIcgiCVaWO3ZsmOeNV6kaNSOtetBhkic+xJwONXjaP0zb4ceNZVQ5WP0405VCOOARZYWJYBE+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:11:27.282795Z","bundle_sha256":"0874fd6b83aebc92b4b0d2b4747d1dec10fdc180fad483adb02c9a2934551a5a"}}