{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4TKQIEOG6LSA75OMR5PCSFFADH","short_pith_number":"pith:4TKQIEOG","canonical_record":{"source":{"id":"1309.5701","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-23T06:19:54Z","cross_cats_sorted":[],"title_canon_sha256":"6e48e6f169df7d26e50cd3fd7811615e35fdf1ab4af03496962b6a9f319b79fd","abstract_canon_sha256":"36ee66522a4771d8bf020632cf790a18539ea3eff2a0d038634950b6a5c35f36"},"schema_version":"1.0"},"canonical_sha256":"e4d50411c6f2e40ff5cc8f5e2914a019eeafa513cd2cf465f8d9421e4ceb1ede","source":{"kind":"arxiv","id":"1309.5701","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5701","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5701v2","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5701","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"4TKQIEOG6LSA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4TKQIEOG6LSA75OM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4TKQIEOG","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4TKQIEOG6LSA75OMR5PCSFFADH","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5701","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-23T06:19:54Z","cross_cats_sorted":[],"title_canon_sha256":"6e48e6f169df7d26e50cd3fd7811615e35fdf1ab4af03496962b6a9f319b79fd","abstract_canon_sha256":"36ee66522a4771d8bf020632cf790a18539ea3eff2a0d038634950b6a5c35f36"},"schema_version":"1.0"},"canonical_sha256":"e4d50411c6f2e40ff5cc8f5e2914a019eeafa513cd2cf465f8d9421e4ceb1ede","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:34.307133Z","signature_b64":"J+4PTkFYDSUpe+FZN/GcQ+cNxYZG83k/LJb1kgKAJJRkeXHT2rVaIn2bkBVy4CGHypuXATKTlaYkULZThVyFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d50411c6f2e40ff5cc8f5e2914a019eeafa513cd2cf465f8d9421e4ceb1ede","last_reissued_at":"2026-05-18T02:25:34.306757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:34.306757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5701","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-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNJpQ4L4hWNDtPVSdvgRCagBye+12fgharifBSBECv0MNRwhrMVEZnoxHeOjbR5FIWgBOOi/335VAw3IJIKWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:57:52.732684Z"},"content_sha256":"c998556bec430b61726cd2753106a6397d8005c41cbdc2343faf24327b272c8c","schema_version":"1.0","event_id":"sha256:c998556bec430b61726cd2753106a6397d8005c41cbdc2343faf24327b272c8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4TKQIEOG6LSA75OMR5PCSFFADH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ellipsoidal Rounding for Nonnegative Matrix Factorization Under Noisy Separability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Tomohiko Mizutani","submitted_at":"2013-09-23T06:19:54Z","abstract_excerpt":"We present a numerical algorithm for nonnegative matrix factorization (NMF) problems under noisy separability. An NMF problem under separability can be stated as one of finding all vertices of the convex hull of data points. The research interest of this paper is to find the vectors as close to the vertices as possible in a situation in which noise is added to the data points. Our algorithm is designed to capture the shape of the convex hull of data points by using its enclosing ellipsoid. We show that the algorithm has correctness and robustness properties from theoretical and practical persp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5701","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-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZtdW4QwEMGmj9VSq2CxgYgaZb2dBfREQ6HzDOUAdmEQrgkh/ZN77EAEo9fzDdY2VyphmmoS/fcILkvR+WvLzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:57:52.733416Z"},"content_sha256":"becb2021d25eb2fb6f90c27e0f2ae6909a9f93a8da40bdba52c7b5e5a038f548","schema_version":"1.0","event_id":"sha256:becb2021d25eb2fb6f90c27e0f2ae6909a9f93a8da40bdba52c7b5e5a038f548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TKQIEOG6LSA75OMR5PCSFFADH/bundle.json","state_url":"https://pith.science/pith/4TKQIEOG6LSA75OMR5PCSFFADH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TKQIEOG6LSA75OMR5PCSFFADH/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-11T02:57:52Z","links":{"resolver":"https://pith.science/pith/4TKQIEOG6LSA75OMR5PCSFFADH","bundle":"https://pith.science/pith/4TKQIEOG6LSA75OMR5PCSFFADH/bundle.json","state":"https://pith.science/pith/4TKQIEOG6LSA75OMR5PCSFFADH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TKQIEOG6LSA75OMR5PCSFFADH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4TKQIEOG6LSA75OMR5PCSFFADH","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":"36ee66522a4771d8bf020632cf790a18539ea3eff2a0d038634950b6a5c35f36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-23T06:19:54Z","title_canon_sha256":"6e48e6f169df7d26e50cd3fd7811615e35fdf1ab4af03496962b6a9f319b79fd"},"schema_version":"1.0","source":{"id":"1309.5701","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5701","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5701v2","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5701","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"4TKQIEOG6LSA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4TKQIEOG6LSA75OM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4TKQIEOG","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:becb2021d25eb2fb6f90c27e0f2ae6909a9f93a8da40bdba52c7b5e5a038f548","target":"graph","created_at":"2026-05-18T02:25:34Z","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":"We present a numerical algorithm for nonnegative matrix factorization (NMF) problems under noisy separability. An NMF problem under separability can be stated as one of finding all vertices of the convex hull of data points. The research interest of this paper is to find the vectors as close to the vertices as possible in a situation in which noise is added to the data points. Our algorithm is designed to capture the shape of the convex hull of data points by using its enclosing ellipsoid. We show that the algorithm has correctness and robustness properties from theoretical and practical persp","authors_text":"Tomohiko Mizutani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-23T06:19:54Z","title":"Ellipsoidal Rounding for Nonnegative Matrix Factorization Under Noisy Separability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5701","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:c998556bec430b61726cd2753106a6397d8005c41cbdc2343faf24327b272c8c","target":"record","created_at":"2026-05-18T02:25:34Z","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":"36ee66522a4771d8bf020632cf790a18539ea3eff2a0d038634950b6a5c35f36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-23T06:19:54Z","title_canon_sha256":"6e48e6f169df7d26e50cd3fd7811615e35fdf1ab4af03496962b6a9f319b79fd"},"schema_version":"1.0","source":{"id":"1309.5701","kind":"arxiv","version":2}},"canonical_sha256":"e4d50411c6f2e40ff5cc8f5e2914a019eeafa513cd2cf465f8d9421e4ceb1ede","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4d50411c6f2e40ff5cc8f5e2914a019eeafa513cd2cf465f8d9421e4ceb1ede","first_computed_at":"2026-05-18T02:25:34.306757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:34.306757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J+4PTkFYDSUpe+FZN/GcQ+cNxYZG83k/LJb1kgKAJJRkeXHT2rVaIn2bkBVy4CGHypuXATKTlaYkULZThVyFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:34.307133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5701","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c998556bec430b61726cd2753106a6397d8005c41cbdc2343faf24327b272c8c","sha256:becb2021d25eb2fb6f90c27e0f2ae6909a9f93a8da40bdba52c7b5e5a038f548"],"state_sha256":"8185fc4df78c55d58503571ae17b2dd6a660a35de1568235f386eda52d91fa45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7FmcXqSz8q/EgeGb0VGWT5dYO1TtZ3CSfzsFooaYwwtY5Tkd/ha/aVU0zG8FigjwTyWpjTLFI/Z7wejwk+nDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:57:52.738129Z","bundle_sha256":"5ca2a7e12501003c53ad8e87331b39cf91f4c151e79e9fae1926f0863f748b47"}}