{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FPB5KQVULQOGDKBECT5O3GUQOE","short_pith_number":"pith:FPB5KQVU","schema_version":"1.0","canonical_sha256":"2bc3d542b45c1c61a82414faed9a90710d28832ff9b82809203ec34a8ac397eb","source":{"kind":"arxiv","id":"2510.00417","version":2},"attestation_state":"computed","paper":{"title":"Progressively Sampled Equality-Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel P. Robinson, Frank E. Curtis, Lingjun Guo","submitted_at":"2025-10-01T01:58:17Z","abstract_excerpt":"An algorithm is proposed, analyzed, and tested for solving continuous nonlinear-equality-constrained optimization problems where the objective and constraint functions are defined by expectations or averages over large, finite numbers of terms. The main idea of the algorithm is to solve a sequence of related problems, each involving finite samples of objective- and constraint-function terms, over which the sample sets grow progressively. Under assumptions about the problem functions and their first- and second-order derivatives that are reasonable in real-world settings of interest, it is show"},"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":"2510.00417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-10-01T01:58:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ab7a816cf987d99c01948e3424c91f0ee17a64e4fb3269831d1c4dbb25bfffb9","abstract_canon_sha256":"3be96b1cb763a8ae273b593b8275febfb09cadad02c7bfa12beff2ce49fad670"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.166713Z","signature_b64":"tyRW9W5sw+lvMX5fkg/tWFN7PHPX3U/y/PvU5TPQhzms8oK1BTD0YkmtMNobz2yrMYkfS6omcz3VTCdNba+wDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bc3d542b45c1c61a82414faed9a90710d28832ff9b82809203ec34a8ac397eb","last_reissued_at":"2026-05-18T02:44:33.165856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.165856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Progressively Sampled Equality-Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel P. Robinson, Frank E. Curtis, Lingjun Guo","submitted_at":"2025-10-01T01:58:17Z","abstract_excerpt":"An algorithm is proposed, analyzed, and tested for solving continuous nonlinear-equality-constrained optimization problems where the objective and constraint functions are defined by expectations or averages over large, finite numbers of terms. The main idea of the algorithm is to solve a sequence of related problems, each involving finite samples of objective- and constraint-function terms, over which the sample sets grow progressively. Under assumptions about the problem functions and their first- and second-order derivatives that are reasonable in real-world settings of interest, it is show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.00417","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":"2510.00417","created_at":"2026-05-18T02:44:33.166119+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.00417v2","created_at":"2026-05-18T02:44:33.166119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.00417","created_at":"2026-05-18T02:44:33.166119+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPB5KQVULQOG","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPB5KQVULQOGDKBE","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPB5KQVU","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/FPB5KQVULQOGDKBECT5O3GUQOE","json":"https://pith.science/pith/FPB5KQVULQOGDKBECT5O3GUQOE.json","graph_json":"https://pith.science/api/pith-number/FPB5KQVULQOGDKBECT5O3GUQOE/graph.json","events_json":"https://pith.science/api/pith-number/FPB5KQVULQOGDKBECT5O3GUQOE/events.json","paper":"https://pith.science/paper/FPB5KQVU"},"agent_actions":{"view_html":"https://pith.science/pith/FPB5KQVULQOGDKBECT5O3GUQOE","download_json":"https://pith.science/pith/FPB5KQVULQOGDKBECT5O3GUQOE.json","view_paper":"https://pith.science/paper/FPB5KQVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.00417&json=true","fetch_graph":"https://pith.science/api/pith-number/FPB5KQVULQOGDKBECT5O3GUQOE/graph.json","fetch_events":"https://pith.science/api/pith-number/FPB5KQVULQOGDKBECT5O3GUQOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPB5KQVULQOGDKBECT5O3GUQOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPB5KQVULQOGDKBECT5O3GUQOE/action/storage_attestation","attest_author":"https://pith.science/pith/FPB5KQVULQOGDKBECT5O3GUQOE/action/author_attestation","sign_citation":"https://pith.science/pith/FPB5KQVULQOGDKBECT5O3GUQOE/action/citation_signature","submit_replication":"https://pith.science/pith/FPB5KQVULQOGDKBECT5O3GUQOE/action/replication_record"}},"created_at":"2026-05-18T02:44:33.166119+00:00","updated_at":"2026-05-18T02:44:33.166119+00:00"}