{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OO42YLK5ZNA6D6XPKZUGVIX4AS","short_pith_number":"pith:OO42YLK5","canonical_record":{"source":{"id":"1206.1270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:42:27Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"18acddefd39860bb8f288ac03ad838cb39b56204c6547cef8073ccfe1135c6fd","abstract_canon_sha256":"3b2addb9255ea7dbb161095a2ce5b867912f62bf3b1d5ec371212874537b26c3"},"schema_version":"1.0"},"canonical_sha256":"73b9ac2d5dcb41e1faef56686aa2fc04b405f2727f7dfe23be6782e5169d8414","source":{"kind":"arxiv","id":"1206.1270","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1270","created_at":"2026-05-18T03:34:38Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1270v2","created_at":"2026-05-18T03:34:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1270","created_at":"2026-05-18T03:34:38Z"},{"alias_kind":"pith_short_12","alias_value":"OO42YLK5ZNA6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OO42YLK5ZNA6D6XP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OO42YLK5","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OO42YLK5ZNA6D6XPKZUGVIX4AS","target":"record","payload":{"canonical_record":{"source":{"id":"1206.1270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:42:27Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"18acddefd39860bb8f288ac03ad838cb39b56204c6547cef8073ccfe1135c6fd","abstract_canon_sha256":"3b2addb9255ea7dbb161095a2ce5b867912f62bf3b1d5ec371212874537b26c3"},"schema_version":"1.0"},"canonical_sha256":"73b9ac2d5dcb41e1faef56686aa2fc04b405f2727f7dfe23be6782e5169d8414","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:38.165103Z","signature_b64":"8Uhnf9inqeItj080BIGWOsLGK0pobe1osNMqdcNrIwAPQlqpiQN1kLl42G68VPdQgDqKUo2r/SMbrHWnChGhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73b9ac2d5dcb41e1faef56686aa2fc04b405f2727f7dfe23be6782e5169d8414","last_reissued_at":"2026-05-18T03:34:38.164447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:38.164447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.1270","source_version":2,"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-18T03:34:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84BvCPfa7pu8wYN/EsBEP2ApWYWSuq33h9nodg9m+mNnwa94KQxZnW8ftgTaevlOnsMtjhPD/t5XpRL9PsqPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:39:59.306585Z"},"content_sha256":"bef5401dde477e84b3994dfdcb3d6909e1dd0777cf4970a80392f9b839b21c6e","schema_version":"1.0","event_id":"sha256:bef5401dde477e84b3994dfdcb3d6909e1dd0777cf4970a80392f9b839b21c6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OO42YLK5ZNA6D6XPKZUGVIX4AS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factoring nonnegative matrices with linear programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Benjamin Recht, Christopher Re, Joel A. Tropp, Victor Bittorf","submitted_at":"2012-06-06T16:42:27Z","abstract_excerpt":"This paper describes a new approach, based on linear programming, for computing nonnegative matrix factorizations (NMFs). The key idea is a data-driven model for the factorization where the most salient features in the data are used to express the remaining features. More precisely, given a data matrix X, the algorithm identifies a matrix C such that X approximately equals CX and some linear constraints. The constraints are chosen to ensure that the matrix C selects features; these features can then be used to find a low-rank NMF of X. A theoretical analysis demonstrates that this approach has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1270","kind":"arxiv","version":2},"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-18T03:34:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YulPXoBLyxZlHZPAM7uujc480Y+qHRtfMhocE4xZkv7Nmi+Kz3QeBuvfe7yDpXts0pvbTwIr6T38RUrWYvr5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:39:59.307076Z"},"content_sha256":"2b07674562a8cc289f2ca671de66acbd23275a61ee011af0c46f9fe849086204","schema_version":"1.0","event_id":"sha256:2b07674562a8cc289f2ca671de66acbd23275a61ee011af0c46f9fe849086204"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OO42YLK5ZNA6D6XPKZUGVIX4AS/bundle.json","state_url":"https://pith.science/pith/OO42YLK5ZNA6D6XPKZUGVIX4AS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OO42YLK5ZNA6D6XPKZUGVIX4AS/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-30T07:39:59Z","links":{"resolver":"https://pith.science/pith/OO42YLK5ZNA6D6XPKZUGVIX4AS","bundle":"https://pith.science/pith/OO42YLK5ZNA6D6XPKZUGVIX4AS/bundle.json","state":"https://pith.science/pith/OO42YLK5ZNA6D6XPKZUGVIX4AS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OO42YLK5ZNA6D6XPKZUGVIX4AS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OO42YLK5ZNA6D6XPKZUGVIX4AS","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":"3b2addb9255ea7dbb161095a2ce5b867912f62bf3b1d5ec371212874537b26c3","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:42:27Z","title_canon_sha256":"18acddefd39860bb8f288ac03ad838cb39b56204c6547cef8073ccfe1135c6fd"},"schema_version":"1.0","source":{"id":"1206.1270","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1270","created_at":"2026-05-18T03:34:38Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1270v2","created_at":"2026-05-18T03:34:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1270","created_at":"2026-05-18T03:34:38Z"},{"alias_kind":"pith_short_12","alias_value":"OO42YLK5ZNA6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OO42YLK5ZNA6D6XP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OO42YLK5","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:2b07674562a8cc289f2ca671de66acbd23275a61ee011af0c46f9fe849086204","target":"graph","created_at":"2026-05-18T03:34:38Z","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":"This paper describes a new approach, based on linear programming, for computing nonnegative matrix factorizations (NMFs). The key idea is a data-driven model for the factorization where the most salient features in the data are used to express the remaining features. More precisely, given a data matrix X, the algorithm identifies a matrix C such that X approximately equals CX and some linear constraints. The constraints are chosen to ensure that the matrix C selects features; these features can then be used to find a low-rank NMF of X. A theoretical analysis demonstrates that this approach has","authors_text":"Benjamin Recht, Christopher Re, Joel A. Tropp, Victor Bittorf","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:42:27Z","title":"Factoring nonnegative matrices with linear programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1270","kind":"arxiv","version":2},"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:bef5401dde477e84b3994dfdcb3d6909e1dd0777cf4970a80392f9b839b21c6e","target":"record","created_at":"2026-05-18T03:34:38Z","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":"3b2addb9255ea7dbb161095a2ce5b867912f62bf3b1d5ec371212874537b26c3","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-06T16:42:27Z","title_canon_sha256":"18acddefd39860bb8f288ac03ad838cb39b56204c6547cef8073ccfe1135c6fd"},"schema_version":"1.0","source":{"id":"1206.1270","kind":"arxiv","version":2}},"canonical_sha256":"73b9ac2d5dcb41e1faef56686aa2fc04b405f2727f7dfe23be6782e5169d8414","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73b9ac2d5dcb41e1faef56686aa2fc04b405f2727f7dfe23be6782e5169d8414","first_computed_at":"2026-05-18T03:34:38.164447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:38.164447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Uhnf9inqeItj080BIGWOsLGK0pobe1osNMqdcNrIwAPQlqpiQN1kLl42G68VPdQgDqKUo2r/SMbrHWnChGhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:38.165103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1270","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bef5401dde477e84b3994dfdcb3d6909e1dd0777cf4970a80392f9b839b21c6e","sha256:2b07674562a8cc289f2ca671de66acbd23275a61ee011af0c46f9fe849086204"],"state_sha256":"fd6c9bf86dbdd3729c6c6a948eca8d7f1ddac318289e47271ca165fd70b5eb3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"40zRS258yd4scYMX/nPfT2ETPTZEn1bEQFoGPLaE7UyTINIkWCM9z1HwBaqSreVw5svTMmUgEWSQxjhwBZwuCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:39:59.309818Z","bundle_sha256":"b4fdba0702dd36cbef7bd850e08c7a57e15981da7e248f96cf92d740703754c3"}}