{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KFUBXYMAZVZWAG2PT3KWAUPJUM","short_pith_number":"pith:KFUBXYMA","canonical_record":{"source":{"id":"1710.00387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-01T18:20:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e2558c6f61f031ac4ee454448cbf9c2747d69130356f5baddf01770ec37f850b","abstract_canon_sha256":"3044e47a2218b64dbb8d2b66129a6cffe64b20efdd6a79ce5fe560ff3d9e3813"},"schema_version":"1.0"},"canonical_sha256":"51681be180cd73601b4f9ed56051e9a300a0420e592b95fa01fdc6606978c39b","source":{"kind":"arxiv","id":"1710.00387","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00387","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00387v1","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00387","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"KFUBXYMAZVZW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KFUBXYMAZVZWAG2P","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KFUBXYMA","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KFUBXYMAZVZWAG2PT3KWAUPJUM","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-01T18:20:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e2558c6f61f031ac4ee454448cbf9c2747d69130356f5baddf01770ec37f850b","abstract_canon_sha256":"3044e47a2218b64dbb8d2b66129a6cffe64b20efdd6a79ce5fe560ff3d9e3813"},"schema_version":"1.0"},"canonical_sha256":"51681be180cd73601b4f9ed56051e9a300a0420e592b95fa01fdc6606978c39b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:19.381728Z","signature_b64":"nsPbFR4NaLZC9DWEcBqQ6utdFYiigjUtkygNcR1VVyZ3q8J/yiPw+UHmHBzMsllEMRy3Eg5cpZMlBRpU8Jw1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51681be180cd73601b4f9ed56051e9a300a0420e592b95fa01fdc6606978c39b","last_reissued_at":"2026-05-18T00:16:19.381284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:19.381284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00387","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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/C1k14XuxdFxlAiJtPQ6AdyDQnlTzD05p65gJjkWFR2h5RrqpTgvoIUONGuKCREmJMOz3JhzKsrCd/IcjUsKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:56:51.223331Z"},"content_sha256":"9e2360c237ea06ab3d2a5e43b77da242a63428452be07eca7e76dd4595a4867c","schema_version":"1.0","event_id":"sha256:9e2360c237ea06ab3d2a5e43b77da242a63428452be07eca7e76dd4595a4867c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KFUBXYMAZVZWAG2PT3KWAUPJUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Preconditioning for Noisy Separable NMFs by Successive Projection Based Low-Rank Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.NA","authors_text":"Mirai Tanaka, Tomohiko Mizutani","submitted_at":"2017-10-01T18:20:57Z","abstract_excerpt":"The successive projection algorithm (SPA) can quickly solve a nonnegative matrix factorization problem under a separability assumption. Even if noise is added to the problem, SPA is robust as long as the perturbations caused by the noise are small. In particular, robustness against noise should be high when handling the problems arising from real applications. The preconditioner proposed by Gillis and Vavasis (2015) makes it possible to enhance the noise robustness of SPA. Meanwhile, an additional computational cost is required. The construction of the preconditioner contains a step to compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00387","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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0Y9YLMiWQvbTngsOe435mGoobMykX7clKnBvOTnjFSFNlOV7S4KBVHQmirRAcIj5lLHOrqanZBJtkj9jqRoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:56:51.224033Z"},"content_sha256":"784aa802d8f1922fbbe2b1c89de701cd37d64156d70a6ef952b36fced855eaf0","schema_version":"1.0","event_id":"sha256:784aa802d8f1922fbbe2b1c89de701cd37d64156d70a6ef952b36fced855eaf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFUBXYMAZVZWAG2PT3KWAUPJUM/bundle.json","state_url":"https://pith.science/pith/KFUBXYMAZVZWAG2PT3KWAUPJUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFUBXYMAZVZWAG2PT3KWAUPJUM/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:56:51Z","links":{"resolver":"https://pith.science/pith/KFUBXYMAZVZWAG2PT3KWAUPJUM","bundle":"https://pith.science/pith/KFUBXYMAZVZWAG2PT3KWAUPJUM/bundle.json","state":"https://pith.science/pith/KFUBXYMAZVZWAG2PT3KWAUPJUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFUBXYMAZVZWAG2PT3KWAUPJUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KFUBXYMAZVZWAG2PT3KWAUPJUM","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":"3044e47a2218b64dbb8d2b66129a6cffe64b20efdd6a79ce5fe560ff3d9e3813","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-01T18:20:57Z","title_canon_sha256":"e2558c6f61f031ac4ee454448cbf9c2747d69130356f5baddf01770ec37f850b"},"schema_version":"1.0","source":{"id":"1710.00387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00387","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00387v1","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00387","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"KFUBXYMAZVZW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KFUBXYMAZVZWAG2P","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KFUBXYMA","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:784aa802d8f1922fbbe2b1c89de701cd37d64156d70a6ef952b36fced855eaf0","target":"graph","created_at":"2026-05-18T00:16:19Z","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":"The successive projection algorithm (SPA) can quickly solve a nonnegative matrix factorization problem under a separability assumption. Even if noise is added to the problem, SPA is robust as long as the perturbations caused by the noise are small. In particular, robustness against noise should be high when handling the problems arising from real applications. The preconditioner proposed by Gillis and Vavasis (2015) makes it possible to enhance the noise robustness of SPA. Meanwhile, an additional computational cost is required. The construction of the preconditioner contains a step to compute","authors_text":"Mirai Tanaka, Tomohiko Mizutani","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-01T18:20:57Z","title":"Efficient Preconditioning for Noisy Separable NMFs by Successive Projection Based Low-Rank Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00387","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:9e2360c237ea06ab3d2a5e43b77da242a63428452be07eca7e76dd4595a4867c","target":"record","created_at":"2026-05-18T00:16:19Z","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":"3044e47a2218b64dbb8d2b66129a6cffe64b20efdd6a79ce5fe560ff3d9e3813","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-01T18:20:57Z","title_canon_sha256":"e2558c6f61f031ac4ee454448cbf9c2747d69130356f5baddf01770ec37f850b"},"schema_version":"1.0","source":{"id":"1710.00387","kind":"arxiv","version":1}},"canonical_sha256":"51681be180cd73601b4f9ed56051e9a300a0420e592b95fa01fdc6606978c39b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51681be180cd73601b4f9ed56051e9a300a0420e592b95fa01fdc6606978c39b","first_computed_at":"2026-05-18T00:16:19.381284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:19.381284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nsPbFR4NaLZC9DWEcBqQ6utdFYiigjUtkygNcR1VVyZ3q8J/yiPw+UHmHBzMsllEMRy3Eg5cpZMlBRpU8Jw1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:19.381728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e2360c237ea06ab3d2a5e43b77da242a63428452be07eca7e76dd4595a4867c","sha256:784aa802d8f1922fbbe2b1c89de701cd37d64156d70a6ef952b36fced855eaf0"],"state_sha256":"18a4c19cd81a28f83f98efbce2a2fd9224e47253fc6553403aa99dc64f3146c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZO3Tl4ptYa0L0HLSJkPWYUUgA/ltzfcaBXKJ+ZAG+UQ88YSo3TVY7weZtuBjc907K/z1GIoQxqjimdqAxyx8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:56:51.228106Z","bundle_sha256":"fb4b433d21f0e3fefd2b5a18394fef4f205a3e2e2be0b70ccaa97aeed1288466"}}