{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WOQWCKHDJPK3SKDPQZ745D7GEZ","short_pith_number":"pith:WOQWCKHD","canonical_record":{"source":{"id":"1512.02420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-08T12:11:37Z","cross_cats_sorted":[],"title_canon_sha256":"69835c44cecaacd7ca3ca90e77c4ddc37cb4fbd1487c4e26bb91c67d927d6de8","abstract_canon_sha256":"5804ff04432d6f24a4eb1f77ed6efb136e74c08979ee80899467864ad563b633"},"schema_version":"1.0"},"canonical_sha256":"b3a16128e34bd5b9286f867fce8fe62641cb179bbd3018a82c51612e321f29dd","source":{"kind":"arxiv","id":"1512.02420","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02420","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02420v2","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02420","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"WOQWCKHDJPK3","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WOQWCKHDJPK3SKDP","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WOQWCKHD","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WOQWCKHDJPK3SKDPQZ745D7GEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-08T12:11:37Z","cross_cats_sorted":[],"title_canon_sha256":"69835c44cecaacd7ca3ca90e77c4ddc37cb4fbd1487c4e26bb91c67d927d6de8","abstract_canon_sha256":"5804ff04432d6f24a4eb1f77ed6efb136e74c08979ee80899467864ad563b633"},"schema_version":"1.0"},"canonical_sha256":"b3a16128e34bd5b9286f867fce8fe62641cb179bbd3018a82c51612e321f29dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:45.397754Z","signature_b64":"sK5v8KqKaUE+xWUK9Dq/drcEQtsHtrCpraNGG7wvLlTJvdR2wxe7Cqag0tQOZwX02l6B+BFDVKXlFHakzRq3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3a16128e34bd5b9286f867fce8fe62641cb179bbd3018a82c51612e321f29dd","last_reissued_at":"2026-05-18T01:02:45.397322Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:45.397322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02420","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-18T01:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hftdMXnhMSVWXUVcJGZhsYuvAX8iCJIKxUdW4kEVRa/m0GqsolBd/CKbtN0KdL3HFFzvxa9B4KMqMBvrfffjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:07:09.926080Z"},"content_sha256":"56a3c739d78dfb0bd5dc384bf4b37f554731c5949e7d6152d9c009e90afde317","schema_version":"1.0","event_id":"sha256:56a3c739d78dfb0bd5dc384bf4b37f554731c5949e7d6152d9c009e90afde317"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WOQWCKHDJPK3SKDPQZ745D7GEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum algorithm for association rules mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chao-Hua Yu, Fei Gao, Qiao-Yan Wen, Qing-Le Wang","submitted_at":"2015-12-08T12:11:37Z","abstract_excerpt":"Association rules mining is one of the most important problems in knowledge discovery and data mining. The goal of it is to acquire consumption habits of customers by discovering the relationships between items from a transaction database that has a large number of transactions and items. The most compute intensive process for ARM is to find out the frequent 1-itemsets and 2-itemsets. In this paper, we propose a quantum algorithm for finding out the frequent 1-itemsets and 2-itemsets. In our algorithm, to mine the frequent 1-itemsets efficiently, we use the technique of amplitude amplification"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02420","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-18T01:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WuoeX5gQbYrrkKiXKKqCprFqtAzs/w9JPc21BCuEbas6OhyrD7txUFeSUQZjqrOcVPgmBtk/sHk7LToyWyQzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:07:09.926757Z"},"content_sha256":"4f1b1d30520d7c566379661f669986b6812d8162a0ee147ab05840f01c98e312","schema_version":"1.0","event_id":"sha256:4f1b1d30520d7c566379661f669986b6812d8162a0ee147ab05840f01c98e312"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOQWCKHDJPK3SKDPQZ745D7GEZ/bundle.json","state_url":"https://pith.science/pith/WOQWCKHDJPK3SKDPQZ745D7GEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOQWCKHDJPK3SKDPQZ745D7GEZ/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-05-26T23:07:09Z","links":{"resolver":"https://pith.science/pith/WOQWCKHDJPK3SKDPQZ745D7GEZ","bundle":"https://pith.science/pith/WOQWCKHDJPK3SKDPQZ745D7GEZ/bundle.json","state":"https://pith.science/pith/WOQWCKHDJPK3SKDPQZ745D7GEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOQWCKHDJPK3SKDPQZ745D7GEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WOQWCKHDJPK3SKDPQZ745D7GEZ","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":"5804ff04432d6f24a4eb1f77ed6efb136e74c08979ee80899467864ad563b633","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-08T12:11:37Z","title_canon_sha256":"69835c44cecaacd7ca3ca90e77c4ddc37cb4fbd1487c4e26bb91c67d927d6de8"},"schema_version":"1.0","source":{"id":"1512.02420","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02420","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02420v2","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02420","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"WOQWCKHDJPK3","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WOQWCKHDJPK3SKDP","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WOQWCKHD","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:4f1b1d30520d7c566379661f669986b6812d8162a0ee147ab05840f01c98e312","target":"graph","created_at":"2026-05-18T01:02:45Z","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":"Association rules mining is one of the most important problems in knowledge discovery and data mining. The goal of it is to acquire consumption habits of customers by discovering the relationships between items from a transaction database that has a large number of transactions and items. The most compute intensive process for ARM is to find out the frequent 1-itemsets and 2-itemsets. In this paper, we propose a quantum algorithm for finding out the frequent 1-itemsets and 2-itemsets. In our algorithm, to mine the frequent 1-itemsets efficiently, we use the technique of amplitude amplification","authors_text":"Chao-Hua Yu, Fei Gao, Qiao-Yan Wen, Qing-Le Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-08T12:11:37Z","title":"Quantum algorithm for association rules mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02420","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:56a3c739d78dfb0bd5dc384bf4b37f554731c5949e7d6152d9c009e90afde317","target":"record","created_at":"2026-05-18T01:02:45Z","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":"5804ff04432d6f24a4eb1f77ed6efb136e74c08979ee80899467864ad563b633","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-08T12:11:37Z","title_canon_sha256":"69835c44cecaacd7ca3ca90e77c4ddc37cb4fbd1487c4e26bb91c67d927d6de8"},"schema_version":"1.0","source":{"id":"1512.02420","kind":"arxiv","version":2}},"canonical_sha256":"b3a16128e34bd5b9286f867fce8fe62641cb179bbd3018a82c51612e321f29dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3a16128e34bd5b9286f867fce8fe62641cb179bbd3018a82c51612e321f29dd","first_computed_at":"2026-05-18T01:02:45.397322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:45.397322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sK5v8KqKaUE+xWUK9Dq/drcEQtsHtrCpraNGG7wvLlTJvdR2wxe7Cqag0tQOZwX02l6B+BFDVKXlFHakzRq3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:45.397754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02420","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56a3c739d78dfb0bd5dc384bf4b37f554731c5949e7d6152d9c009e90afde317","sha256:4f1b1d30520d7c566379661f669986b6812d8162a0ee147ab05840f01c98e312"],"state_sha256":"9dd9d5bd271e494ebce4fc731e944c4f8655aff26c775ec3ebd68660c38c5909"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5hHgV0b40ZdPheKHA5R0B83PURU38V78npKIUrq0+nf2DKpTYnFviVoCsQLM6WpJAZPa3O2DFRvRGh+vdQFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:07:09.930236Z","bundle_sha256":"e8302e34cb5bdc68a8865c271139da806a5ff19a72becbcb1cf9a881d264e9e7"}}