{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VTF2POVHI6RXPCBXO7G6FSXP2Z","short_pith_number":"pith:VTF2POVH","canonical_record":{"source":{"id":"2309.09976","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-18T17:56:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"71d7bdce4f8e20be8452a24758cf1241fa7e4dbdddabbcbf7729314b56a590c8","abstract_canon_sha256":"53499f0933a589d8868f1dbcbb22dafabf093912863e47ec13cd271f54db201e"},"schema_version":"1.0"},"canonical_sha256":"accba7baa747a377883777cde2caefd648f455a8549e7ff7ff8e55305fada9c2","source":{"kind":"arxiv","id":"2309.09976","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.09976","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2309.09976v6","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09976","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"VTF2POVHI6RX","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"VTF2POVHI6RXPCBX","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"VTF2POVH","created_at":"2026-07-05T10:03:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VTF2POVHI6RXPCBXO7G6FSXP2Z","target":"record","payload":{"canonical_record":{"source":{"id":"2309.09976","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-18T17:56:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"71d7bdce4f8e20be8452a24758cf1241fa7e4dbdddabbcbf7729314b56a590c8","abstract_canon_sha256":"53499f0933a589d8868f1dbcbb22dafabf093912863e47ec13cd271f54db201e"},"schema_version":"1.0"},"canonical_sha256":"accba7baa747a377883777cde2caefd648f455a8549e7ff7ff8e55305fada9c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:39.650988Z","signature_b64":"y2SyS7jLvD1l1M2bMijX4z4RJvEvSXnyscLkncOtvtlakHyFJxsyQTNRvQOuwxjshvr7PwyLqnu0OIwDkAPtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"accba7baa747a377883777cde2caefd648f455a8549e7ff7ff8e55305fada9c2","last_reissued_at":"2026-07-05T10:03:39.650546Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:39.650546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.09976","source_version":6,"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-05T10:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4E75FRUrmeLA9bfkQyZyFHKPKf9uIlBJyegLFGW+Jt0z0hoMRGV4/9pPtj6b6ygOin3wZK9kns1y+oTBgHb5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T21:51:31.679380Z"},"content_sha256":"2c58e65950ba22b64da47ffa169f6c7cebfaaf3a224702caaf734f2609f01a94","schema_version":"1.0","event_id":"sha256:2c58e65950ba22b64da47ffa169f6c7cebfaaf3a224702caaf734f2609f01a94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VTF2POVHI6RXPCBXO7G6FSXP2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Des-q: a quantum algorithm to provably speedup retraining of decision trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Changhao Li, Marco Pistoia, Niraj Kumar, Pierre Minssen, Romina Yalovetzky","submitted_at":"2023-09-18T17:56:08Z","abstract_excerpt":"Decision trees are widely adopted machine learning models due to their simplicity and explainability. However, as training data size grows, standard methods become increasingly slow, scaling polynomially with the number of training examples. In this work, we introduce Des-q, a novel quantum algorithm to construct and retrain decision trees for regression and binary classification tasks. Assuming the data stream produces small, periodic increments of new training examples, Des-q significantly reduces the tree retraining time. Des-q achieves a logarithmic complexity in the combined total number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09976","kind":"arxiv","version":6},"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/2309.09976/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-05T10:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldtaAMLUcB74xREoU0dj6gZ664o3ke4atXJVbsUhI+cfePArmOwRrd/EsgVejLKThv7q7B4doS/yFAA8NIRyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T21:51:31.679773Z"},"content_sha256":"6b4117634d8451548ba81eafda62192bab6157d318d1fa725fdd273bba3ad642","schema_version":"1.0","event_id":"sha256:6b4117634d8451548ba81eafda62192bab6157d318d1fa725fdd273bba3ad642"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTF2POVHI6RXPCBXO7G6FSXP2Z/bundle.json","state_url":"https://pith.science/pith/VTF2POVHI6RXPCBXO7G6FSXP2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTF2POVHI6RXPCBXO7G6FSXP2Z/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-07-11T21:51:31Z","links":{"resolver":"https://pith.science/pith/VTF2POVHI6RXPCBXO7G6FSXP2Z","bundle":"https://pith.science/pith/VTF2POVHI6RXPCBXO7G6FSXP2Z/bundle.json","state":"https://pith.science/pith/VTF2POVHI6RXPCBXO7G6FSXP2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTF2POVHI6RXPCBXO7G6FSXP2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VTF2POVHI6RXPCBXO7G6FSXP2Z","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":"53499f0933a589d8868f1dbcbb22dafabf093912863e47ec13cd271f54db201e","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-18T17:56:08Z","title_canon_sha256":"71d7bdce4f8e20be8452a24758cf1241fa7e4dbdddabbcbf7729314b56a590c8"},"schema_version":"1.0","source":{"id":"2309.09976","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.09976","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2309.09976v6","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09976","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"VTF2POVHI6RX","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"VTF2POVHI6RXPCBX","created_at":"2026-07-05T10:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"VTF2POVH","created_at":"2026-07-05T10:03:39Z"}],"graph_snapshots":[{"event_id":"sha256:6b4117634d8451548ba81eafda62192bab6157d318d1fa725fdd273bba3ad642","target":"graph","created_at":"2026-07-05T10:03:39Z","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/2309.09976/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decision trees are widely adopted machine learning models due to their simplicity and explainability. However, as training data size grows, standard methods become increasingly slow, scaling polynomially with the number of training examples. In this work, we introduce Des-q, a novel quantum algorithm to construct and retrain decision trees for regression and binary classification tasks. Assuming the data stream produces small, periodic increments of new training examples, Des-q significantly reduces the tree retraining time. Des-q achieves a logarithmic complexity in the combined total number ","authors_text":"Changhao Li, Marco Pistoia, Niraj Kumar, Pierre Minssen, Romina Yalovetzky","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-18T17:56:08Z","title":"Des-q: a quantum algorithm to provably speedup retraining of decision trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09976","kind":"arxiv","version":6},"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:2c58e65950ba22b64da47ffa169f6c7cebfaaf3a224702caaf734f2609f01a94","target":"record","created_at":"2026-07-05T10:03:39Z","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":"53499f0933a589d8868f1dbcbb22dafabf093912863e47ec13cd271f54db201e","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-18T17:56:08Z","title_canon_sha256":"71d7bdce4f8e20be8452a24758cf1241fa7e4dbdddabbcbf7729314b56a590c8"},"schema_version":"1.0","source":{"id":"2309.09976","kind":"arxiv","version":6}},"canonical_sha256":"accba7baa747a377883777cde2caefd648f455a8549e7ff7ff8e55305fada9c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"accba7baa747a377883777cde2caefd648f455a8549e7ff7ff8e55305fada9c2","first_computed_at":"2026-07-05T10:03:39.650546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:03:39.650546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y2SyS7jLvD1l1M2bMijX4z4RJvEvSXnyscLkncOtvtlakHyFJxsyQTNRvQOuwxjshvr7PwyLqnu0OIwDkAPtAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:03:39.650988Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.09976","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c58e65950ba22b64da47ffa169f6c7cebfaaf3a224702caaf734f2609f01a94","sha256:6b4117634d8451548ba81eafda62192bab6157d318d1fa725fdd273bba3ad642"],"state_sha256":"b3cf3010e36a14ca8e79d58a2f1222b8c1a4f1a042fa38a3de3c88042bb8541f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnVbb9o50P+17tGPqPD7O+FrxeTp+voCbtSW1MlVwoE4w0ZRH5ypKoSbCfBDXG/fhwWadccqeMfdpnRrLravDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T21:51:31.684327Z","bundle_sha256":"db095291ee42661e0d4f9e22f1b6cdbb3e25895eb0837d9107141b08411a7790"}}