{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2PZJTP6LJ7X3NATQHTS6HMWJAD","short_pith_number":"pith:2PZJTP6L","canonical_record":{"source":{"id":"1802.05429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2018-02-15T08:01:48Z","cross_cats_sorted":["eess.AS","stat.ML"],"title_canon_sha256":"29e36ee0b0d574fa635961d0369ce8356215aefe236beae450e8489c9478e631","abstract_canon_sha256":"a8f9a0d33374b91f42b5a69e89595c880242c9953b7f6b92ceeb83b49f29f1f8"},"schema_version":"1.0"},"canonical_sha256":"d3f299bfcb4fefb682703ce5e3b2c900f1ea8049e118c39b3f51dac7e47e62d6","source":{"kind":"arxiv","id":"1802.05429","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05429","created_at":"2026-05-18T00:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05429v1","created_at":"2026-05-18T00:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05429","created_at":"2026-05-18T00:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"2PZJTP6LJ7X3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2PZJTP6LJ7X3NATQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2PZJTP6L","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2PZJTP6LJ7X3NATQHTS6HMWJAD","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2018-02-15T08:01:48Z","cross_cats_sorted":["eess.AS","stat.ML"],"title_canon_sha256":"29e36ee0b0d574fa635961d0369ce8356215aefe236beae450e8489c9478e631","abstract_canon_sha256":"a8f9a0d33374b91f42b5a69e89595c880242c9953b7f6b92ceeb83b49f29f1f8"},"schema_version":"1.0"},"canonical_sha256":"d3f299bfcb4fefb682703ce5e3b2c900f1ea8049e118c39b3f51dac7e47e62d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:49.769856Z","signature_b64":"E40rl2ess9u6PmV6J5i8L+3SvQknow3Kfe63sr3aix1zrS5m3v7iaaJkFDc9vA3b03go/gjWQYFyl+EhCmqWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3f299bfcb4fefb682703ce5e3b2c900f1ea8049e118c39b3f51dac7e47e62d6","last_reissued_at":"2026-05-18T00:04:49.769192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:49.769192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05429","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:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BR8pIvVEKodcYadrJX8pIZ0EyTaDG6aYHXfxYAKKrUiJ8mWwtBqprmg5Lswb52bmWtv4hP2pmxdDFn/N9J+yBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:43:31.976621Z"},"content_sha256":"1ecf65be4e5710ae477a5c2cf18a536777266d306435a5b4a6dbebc3e8f68cc2","schema_version":"1.0","event_id":"sha256:1ecf65be4e5710ae477a5c2cf18a536777266d306435a5b4a6dbebc3e8f68cc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2PZJTP6LJ7X3NATQHTS6HMWJAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blind Source Separation with Optimal Transport Non-negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.AS","stat.ML"],"primary_cat":"cs.SD","authors_text":"Antoine Rolet, Hiroshi Sawada, Mathieu Blondel, Vivien Seguy","submitted_at":"2018-02-15T08:01:48Z","abstract_excerpt":"Optimal transport as a loss for machine learning optimization problems has recently gained a lot of attention. Building upon recent advances in computational optimal transport, we develop an optimal transport non-negative matrix factorization (NMF) algorithm for supervised speech blind source separation (BSS). Optimal transport allows us to design and leverage a cost between short-time Fourier transform (STFT) spectrogram frequencies, which takes into account how humans perceive sound. We give empirical evidence that using our proposed optimal transport NMF leads to perceptually better results"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05429","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:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+jkINH1w9R2QqLqZFUbsplLSjBI7ft9buJC5MYSoYccEDUsgxNJcF/0JZen3dmkH0HW/whk1LGTLu7jN8abDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:43:31.977202Z"},"content_sha256":"e6d4399b4d591cf945088e01f501f5e7295be077dbe071a9bf986152e8078095","schema_version":"1.0","event_id":"sha256:e6d4399b4d591cf945088e01f501f5e7295be077dbe071a9bf986152e8078095"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/bundle.json","state_url":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/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-25T21:43:31Z","links":{"resolver":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD","bundle":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/bundle.json","state":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2PZJTP6LJ7X3NATQHTS6HMWJAD","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":"a8f9a0d33374b91f42b5a69e89595c880242c9953b7f6b92ceeb83b49f29f1f8","cross_cats_sorted":["eess.AS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2018-02-15T08:01:48Z","title_canon_sha256":"29e36ee0b0d574fa635961d0369ce8356215aefe236beae450e8489c9478e631"},"schema_version":"1.0","source":{"id":"1802.05429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05429","created_at":"2026-05-18T00:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05429v1","created_at":"2026-05-18T00:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05429","created_at":"2026-05-18T00:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"2PZJTP6LJ7X3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2PZJTP6LJ7X3NATQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2PZJTP6L","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:e6d4399b4d591cf945088e01f501f5e7295be077dbe071a9bf986152e8078095","target":"graph","created_at":"2026-05-18T00:04:49Z","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":"Optimal transport as a loss for machine learning optimization problems has recently gained a lot of attention. Building upon recent advances in computational optimal transport, we develop an optimal transport non-negative matrix factorization (NMF) algorithm for supervised speech blind source separation (BSS). Optimal transport allows us to design and leverage a cost between short-time Fourier transform (STFT) spectrogram frequencies, which takes into account how humans perceive sound. We give empirical evidence that using our proposed optimal transport NMF leads to perceptually better results","authors_text":"Antoine Rolet, Hiroshi Sawada, Mathieu Blondel, Vivien Seguy","cross_cats":["eess.AS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2018-02-15T08:01:48Z","title":"Blind Source Separation with Optimal Transport Non-negative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05429","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:1ecf65be4e5710ae477a5c2cf18a536777266d306435a5b4a6dbebc3e8f68cc2","target":"record","created_at":"2026-05-18T00:04:49Z","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":"a8f9a0d33374b91f42b5a69e89595c880242c9953b7f6b92ceeb83b49f29f1f8","cross_cats_sorted":["eess.AS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2018-02-15T08:01:48Z","title_canon_sha256":"29e36ee0b0d574fa635961d0369ce8356215aefe236beae450e8489c9478e631"},"schema_version":"1.0","source":{"id":"1802.05429","kind":"arxiv","version":1}},"canonical_sha256":"d3f299bfcb4fefb682703ce5e3b2c900f1ea8049e118c39b3f51dac7e47e62d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3f299bfcb4fefb682703ce5e3b2c900f1ea8049e118c39b3f51dac7e47e62d6","first_computed_at":"2026-05-18T00:04:49.769192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:49.769192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E40rl2ess9u6PmV6J5i8L+3SvQknow3Kfe63sr3aix1zrS5m3v7iaaJkFDc9vA3b03go/gjWQYFyl+EhCmqWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:49.769856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ecf65be4e5710ae477a5c2cf18a536777266d306435a5b4a6dbebc3e8f68cc2","sha256:e6d4399b4d591cf945088e01f501f5e7295be077dbe071a9bf986152e8078095"],"state_sha256":"88f81d078cc0d5eb1a3e7ef2080e758ffb714abdd4c31c7bab8cc325511bdcb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RlC91tWAoKR8sq/8VBQGBhpM+QhhKsaC32YTlefYLOI7XVS3rvVar7U/faDqBWHNWSelvfkAp/TTIGad5tpkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:43:31.980726Z","bundle_sha256":"900c435b21cc6458a3a576320d4b7ae34fc25845ee2e25c43881410fc5d4c3ab"}}