{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:QQJICAJMGIWNRCTLNH3JEHNZRE","short_pith_number":"pith:QQJICAJM","canonical_record":{"source":{"id":"2207.10559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-21T15:58:40Z","cross_cats_sorted":[],"title_canon_sha256":"6526b169ff078e505f3ba451fb83f8c976d260b398fb88e4f75a581c106c7226","abstract_canon_sha256":"37f3fe89a7d1e62bc57f0fa0c7fef1bcfb70578b81974da96f6e291888c0c246"},"schema_version":"1.0"},"canonical_sha256":"841281012c322cd88a6b69f6921db9893e6859169ba56b276a7db7b7ec392e53","source":{"kind":"arxiv","id":"2207.10559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.10559","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"arxiv_version","alias_value":"2207.10559v1","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.10559","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"pith_short_12","alias_value":"QQJICAJMGIWN","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"pith_short_16","alias_value":"QQJICAJMGIWNRCTL","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"pith_short_8","alias_value":"QQJICAJM","created_at":"2026-07-05T05:40:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:QQJICAJMGIWNRCTLNH3JEHNZRE","target":"record","payload":{"canonical_record":{"source":{"id":"2207.10559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-21T15:58:40Z","cross_cats_sorted":[],"title_canon_sha256":"6526b169ff078e505f3ba451fb83f8c976d260b398fb88e4f75a581c106c7226","abstract_canon_sha256":"37f3fe89a7d1e62bc57f0fa0c7fef1bcfb70578b81974da96f6e291888c0c246"},"schema_version":"1.0"},"canonical_sha256":"841281012c322cd88a6b69f6921db9893e6859169ba56b276a7db7b7ec392e53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:07.874973Z","signature_b64":"9U0c7G4VXAoosfYZZZffbAfh13vDc74zE6NWfRoDp+F5TS2eXVN3B21WkzuobU2NqRS9xtihTujI8CAxXD0mBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"841281012c322cd88a6b69f6921db9893e6859169ba56b276a7db7b7ec392e53","last_reissued_at":"2026-07-05T05:40:07.874486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:07.874486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.10559","source_version":1,"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-05T05:40:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"je8wRgQCPmvPkKmMnM88NSprHG+i9EwgrRgly7/a/EhQvkwh3seHmdDPjWXQ7j3fX8i0Qra5Jbt0U398WKnABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:36:02.591740Z"},"content_sha256":"60fa7f276ce6bc5792beaf8e95602c523bf0b503cb9960b0c4080d450566b5b0","schema_version":"1.0","event_id":"sha256:60fa7f276ce6bc5792beaf8e95602c523bf0b503cb9960b0c4080d450566b5b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:QQJICAJMGIWNRCTLNH3JEHNZRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum density peak clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Duarte Magano, Lorenzo Buffoni, Yasser Omar","submitted_at":"2022-07-21T15:58:40Z","abstract_excerpt":"Clustering algorithms are of fundamental importance when dealing with large unstructured datasets and discovering new patterns and correlations therein, with applications ranging from scientific research to medical imaging and marketing analysis. In this work, we introduce a quantum version of the density peak clustering algorithm, built upon a quantum routine for minimum finding. We prove a quantum speedup for a decision version of density peak clustering depending on the structure of the dataset. Specifically, the speedup is dependent on the heights of the trees of the induced graph of neare"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.10559","kind":"arxiv","version":1},"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/2207.10559/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-05T05:40:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKgEXS+vmr3tRJNev8PcqGc3G1gd908WW4ExoiHo6xFNGHhb+IKAWiDycM8lwWIdy1kxwVu5bwQ99hqWsow3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:36:02.592294Z"},"content_sha256":"79f67def864e0c8e67adc7054deb5809e0a80f68822aa4bef3fee7ac309e782b","schema_version":"1.0","event_id":"sha256:79f67def864e0c8e67adc7054deb5809e0a80f68822aa4bef3fee7ac309e782b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQJICAJMGIWNRCTLNH3JEHNZRE/bundle.json","state_url":"https://pith.science/pith/QQJICAJMGIWNRCTLNH3JEHNZRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQJICAJMGIWNRCTLNH3JEHNZRE/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-14T06:36:02Z","links":{"resolver":"https://pith.science/pith/QQJICAJMGIWNRCTLNH3JEHNZRE","bundle":"https://pith.science/pith/QQJICAJMGIWNRCTLNH3JEHNZRE/bundle.json","state":"https://pith.science/pith/QQJICAJMGIWNRCTLNH3JEHNZRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQJICAJMGIWNRCTLNH3JEHNZRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:QQJICAJMGIWNRCTLNH3JEHNZRE","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":"37f3fe89a7d1e62bc57f0fa0c7fef1bcfb70578b81974da96f6e291888c0c246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-21T15:58:40Z","title_canon_sha256":"6526b169ff078e505f3ba451fb83f8c976d260b398fb88e4f75a581c106c7226"},"schema_version":"1.0","source":{"id":"2207.10559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.10559","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"arxiv_version","alias_value":"2207.10559v1","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.10559","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"pith_short_12","alias_value":"QQJICAJMGIWN","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"pith_short_16","alias_value":"QQJICAJMGIWNRCTL","created_at":"2026-07-05T05:40:07Z"},{"alias_kind":"pith_short_8","alias_value":"QQJICAJM","created_at":"2026-07-05T05:40:07Z"}],"graph_snapshots":[{"event_id":"sha256:79f67def864e0c8e67adc7054deb5809e0a80f68822aa4bef3fee7ac309e782b","target":"graph","created_at":"2026-07-05T05:40:07Z","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/2207.10559/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering algorithms are of fundamental importance when dealing with large unstructured datasets and discovering new patterns and correlations therein, with applications ranging from scientific research to medical imaging and marketing analysis. In this work, we introduce a quantum version of the density peak clustering algorithm, built upon a quantum routine for minimum finding. We prove a quantum speedup for a decision version of density peak clustering depending on the structure of the dataset. Specifically, the speedup is dependent on the heights of the trees of the induced graph of neare","authors_text":"Duarte Magano, Lorenzo Buffoni, Yasser Omar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-21T15:58:40Z","title":"Quantum density peak clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.10559","kind":"arxiv","version":1},"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:60fa7f276ce6bc5792beaf8e95602c523bf0b503cb9960b0c4080d450566b5b0","target":"record","created_at":"2026-07-05T05:40:07Z","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":"37f3fe89a7d1e62bc57f0fa0c7fef1bcfb70578b81974da96f6e291888c0c246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-21T15:58:40Z","title_canon_sha256":"6526b169ff078e505f3ba451fb83f8c976d260b398fb88e4f75a581c106c7226"},"schema_version":"1.0","source":{"id":"2207.10559","kind":"arxiv","version":1}},"canonical_sha256":"841281012c322cd88a6b69f6921db9893e6859169ba56b276a7db7b7ec392e53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"841281012c322cd88a6b69f6921db9893e6859169ba56b276a7db7b7ec392e53","first_computed_at":"2026-07-05T05:40:07.874486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:40:07.874486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9U0c7G4VXAoosfYZZZffbAfh13vDc74zE6NWfRoDp+F5TS2eXVN3B21WkzuobU2NqRS9xtihTujI8CAxXD0mBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:40:07.874973Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.10559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60fa7f276ce6bc5792beaf8e95602c523bf0b503cb9960b0c4080d450566b5b0","sha256:79f67def864e0c8e67adc7054deb5809e0a80f68822aa4bef3fee7ac309e782b"],"state_sha256":"76934416f7f50f5890f26578870c68401be8a1dcf31d61f5e780bdaea3e7326c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1TDj5BjW+0VsrFk5hYoKeQQtBLbp7x0CrN56vDXeOSDm0U/RsX1gnET4liS2lYfKyT+r1HMoENLjTeyMzaNKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:36:02.597923Z","bundle_sha256":"96120f6e32a05b59cff5ee4e55dd8c3536e353aad1b634c71a0a87b0c0e5a464"}}