{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HBHYQPQNPYX5XLSTTEWHJMGU6O","short_pith_number":"pith:HBHYQPQN","schema_version":"1.0","canonical_sha256":"384f883e0d7e2fdbae53992c74b0d4f3828e96d606062afed5d2eec10b3868b5","source":{"kind":"arxiv","id":"2409.16541","version":2},"attestation_state":"computed","paper":{"title":"Monge-Kantorovich Fitting With Sobolev Budgets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"cs.LG","authors_text":"Forest Kobayashi, Jonathan Hayase, Young-Heon Kim","submitted_at":"2024-09-25T01:30:16Z","abstract_excerpt":"Given $m < n$, we consider the problem of ``best'' approximating an $n\\text{-d}$ probability measure $\\rho$ via an $m\\text{-d}$ measure $\\nu$ such that $\\mathrm{supp}\\ \\nu$ has bounded total ``complexity.'' When $\\rho$ is concentrated near an $m\\text{-d}$ set we may interpret this as a manifold learning problem with noisy data. However, we do not restrict our analysis to this case, as the more general formulation has broader applications.\n  We quantify $\\nu$'s performance in approximating $\\rho$ via the Monge-Kantorovich (also called Wasserstein) $p$-cost $\\mathbb{W}_p^p(\\rho, \\nu)$, and const"},"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":"2409.16541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-09-25T01:30:16Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"c0f2ea3b543545210ac5850a04dc35c1089c23b04377b5bf4c921e607cf16c4f","abstract_canon_sha256":"3e9f2835d99b7c2c4ee0f2d4238d342e7c7ed65824f009f7283f00bce047632a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:15.507955Z","signature_b64":"3JBdhCLEyyT+7bjl+Zou2gxATO5ovGawme0Qcq3ZUzPvTJotwwtxzThfmTYYEWYl79bY2GS5hghz+CIxXFrxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"384f883e0d7e2fdbae53992c74b0d4f3828e96d606062afed5d2eec10b3868b5","last_reissued_at":"2026-07-05T10:41:15.507471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:15.507471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monge-Kantorovich Fitting With Sobolev Budgets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"cs.LG","authors_text":"Forest Kobayashi, Jonathan Hayase, Young-Heon Kim","submitted_at":"2024-09-25T01:30:16Z","abstract_excerpt":"Given $m < n$, we consider the problem of ``best'' approximating an $n\\text{-d}$ probability measure $\\rho$ via an $m\\text{-d}$ measure $\\nu$ such that $\\mathrm{supp}\\ \\nu$ has bounded total ``complexity.'' When $\\rho$ is concentrated near an $m\\text{-d}$ set we may interpret this as a manifold learning problem with noisy data. However, we do not restrict our analysis to this case, as the more general formulation has broader applications.\n  We quantify $\\nu$'s performance in approximating $\\rho$ via the Monge-Kantorovich (also called Wasserstein) $p$-cost $\\mathbb{W}_p^p(\\rho, \\nu)$, and const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.16541","kind":"arxiv","version":2},"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/2409.16541/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":"2409.16541","created_at":"2026-07-05T10:41:15.507529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.16541v2","created_at":"2026-07-05T10:41:15.507529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.16541","created_at":"2026-07-05T10:41:15.507529+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBHYQPQNPYX5","created_at":"2026-07-05T10:41:15.507529+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBHYQPQNPYX5XLST","created_at":"2026-07-05T10:41:15.507529+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBHYQPQN","created_at":"2026-07-05T10:41:15.507529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30826","citing_title":"On the structure of optimal free Dirichlet regions in mass transportation problems","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HBHYQPQNPYX5XLSTTEWHJMGU6O","json":"https://pith.science/pith/HBHYQPQNPYX5XLSTTEWHJMGU6O.json","graph_json":"https://pith.science/api/pith-number/HBHYQPQNPYX5XLSTTEWHJMGU6O/graph.json","events_json":"https://pith.science/api/pith-number/HBHYQPQNPYX5XLSTTEWHJMGU6O/events.json","paper":"https://pith.science/paper/HBHYQPQN"},"agent_actions":{"view_html":"https://pith.science/pith/HBHYQPQNPYX5XLSTTEWHJMGU6O","download_json":"https://pith.science/pith/HBHYQPQNPYX5XLSTTEWHJMGU6O.json","view_paper":"https://pith.science/paper/HBHYQPQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.16541&json=true","fetch_graph":"https://pith.science/api/pith-number/HBHYQPQNPYX5XLSTTEWHJMGU6O/graph.json","fetch_events":"https://pith.science/api/pith-number/HBHYQPQNPYX5XLSTTEWHJMGU6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBHYQPQNPYX5XLSTTEWHJMGU6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBHYQPQNPYX5XLSTTEWHJMGU6O/action/storage_attestation","attest_author":"https://pith.science/pith/HBHYQPQNPYX5XLSTTEWHJMGU6O/action/author_attestation","sign_citation":"https://pith.science/pith/HBHYQPQNPYX5XLSTTEWHJMGU6O/action/citation_signature","submit_replication":"https://pith.science/pith/HBHYQPQNPYX5XLSTTEWHJMGU6O/action/replication_record"}},"created_at":"2026-07-05T10:41:15.507529+00:00","updated_at":"2026-07-05T10:41:15.507529+00:00"}