{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6MMON2YDVMQSKPBOJYPAC5DEPL","short_pith_number":"pith:6MMON2YD","schema_version":"1.0","canonical_sha256":"f318e6eb03ab21253c2e4e1e0174647af04275e5ce1e4394360a454ea6943ac7","source":{"kind":"arxiv","id":"1802.07828","version":1},"attestation_state":"computed","paper":{"title":"Quantum Divide-and-Conquer Anchoring for Separable Non-negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dacheng Tao, Runyao Duan, Tongliang Liu, Yinan Li, Yuxuan Du","submitted_at":"2018-02-20T04:03:09Z","abstract_excerpt":"It is NP-complete to find non-negative factors $W$ and $H$ with fixed rank $r$ from a non-negative matrix $X$ by minimizing $\\|X-WH^\\top\\|_F^2$. Although the separability assumption (all data points are in the conical hull of the extreme rows) enables polynomial-time algorithms, the computational cost is not affordable for big data. This paper investigates how the power of quantum computation can be capitalized to solve the non-negative matrix factorization with the separability assumption (SNMF) by devising a quantum algorithm based on the divide-and-conquer anchoring (DCA) scheme. The design"},"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":"1802.07828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-02-20T04:03:09Z","cross_cats_sorted":[],"title_canon_sha256":"b8ee9afbc8e8cce46e9f225eca14ac13ca1354f1b8c3e99d92a583b4084b1fc5","abstract_canon_sha256":"08cc76ec1df80b9d46db7e0775a195884ccf023dc7fa537c589594334e8d0d80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:48.789105Z","signature_b64":"MT1ERbeM8cBZ4PWI/6t5GubDZKOfQ2Y4WIOc8yle58PjGzlVaawhdfQW5PreQKedy6WgROOTNiocUvxa3TWsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f318e6eb03ab21253c2e4e1e0174647af04275e5ce1e4394360a454ea6943ac7","last_reissued_at":"2026-05-18T00:22:48.788509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:48.788509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Divide-and-Conquer Anchoring for Separable Non-negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dacheng Tao, Runyao Duan, Tongliang Liu, Yinan Li, Yuxuan Du","submitted_at":"2018-02-20T04:03:09Z","abstract_excerpt":"It is NP-complete to find non-negative factors $W$ and $H$ with fixed rank $r$ from a non-negative matrix $X$ by minimizing $\\|X-WH^\\top\\|_F^2$. Although the separability assumption (all data points are in the conical hull of the extreme rows) enables polynomial-time algorithms, the computational cost is not affordable for big data. This paper investigates how the power of quantum computation can be capitalized to solve the non-negative matrix factorization with the separability assumption (SNMF) by devising a quantum algorithm based on the divide-and-conquer anchoring (DCA) scheme. The design"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07828","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":""},"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":"1802.07828","created_at":"2026-05-18T00:22:48.788612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07828v1","created_at":"2026-05-18T00:22:48.788612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07828","created_at":"2026-05-18T00:22:48.788612+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MMON2YDVMQS","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MMON2YDVMQSKPBO","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MMON2YD","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL","json":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL.json","graph_json":"https://pith.science/api/pith-number/6MMON2YDVMQSKPBOJYPAC5DEPL/graph.json","events_json":"https://pith.science/api/pith-number/6MMON2YDVMQSKPBOJYPAC5DEPL/events.json","paper":"https://pith.science/paper/6MMON2YD"},"agent_actions":{"view_html":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL","download_json":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL.json","view_paper":"https://pith.science/paper/6MMON2YD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07828&json=true","fetch_graph":"https://pith.science/api/pith-number/6MMON2YDVMQSKPBOJYPAC5DEPL/graph.json","fetch_events":"https://pith.science/api/pith-number/6MMON2YDVMQSKPBOJYPAC5DEPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/action/storage_attestation","attest_author":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/action/author_attestation","sign_citation":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/action/citation_signature","submit_replication":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/action/replication_record"}},"created_at":"2026-05-18T00:22:48.788612+00:00","updated_at":"2026-05-18T00:22:48.788612+00:00"}