{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NK5XVW5CLUWQUVCWHKTFN7ZYE5","short_pith_number":"pith:NK5XVW5C","canonical_record":{"source":{"id":"1908.04109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-12T12:21:50Z","cross_cats_sorted":["cs.LG","cs.NA","eess.IV","math.NA","stat.ML"],"title_canon_sha256":"7086308e1b0d8cdef536a03c8cc799ae0ea3109783aa29b18173ef0920a1deb0","abstract_canon_sha256":"103b42e779a011913f9e7da2c5483f285cbd7e8c4d79d57b11bb829195e74536"},"schema_version":"1.0"},"canonical_sha256":"6abb7adba25d2d0a54563aa656ff38276fc6e6554227309cd1e50f0e27275013","source":{"kind":"arxiv","id":"1908.04109","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04109","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04109v1","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04109","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"NK5XVW5CLUWQ","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_16","alias_value":"NK5XVW5CLUWQUVCW","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_8","alias_value":"NK5XVW5C","created_at":"2026-07-04T23:53:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NK5XVW5CLUWQUVCWHKTFN7ZYE5","target":"record","payload":{"canonical_record":{"source":{"id":"1908.04109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-12T12:21:50Z","cross_cats_sorted":["cs.LG","cs.NA","eess.IV","math.NA","stat.ML"],"title_canon_sha256":"7086308e1b0d8cdef536a03c8cc799ae0ea3109783aa29b18173ef0920a1deb0","abstract_canon_sha256":"103b42e779a011913f9e7da2c5483f285cbd7e8c4d79d57b11bb829195e74536"},"schema_version":"1.0"},"canonical_sha256":"6abb7adba25d2d0a54563aa656ff38276fc6e6554227309cd1e50f0e27275013","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:20.796796Z","signature_b64":"ZQiWCPydV66pESfioKYPMjaoqYYLWnCjd7dbPoPsO93dRbi1RhF7Jrf6t76gl00LIOqpEkxc/GctuKVCpoD3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6abb7adba25d2d0a54563aa656ff38276fc6e6554227309cd1e50f0e27275013","last_reissued_at":"2026-07-04T23:53:20.796430Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:20.796430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.04109","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-07-04T23:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44JIOLD6DH9Pjr6FeLaDeLK2niI2NX4ndsOwn4KMfkb4nDnH4kVnQppPDIOADLTV+380axaYqH00R9ZCo8lfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:41:16.630785Z"},"content_sha256":"ff1501f3837e9aa0e9c6d535d6da3f9cfc57575fbf3e3c47155862178d0fe944","schema_version":"1.0","event_id":"sha256:ff1501f3837e9aa0e9c6d535d6da3f9cfc57575fbf3e3c47155862178d0fe944"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NK5XVW5CLUWQUVCWHKTFN7ZYE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Successive Projection Algorithm Robust to Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","eess.IV","math.NA","stat.ML"],"primary_cat":"eess.SP","authors_text":"Nicolas Gillis","submitted_at":"2019-08-12T12:21:50Z","abstract_excerpt":"The successive projection algorithm (SPA) is a fast algorithm to tackle separable nonnegative matrix factorization (NMF). Given a nonnegative data matrix $X$, SPA identifies an index set $\\mathcal{K}$ such that there exists a nonnegative matrix $H$ with $X \\approx X(:,\\mathcal{K})H$. SPA has been successfully used as a pure-pixel search algorithm in hyperspectral unmixing and for anchor word selection in document classification. Moreover, SPA is provably robust in low-noise settings. The main drawbacks of SPA are that it is not robust to outliers and does not take the data fitting term into ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04109","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04109/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zac3ybeRaLMxJfyS9NtBwQqHIZxZp92hXzwXse9WRYkCZp1O5sVBydyT4386HBmrkeI5EsIHphF1QR/D+XEwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:41:16.631693Z"},"content_sha256":"e774104c414ef97f95bde43551fd305ee768495cdeee8a2a2f75378564b4e3e3","schema_version":"1.0","event_id":"sha256:e774104c414ef97f95bde43551fd305ee768495cdeee8a2a2f75378564b4e3e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NK5XVW5CLUWQUVCWHKTFN7ZYE5/bundle.json","state_url":"https://pith.science/pith/NK5XVW5CLUWQUVCWHKTFN7ZYE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NK5XVW5CLUWQUVCWHKTFN7ZYE5/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-08-16T06:41:16Z","links":{"resolver":"https://pith.science/pith/NK5XVW5CLUWQUVCWHKTFN7ZYE5","bundle":"https://pith.science/pith/NK5XVW5CLUWQUVCWHKTFN7ZYE5/bundle.json","state":"https://pith.science/pith/NK5XVW5CLUWQUVCWHKTFN7ZYE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NK5XVW5CLUWQUVCWHKTFN7ZYE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NK5XVW5CLUWQUVCWHKTFN7ZYE5","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":"103b42e779a011913f9e7da2c5483f285cbd7e8c4d79d57b11bb829195e74536","cross_cats_sorted":["cs.LG","cs.NA","eess.IV","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-12T12:21:50Z","title_canon_sha256":"7086308e1b0d8cdef536a03c8cc799ae0ea3109783aa29b18173ef0920a1deb0"},"schema_version":"1.0","source":{"id":"1908.04109","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04109","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04109v1","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04109","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"NK5XVW5CLUWQ","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_16","alias_value":"NK5XVW5CLUWQUVCW","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_8","alias_value":"NK5XVW5C","created_at":"2026-07-04T23:53:20Z"}],"graph_snapshots":[{"event_id":"sha256:e774104c414ef97f95bde43551fd305ee768495cdeee8a2a2f75378564b4e3e3","target":"graph","created_at":"2026-07-04T23:53:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.04109/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The successive projection algorithm (SPA) is a fast algorithm to tackle separable nonnegative matrix factorization (NMF). Given a nonnegative data matrix $X$, SPA identifies an index set $\\mathcal{K}$ such that there exists a nonnegative matrix $H$ with $X \\approx X(:,\\mathcal{K})H$. SPA has been successfully used as a pure-pixel search algorithm in hyperspectral unmixing and for anchor word selection in document classification. Moreover, SPA is provably robust in low-noise settings. The main drawbacks of SPA are that it is not robust to outliers and does not take the data fitting term into ac","authors_text":"Nicolas Gillis","cross_cats":["cs.LG","cs.NA","eess.IV","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-12T12:21:50Z","title":"Successive Projection Algorithm Robust to Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04109","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:ff1501f3837e9aa0e9c6d535d6da3f9cfc57575fbf3e3c47155862178d0fe944","target":"record","created_at":"2026-07-04T23:53:20Z","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":"103b42e779a011913f9e7da2c5483f285cbd7e8c4d79d57b11bb829195e74536","cross_cats_sorted":["cs.LG","cs.NA","eess.IV","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-12T12:21:50Z","title_canon_sha256":"7086308e1b0d8cdef536a03c8cc799ae0ea3109783aa29b18173ef0920a1deb0"},"schema_version":"1.0","source":{"id":"1908.04109","kind":"arxiv","version":1}},"canonical_sha256":"6abb7adba25d2d0a54563aa656ff38276fc6e6554227309cd1e50f0e27275013","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6abb7adba25d2d0a54563aa656ff38276fc6e6554227309cd1e50f0e27275013","first_computed_at":"2026-07-04T23:53:20.796430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:53:20.796430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZQiWCPydV66pESfioKYPMjaoqYYLWnCjd7dbPoPsO93dRbi1RhF7Jrf6t76gl00LIOqpEkxc/GctuKVCpoD3Cg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:53:20.796796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04109","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff1501f3837e9aa0e9c6d535d6da3f9cfc57575fbf3e3c47155862178d0fe944","sha256:e774104c414ef97f95bde43551fd305ee768495cdeee8a2a2f75378564b4e3e3"],"state_sha256":"e0bab365ace3903f274121d7324d1dc55b170335ab46de5a2f768c2037ed9f86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dV/OFIPKeLxOIwgnx7K/DjJZ+/3jqrNqjaYIobb7xJwmsZdTqGeoce2jhJQb+DmUzFEUPvO+NDDsd7Fk+7oiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:41:16.642027Z","bundle_sha256":"ad4f8cb1e0e983ab109b81ee2aee08bf8377e99e185efd4fd037109cd832b7d9"}}