{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2PZJTP6LJ7X3NATQHTS6HMWJAD","short_pith_number":"pith:2PZJTP6L","schema_version":"1.0","canonical_sha256":"d3f299bfcb4fefb682703ce5e3b2c900f1ea8049e118c39b3f51dac7e47e62d6","source":{"kind":"arxiv","id":"1802.05429","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.05429","created_at":"2026-05-18T00:04:49.769300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05429v1","created_at":"2026-05-18T00:04:49.769300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05429","created_at":"2026-05-18T00:04:49.769300+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PZJTP6LJ7X3","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PZJTP6LJ7X3NATQ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PZJTP6L","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD","json":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD.json","graph_json":"https://pith.science/api/pith-number/2PZJTP6LJ7X3NATQHTS6HMWJAD/graph.json","events_json":"https://pith.science/api/pith-number/2PZJTP6LJ7X3NATQHTS6HMWJAD/events.json","paper":"https://pith.science/paper/2PZJTP6L"},"agent_actions":{"view_html":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD","download_json":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD.json","view_paper":"https://pith.science/paper/2PZJTP6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05429&json=true","fetch_graph":"https://pith.science/api/pith-number/2PZJTP6LJ7X3NATQHTS6HMWJAD/graph.json","fetch_events":"https://pith.science/api/pith-number/2PZJTP6LJ7X3NATQHTS6HMWJAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/action/storage_attestation","attest_author":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/action/author_attestation","sign_citation":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/action/citation_signature","submit_replication":"https://pith.science/pith/2PZJTP6LJ7X3NATQHTS6HMWJAD/action/replication_record"}},"created_at":"2026-05-18T00:04:49.769300+00:00","updated_at":"2026-05-18T00:04:49.769300+00:00"}