{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6MMON2YDVMQSKPBOJYPAC5DEPL","short_pith_number":"pith:6MMON2YD","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"},"canonical_sha256":"f318e6eb03ab21253c2e4e1e0174647af04275e5ce1e4394360a454ea6943ac7","source":{"kind":"arxiv","id":"1802.07828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07828","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07828v1","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07828","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"6MMON2YDVMQS","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6MMON2YDVMQSKPBO","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6MMON2YD","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6MMON2YDVMQSKPBOJYPAC5DEPL","target":"record","payload":{"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"},"canonical_sha256":"f318e6eb03ab21253c2e4e1e0174647af04275e5ce1e4394360a454ea6943ac7","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"},"source_kind":"arxiv","source_id":"1802.07828","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-05-18T00:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoHNn+I6pls1vfJMR3T3FYwjNUO3uSp4Np0E4kVeSq0xn5kUuZJ5kEYcaI7JQ0xMMSqmbM/JLMAKgmP2RxuUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:12:45.210610Z"},"content_sha256":"2b329141adcef63e8de1df2ab43e94ec5333e1af2a1d29a7fd039b8a95e8114a","schema_version":"1.0","event_id":"sha256:2b329141adcef63e8de1df2ab43e94ec5333e1af2a1d29a7fd039b8a95e8114a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6MMON2YDVMQSKPBOJYPAC5DEPL","target":"graph","payload":{"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"},"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-05-18T00:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jM8j4v8R7dE9D5v8rQzfW+DVlneweB/XXBY7MMb9YYhimvyhnMV/3yL7HqhiV/nZl690ws6ejwsZ8vaMoSqKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:12:45.210978Z"},"content_sha256":"2bd416252ce710c946e4ad727cbf920320f3074258822c1ae8c87343127f2d4e","schema_version":"1.0","event_id":"sha256:2bd416252ce710c946e4ad727cbf920320f3074258822c1ae8c87343127f2d4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/bundle.json","state_url":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/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-05-30T21:12:45Z","links":{"resolver":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL","bundle":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/bundle.json","state":"https://pith.science/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MMON2YDVMQSKPBOJYPAC5DEPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6MMON2YDVMQSKPBOJYPAC5DEPL","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":"08cc76ec1df80b9d46db7e0775a195884ccf023dc7fa537c589594334e8d0d80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-02-20T04:03:09Z","title_canon_sha256":"b8ee9afbc8e8cce46e9f225eca14ac13ca1354f1b8c3e99d92a583b4084b1fc5"},"schema_version":"1.0","source":{"id":"1802.07828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07828","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07828v1","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07828","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"6MMON2YDVMQS","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6MMON2YDVMQSKPBO","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6MMON2YD","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:2bd416252ce710c946e4ad727cbf920320f3074258822c1ae8c87343127f2d4e","target":"graph","created_at":"2026-05-18T00:22:48Z","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"},"paper":{"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","authors_text":"Dacheng Tao, Runyao Duan, Tongliang Liu, Yinan Li, Yuxuan Du","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-02-20T04:03:09Z","title":"Quantum Divide-and-Conquer Anchoring for Separable Non-negative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07828","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:2b329141adcef63e8de1df2ab43e94ec5333e1af2a1d29a7fd039b8a95e8114a","target":"record","created_at":"2026-05-18T00:22:48Z","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":"08cc76ec1df80b9d46db7e0775a195884ccf023dc7fa537c589594334e8d0d80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-02-20T04:03:09Z","title_canon_sha256":"b8ee9afbc8e8cce46e9f225eca14ac13ca1354f1b8c3e99d92a583b4084b1fc5"},"schema_version":"1.0","source":{"id":"1802.07828","kind":"arxiv","version":1}},"canonical_sha256":"f318e6eb03ab21253c2e4e1e0174647af04275e5ce1e4394360a454ea6943ac7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f318e6eb03ab21253c2e4e1e0174647af04275e5ce1e4394360a454ea6943ac7","first_computed_at":"2026-05-18T00:22:48.788509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:48.788509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MT1ERbeM8cBZ4PWI/6t5GubDZKOfQ2Y4WIOc8yle58PjGzlVaawhdfQW5PreQKedy6WgROOTNiocUvxa3TWsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:48.789105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b329141adcef63e8de1df2ab43e94ec5333e1af2a1d29a7fd039b8a95e8114a","sha256:2bd416252ce710c946e4ad727cbf920320f3074258822c1ae8c87343127f2d4e"],"state_sha256":"0a8f8e30181273b5c61d4e89f948cf135fe8c5cec29c93a636e69c82bc105f10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfn2S9cLtDfsa1WXZouP6EBHbgiRqmDq21FEl0uWF/Pt+rpl534wmkF3BZeCDfIGLTSyMvvD37ImtmFvFPhoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:12:45.213202Z","bundle_sha256":"751fdd00af75de83a7593b0272959aa03a99ccbd8a7d3b09ed141f421545f591"}}