{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:STW573RKYH5RZUPNGIYHWDKSQT","short_pith_number":"pith:STW573RK","schema_version":"1.0","canonical_sha256":"94eddfee2ac1fb1cd1ed32307b0d5284e335c4d1a5accfc81240902fdd42cef7","source":{"kind":"arxiv","id":"2407.00051","version":1},"attestation_state":"computed","paper":{"title":"SAGIPS: A Scalable Asynchronous Generative Inverse Problem Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Daniel Lersch, J. Taylor Childers, Kishansingh Rajput, Malachi Schram, N. Sato, Xingfu Wu, Zhenyu Dai","submitted_at":"2024-06-11T17:57:49Z","abstract_excerpt":"Large scale, inverse problem solving deep learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem often poses challenges to the algorithm and requires the proper utilization of high-performance computing systems. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduces a \\underline{S}calable \\underline{A}synchronous \\underline{G}enerative workflow for solving \\underli"},"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":"2407.00051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-06-11T17:57:49Z","cross_cats_sorted":[],"title_canon_sha256":"eabb00d4649f9e280cac7c308efd177222ba1019ee65fc44838714124068396f","abstract_canon_sha256":"070fbca98698d275cf7f8b9075d896e1bac298536489f419670e2c5d0618fde9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:13.666820Z","signature_b64":"G3qvPeb4/fKhBiTPACtvdyWq4JJmILjlEHbwO6QPNxlikDJ95XPTeGZ9WaQ1lYhpYai92aBYdcf+3DwXXt7OCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94eddfee2ac1fb1cd1ed32307b0d5284e335c4d1a5accfc81240902fdd42cef7","last_reissued_at":"2026-07-05T08:38:13.666208Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:13.666208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAGIPS: A Scalable Asynchronous Generative Inverse Problem Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Daniel Lersch, J. Taylor Childers, Kishansingh Rajput, Malachi Schram, N. Sato, Xingfu Wu, Zhenyu Dai","submitted_at":"2024-06-11T17:57:49Z","abstract_excerpt":"Large scale, inverse problem solving deep learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem often poses challenges to the algorithm and requires the proper utilization of high-performance computing systems. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduces a \\underline{S}calable \\underline{A}synchronous \\underline{G}enerative workflow for solving \\underli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.00051","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/2407.00051/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":"2407.00051","created_at":"2026-07-05T08:38:13.666279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.00051v1","created_at":"2026-07-05T08:38:13.666279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.00051","created_at":"2026-07-05T08:38:13.666279+00:00"},{"alias_kind":"pith_short_12","alias_value":"STW573RKYH5R","created_at":"2026-07-05T08:38:13.666279+00:00"},{"alias_kind":"pith_short_16","alias_value":"STW573RKYH5RZUPN","created_at":"2026-07-05T08:38:13.666279+00:00"},{"alias_kind":"pith_short_8","alias_value":"STW573RK","created_at":"2026-07-05T08:38:13.666279+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.15768","citing_title":"Toward an event-level analysis of hadron structure using differential programming","ref_index":95,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/STW573RKYH5RZUPNGIYHWDKSQT","json":"https://pith.science/pith/STW573RKYH5RZUPNGIYHWDKSQT.json","graph_json":"https://pith.science/api/pith-number/STW573RKYH5RZUPNGIYHWDKSQT/graph.json","events_json":"https://pith.science/api/pith-number/STW573RKYH5RZUPNGIYHWDKSQT/events.json","paper":"https://pith.science/paper/STW573RK"},"agent_actions":{"view_html":"https://pith.science/pith/STW573RKYH5RZUPNGIYHWDKSQT","download_json":"https://pith.science/pith/STW573RKYH5RZUPNGIYHWDKSQT.json","view_paper":"https://pith.science/paper/STW573RK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.00051&json=true","fetch_graph":"https://pith.science/api/pith-number/STW573RKYH5RZUPNGIYHWDKSQT/graph.json","fetch_events":"https://pith.science/api/pith-number/STW573RKYH5RZUPNGIYHWDKSQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STW573RKYH5RZUPNGIYHWDKSQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STW573RKYH5RZUPNGIYHWDKSQT/action/storage_attestation","attest_author":"https://pith.science/pith/STW573RKYH5RZUPNGIYHWDKSQT/action/author_attestation","sign_citation":"https://pith.science/pith/STW573RKYH5RZUPNGIYHWDKSQT/action/citation_signature","submit_replication":"https://pith.science/pith/STW573RKYH5RZUPNGIYHWDKSQT/action/replication_record"}},"created_at":"2026-07-05T08:38:13.666279+00:00","updated_at":"2026-07-05T08:38:13.666279+00:00"}