{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TY7USWYQ3HPNPFCKPYIBQZ5GRO","short_pith_number":"pith:TY7USWYQ","canonical_record":{"source":{"id":"2007.01028","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T11:26:54Z","cross_cats_sorted":["quant-ph","stat.ML"],"title_canon_sha256":"fe6d28276793e8f1322064623ddb61817304874dba2a3cd654f0bd43a725d95a","abstract_canon_sha256":"7eadadaab58da46e9fce6b6d42b70ba6e6cf02b8600c5325a846fc527d8d0c0b"},"schema_version":"1.0"},"canonical_sha256":"9e3f495b10d9ded7944a7e101867a68bab0963492b9d9ab739c0d681ebf18c58","source":{"kind":"arxiv","id":"2007.01028","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.01028","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"arxiv_version","alias_value":"2007.01028v3","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.01028","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"pith_short_12","alias_value":"TY7USWYQ3HPN","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"pith_short_16","alias_value":"TY7USWYQ3HPNPFCK","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"pith_short_8","alias_value":"TY7USWYQ","created_at":"2026-07-05T09:42:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TY7USWYQ3HPNPFCKPYIBQZ5GRO","target":"record","payload":{"canonical_record":{"source":{"id":"2007.01028","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T11:26:54Z","cross_cats_sorted":["quant-ph","stat.ML"],"title_canon_sha256":"fe6d28276793e8f1322064623ddb61817304874dba2a3cd654f0bd43a725d95a","abstract_canon_sha256":"7eadadaab58da46e9fce6b6d42b70ba6e6cf02b8600c5325a846fc527d8d0c0b"},"schema_version":"1.0"},"canonical_sha256":"9e3f495b10d9ded7944a7e101867a68bab0963492b9d9ab739c0d681ebf18c58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:16.495671Z","signature_b64":"ndAV9u8b+E/M8eRDbU86EUGfauDyXdZaN7jM++Ej/uj7rtKnZglNj6Q6dZUJFxQGVQyi94M+YZ5ycFhksb1SCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e3f495b10d9ded7944a7e101867a68bab0963492b9d9ab739c0d681ebf18c58","last_reissued_at":"2026-07-05T09:42:16.495203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:16.495203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.01028","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-05T09:42:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6Ya6+Kt8BYqvWFrl2thAZWTVT4gvQ7F2LvzcPSaJCCxZj+EKE1RdiHt9IGjCLA33COwu6SOQK76yWxyLUoCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:00:42.023269Z"},"content_sha256":"3411a1bcfdba5f7f036c1097137ee44519beab775bd11c9e00fa2000db87b943","schema_version":"1.0","event_id":"sha256:3411a1bcfdba5f7f036c1097137ee44519beab775bd11c9e00fa2000db87b943"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TY7USWYQ3HPNPFCKPYIBQZ5GRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Ensemble for Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph","stat.ML"],"primary_cat":"cs.LG","authors_text":"Antonio Macaluso, Claudio Sartori, Luca Clissa, Stefano Lodi","submitted_at":"2020-07-02T11:26:54Z","abstract_excerpt":"A powerful way to improve performance in machine learning is to construct an ensemble that combines the predictions of multiple models. Ensemble methods are often much more accurate and lower variance than the individual classifiers that make them up but have high requirements in terms of memory and computational time. In fact, a large number of alternative algorithms is usually adopted, each requiring to query all available data.\n  We propose a new quantum algorithm that exploits quantum superposition, entanglement and interference to build an ensemble of classification models. Thanks to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.01028","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/2007.01028/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-05T09:42:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLAntvXFaeBC6a4MABthJ8djMjV6xWl1/TCjNDbVSeAuXkS0S90TYiW5o9YzmQGu920krIx/FuQ/GaIo03+hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:00:42.023784Z"},"content_sha256":"c62a5ea41b0b0da7bfcf7902b90ac1622bd81320b6788487a686f299b3f06851","schema_version":"1.0","event_id":"sha256:c62a5ea41b0b0da7bfcf7902b90ac1622bd81320b6788487a686f299b3f06851"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TY7USWYQ3HPNPFCKPYIBQZ5GRO/bundle.json","state_url":"https://pith.science/pith/TY7USWYQ3HPNPFCKPYIBQZ5GRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TY7USWYQ3HPNPFCKPYIBQZ5GRO/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-08T22:00:42Z","links":{"resolver":"https://pith.science/pith/TY7USWYQ3HPNPFCKPYIBQZ5GRO","bundle":"https://pith.science/pith/TY7USWYQ3HPNPFCKPYIBQZ5GRO/bundle.json","state":"https://pith.science/pith/TY7USWYQ3HPNPFCKPYIBQZ5GRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TY7USWYQ3HPNPFCKPYIBQZ5GRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TY7USWYQ3HPNPFCKPYIBQZ5GRO","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":"7eadadaab58da46e9fce6b6d42b70ba6e6cf02b8600c5325a846fc527d8d0c0b","cross_cats_sorted":["quant-ph","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T11:26:54Z","title_canon_sha256":"fe6d28276793e8f1322064623ddb61817304874dba2a3cd654f0bd43a725d95a"},"schema_version":"1.0","source":{"id":"2007.01028","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.01028","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"arxiv_version","alias_value":"2007.01028v3","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.01028","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"pith_short_12","alias_value":"TY7USWYQ3HPN","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"pith_short_16","alias_value":"TY7USWYQ3HPNPFCK","created_at":"2026-07-05T09:42:16Z"},{"alias_kind":"pith_short_8","alias_value":"TY7USWYQ","created_at":"2026-07-05T09:42:16Z"}],"graph_snapshots":[{"event_id":"sha256:c62a5ea41b0b0da7bfcf7902b90ac1622bd81320b6788487a686f299b3f06851","target":"graph","created_at":"2026-07-05T09:42:16Z","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/2007.01028/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A powerful way to improve performance in machine learning is to construct an ensemble that combines the predictions of multiple models. Ensemble methods are often much more accurate and lower variance than the individual classifiers that make them up but have high requirements in terms of memory and computational time. In fact, a large number of alternative algorithms is usually adopted, each requiring to query all available data.\n  We propose a new quantum algorithm that exploits quantum superposition, entanglement and interference to build an ensemble of classification models. Thanks to the ","authors_text":"Antonio Macaluso, Claudio Sartori, Luca Clissa, Stefano Lodi","cross_cats":["quant-ph","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T11:26:54Z","title":"Quantum Ensemble for Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.01028","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:3411a1bcfdba5f7f036c1097137ee44519beab775bd11c9e00fa2000db87b943","target":"record","created_at":"2026-07-05T09:42:16Z","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":"7eadadaab58da46e9fce6b6d42b70ba6e6cf02b8600c5325a846fc527d8d0c0b","cross_cats_sorted":["quant-ph","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T11:26:54Z","title_canon_sha256":"fe6d28276793e8f1322064623ddb61817304874dba2a3cd654f0bd43a725d95a"},"schema_version":"1.0","source":{"id":"2007.01028","kind":"arxiv","version":3}},"canonical_sha256":"9e3f495b10d9ded7944a7e101867a68bab0963492b9d9ab739c0d681ebf18c58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e3f495b10d9ded7944a7e101867a68bab0963492b9d9ab739c0d681ebf18c58","first_computed_at":"2026-07-05T09:42:16.495203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:16.495203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ndAV9u8b+E/M8eRDbU86EUGfauDyXdZaN7jM++Ej/uj7rtKnZglNj6Q6dZUJFxQGVQyi94M+YZ5ycFhksb1SCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:16.495671Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.01028","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3411a1bcfdba5f7f036c1097137ee44519beab775bd11c9e00fa2000db87b943","sha256:c62a5ea41b0b0da7bfcf7902b90ac1622bd81320b6788487a686f299b3f06851"],"state_sha256":"548209602038e734623eb6a2cc11efb9c9acdf416ccbdbcf8840c5199740998e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4sFAqGe5b6nC6e2lK2CGPkXPAKnL6CvHyjM8YZiWB3VE7sh6skE1YvrNvdyQsRzJylSLgLZXPEpA1GSg8kvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T22:00:42.028918Z","bundle_sha256":"28b0f74d0f4dbbad17af1a2baecf156d02da9ea830644f528104e281f103fd53"}}