{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3WFLJDUTYGT7OCSW2EN6TQKMQG","short_pith_number":"pith:3WFLJDUT","schema_version":"1.0","canonical_sha256":"dd8ab48e93c1a7f70a56d11be9c14c819c3193caea745d01fd2a44402012386d","source":{"kind":"arxiv","id":"2208.03897","version":1},"attestation_state":"computed","paper":{"title":"Neural Optimization Machine: A Neural Network Approach for Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jie Chen, Yongming Liu","submitted_at":"2022-08-08T03:34:58Z","abstract_excerpt":"A novel neural network (NN) approach is proposed for constrained optimization. The proposed method uses a specially designed NN architecture and training/optimization procedure called Neural Optimization Machine (NOM). The objective functions for the NOM are approximated with NN models. The optimization process is conducted by the neural network's built-in backpropagation algorithm. The NOM solves optimization problems by extending the architecture of the NN objective function model. This is achieved by appropriately designing the NOM's structure, activation function, and loss function. The NN"},"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":"2208.03897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-08-08T03:34:58Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"8b9d47d763ebb0ce18ef0fd8e676d7c87a94fd61293ba17dc0016e445af8b186","abstract_canon_sha256":"68761300910a16b8f4f8f7213ce2b8e9c2e5143837d4e2a139898d6deb985210"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:19.442663Z","signature_b64":"Oo7GLu3PeR/9rFw2D5/JSGb2UXRWYDTpGWvYujIGN2yQ6Tf4mgIRayeKUOKMwaCrQ6HtCTqMlJomR7T0o16NBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd8ab48e93c1a7f70a56d11be9c14c819c3193caea745d01fd2a44402012386d","last_reissued_at":"2026-07-05T04:47:19.442296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:19.442296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Optimization Machine: A Neural Network Approach for Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jie Chen, Yongming Liu","submitted_at":"2022-08-08T03:34:58Z","abstract_excerpt":"A novel neural network (NN) approach is proposed for constrained optimization. The proposed method uses a specially designed NN architecture and training/optimization procedure called Neural Optimization Machine (NOM). The objective functions for the NOM are approximated with NN models. The optimization process is conducted by the neural network's built-in backpropagation algorithm. The NOM solves optimization problems by extending the architecture of the NN objective function model. This is achieved by appropriately designing the NOM's structure, activation function, and loss function. The NN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.03897","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/2208.03897/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":"2208.03897","created_at":"2026-07-05T04:47:19.442357+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.03897v1","created_at":"2026-07-05T04:47:19.442357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.03897","created_at":"2026-07-05T04:47:19.442357+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WFLJDUTYGT7","created_at":"2026-07-05T04:47:19.442357+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WFLJDUTYGT7OCSW","created_at":"2026-07-05T04:47:19.442357+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WFLJDUT","created_at":"2026-07-05T04:47:19.442357+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15273","citing_title":"Into the Void: Mapping the Unseen Gaps in High Dimensional Data","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3WFLJDUTYGT7OCSW2EN6TQKMQG","json":"https://pith.science/pith/3WFLJDUTYGT7OCSW2EN6TQKMQG.json","graph_json":"https://pith.science/api/pith-number/3WFLJDUTYGT7OCSW2EN6TQKMQG/graph.json","events_json":"https://pith.science/api/pith-number/3WFLJDUTYGT7OCSW2EN6TQKMQG/events.json","paper":"https://pith.science/paper/3WFLJDUT"},"agent_actions":{"view_html":"https://pith.science/pith/3WFLJDUTYGT7OCSW2EN6TQKMQG","download_json":"https://pith.science/pith/3WFLJDUTYGT7OCSW2EN6TQKMQG.json","view_paper":"https://pith.science/paper/3WFLJDUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.03897&json=true","fetch_graph":"https://pith.science/api/pith-number/3WFLJDUTYGT7OCSW2EN6TQKMQG/graph.json","fetch_events":"https://pith.science/api/pith-number/3WFLJDUTYGT7OCSW2EN6TQKMQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WFLJDUTYGT7OCSW2EN6TQKMQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WFLJDUTYGT7OCSW2EN6TQKMQG/action/storage_attestation","attest_author":"https://pith.science/pith/3WFLJDUTYGT7OCSW2EN6TQKMQG/action/author_attestation","sign_citation":"https://pith.science/pith/3WFLJDUTYGT7OCSW2EN6TQKMQG/action/citation_signature","submit_replication":"https://pith.science/pith/3WFLJDUTYGT7OCSW2EN6TQKMQG/action/replication_record"}},"created_at":"2026-07-05T04:47:19.442357+00:00","updated_at":"2026-07-05T04:47:19.442357+00:00"}