{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WWUAQUJHHZSWSUX3VG2FNDG3PW","short_pith_number":"pith:WWUAQUJH","schema_version":"1.0","canonical_sha256":"b5a80851273e656952fba9b4568cdb7d893b636960989c7fe6d662963c7f2a0e","source":{"kind":"arxiv","id":"2504.04609","version":1},"attestation_state":"computed","paper":{"title":"Scalable Approximate Algorithms for Optimal Transport Linear Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Ann M. Dillner, Francois Kamper, Gianluca Janka, Michael W. Heiss, Satoshi Takahama, Tomasz Kacprzak","submitted_at":"2025-04-06T20:37:25Z","abstract_excerpt":"Recently, linear regression models incorporating an optimal transport (OT) loss have been explored for applications such as supervised unmixing of spectra, music transcription, and mass spectrometry. However, these task-specific approaches often do not generalize readily to a broader class of linear models. In this work, we propose a novel algorithmic framework for solving a general class of non-negative linear regression models with an entropy-regularized OT datafit term, based on Sinkhorn-like scaling iterations. Our framework accommodates convex penalty functions on the weights (e.g. square"},"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":"2504.04609","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-06T20:37:25Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"c895b29cd19ee7fcfdbf35ed97b60cc9443cc3960173a32845033ba564c11708","abstract_canon_sha256":"37aa05fabb71ec4b8ea49dfd01fa492dcbf0063ac2e3f4cf4f4265953958299f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:26.988762Z","signature_b64":"cYDNzCrONvRNLHYo8rgKedN5f8WOFRmJVgVZY7pLx9OidLBMC/bKk8uIvroFSKxN9mF+2MwitPFSYptJLB97Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a80851273e656952fba9b4568cdb7d893b636960989c7fe6d662963c7f2a0e","last_reissued_at":"2026-07-05T10:45:26.988272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:26.988272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Approximate Algorithms for Optimal Transport Linear Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Ann M. Dillner, Francois Kamper, Gianluca Janka, Michael W. Heiss, Satoshi Takahama, Tomasz Kacprzak","submitted_at":"2025-04-06T20:37:25Z","abstract_excerpt":"Recently, linear regression models incorporating an optimal transport (OT) loss have been explored for applications such as supervised unmixing of spectra, music transcription, and mass spectrometry. However, these task-specific approaches often do not generalize readily to a broader class of linear models. In this work, we propose a novel algorithmic framework for solving a general class of non-negative linear regression models with an entropy-regularized OT datafit term, based on Sinkhorn-like scaling iterations. Our framework accommodates convex penalty functions on the weights (e.g. square"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04609","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/2504.04609/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.04609","created_at":"2026-07-05T10:45:26.988340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04609v1","created_at":"2026-07-05T10:45:26.988340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04609","created_at":"2026-07-05T10:45:26.988340+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWUAQUJHHZSW","created_at":"2026-07-05T10:45:26.988340+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWUAQUJHHZSWSUX3","created_at":"2026-07-05T10:45:26.988340+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWUAQUJH","created_at":"2026-07-05T10:45:26.988340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09782","citing_title":"Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09782","citing_title":"Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09782","citing_title":"Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WWUAQUJHHZSWSUX3VG2FNDG3PW","json":"https://pith.science/pith/WWUAQUJHHZSWSUX3VG2FNDG3PW.json","graph_json":"https://pith.science/api/pith-number/WWUAQUJHHZSWSUX3VG2FNDG3PW/graph.json","events_json":"https://pith.science/api/pith-number/WWUAQUJHHZSWSUX3VG2FNDG3PW/events.json","paper":"https://pith.science/paper/WWUAQUJH"},"agent_actions":{"view_html":"https://pith.science/pith/WWUAQUJHHZSWSUX3VG2FNDG3PW","download_json":"https://pith.science/pith/WWUAQUJHHZSWSUX3VG2FNDG3PW.json","view_paper":"https://pith.science/paper/WWUAQUJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04609&json=true","fetch_graph":"https://pith.science/api/pith-number/WWUAQUJHHZSWSUX3VG2FNDG3PW/graph.json","fetch_events":"https://pith.science/api/pith-number/WWUAQUJHHZSWSUX3VG2FNDG3PW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWUAQUJHHZSWSUX3VG2FNDG3PW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWUAQUJHHZSWSUX3VG2FNDG3PW/action/storage_attestation","attest_author":"https://pith.science/pith/WWUAQUJHHZSWSUX3VG2FNDG3PW/action/author_attestation","sign_citation":"https://pith.science/pith/WWUAQUJHHZSWSUX3VG2FNDG3PW/action/citation_signature","submit_replication":"https://pith.science/pith/WWUAQUJHHZSWSUX3VG2FNDG3PW/action/replication_record"}},"created_at":"2026-07-05T10:45:26.988340+00:00","updated_at":"2026-07-05T10:45:26.988340+00:00"}