{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HSPXSZ7DA3P6WFR27LOVTX2PRJ","short_pith_number":"pith:HSPXSZ7D","schema_version":"1.0","canonical_sha256":"3c9f7967e306dfeb163afadd59df4f8a617f9770ad55728ebff62f8be5e1677a","source":{"kind":"arxiv","id":"2501.06350","version":2},"attestation_state":"computed","paper":{"title":"SMOP: Stochastic trust region method for multi-objective problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Luka Rute\\v{s}i\\'c, Nata\\v{s}a Kreji\\'c, Nata\\v{s}a Krklec Jerinki\\'c","submitted_at":"2025-01-10T21:23:05Z","abstract_excerpt":"The problem we consider is a multi-objective optimization problem, in which the goal is to find an optimal value of a vector function representing various criteria. The aim of this work is to develop an algorithm which utilizes the trust region framework with probabilistic model functions, able to cope with noisy problems, using inaccurate functions and gradients. The key novelty is approximation of each function in the multiobjective problem with probabilistically fully linear model which yields the composite model defined by max operator as a satisfactory approximation for the nonsmooth scal"},"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":"2501.06350","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-10T21:23:05Z","cross_cats_sorted":[],"title_canon_sha256":"2fcda5afbbb8dfca64f394e3d669eb29398195b66d9cabaa8f85c9bdd883d544","abstract_canon_sha256":"9e8f0c7d1dad69fcd89063538aae6fad655a74594ce1d0353d1d6f25bac3ffc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:01.580106Z","signature_b64":"KUtbcaUDgHPNqaZJL//UpludlTsJTH7bppjBwMW3ztaEjsIV/1BkMHi6Ets+y4Cv8ZWcgt1xtxWd8rSf/AVqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c9f7967e306dfeb163afadd59df4f8a617f9770ad55728ebff62f8be5e1677a","last_reissued_at":"2026-05-17T23:39:01.579443Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:01.579443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SMOP: Stochastic trust region method for multi-objective problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Luka Rute\\v{s}i\\'c, Nata\\v{s}a Kreji\\'c, Nata\\v{s}a Krklec Jerinki\\'c","submitted_at":"2025-01-10T21:23:05Z","abstract_excerpt":"The problem we consider is a multi-objective optimization problem, in which the goal is to find an optimal value of a vector function representing various criteria. The aim of this work is to develop an algorithm which utilizes the trust region framework with probabilistic model functions, able to cope with noisy problems, using inaccurate functions and gradients. The key novelty is approximation of each function in the multiobjective problem with probabilistically fully linear model which yields the composite model defined by max operator as a satisfactory approximation for the nonsmooth scal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.06350","kind":"arxiv","version":2},"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":"2501.06350","created_at":"2026-05-17T23:39:01.579557+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.06350v2","created_at":"2026-05-17T23:39:01.579557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.06350","created_at":"2026-05-17T23:39:01.579557+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSPXSZ7DA3P6","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSPXSZ7DA3P6WFR2","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSPXSZ7D","created_at":"2026-05-18T12:33:37.589309+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/HSPXSZ7DA3P6WFR27LOVTX2PRJ","json":"https://pith.science/pith/HSPXSZ7DA3P6WFR27LOVTX2PRJ.json","graph_json":"https://pith.science/api/pith-number/HSPXSZ7DA3P6WFR27LOVTX2PRJ/graph.json","events_json":"https://pith.science/api/pith-number/HSPXSZ7DA3P6WFR27LOVTX2PRJ/events.json","paper":"https://pith.science/paper/HSPXSZ7D"},"agent_actions":{"view_html":"https://pith.science/pith/HSPXSZ7DA3P6WFR27LOVTX2PRJ","download_json":"https://pith.science/pith/HSPXSZ7DA3P6WFR27LOVTX2PRJ.json","view_paper":"https://pith.science/paper/HSPXSZ7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.06350&json=true","fetch_graph":"https://pith.science/api/pith-number/HSPXSZ7DA3P6WFR27LOVTX2PRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HSPXSZ7DA3P6WFR27LOVTX2PRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSPXSZ7DA3P6WFR27LOVTX2PRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSPXSZ7DA3P6WFR27LOVTX2PRJ/action/storage_attestation","attest_author":"https://pith.science/pith/HSPXSZ7DA3P6WFR27LOVTX2PRJ/action/author_attestation","sign_citation":"https://pith.science/pith/HSPXSZ7DA3P6WFR27LOVTX2PRJ/action/citation_signature","submit_replication":"https://pith.science/pith/HSPXSZ7DA3P6WFR27LOVTX2PRJ/action/replication_record"}},"created_at":"2026-05-17T23:39:01.579557+00:00","updated_at":"2026-05-17T23:39:01.579557+00:00"}