{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FHWWCCBZTXZA6MX53DIK5M6Z6W","short_pith_number":"pith:FHWWCCBZ","schema_version":"1.0","canonical_sha256":"29ed6108399df20f32fdd8d0aeb3d9f58fe596447d0908aaa0b08b70adb1bc72","source":{"kind":"arxiv","id":"1210.1301","version":1},"attestation_state":"computed","paper":{"title":"Nonsmooth method for constrained optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kazufumi Ito, Tomoya Takeuchi","submitted_at":"2012-10-04T05:40:32Z","abstract_excerpt":"We propose an implicit iterative algorithm for an exact penalty method arising from inequality constrained optimization problems. A rapidly convergent fixed point method is developed for a regularized penalty functional. The applicability and feasibility of the proposed method is demonstrated using large scale inequality constrained problems."},"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":"1210.1301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-04T05:40:32Z","cross_cats_sorted":[],"title_canon_sha256":"8521f2cfe8a6e8747b26206257bb18772d4b47ad8a0a67ffe1cc9e35ae10afa5","abstract_canon_sha256":"464c009d9fe9460e3ede8f3f9ae04a4087de0e9abbc91d0c9529003f834b7454"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:03.985867Z","signature_b64":"a/fuKMTyJjlb24Si5jXAiKuYftVBaJgKNUmaUyfd4hC3yzYmaLA+Hh9zMGziRDQpIDTzAvPfJ3krpcHj3zS0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29ed6108399df20f32fdd8d0aeb3d9f58fe596447d0908aaa0b08b70adb1bc72","last_reissued_at":"2026-05-18T03:44:03.985006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:03.985006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonsmooth method for constrained optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kazufumi Ito, Tomoya Takeuchi","submitted_at":"2012-10-04T05:40:32Z","abstract_excerpt":"We propose an implicit iterative algorithm for an exact penalty method arising from inequality constrained optimization problems. A rapidly convergent fixed point method is developed for a regularized penalty functional. The applicability and feasibility of the proposed method is demonstrated using large scale inequality constrained problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1301","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":"1210.1301","created_at":"2026-05-18T03:44:03.985145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1301v1","created_at":"2026-05-18T03:44:03.985145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1301","created_at":"2026-05-18T03:44:03.985145+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHWWCCBZTXZA","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHWWCCBZTXZA6MX5","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHWWCCBZ","created_at":"2026-05-18T12:27:06.952714+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/FHWWCCBZTXZA6MX53DIK5M6Z6W","json":"https://pith.science/pith/FHWWCCBZTXZA6MX53DIK5M6Z6W.json","graph_json":"https://pith.science/api/pith-number/FHWWCCBZTXZA6MX53DIK5M6Z6W/graph.json","events_json":"https://pith.science/api/pith-number/FHWWCCBZTXZA6MX53DIK5M6Z6W/events.json","paper":"https://pith.science/paper/FHWWCCBZ"},"agent_actions":{"view_html":"https://pith.science/pith/FHWWCCBZTXZA6MX53DIK5M6Z6W","download_json":"https://pith.science/pith/FHWWCCBZTXZA6MX53DIK5M6Z6W.json","view_paper":"https://pith.science/paper/FHWWCCBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1301&json=true","fetch_graph":"https://pith.science/api/pith-number/FHWWCCBZTXZA6MX53DIK5M6Z6W/graph.json","fetch_events":"https://pith.science/api/pith-number/FHWWCCBZTXZA6MX53DIK5M6Z6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHWWCCBZTXZA6MX53DIK5M6Z6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHWWCCBZTXZA6MX53DIK5M6Z6W/action/storage_attestation","attest_author":"https://pith.science/pith/FHWWCCBZTXZA6MX53DIK5M6Z6W/action/author_attestation","sign_citation":"https://pith.science/pith/FHWWCCBZTXZA6MX53DIK5M6Z6W/action/citation_signature","submit_replication":"https://pith.science/pith/FHWWCCBZTXZA6MX53DIK5M6Z6W/action/replication_record"}},"created_at":"2026-05-18T03:44:03.985145+00:00","updated_at":"2026-05-18T03:44:03.985145+00:00"}