{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4PBDHFCLXGACGN7GCP42QTIYEJ","short_pith_number":"pith:4PBDHFCL","schema_version":"1.0","canonical_sha256":"e3c233944bb9802337e613f9a84d18226e89e19a6c1d2c784888f5872cce3410","source":{"kind":"arxiv","id":"1706.02730","version":1},"attestation_state":"computed","paper":{"title":"Random projections for trust region subproblems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Claudia D'Ambrosio, Ky Vu, Leo Liberti, Pierre-Louis Poirion","submitted_at":"2017-06-08T18:36:51Z","abstract_excerpt":"The trust region method is an algorithm traditionally used in the field of derivative free optimization. The method works by iteratively constructing surrogate models (often linear or quadratic functions) to approximate the true objective function inside some neighborhood of a current iterate. The neighborhood is called \"trust region in the sense that the model is trusted to be good enough inside the neighborhood. Updated points are found by solving the corresponding trust region subproblems. In this paper, we describe an application of random projections to solving trust region subproblems ap"},"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":"1706.02730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-08T18:36:51Z","cross_cats_sorted":[],"title_canon_sha256":"754950d8319f4e7326e1426fea6dc533dff509b2fb5d73c161c34654ef85850e","abstract_canon_sha256":"7185c5f916dc0ae8213c29a329534a502905341f346f3ca775cb21b146ce958c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:43.268909Z","signature_b64":"PeyDGeAWm399/BY/n+RU2fOgkcvU9gQdubSiDR9QrTEwSy1tOhCW65Mu3kE7JU80N3xYYQkK2T6E1ray8+a4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3c233944bb9802337e613f9a84d18226e89e19a6c1d2c784888f5872cce3410","last_reissued_at":"2026-05-18T00:42:43.268222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:43.268222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random projections for trust region subproblems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Claudia D'Ambrosio, Ky Vu, Leo Liberti, Pierre-Louis Poirion","submitted_at":"2017-06-08T18:36:51Z","abstract_excerpt":"The trust region method is an algorithm traditionally used in the field of derivative free optimization. The method works by iteratively constructing surrogate models (often linear or quadratic functions) to approximate the true objective function inside some neighborhood of a current iterate. The neighborhood is called \"trust region in the sense that the model is trusted to be good enough inside the neighborhood. Updated points are found by solving the corresponding trust region subproblems. In this paper, we describe an application of random projections to solving trust region subproblems ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02730","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":"1706.02730","created_at":"2026-05-18T00:42:43.268331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02730v1","created_at":"2026-05-18T00:42:43.268331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02730","created_at":"2026-05-18T00:42:43.268331+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PBDHFCLXGAC","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PBDHFCLXGACGN7G","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PBDHFCL","created_at":"2026-05-18T12:31:00.734936+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/4PBDHFCLXGACGN7GCP42QTIYEJ","json":"https://pith.science/pith/4PBDHFCLXGACGN7GCP42QTIYEJ.json","graph_json":"https://pith.science/api/pith-number/4PBDHFCLXGACGN7GCP42QTIYEJ/graph.json","events_json":"https://pith.science/api/pith-number/4PBDHFCLXGACGN7GCP42QTIYEJ/events.json","paper":"https://pith.science/paper/4PBDHFCL"},"agent_actions":{"view_html":"https://pith.science/pith/4PBDHFCLXGACGN7GCP42QTIYEJ","download_json":"https://pith.science/pith/4PBDHFCLXGACGN7GCP42QTIYEJ.json","view_paper":"https://pith.science/paper/4PBDHFCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02730&json=true","fetch_graph":"https://pith.science/api/pith-number/4PBDHFCLXGACGN7GCP42QTIYEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4PBDHFCLXGACGN7GCP42QTIYEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PBDHFCLXGACGN7GCP42QTIYEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PBDHFCLXGACGN7GCP42QTIYEJ/action/storage_attestation","attest_author":"https://pith.science/pith/4PBDHFCLXGACGN7GCP42QTIYEJ/action/author_attestation","sign_citation":"https://pith.science/pith/4PBDHFCLXGACGN7GCP42QTIYEJ/action/citation_signature","submit_replication":"https://pith.science/pith/4PBDHFCLXGACGN7GCP42QTIYEJ/action/replication_record"}},"created_at":"2026-05-18T00:42:43.268331+00:00","updated_at":"2026-05-18T00:42:43.268331+00:00"}