{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2GKIAPXB3GUU3TQMNHBZFD7WRS","short_pith_number":"pith:2GKIAPXB","schema_version":"1.0","canonical_sha256":"d194803ee1d9a94dce0c69c3928ff68ca9524821c6acf92dc29d73334a09add8","source":{"kind":"arxiv","id":"1903.10875","version":1},"attestation_state":"computed","paper":{"title":"Nonlinear Iterative Hard Thresholding for Inverse Scattering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Anna C. Gilbert, Howard W. Levinson, John C. Schotland","submitted_at":"2019-03-22T19:58:56Z","abstract_excerpt":"We consider the inverse scattering problem for sparse scatterers. An image reconstruction algorithm is proposed that is based on a nonlinear generalization of iterative hard thresholding. The convergence and error of the method was analyzed by means of coherence estimates and compared to numerical simulations."},"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":"1903.10875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-22T19:58:56Z","cross_cats_sorted":[],"title_canon_sha256":"94d3ab29c216f98475ed32a6ff221f4dc46f62b4bb776d5ffbc874e3468bf495","abstract_canon_sha256":"c8eaeb276b37204c46d0867484570cf569184196dae14d23b4661eded9923c82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:17.426660Z","signature_b64":"xSTHdKnPCUH7aI3up/Ond2PypDL0lPkyoAwEyaYbRrg+9DxZH6GnduLB7zpTwWKwNH/VC5TmwqvVo9JuclyXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d194803ee1d9a94dce0c69c3928ff68ca9524821c6acf92dc29d73334a09add8","last_reissued_at":"2026-05-17T23:50:17.425968Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:17.425968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonlinear Iterative Hard Thresholding for Inverse Scattering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Anna C. Gilbert, Howard W. Levinson, John C. Schotland","submitted_at":"2019-03-22T19:58:56Z","abstract_excerpt":"We consider the inverse scattering problem for sparse scatterers. An image reconstruction algorithm is proposed that is based on a nonlinear generalization of iterative hard thresholding. The convergence and error of the method was analyzed by means of coherence estimates and compared to numerical simulations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10875","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":""},"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":"1903.10875","created_at":"2026-05-17T23:50:17.426065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10875v1","created_at":"2026-05-17T23:50:17.426065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10875","created_at":"2026-05-17T23:50:17.426065+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GKIAPXB3GUU","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GKIAPXB3GUU3TQM","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GKIAPXB","created_at":"2026-05-18T12:33:07.085635+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/2GKIAPXB3GUU3TQMNHBZFD7WRS","json":"https://pith.science/pith/2GKIAPXB3GUU3TQMNHBZFD7WRS.json","graph_json":"https://pith.science/api/pith-number/2GKIAPXB3GUU3TQMNHBZFD7WRS/graph.json","events_json":"https://pith.science/api/pith-number/2GKIAPXB3GUU3TQMNHBZFD7WRS/events.json","paper":"https://pith.science/paper/2GKIAPXB"},"agent_actions":{"view_html":"https://pith.science/pith/2GKIAPXB3GUU3TQMNHBZFD7WRS","download_json":"https://pith.science/pith/2GKIAPXB3GUU3TQMNHBZFD7WRS.json","view_paper":"https://pith.science/paper/2GKIAPXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10875&json=true","fetch_graph":"https://pith.science/api/pith-number/2GKIAPXB3GUU3TQMNHBZFD7WRS/graph.json","fetch_events":"https://pith.science/api/pith-number/2GKIAPXB3GUU3TQMNHBZFD7WRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GKIAPXB3GUU3TQMNHBZFD7WRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GKIAPXB3GUU3TQMNHBZFD7WRS/action/storage_attestation","attest_author":"https://pith.science/pith/2GKIAPXB3GUU3TQMNHBZFD7WRS/action/author_attestation","sign_citation":"https://pith.science/pith/2GKIAPXB3GUU3TQMNHBZFD7WRS/action/citation_signature","submit_replication":"https://pith.science/pith/2GKIAPXB3GUU3TQMNHBZFD7WRS/action/replication_record"}},"created_at":"2026-05-17T23:50:17.426065+00:00","updated_at":"2026-05-17T23:50:17.426065+00:00"}