{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Y36K37JEQLFFGCBSFXFXEKSTHE","short_pith_number":"pith:Y36K37JE","schema_version":"1.0","canonical_sha256":"c6fcadfd2482ca5308322dcb722a53393f81de63b00bdf61c70e049a0ca4e1fe","source":{"kind":"arxiv","id":"2309.09907","version":3},"attestation_state":"computed","paper":{"title":"Quantum Vision Clustering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"quant-ph","authors_text":"Hugh Churchill, Khoa Luu, Samee U. Khan, Xuan Bac Nguyen","submitted_at":"2023-09-18T16:15:16Z","abstract_excerpt":"Unsupervised visual clustering has garnered significant attention in recent times, aiming to characterize distributions of unlabeled visual images through clustering based on a parameterized appearance approach. Alternatively, clustering algorithms can be viewed as assignment problems, often characterized as NP-hard, yet precisely solvable for small instances on contemporary hardware. Adiabatic quantum computing (AQC) emerges as a promising solution, poised to deliver substantial speedups for a range of NP-hard optimization problems. However, existing clustering formulations face challenges in"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.09907","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-18T16:15:16Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"37f41e9608c83f87c7334fbd1b03e789293431e4365b2b521fff5f2040e5087c","abstract_canon_sha256":"83f820342c971dd6f2c604ec5da58102eb9a9c2d716da68b1e8357bcca769413"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:41.589085Z","signature_b64":"aNSS22BMkbJADtNb+sJSaeRyF0zkB9Zj4PE5LPs9awcsjz1Uz9wGkjiqThMmAzGQMpkGSuK4+v+XGuKUSxyUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6fcadfd2482ca5308322dcb722a53393f81de63b00bdf61c70e049a0ca4e1fe","last_reissued_at":"2026-07-05T10:15:41.588569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:41.588569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Vision Clustering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"quant-ph","authors_text":"Hugh Churchill, Khoa Luu, Samee U. Khan, Xuan Bac Nguyen","submitted_at":"2023-09-18T16:15:16Z","abstract_excerpt":"Unsupervised visual clustering has garnered significant attention in recent times, aiming to characterize distributions of unlabeled visual images through clustering based on a parameterized appearance approach. Alternatively, clustering algorithms can be viewed as assignment problems, often characterized as NP-hard, yet precisely solvable for small instances on contemporary hardware. Adiabatic quantum computing (AQC) emerges as a promising solution, poised to deliver substantial speedups for a range of NP-hard optimization problems. However, existing clustering formulations face challenges in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09907","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/2309.09907/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.09907","created_at":"2026-07-05T10:15:41.588637+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.09907v3","created_at":"2026-07-05T10:15:41.588637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09907","created_at":"2026-07-05T10:15:41.588637+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y36K37JEQLFF","created_at":"2026-07-05T10:15:41.588637+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y36K37JEQLFFGCBS","created_at":"2026-07-05T10:15:41.588637+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y36K37JE","created_at":"2026-07-05T10:15:41.588637+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.18187","citing_title":"BRAIN: Bias-Mitigation Continual Learning Approach to Vision-Brain Understanding","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13833","citing_title":"QLAM: A Quantum Long-Attention Memory Approach to Long-Sequence Token Modeling","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y36K37JEQLFFGCBSFXFXEKSTHE","json":"https://pith.science/pith/Y36K37JEQLFFGCBSFXFXEKSTHE.json","graph_json":"https://pith.science/api/pith-number/Y36K37JEQLFFGCBSFXFXEKSTHE/graph.json","events_json":"https://pith.science/api/pith-number/Y36K37JEQLFFGCBSFXFXEKSTHE/events.json","paper":"https://pith.science/paper/Y36K37JE"},"agent_actions":{"view_html":"https://pith.science/pith/Y36K37JEQLFFGCBSFXFXEKSTHE","download_json":"https://pith.science/pith/Y36K37JEQLFFGCBSFXFXEKSTHE.json","view_paper":"https://pith.science/paper/Y36K37JE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.09907&json=true","fetch_graph":"https://pith.science/api/pith-number/Y36K37JEQLFFGCBSFXFXEKSTHE/graph.json","fetch_events":"https://pith.science/api/pith-number/Y36K37JEQLFFGCBSFXFXEKSTHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y36K37JEQLFFGCBSFXFXEKSTHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y36K37JEQLFFGCBSFXFXEKSTHE/action/storage_attestation","attest_author":"https://pith.science/pith/Y36K37JEQLFFGCBSFXFXEKSTHE/action/author_attestation","sign_citation":"https://pith.science/pith/Y36K37JEQLFFGCBSFXFXEKSTHE/action/citation_signature","submit_replication":"https://pith.science/pith/Y36K37JEQLFFGCBSFXFXEKSTHE/action/replication_record"}},"created_at":"2026-07-05T10:15:41.588637+00:00","updated_at":"2026-07-05T10:15:41.588637+00:00"}