{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WWUAQUJHHZSWSUX3VG2FNDG3PW","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":"37aa05fabb71ec4b8ea49dfd01fa492dcbf0063ac2e3f4cf4f4265953958299f","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-06T20:37:25Z","title_canon_sha256":"c895b29cd19ee7fcfdbf35ed97b60cc9443cc3960173a32845033ba564c11708"},"schema_version":"1.0","source":{"id":"2504.04609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.04609","created_at":"2026-07-05T10:45:26Z"},{"alias_kind":"arxiv_version","alias_value":"2504.04609v1","created_at":"2026-07-05T10:45:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04609","created_at":"2026-07-05T10:45:26Z"},{"alias_kind":"pith_short_12","alias_value":"WWUAQUJHHZSW","created_at":"2026-07-05T10:45:26Z"},{"alias_kind":"pith_short_16","alias_value":"WWUAQUJHHZSWSUX3","created_at":"2026-07-05T10:45:26Z"},{"alias_kind":"pith_short_8","alias_value":"WWUAQUJH","created_at":"2026-07-05T10:45:26Z"}],"graph_snapshots":[{"event_id":"sha256:c9ebe13218e1ed296509d63d27a54d1557e6843348290cb49f0aed5c996a35ed","target":"graph","created_at":"2026-07-05T10:45:26Z","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/2504.04609/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ann M. Dillner, Francois Kamper, Gianluca Janka, Michael W. Heiss, Satoshi Takahama, Tomasz Kacprzak","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-06T20:37:25Z","title":"Scalable Approximate Algorithms for Optimal Transport Linear Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04609","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:ed2422c63a85ab91229b1300e42bdaa4741708cee016503be5aa62dabcf5bfbd","target":"record","created_at":"2026-07-05T10:45:26Z","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":"37aa05fabb71ec4b8ea49dfd01fa492dcbf0063ac2e3f4cf4f4265953958299f","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-06T20:37:25Z","title_canon_sha256":"c895b29cd19ee7fcfdbf35ed97b60cc9443cc3960173a32845033ba564c11708"},"schema_version":"1.0","source":{"id":"2504.04609","kind":"arxiv","version":1}},"canonical_sha256":"b5a80851273e656952fba9b4568cdb7d893b636960989c7fe6d662963c7f2a0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5a80851273e656952fba9b4568cdb7d893b636960989c7fe6d662963c7f2a0e","first_computed_at":"2026-07-05T10:45:26.988272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:45:26.988272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cYDNzCrONvRNLHYo8rgKedN5f8WOFRmJVgVZY7pLx9OidLBMC/bKk8uIvroFSKxN9mF+2MwitPFSYptJLB97Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:45:26.988762Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.04609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed2422c63a85ab91229b1300e42bdaa4741708cee016503be5aa62dabcf5bfbd","sha256:c9ebe13218e1ed296509d63d27a54d1557e6843348290cb49f0aed5c996a35ed"],"state_sha256":"a9c5994c87ad86ef5f1fdf83197df7349c601b7a0159f7edaa73ac6d21a6e207"}