{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:F22LSLXOGMA7E4XPLYRDE76IN2","short_pith_number":"pith:F22LSLXO","schema_version":"1.0","canonical_sha256":"2eb4b92eee3301f272ef5e22327fc86e9e70df7d351c51364969949c09d96616","source":{"kind":"arxiv","id":"2407.04235","version":1},"attestation_state":"computed","paper":{"title":"Novel Optimization Techniques for Parameter Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"math.OC","authors_text":"Casey Garner, Chenyu Wu, Kevin Leder, Nuozhou Wang, Shuzhong Zhang","submitted_at":"2024-07-05T03:22:51Z","abstract_excerpt":"In this paper, we introduce a new optimization algorithm that is well suited for solving parameter estimation problems. We call our new method cubic regularized Newton with affine scaling (CRNAS). In contrast to so-called first-order methods which rely solely on the gradient of the objective function, our method utilizes the Hessian of the objective. As a result it is able to focus on points satisfying the second-order optimality conditions, as opposed to first-order methods that simply converge to critical points. This is an important feature in parameter estimation problems where the objecti"},"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.04235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-05T03:22:51Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"1180bdd614561ab33054d7cfc91073869142fa722fdcd0a0d3890d1f1fc5bf97","abstract_canon_sha256":"d9771c291a43ac7e4c819c9e3f75dc05d62ea64d1118bbfc49228834c812add5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:31.086011Z","signature_b64":"zjGsFSPMS/3raDMmpyg7cJLV7lKMDYkiehZ8jvFhL8kDTzaRbxSTW0UdZpf82Tv+rUCc6fNM+JYSd7v6SbD6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb4b92eee3301f272ef5e22327fc86e9e70df7d351c51364969949c09d96616","last_reissued_at":"2026-07-05T08:40:31.085534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:31.085534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Novel Optimization Techniques for Parameter Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"math.OC","authors_text":"Casey Garner, Chenyu Wu, Kevin Leder, Nuozhou Wang, Shuzhong Zhang","submitted_at":"2024-07-05T03:22:51Z","abstract_excerpt":"In this paper, we introduce a new optimization algorithm that is well suited for solving parameter estimation problems. We call our new method cubic regularized Newton with affine scaling (CRNAS). In contrast to so-called first-order methods which rely solely on the gradient of the objective function, our method utilizes the Hessian of the objective. As a result it is able to focus on points satisfying the second-order optimality conditions, as opposed to first-order methods that simply converge to critical points. This is an important feature in parameter estimation problems where the objecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04235","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.04235/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.04235","created_at":"2026-07-05T08:40:31.085597+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.04235v1","created_at":"2026-07-05T08:40:31.085597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04235","created_at":"2026-07-05T08:40:31.085597+00:00"},{"alias_kind":"pith_short_12","alias_value":"F22LSLXOGMA7","created_at":"2026-07-05T08:40:31.085597+00:00"},{"alias_kind":"pith_short_16","alias_value":"F22LSLXOGMA7E4XP","created_at":"2026-07-05T08:40:31.085597+00:00"},{"alias_kind":"pith_short_8","alias_value":"F22LSLXO","created_at":"2026-07-05T08:40:31.085597+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08506","citing_title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F22LSLXOGMA7E4XPLYRDE76IN2","json":"https://pith.science/pith/F22LSLXOGMA7E4XPLYRDE76IN2.json","graph_json":"https://pith.science/api/pith-number/F22LSLXOGMA7E4XPLYRDE76IN2/graph.json","events_json":"https://pith.science/api/pith-number/F22LSLXOGMA7E4XPLYRDE76IN2/events.json","paper":"https://pith.science/paper/F22LSLXO"},"agent_actions":{"view_html":"https://pith.science/pith/F22LSLXOGMA7E4XPLYRDE76IN2","download_json":"https://pith.science/pith/F22LSLXOGMA7E4XPLYRDE76IN2.json","view_paper":"https://pith.science/paper/F22LSLXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.04235&json=true","fetch_graph":"https://pith.science/api/pith-number/F22LSLXOGMA7E4XPLYRDE76IN2/graph.json","fetch_events":"https://pith.science/api/pith-number/F22LSLXOGMA7E4XPLYRDE76IN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F22LSLXOGMA7E4XPLYRDE76IN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F22LSLXOGMA7E4XPLYRDE76IN2/action/storage_attestation","attest_author":"https://pith.science/pith/F22LSLXOGMA7E4XPLYRDE76IN2/action/author_attestation","sign_citation":"https://pith.science/pith/F22LSLXOGMA7E4XPLYRDE76IN2/action/citation_signature","submit_replication":"https://pith.science/pith/F22LSLXOGMA7E4XPLYRDE76IN2/action/replication_record"}},"created_at":"2026-07-05T08:40:31.085597+00:00","updated_at":"2026-07-05T08:40:31.085597+00:00"}