{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FBHWXZZ3XUA3J2U67EHHXWTPPP","short_pith_number":"pith:FBHWXZZ3","schema_version":"1.0","canonical_sha256":"284f6be73bbd01b4ea9ef90e7bda6f7bd35814315854b805f51f6fc9f7e535c9","source":{"kind":"arxiv","id":"2501.14636","version":1},"attestation_state":"computed","paper":{"title":"A Paired Autoencoder Framework for Inverse Problems via Bayes Risk Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Emma Hart, Julianne Chung, Matthias Chung","submitted_at":"2025-01-24T16:55:36Z","abstract_excerpt":"In this work, we describe a new data-driven approach for inverse problems that exploits technologies from machine learning, in particular autoencoder network structures. We consider a paired autoencoder framework, where two autoencoders are used to efficiently represent the input and target spaces separately and optimal mappings are learned between latent spaces, thus enabling forward and inverse surrogate mappings. We focus on interpretations using Bayes risk and empirical Bayes risk minimization, and we provide various theoretical results and connections to existing works on low-rank matrix "},"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":"2501.14636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-24T16:55:36Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"2474244ebad6b2989a76fe9ad9cedab82a5d8223c59cb8c0e0de3e442d9cce9a","abstract_canon_sha256":"7e498531081e48642847ca6c64f636cedada31de8dc2e4ea308478f163e5707c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:03.742544Z","signature_b64":"HIiATDBQ5ueXe+yeDbdumvYbJQmS8M23HoZVk4rqqk9l0Es01fEmud3dEDwWaYwF55k3n7cNlzbxxb4bQnV5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"284f6be73bbd01b4ea9ef90e7bda6f7bd35814315854b805f51f6fc9f7e535c9","last_reissued_at":"2026-07-05T10:05:03.742034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:03.742034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Paired Autoencoder Framework for Inverse Problems via Bayes Risk Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Emma Hart, Julianne Chung, Matthias Chung","submitted_at":"2025-01-24T16:55:36Z","abstract_excerpt":"In this work, we describe a new data-driven approach for inverse problems that exploits technologies from machine learning, in particular autoencoder network structures. We consider a paired autoencoder framework, where two autoencoders are used to efficiently represent the input and target spaces separately and optimal mappings are learned between latent spaces, thus enabling forward and inverse surrogate mappings. We focus on interpretations using Bayes risk and empirical Bayes risk minimization, and we provide various theoretical results and connections to existing works on low-rank matrix "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14636","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/2501.14636/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":"2501.14636","created_at":"2026-07-05T10:05:03.742110+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.14636v1","created_at":"2026-07-05T10:05:03.742110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14636","created_at":"2026-07-05T10:05:03.742110+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBHWXZZ3XUA3","created_at":"2026-07-05T10:05:03.742110+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBHWXZZ3XUA3J2U6","created_at":"2026-07-05T10:05:03.742110+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBHWXZZ3","created_at":"2026-07-05T10:05:03.742110+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.05831","citing_title":"Optimal Linear Baseline Models for Scientific Machine Learning","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FBHWXZZ3XUA3J2U67EHHXWTPPP","json":"https://pith.science/pith/FBHWXZZ3XUA3J2U67EHHXWTPPP.json","graph_json":"https://pith.science/api/pith-number/FBHWXZZ3XUA3J2U67EHHXWTPPP/graph.json","events_json":"https://pith.science/api/pith-number/FBHWXZZ3XUA3J2U67EHHXWTPPP/events.json","paper":"https://pith.science/paper/FBHWXZZ3"},"agent_actions":{"view_html":"https://pith.science/pith/FBHWXZZ3XUA3J2U67EHHXWTPPP","download_json":"https://pith.science/pith/FBHWXZZ3XUA3J2U67EHHXWTPPP.json","view_paper":"https://pith.science/paper/FBHWXZZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.14636&json=true","fetch_graph":"https://pith.science/api/pith-number/FBHWXZZ3XUA3J2U67EHHXWTPPP/graph.json","fetch_events":"https://pith.science/api/pith-number/FBHWXZZ3XUA3J2U67EHHXWTPPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBHWXZZ3XUA3J2U67EHHXWTPPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBHWXZZ3XUA3J2U67EHHXWTPPP/action/storage_attestation","attest_author":"https://pith.science/pith/FBHWXZZ3XUA3J2U67EHHXWTPPP/action/author_attestation","sign_citation":"https://pith.science/pith/FBHWXZZ3XUA3J2U67EHHXWTPPP/action/citation_signature","submit_replication":"https://pith.science/pith/FBHWXZZ3XUA3J2U67EHHXWTPPP/action/replication_record"}},"created_at":"2026-07-05T10:05:03.742110+00:00","updated_at":"2026-07-05T10:05:03.742110+00:00"}