{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4E5WBLNLLRCYJLKQ6ARYTZS2VE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0c2f4841bfd6beb9f372e866ad1663574fa6dfcc18cc4650fdc167941cca16ef","cross_cats_sorted":["cs.MS","cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-06T17:57:44Z","title_canon_sha256":"fd36fa10e173054b328e1bf1e609f0ec1038aa3eae9e959929c8d93cbc2c4f40"},"schema_version":"1.0","source":{"id":"2101.02164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.02164","created_at":"2026-07-05T02:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"2101.02164v1","created_at":"2026-07-05T02:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.02164","created_at":"2026-07-05T02:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"4E5WBLNLLRCY","created_at":"2026-07-05T02:09:55Z"},{"alias_kind":"pith_short_16","alias_value":"4E5WBLNLLRCYJLKQ","created_at":"2026-07-05T02:09:55Z"},{"alias_kind":"pith_short_8","alias_value":"4E5WBLNL","created_at":"2026-07-05T02:09:55Z"}],"graph_snapshots":[{"event_id":"sha256:895cc59041267598cab972697c56e037b47255c018dbd7b9fb53a266d65d7c55","target":"graph","created_at":"2026-07-05T02:09:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.02164/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Algorithm NCL is designed for general smooth optimization problems where first and second derivatives are available, including problems whose constraints may not be linearly independent at a solution (i.e., do not satisfy the LICQ). It is equivalent to the LANCELOT augmented Lagrangian method, reformulated as a short sequence of nonlinearly constrained subproblems that can be solved efficiently by IPOPT and KNITRO, with warm starts on each subproblem. We give numerical results from a Julia implementation of Algorithm NCL on tax policy models that do not satisfy the LICQ, and on nonlinear least","authors_text":"Ding Ma, Dominique Orban, Michael A. Saunders","cross_cats":["cs.MS","cs.NA","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-06T17:57:44Z","title":"A Julia implementation of Algorithm NCL for constrained optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.02164","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ef9318d46a9dd714e401f579045c9d19308899698243b5209b99b8e1e6886e58","target":"record","created_at":"2026-07-05T02:09:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0c2f4841bfd6beb9f372e866ad1663574fa6dfcc18cc4650fdc167941cca16ef","cross_cats_sorted":["cs.MS","cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-06T17:57:44Z","title_canon_sha256":"fd36fa10e173054b328e1bf1e609f0ec1038aa3eae9e959929c8d93cbc2c4f40"},"schema_version":"1.0","source":{"id":"2101.02164","kind":"arxiv","version":1}},"canonical_sha256":"e13b60adab5c4584ad50f02389e65aa90a45bb33ca40e45a7f0091008a32268f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e13b60adab5c4584ad50f02389e65aa90a45bb33ca40e45a7f0091008a32268f","first_computed_at":"2026-07-05T02:09:55.924821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:09:55.924821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Le1EeoBKvfncnAe5qGH9u3i2hA8CzW9UECKkWKU9KaJqdP3rYpjkhutsWo/R+1CiDx/nBmiI1Di8k93tsdl4AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:09:55.925212Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.02164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef9318d46a9dd714e401f579045c9d19308899698243b5209b99b8e1e6886e58","sha256:895cc59041267598cab972697c56e037b47255c018dbd7b9fb53a266d65d7c55"],"state_sha256":"f2511f63ed0ebbd60ed9f5e0f2caf65d92dd676e585f8f5990adc247da5f73df"}