{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TI6YARKWSC6YZY6DJGYV473TN7","short_pith_number":"pith:TI6YARKW","canonical_record":{"source":{"id":"2402.11920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-19T08:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"e0e7916e9b98556e51dfeaf915f8867de52071c04e736e0c89ae9a13b89c3dc2","abstract_canon_sha256":"a39ec41c828b681ee815efeed1b45bcb479bf63d61c637388166a1e6714262e7"},"schema_version":"1.0"},"canonical_sha256":"9a3d80455690bd8ce3c349b15e7f736fc3604df42228f90b9bb4ca22960d1bb3","source":{"kind":"arxiv","id":"2402.11920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.11920","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"arxiv_version","alias_value":"2402.11920v1","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11920","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"pith_short_12","alias_value":"TI6YARKWSC6Y","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"pith_short_16","alias_value":"TI6YARKWSC6YZY6D","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"pith_short_8","alias_value":"TI6YARKW","created_at":"2026-07-05T07:46:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TI6YARKWSC6YZY6DJGYV473TN7","target":"record","payload":{"canonical_record":{"source":{"id":"2402.11920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-19T08:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"e0e7916e9b98556e51dfeaf915f8867de52071c04e736e0c89ae9a13b89c3dc2","abstract_canon_sha256":"a39ec41c828b681ee815efeed1b45bcb479bf63d61c637388166a1e6714262e7"},"schema_version":"1.0"},"canonical_sha256":"9a3d80455690bd8ce3c349b15e7f736fc3604df42228f90b9bb4ca22960d1bb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:46.250693Z","signature_b64":"XSqz3GOrP0z+UYjd4g+J8Zh7Z+DR5OFk/k4UJm4q8ZeuWMShcpg7t5AnZk6ASzQ+VVvYTGI8zsiuSY2HURRkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a3d80455690bd8ce3c349b15e7f736fc3604df42228f90b9bb4ca22960d1bb3","last_reissued_at":"2026-07-05T07:46:46.250252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:46.250252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.11920","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:46:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5iQJO4ZfXMKpl0NSxOSmp/KRCuYkuBG8IDGwgQ62IzxOhTXB14BnoY4zh7ddFflQEYwexMbO2GBSm5PZRDPxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:47:43.002633Z"},"content_sha256":"0376eeebf94ce7f3bd71c38a16560c6eb567edfeb0f3ae376a98105ec992b53d","schema_version":"1.0","event_id":"sha256:0376eeebf94ce7f3bd71c38a16560c6eb567edfeb0f3ae376a98105ec992b53d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TI6YARKWSC6YZY6DJGYV473TN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Feasible Method for Constrained Derivative-Free Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jorge Nocedal, Melody Qiming Xuan","submitted_at":"2024-02-19T08:10:35Z","abstract_excerpt":"This paper explores a method for solving constrained optimization problems when the derivatives of the objective function are unavailable, while the derivatives of the constraints are known. We allow the objective and constraint function to be nonconvex. The method constructs a quadratic model of the objective function via interpolation and computes a step by minimizing this model subject to the original constraints in the problem and a trust region constraint. The step computation requires the solution of a general nonlinear program, which is economically feasible when the constraints and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11920","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/2402.11920/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:46:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kk5l+j/FcLS8lKdNZdl8xQwGoaKX9nyhH8yutl2ZnhCHfeGD576aLftZXbdbF0z8Jj0sYpFI3461U8EiaiXVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:47:43.003546Z"},"content_sha256":"588631bbc8cbb0eb403cf12f495876789a4b9bae5b24afc2d8f4d6c1854a0cd7","schema_version":"1.0","event_id":"sha256:588631bbc8cbb0eb403cf12f495876789a4b9bae5b24afc2d8f4d6c1854a0cd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TI6YARKWSC6YZY6DJGYV473TN7/bundle.json","state_url":"https://pith.science/pith/TI6YARKWSC6YZY6DJGYV473TN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TI6YARKWSC6YZY6DJGYV473TN7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T08:47:43Z","links":{"resolver":"https://pith.science/pith/TI6YARKWSC6YZY6DJGYV473TN7","bundle":"https://pith.science/pith/TI6YARKWSC6YZY6DJGYV473TN7/bundle.json","state":"https://pith.science/pith/TI6YARKWSC6YZY6DJGYV473TN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TI6YARKWSC6YZY6DJGYV473TN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TI6YARKWSC6YZY6DJGYV473TN7","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":"a39ec41c828b681ee815efeed1b45bcb479bf63d61c637388166a1e6714262e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-19T08:10:35Z","title_canon_sha256":"e0e7916e9b98556e51dfeaf915f8867de52071c04e736e0c89ae9a13b89c3dc2"},"schema_version":"1.0","source":{"id":"2402.11920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.11920","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"arxiv_version","alias_value":"2402.11920v1","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11920","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"pith_short_12","alias_value":"TI6YARKWSC6Y","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"pith_short_16","alias_value":"TI6YARKWSC6YZY6D","created_at":"2026-07-05T07:46:46Z"},{"alias_kind":"pith_short_8","alias_value":"TI6YARKW","created_at":"2026-07-05T07:46:46Z"}],"graph_snapshots":[{"event_id":"sha256:588631bbc8cbb0eb403cf12f495876789a4b9bae5b24afc2d8f4d6c1854a0cd7","target":"graph","created_at":"2026-07-05T07:46:46Z","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/2402.11920/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper explores a method for solving constrained optimization problems when the derivatives of the objective function are unavailable, while the derivatives of the constraints are known. We allow the objective and constraint function to be nonconvex. The method constructs a quadratic model of the objective function via interpolation and computes a step by minimizing this model subject to the original constraints in the problem and a trust region constraint. The step computation requires the solution of a general nonlinear program, which is economically feasible when the constraints and the","authors_text":"Jorge Nocedal, Melody Qiming Xuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-19T08:10:35Z","title":"A Feasible Method for Constrained Derivative-Free Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11920","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:0376eeebf94ce7f3bd71c38a16560c6eb567edfeb0f3ae376a98105ec992b53d","target":"record","created_at":"2026-07-05T07:46:46Z","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":"a39ec41c828b681ee815efeed1b45bcb479bf63d61c637388166a1e6714262e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-19T08:10:35Z","title_canon_sha256":"e0e7916e9b98556e51dfeaf915f8867de52071c04e736e0c89ae9a13b89c3dc2"},"schema_version":"1.0","source":{"id":"2402.11920","kind":"arxiv","version":1}},"canonical_sha256":"9a3d80455690bd8ce3c349b15e7f736fc3604df42228f90b9bb4ca22960d1bb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a3d80455690bd8ce3c349b15e7f736fc3604df42228f90b9bb4ca22960d1bb3","first_computed_at":"2026-07-05T07:46:46.250252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:46:46.250252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XSqz3GOrP0z+UYjd4g+J8Zh7Z+DR5OFk/k4UJm4q8ZeuWMShcpg7t5AnZk6ASzQ+VVvYTGI8zsiuSY2HURRkAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:46:46.250693Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.11920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0376eeebf94ce7f3bd71c38a16560c6eb567edfeb0f3ae376a98105ec992b53d","sha256:588631bbc8cbb0eb403cf12f495876789a4b9bae5b24afc2d8f4d6c1854a0cd7"],"state_sha256":"44e9d35a63d18b417c2fe58c6e1c50a69a817f9cfe34e30bba9699a06a6333ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UgGSN2tqskgj0bxwMMBqgZyK2pkoxfBS+T/gTRvo34ISgQmQHoyGKKttVhBs5F1VVghtdEINF4gFfOFEqhSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T08:47:43.010879Z","bundle_sha256":"11db92eae3c4deeb49137399461b2ca0b2e91f75616d427382cc7f460548b9ee"}}