{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DYGRF5VW363MWYKKS2C2RBNB3A","short_pith_number":"pith:DYGRF5VW","schema_version":"1.0","canonical_sha256":"1e0d12f6b6dfb6cb614a9685a885a1d8060cafb6ed37427d1337a6f5ee865b01","source":{"kind":"arxiv","id":"1612.02358","version":2},"attestation_state":"computed","paper":{"title":"A-optimal encoding weights for nonlinear inverse problems, with applications to the Helmholtz inverse problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Alen Alexanderian, Benjamin Crestel, Georg Stadler, Omar Ghattas","submitted_at":"2016-12-07T18:23:21Z","abstract_excerpt":"The computational cost of solving an inverse problem governed by PDEs, using multiple experiments, increases linearly with the number of experiments. A recently proposed method to decrease this cost uses only a small number of random linear combinations of all experiments for solving the inverse problem. This approach applies to inverse problems where the PDE solution depends linearly on the right-hand side function that models the experiment. As this method is stochastic in essence, the quality of the obtained reconstructions can vary, in particular when only a small number of combinations ar"},"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":"1612.02358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T18:23:21Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"305d975f5cd402e3721c451dad1e8b215639e727a5394d3ad898643014a19271","abstract_canon_sha256":"a55a19355bc48d2b0530eda3a54c0559a8d403621596b26e6a14fdd65c4bf03e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:00.879134Z","signature_b64":"3ggviLgYlHX+OLt1rGNO5qt75QN+5eCgqFASfwLU0yplOEm5/eD1tfNjhUtywHZLU/BEMEX4MFzhqemjKxQlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e0d12f6b6dfb6cb614a9685a885a1d8060cafb6ed37427d1337a6f5ee865b01","last_reissued_at":"2026-05-18T00:39:00.878655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:00.878655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A-optimal encoding weights for nonlinear inverse problems, with applications to the Helmholtz inverse problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Alen Alexanderian, Benjamin Crestel, Georg Stadler, Omar Ghattas","submitted_at":"2016-12-07T18:23:21Z","abstract_excerpt":"The computational cost of solving an inverse problem governed by PDEs, using multiple experiments, increases linearly with the number of experiments. A recently proposed method to decrease this cost uses only a small number of random linear combinations of all experiments for solving the inverse problem. This approach applies to inverse problems where the PDE solution depends linearly on the right-hand side function that models the experiment. As this method is stochastic in essence, the quality of the obtained reconstructions can vary, in particular when only a small number of combinations ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02358","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":""},"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":"1612.02358","created_at":"2026-05-18T00:39:00.878727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02358v2","created_at":"2026-05-18T00:39:00.878727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02358","created_at":"2026-05-18T00:39:00.878727+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYGRF5VW363M","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYGRF5VW363MWYKK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYGRF5VW","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DYGRF5VW363MWYKKS2C2RBNB3A","json":"https://pith.science/pith/DYGRF5VW363MWYKKS2C2RBNB3A.json","graph_json":"https://pith.science/api/pith-number/DYGRF5VW363MWYKKS2C2RBNB3A/graph.json","events_json":"https://pith.science/api/pith-number/DYGRF5VW363MWYKKS2C2RBNB3A/events.json","paper":"https://pith.science/paper/DYGRF5VW"},"agent_actions":{"view_html":"https://pith.science/pith/DYGRF5VW363MWYKKS2C2RBNB3A","download_json":"https://pith.science/pith/DYGRF5VW363MWYKKS2C2RBNB3A.json","view_paper":"https://pith.science/paper/DYGRF5VW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02358&json=true","fetch_graph":"https://pith.science/api/pith-number/DYGRF5VW363MWYKKS2C2RBNB3A/graph.json","fetch_events":"https://pith.science/api/pith-number/DYGRF5VW363MWYKKS2C2RBNB3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYGRF5VW363MWYKKS2C2RBNB3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYGRF5VW363MWYKKS2C2RBNB3A/action/storage_attestation","attest_author":"https://pith.science/pith/DYGRF5VW363MWYKKS2C2RBNB3A/action/author_attestation","sign_citation":"https://pith.science/pith/DYGRF5VW363MWYKKS2C2RBNB3A/action/citation_signature","submit_replication":"https://pith.science/pith/DYGRF5VW363MWYKKS2C2RBNB3A/action/replication_record"}},"created_at":"2026-05-18T00:39:00.878727+00:00","updated_at":"2026-05-18T00:39:00.878727+00:00"}