{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PB6XO35EUARHDHMO2SLISZRERW","short_pith_number":"pith:PB6XO35E","canonical_record":{"source":{"id":"1710.11005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-30T15:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"38a206b4caf873b13bca44b9d4f18bd2893d03fabfd5ee6991b171395d02d057","abstract_canon_sha256":"6499d7b5fef8c099488ca3914bd0c3e0cc9a59b22522b5561944e36a3ce5e083"},"schema_version":"1.0"},"canonical_sha256":"787d776fa4a022719d8ed4968966248d9db1765c8748840c607b1cee0151fb26","source":{"kind":"arxiv","id":"1710.11005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11005","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11005v1","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11005","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"PB6XO35EUARH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PB6XO35EUARHDHMO","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PB6XO35E","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PB6XO35EUARHDHMO2SLISZRERW","target":"record","payload":{"canonical_record":{"source":{"id":"1710.11005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-30T15:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"38a206b4caf873b13bca44b9d4f18bd2893d03fabfd5ee6991b171395d02d057","abstract_canon_sha256":"6499d7b5fef8c099488ca3914bd0c3e0cc9a59b22522b5561944e36a3ce5e083"},"schema_version":"1.0"},"canonical_sha256":"787d776fa4a022719d8ed4968966248d9db1765c8748840c607b1cee0151fb26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.849837Z","signature_b64":"84/ASC2kR9c/hfEq2XZduOCEeI71aN1ABn7SM3+iR+uDjsN+Spl32l9HHXXXiknbivP60t34CGtSC5/dnNYHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787d776fa4a022719d8ed4968966248d9db1765c8748840c607b1cee0151fb26","last_reissued_at":"2026-05-18T00:31:45.849237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.849237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.11005","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-05-18T00:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVjWUVHc5uy4ThNMocwPFoOHGxdhbF3SpoQrsR2l4vHT/IQAonuaMFKkm3C5BB1VvbS2a4xcr99It1O2o/XHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:28:40.596306Z"},"content_sha256":"45549097c36708e0faa69fc54d393faab958c2a14455a174dce6cd906c4b242a","schema_version":"1.0","event_id":"sha256:45549097c36708e0faa69fc54d393faab958c2a14455a174dce6cd906c4b242a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PB6XO35EUARHDHMO2SLISZRERW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Derivative-Free Gauss-Newton Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Lindon Roberts","submitted_at":"2017-10-30T15:18:01Z","abstract_excerpt":"We present DFO-GN, a derivative-free version of the Gauss-Newton method for solving nonlinear least-squares problems. As is common in derivative-free optimization, DFO-GN uses interpolation of function values to build a model of the objective, which is then used within a trust-region framework to give a globally-convergent algorithm requiring $O(\\epsilon^{-2})$ iterations to reach approximate first-order criticality within tolerance $\\epsilon$. This algorithm is a simplification of the method from [H. Zhang, A. R. Conn, and K. Scheinberg, A Derivative-Free Algorithm for Least-Squares Minimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11005","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"},"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-05-18T00:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7htpbfdz08l7MjHwsPRZ5sSwuzbpm0X/7/BQcpJGBBpjqnJGKhOGOZ/7wIl6t0JL8mglmSReWSFuYgDeq+bKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:28:40.596672Z"},"content_sha256":"5c7f52bb86e27ce46f8c1571e85a7d8d347edf648bb1ba9c965bf22cb1088496","schema_version":"1.0","event_id":"sha256:5c7f52bb86e27ce46f8c1571e85a7d8d347edf648bb1ba9c965bf22cb1088496"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW/bundle.json","state_url":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PB6XO35EUARHDHMO2SLISZRERW/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-06-04T13:28:40Z","links":{"resolver":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW","bundle":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW/bundle.json","state":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PB6XO35EUARHDHMO2SLISZRERW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PB6XO35EUARHDHMO2SLISZRERW","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":"6499d7b5fef8c099488ca3914bd0c3e0cc9a59b22522b5561944e36a3ce5e083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-30T15:18:01Z","title_canon_sha256":"38a206b4caf873b13bca44b9d4f18bd2893d03fabfd5ee6991b171395d02d057"},"schema_version":"1.0","source":{"id":"1710.11005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11005","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11005v1","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11005","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"PB6XO35EUARH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PB6XO35EUARHDHMO","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PB6XO35E","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:5c7f52bb86e27ce46f8c1571e85a7d8d347edf648bb1ba9c965bf22cb1088496","target":"graph","created_at":"2026-05-18T00:31:45Z","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"},"paper":{"abstract_excerpt":"We present DFO-GN, a derivative-free version of the Gauss-Newton method for solving nonlinear least-squares problems. As is common in derivative-free optimization, DFO-GN uses interpolation of function values to build a model of the objective, which is then used within a trust-region framework to give a globally-convergent algorithm requiring $O(\\epsilon^{-2})$ iterations to reach approximate first-order criticality within tolerance $\\epsilon$. This algorithm is a simplification of the method from [H. Zhang, A. R. Conn, and K. Scheinberg, A Derivative-Free Algorithm for Least-Squares Minimizat","authors_text":"Coralia Cartis, Lindon Roberts","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-30T15:18:01Z","title":"A Derivative-Free Gauss-Newton Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11005","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:45549097c36708e0faa69fc54d393faab958c2a14455a174dce6cd906c4b242a","target":"record","created_at":"2026-05-18T00:31:45Z","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":"6499d7b5fef8c099488ca3914bd0c3e0cc9a59b22522b5561944e36a3ce5e083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-30T15:18:01Z","title_canon_sha256":"38a206b4caf873b13bca44b9d4f18bd2893d03fabfd5ee6991b171395d02d057"},"schema_version":"1.0","source":{"id":"1710.11005","kind":"arxiv","version":1}},"canonical_sha256":"787d776fa4a022719d8ed4968966248d9db1765c8748840c607b1cee0151fb26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"787d776fa4a022719d8ed4968966248d9db1765c8748840c607b1cee0151fb26","first_computed_at":"2026-05-18T00:31:45.849237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:45.849237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"84/ASC2kR9c/hfEq2XZduOCEeI71aN1ABn7SM3+iR+uDjsN+Spl32l9HHXXXiknbivP60t34CGtSC5/dnNYHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:45.849837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45549097c36708e0faa69fc54d393faab958c2a14455a174dce6cd906c4b242a","sha256:5c7f52bb86e27ce46f8c1571e85a7d8d347edf648bb1ba9c965bf22cb1088496"],"state_sha256":"e16e37c2d59eb852ec414ba26617b8225dc021d0868551a10abea55ce586d973"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6kqxXR9+DPBUdSEYV2oTTUWv1Lcy3SY3gNxRd6f8DeXFh3dqpzW6IcIFLBxUFJJt+3BGroHxdYa3G6ZWKg5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:28:40.598729Z","bundle_sha256":"21e987dbdef548c6c95a1d9e4e6f1b2a33562c25db15d838519d8d1e23559fd3"}}