{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XE5ESTTSYG6NKYJDLZPPYYD2AF","short_pith_number":"pith:XE5ESTTS","canonical_record":{"source":{"id":"1610.01349","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-05T10:29:10Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"0f188fda40e953d1aabdee70bc93378fbc5bc570036712253ac90e400162ee92","abstract_canon_sha256":"341219ce39114733e07c09e6fd5f0edf0ed2bcb1887025dc4d0181dfaa53fde9"},"schema_version":"1.0"},"canonical_sha256":"b93a494e72c1bcd561235e5efc607a017b15998e034cbe2a83b01822e3481c1b","source":{"kind":"arxiv","id":"1610.01349","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01349","created_at":"2026-05-18T00:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01349v3","created_at":"2026-05-18T00:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01349","created_at":"2026-05-18T00:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"XE5ESTTSYG6N","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XE5ESTTSYG6NKYJD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XE5ESTTS","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XE5ESTTSYG6NKYJDLZPPYYD2AF","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01349","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-05T10:29:10Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"0f188fda40e953d1aabdee70bc93378fbc5bc570036712253ac90e400162ee92","abstract_canon_sha256":"341219ce39114733e07c09e6fd5f0edf0ed2bcb1887025dc4d0181dfaa53fde9"},"schema_version":"1.0"},"canonical_sha256":"b93a494e72c1bcd561235e5efc607a017b15998e034cbe2a83b01822e3481c1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:08.660158Z","signature_b64":"3E9DHUrw48kbre6GZnyZgkdPAWt2y99vehSHsqxgKN4SP8s07cUAfGWDMdILS18eNQz6gfeWiJEI15outSmkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b93a494e72c1bcd561235e5efc607a017b15998e034cbe2a83b01822e3481c1b","last_reissued_at":"2026-05-18T00:30:08.658941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:08.658941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01349","source_version":3,"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:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+HaaDT55473isUNrqrYwMXHNeZ5yN0qjmVEBMplgvfkwLRu4RTSTpO3ftGWyt4HLwG+q37cyc/UlhuflzgtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:11:16.589408Z"},"content_sha256":"7b3a159ee62774f676388e7919325899f9db866c8ee605f17276b10cbde8b090","schema_version":"1.0","event_id":"sha256:7b3a159ee62774f676388e7919325899f9db866c8ee605f17276b10cbde8b090"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XE5ESTTSYG6NKYJDLZPPYYD2AF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Nicolas Gillis, Robert Luce","submitted_at":"2016-10-05T10:29:10Z","abstract_excerpt":"A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01349","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":""},"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:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqqOyWWHntlyCOz3Yy6OHZDtCZnCiTOmemXO0gF/FLHmQYSjlU1xPm2ZnIDJaB7QKg3GZ53QJ3e3Lb1nIzuoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:11:16.589774Z"},"content_sha256":"abefffc7805219be682a792bf0845544eb1411e263fe7181d737b32f11d79bf9","schema_version":"1.0","event_id":"sha256:abefffc7805219be682a792bf0845544eb1411e263fe7181d737b32f11d79bf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/bundle.json","state_url":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/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-06-27T16:11:16Z","links":{"resolver":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF","bundle":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/bundle.json","state":"https://pith.science/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XE5ESTTSYG6NKYJDLZPPYYD2AF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XE5ESTTSYG6NKYJDLZPPYYD2AF","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":"341219ce39114733e07c09e6fd5f0edf0ed2bcb1887025dc4d0181dfaa53fde9","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-05T10:29:10Z","title_canon_sha256":"0f188fda40e953d1aabdee70bc93378fbc5bc570036712253ac90e400162ee92"},"schema_version":"1.0","source":{"id":"1610.01349","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01349","created_at":"2026-05-18T00:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01349v3","created_at":"2026-05-18T00:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01349","created_at":"2026-05-18T00:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"XE5ESTTSYG6N","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XE5ESTTSYG6NKYJD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XE5ESTTS","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:abefffc7805219be682a792bf0845544eb1411e263fe7181d737b32f11d79bf9","target":"graph","created_at":"2026-05-18T00:30:08Z","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":"A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth op","authors_text":"Nicolas Gillis, Robert Luce","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-05T10:29:10Z","title":"A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01349","kind":"arxiv","version":3},"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:7b3a159ee62774f676388e7919325899f9db866c8ee605f17276b10cbde8b090","target":"record","created_at":"2026-05-18T00:30:08Z","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":"341219ce39114733e07c09e6fd5f0edf0ed2bcb1887025dc4d0181dfaa53fde9","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-05T10:29:10Z","title_canon_sha256":"0f188fda40e953d1aabdee70bc93378fbc5bc570036712253ac90e400162ee92"},"schema_version":"1.0","source":{"id":"1610.01349","kind":"arxiv","version":3}},"canonical_sha256":"b93a494e72c1bcd561235e5efc607a017b15998e034cbe2a83b01822e3481c1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b93a494e72c1bcd561235e5efc607a017b15998e034cbe2a83b01822e3481c1b","first_computed_at":"2026-05-18T00:30:08.658941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:08.658941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3E9DHUrw48kbre6GZnyZgkdPAWt2y99vehSHsqxgKN4SP8s07cUAfGWDMdILS18eNQz6gfeWiJEI15outSmkBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:08.660158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01349","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b3a159ee62774f676388e7919325899f9db866c8ee605f17276b10cbde8b090","sha256:abefffc7805219be682a792bf0845544eb1411e263fe7181d737b32f11d79bf9"],"state_sha256":"15f1163632e332155ffcd4bc5a0a001397ca526a847dd45fab2f5ddf16f6209f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsSf5IpYz+s9YJLs+EvvC1GhlcrJYCAi1C3Ky4bZEVWH76DNHsreKhAh3dqWB98vYdUc6BofFLDx3O8vSH8bDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:11:16.591604Z","bundle_sha256":"1e7e8548bbbf78c78197fc6616ba7093303b955fc397deb01da18bf16b5c9977"}}