{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7KALBAI2DTUGQGFWNLSKPVPRET","short_pith_number":"pith:7KALBAI2","schema_version":"1.0","canonical_sha256":"fa80b0811a1ce86818b66ae4a7d5f124de3fb5bad22fd77809143758fb42f3d7","source":{"kind":"arxiv","id":"1804.10798","version":1},"attestation_state":"computed","paper":{"title":"Toward Designing Convergent Deep Operator Splitting Methods for Task-specific Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Risheng Liu, Shichao Cheng, Xin Fan, Yi He, Zhongxuan Luo","submitted_at":"2018-04-28T12:59:50Z","abstract_excerpt":"Operator splitting methods have been successfully used in computational sciences, statistics, learning and vision areas to reduce complex problems into a series of simpler subproblems. However, prevalent splitting schemes are mostly established only based on the mathematical properties of some general optimization models. So it is a laborious process and often requires many iterations of ideation and validation to obtain practical and task-specific optimal solutions, especially for nonconvex problems in real-world scenarios. To break through the above limits, we introduce a new algorithmic fra"},"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":"1804.10798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-28T12:59:50Z","cross_cats_sorted":[],"title_canon_sha256":"86e06057f9a7326b51f027ff1c6c4e4bd3a4b94237dfb2d9adf6f1ac40efd1ae","abstract_canon_sha256":"b184b2fc4abf1c55ca5609693b892ad2de5a1898e4462f7c1dadf49444ae1a30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:15.524410Z","signature_b64":"uQxa1lDJhHGIRSOqyKP0cTndLHsM078kaIEVNO2oJ8/45J1LFJdMEvpZGPJ+r/8EJPDJ1igW7ZhXFl/3ipTpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa80b0811a1ce86818b66ae4a7d5f124de3fb5bad22fd77809143758fb42f3d7","last_reissued_at":"2026-05-18T00:17:15.523718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:15.523718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Designing Convergent Deep Operator Splitting Methods for Task-specific Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Risheng Liu, Shichao Cheng, Xin Fan, Yi He, Zhongxuan Luo","submitted_at":"2018-04-28T12:59:50Z","abstract_excerpt":"Operator splitting methods have been successfully used in computational sciences, statistics, learning and vision areas to reduce complex problems into a series of simpler subproblems. However, prevalent splitting schemes are mostly established only based on the mathematical properties of some general optimization models. So it is a laborious process and often requires many iterations of ideation and validation to obtain practical and task-specific optimal solutions, especially for nonconvex problems in real-world scenarios. To break through the above limits, we introduce a new algorithmic fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10798","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":"1804.10798","created_at":"2026-05-18T00:17:15.523824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10798v1","created_at":"2026-05-18T00:17:15.523824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10798","created_at":"2026-05-18T00:17:15.523824+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KALBAI2DTUG","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KALBAI2DTUGQGFW","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KALBAI2","created_at":"2026-05-18T12:32:11.075285+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/7KALBAI2DTUGQGFWNLSKPVPRET","json":"https://pith.science/pith/7KALBAI2DTUGQGFWNLSKPVPRET.json","graph_json":"https://pith.science/api/pith-number/7KALBAI2DTUGQGFWNLSKPVPRET/graph.json","events_json":"https://pith.science/api/pith-number/7KALBAI2DTUGQGFWNLSKPVPRET/events.json","paper":"https://pith.science/paper/7KALBAI2"},"agent_actions":{"view_html":"https://pith.science/pith/7KALBAI2DTUGQGFWNLSKPVPRET","download_json":"https://pith.science/pith/7KALBAI2DTUGQGFWNLSKPVPRET.json","view_paper":"https://pith.science/paper/7KALBAI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10798&json=true","fetch_graph":"https://pith.science/api/pith-number/7KALBAI2DTUGQGFWNLSKPVPRET/graph.json","fetch_events":"https://pith.science/api/pith-number/7KALBAI2DTUGQGFWNLSKPVPRET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KALBAI2DTUGQGFWNLSKPVPRET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KALBAI2DTUGQGFWNLSKPVPRET/action/storage_attestation","attest_author":"https://pith.science/pith/7KALBAI2DTUGQGFWNLSKPVPRET/action/author_attestation","sign_citation":"https://pith.science/pith/7KALBAI2DTUGQGFWNLSKPVPRET/action/citation_signature","submit_replication":"https://pith.science/pith/7KALBAI2DTUGQGFWNLSKPVPRET/action/replication_record"}},"created_at":"2026-05-18T00:17:15.523824+00:00","updated_at":"2026-05-18T00:17:15.523824+00:00"}