{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CNJQH3H3EVY2J3KB3CESXXUFFU","short_pith_number":"pith:CNJQH3H3","schema_version":"1.0","canonical_sha256":"135303ecfb2571a4ed41d8892bde852d243d4a60da84a04a0e9087dc1b3fcd36","source":{"kind":"arxiv","id":"2504.19629","version":2},"attestation_state":"computed","paper":{"title":"IPAS: An Adaptive Sample Size Method for Weighted Finite Sum Problems with Linear Equality Constraints","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, Sanja Rapaji\\'c","submitted_at":"2025-04-28T09:41:13Z","abstract_excerpt":"Optimization problems with the objective function in the form of weighted sum and linear equality constraints are considered. Given that the number of local cost functions can be large as well as the number of constraints, a stochastic optimization method is proposed. The method belongs to the class of variable sample size first order methods, where the sample size is adaptive and governed by the additional sampling technique earlier proposed in the unconstrained optimization framework. The resulting algorithm may be a mini-batch method, increasing sample size method, or even deterministic in "},"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":"2504.19629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-28T09:41:13Z","cross_cats_sorted":[],"title_canon_sha256":"a1861acf3a7f967bc224ab1cf1aee976d003a651ee6d74699c0c49097ba156be","abstract_canon_sha256":"69d05cfba32dbc740eae834d8dc84c5b78e5bc9c1f2e7ca3ee4c89e1e4a496e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:02:26.254663Z","signature_b64":"3UozVCtk5rpONPUcdn3eZS3rkRdfTQDQpHfdSsdBAnVrRJPvPl2IiZipLcHWzIJOHPWPZWF5nniy94v+ShNPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"135303ecfb2571a4ed41d8892bde852d243d4a60da84a04a0e9087dc1b3fcd36","last_reissued_at":"2026-05-26T01:02:26.253780Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:02:26.253780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"IPAS: An Adaptive Sample Size Method for Weighted Finite Sum Problems with Linear Equality Constraints","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, Sanja Rapaji\\'c","submitted_at":"2025-04-28T09:41:13Z","abstract_excerpt":"Optimization problems with the objective function in the form of weighted sum and linear equality constraints are considered. Given that the number of local cost functions can be large as well as the number of constraints, a stochastic optimization method is proposed. The method belongs to the class of variable sample size first order methods, where the sample size is adaptive and governed by the additional sampling technique earlier proposed in the unconstrained optimization framework. The resulting algorithm may be a mini-batch method, increasing sample size method, or even deterministic in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19629","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.19629/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":"2504.19629","created_at":"2026-05-26T01:02:26.253898+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.19629v2","created_at":"2026-05-26T01:02:26.253898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19629","created_at":"2026-05-26T01:02:26.253898+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNJQH3H3EVY2","created_at":"2026-05-26T01:02:26.253898+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNJQH3H3EVY2J3KB","created_at":"2026-05-26T01:02:26.253898+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNJQH3H3","created_at":"2026-05-26T01:02:26.253898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16263","citing_title":"A Projected Stochastic Gradient Method for Finite-Sum Problems with Linear Equality Constraints","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CNJQH3H3EVY2J3KB3CESXXUFFU","json":"https://pith.science/pith/CNJQH3H3EVY2J3KB3CESXXUFFU.json","graph_json":"https://pith.science/api/pith-number/CNJQH3H3EVY2J3KB3CESXXUFFU/graph.json","events_json":"https://pith.science/api/pith-number/CNJQH3H3EVY2J3KB3CESXXUFFU/events.json","paper":"https://pith.science/paper/CNJQH3H3"},"agent_actions":{"view_html":"https://pith.science/pith/CNJQH3H3EVY2J3KB3CESXXUFFU","download_json":"https://pith.science/pith/CNJQH3H3EVY2J3KB3CESXXUFFU.json","view_paper":"https://pith.science/paper/CNJQH3H3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.19629&json=true","fetch_graph":"https://pith.science/api/pith-number/CNJQH3H3EVY2J3KB3CESXXUFFU/graph.json","fetch_events":"https://pith.science/api/pith-number/CNJQH3H3EVY2J3KB3CESXXUFFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNJQH3H3EVY2J3KB3CESXXUFFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNJQH3H3EVY2J3KB3CESXXUFFU/action/storage_attestation","attest_author":"https://pith.science/pith/CNJQH3H3EVY2J3KB3CESXXUFFU/action/author_attestation","sign_citation":"https://pith.science/pith/CNJQH3H3EVY2J3KB3CESXXUFFU/action/citation_signature","submit_replication":"https://pith.science/pith/CNJQH3H3EVY2J3KB3CESXXUFFU/action/replication_record"}},"created_at":"2026-05-26T01:02:26.253898+00:00","updated_at":"2026-05-26T01:02:26.253898+00:00"}