{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LCW23DRFXS4CZHVDQA2HDEMG3E","short_pith_number":"pith:LCW23DRF","schema_version":"1.0","canonical_sha256":"58adad8e25bcb82c9ea38034719186d9332e7f90970b58b7cd4e9c727e09ea16","source":{"kind":"arxiv","id":"2505.06549","version":2},"attestation_state":"computed","paper":{"title":"Good Things Come in Pairs: Paired Autoencoders for Inverse Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bas Peters, Matthias Chung, Michael Solomon","submitted_at":"2025-05-10T07:31:09Z","abstract_excerpt":"In this book chapter, we discuss recent advances in data-driven approaches for inverse problems. In particular, we focus on the \\emph{paired autoencoder} framework, which has proven to be a powerful tool for solving inverse problems in scientific computing. The paired autoencoder framework is a novel approach that leverages the strengths of both data-driven and model-based methods by projecting both the data and the quantity of interest into a latent space and mapping these latent spaces to provide surrogate forward and inverse mappings. We illustrate the advantages of this approach through nu"},"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":"2505.06549","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-10T07:31:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"00d2f70ecabfa2650469883c7fc078011512cdf5b75d31eb7fa89e273cacfd7c","abstract_canon_sha256":"d30b0c20c064d141345e3bf3849873d695067963294a1bfaab86269bcfc686a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:39.855697Z","signature_b64":"rGUmm8lYhnXv9nDaPFxENnXq55WN31s6tlGyKXVrePfgxS09yK0rlxIElpLk87M3dbJm91o3oaokJ2ggNHKGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58adad8e25bcb82c9ea38034719186d9332e7f90970b58b7cd4e9c727e09ea16","last_reissued_at":"2026-07-05T11:55:39.855206Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:39.855206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Good Things Come in Pairs: Paired Autoencoders for Inverse Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bas Peters, Matthias Chung, Michael Solomon","submitted_at":"2025-05-10T07:31:09Z","abstract_excerpt":"In this book chapter, we discuss recent advances in data-driven approaches for inverse problems. In particular, we focus on the \\emph{paired autoencoder} framework, which has proven to be a powerful tool for solving inverse problems in scientific computing. The paired autoencoder framework is a novel approach that leverages the strengths of both data-driven and model-based methods by projecting both the data and the quantity of interest into a latent space and mapping these latent spaces to provide surrogate forward and inverse mappings. We illustrate the advantages of this approach through nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06549","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/2505.06549/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":"2505.06549","created_at":"2026-07-05T11:55:39.855261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.06549v2","created_at":"2026-07-05T11:55:39.855261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06549","created_at":"2026-07-05T11:55:39.855261+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCW23DRFXS4C","created_at":"2026-07-05T11:55:39.855261+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCW23DRFXS4CZHVD","created_at":"2026-07-05T11:55:39.855261+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCW23DRF","created_at":"2026-07-05T11:55:39.855261+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":73,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LCW23DRFXS4CZHVDQA2HDEMG3E","json":"https://pith.science/pith/LCW23DRFXS4CZHVDQA2HDEMG3E.json","graph_json":"https://pith.science/api/pith-number/LCW23DRFXS4CZHVDQA2HDEMG3E/graph.json","events_json":"https://pith.science/api/pith-number/LCW23DRFXS4CZHVDQA2HDEMG3E/events.json","paper":"https://pith.science/paper/LCW23DRF"},"agent_actions":{"view_html":"https://pith.science/pith/LCW23DRFXS4CZHVDQA2HDEMG3E","download_json":"https://pith.science/pith/LCW23DRFXS4CZHVDQA2HDEMG3E.json","view_paper":"https://pith.science/paper/LCW23DRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.06549&json=true","fetch_graph":"https://pith.science/api/pith-number/LCW23DRFXS4CZHVDQA2HDEMG3E/graph.json","fetch_events":"https://pith.science/api/pith-number/LCW23DRFXS4CZHVDQA2HDEMG3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCW23DRFXS4CZHVDQA2HDEMG3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCW23DRFXS4CZHVDQA2HDEMG3E/action/storage_attestation","attest_author":"https://pith.science/pith/LCW23DRFXS4CZHVDQA2HDEMG3E/action/author_attestation","sign_citation":"https://pith.science/pith/LCW23DRFXS4CZHVDQA2HDEMG3E/action/citation_signature","submit_replication":"https://pith.science/pith/LCW23DRFXS4CZHVDQA2HDEMG3E/action/replication_record"}},"created_at":"2026-07-05T11:55:39.855261+00:00","updated_at":"2026-07-05T11:55:39.855261+00:00"}