{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6JOVHAV3NKGCFOR7A7JDXZDKES","short_pith_number":"pith:6JOVHAV3","canonical_record":{"source":{"id":"1605.07061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-23T15:26:26Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"0bd198f78ee05da14b2ef55f5a2550566168c7c645033b0e203e1f98b88513ad","abstract_canon_sha256":"68b1369a0f15c559e26cfe79858c0c1a3e96279dc295de90bb56e59e0984b553"},"schema_version":"1.0"},"canonical_sha256":"f25d5382bb6a8c22ba3f07d23be46a2486daf5bc95793bab28cba98f6b791c9e","source":{"kind":"arxiv","id":"1605.07061","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07061","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07061v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07061","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"6JOVHAV3NKGC","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6JOVHAV3NKGCFOR7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6JOVHAV3","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6JOVHAV3NKGCFOR7A7JDXZDKES","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-23T15:26:26Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"0bd198f78ee05da14b2ef55f5a2550566168c7c645033b0e203e1f98b88513ad","abstract_canon_sha256":"68b1369a0f15c559e26cfe79858c0c1a3e96279dc295de90bb56e59e0984b553"},"schema_version":"1.0"},"canonical_sha256":"f25d5382bb6a8c22ba3f07d23be46a2486daf5bc95793bab28cba98f6b791c9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:10.450725Z","signature_b64":"/IHYhlS5rxVpqrAQtiyApovDL5yqTxYdVEPm1XbQy8EDumDf+aEzxodibemlGGEPtb/EJT3WetEpqoT2+eUdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f25d5382bb6a8c22ba3f07d23be46a2486daf5bc95793bab28cba98f6b791c9e","last_reissued_at":"2026-05-18T01:14:10.450070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:10.450070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07061","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-18T01:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AVmcm1I5BKmybjbmsamzzPf+ttfQGPj20X+QrPkfP/IWJjSl1GRBGkrr9WH2XsENmpuS4xIZ+92AyKDaNJAHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:36:33.967171Z"},"content_sha256":"6a00badf13e158e2ab1b5136ca8dd2f056990fd6aeaf35d88bffeaf3fb51d3e2","schema_version":"1.0","event_id":"sha256:6a00badf13e158e2ab1b5136ca8dd2f056990fd6aeaf35d88bffeaf3fb51d3e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6JOVHAV3NKGCFOR7A7JDXZDKES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Restricted Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"cs.FL","authors_text":"Dmitry Chistikov, Ines Maru\\v{s}i\\'c, James Worrell, Mahsa Shirmohammadi, Stefan Kiefer","submitted_at":"2016-05-23T15:26:26Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative $n \\times m$ matrix $M$ into a product of a nonnegative $n \\times d$ matrix $W$ and a nonnegative $d \\times m$ matrix $H$. Restricted NMF requires in addition that the column spaces of $M$ and $W$ coincide. Finding the minimal inner dimension $d$ is known to be NP-hard, both for NMF and restricted NMF. We show that restricted NMF is closely related to a question about the nature of minimal probabilistic automata, posed by Paz in his seminal 1971 textbook. We use this connection to answer Paz's question neg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07061","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-18T01:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84xUjlsJ5EwZDNOGxWRGt0YzQltnx3AC6s6LEvy++E83Y76/WIVGYbHD9WKv2ktPpnlvN4RR8XSylqy/03l9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:36:33.967859Z"},"content_sha256":"1e67369b4ca4483584a8d8b962d80b900a3cbf7cac343acf052e21ace61007c8","schema_version":"1.0","event_id":"sha256:1e67369b4ca4483584a8d8b962d80b900a3cbf7cac343acf052e21ace61007c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JOVHAV3NKGCFOR7A7JDXZDKES/bundle.json","state_url":"https://pith.science/pith/6JOVHAV3NKGCFOR7A7JDXZDKES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JOVHAV3NKGCFOR7A7JDXZDKES/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-23T23:36:33Z","links":{"resolver":"https://pith.science/pith/6JOVHAV3NKGCFOR7A7JDXZDKES","bundle":"https://pith.science/pith/6JOVHAV3NKGCFOR7A7JDXZDKES/bundle.json","state":"https://pith.science/pith/6JOVHAV3NKGCFOR7A7JDXZDKES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JOVHAV3NKGCFOR7A7JDXZDKES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6JOVHAV3NKGCFOR7A7JDXZDKES","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":"68b1369a0f15c559e26cfe79858c0c1a3e96279dc295de90bb56e59e0984b553","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-23T15:26:26Z","title_canon_sha256":"0bd198f78ee05da14b2ef55f5a2550566168c7c645033b0e203e1f98b88513ad"},"schema_version":"1.0","source":{"id":"1605.07061","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07061","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07061v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07061","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"6JOVHAV3NKGC","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6JOVHAV3NKGCFOR7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6JOVHAV3","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:1e67369b4ca4483584a8d8b962d80b900a3cbf7cac343acf052e21ace61007c8","target":"graph","created_at":"2026-05-18T01:14:10Z","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":"Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative $n \\times m$ matrix $M$ into a product of a nonnegative $n \\times d$ matrix $W$ and a nonnegative $d \\times m$ matrix $H$. Restricted NMF requires in addition that the column spaces of $M$ and $W$ coincide. Finding the minimal inner dimension $d$ is known to be NP-hard, both for NMF and restricted NMF. We show that restricted NMF is closely related to a question about the nature of minimal probabilistic automata, posed by Paz in his seminal 1971 textbook. We use this connection to answer Paz's question neg","authors_text":"Dmitry Chistikov, Ines Maru\\v{s}i\\'c, James Worrell, Mahsa Shirmohammadi, Stefan Kiefer","cross_cats":["cs.CC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-23T15:26:26Z","title":"On Restricted Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07061","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:6a00badf13e158e2ab1b5136ca8dd2f056990fd6aeaf35d88bffeaf3fb51d3e2","target":"record","created_at":"2026-05-18T01:14:10Z","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":"68b1369a0f15c559e26cfe79858c0c1a3e96279dc295de90bb56e59e0984b553","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-23T15:26:26Z","title_canon_sha256":"0bd198f78ee05da14b2ef55f5a2550566168c7c645033b0e203e1f98b88513ad"},"schema_version":"1.0","source":{"id":"1605.07061","kind":"arxiv","version":1}},"canonical_sha256":"f25d5382bb6a8c22ba3f07d23be46a2486daf5bc95793bab28cba98f6b791c9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f25d5382bb6a8c22ba3f07d23be46a2486daf5bc95793bab28cba98f6b791c9e","first_computed_at":"2026-05-18T01:14:10.450070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:10.450070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/IHYhlS5rxVpqrAQtiyApovDL5yqTxYdVEPm1XbQy8EDumDf+aEzxodibemlGGEPtb/EJT3WetEpqoT2+eUdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:10.450725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07061","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a00badf13e158e2ab1b5136ca8dd2f056990fd6aeaf35d88bffeaf3fb51d3e2","sha256:1e67369b4ca4483584a8d8b962d80b900a3cbf7cac343acf052e21ace61007c8"],"state_sha256":"98680ac55c65e23228c347e8b3a9bcc1868bf1925de01b6f32cc7fa64cabd171"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TndmFRFfbJQK9HricElJ5XcPU73cGX+wEvDkTpNmYFFA4b8mtLpCy4OoDq+lMt2WOrjNHHAEjObbdR66YvtMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T23:36:33.971384Z","bundle_sha256":"8648e2e4667abc756caad16da25a8fc81afe21ed5887f00f7d24ffc2a12c737a"}}