{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N5RF3RVHWVOVC3U6AANS6FRKBQ","short_pith_number":"pith:N5RF3RVH","schema_version":"1.0","canonical_sha256":"6f625dc6a7b55d516e9e001b2f162a0c2380dccc03cfe8a2712e6a4d64268b16","source":{"kind":"arxiv","id":"2607.26622","version":1},"attestation_state":"computed","paper":{"title":"Mesh-dependent iteration count growth in primal-dual active set strategies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ioannis P. A. Papadopoulos, Michael Hinterm\\\"uller","submitted_at":"2026-07-29T08:49:00Z","abstract_excerpt":"Primal-dual active set strategies (PDAS) are popular iterative solvers for mixed complementarity problems such as constrained optimization problems with pointwise inequality constraints. Examples include the reduced-space active set algorithm vinewtonrsls found in PETSc. When applied to discretized infinite-dimensional problems, PDAS exhibit local superlinear convergence thanks to their equivalence to a semismooth Newton method (SSN). However, for many problem classes the number of iterations, to reach convergence, grows without bound under mesh refinement. In this paper we numerically study P"},"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":"2607.26622","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-29T08:49:00Z","cross_cats_sorted":[],"title_canon_sha256":"c8824ab4019bf4326b6d18db5c5f64192a2a828b18ba15cba145653bcbdcc210","abstract_canon_sha256":"ce11c20b505ae477a0c4362b210bc55617e6c38b519703f246cf861d0135da5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f625dc6a7b55d516e9e001b2f162a0c2380dccc03cfe8a2712e6a4d64268b16","last_reissued_at":"2026-07-30T01:21:36.492934Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:21:36.492934Z"},"graph_snapshot":{"paper":{"title":"Mesh-dependent iteration count growth in primal-dual active set strategies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ioannis P. A. Papadopoulos, Michael Hinterm\\\"uller","submitted_at":"2026-07-29T08:49:00Z","abstract_excerpt":"Primal-dual active set strategies (PDAS) are popular iterative solvers for mixed complementarity problems such as constrained optimization problems with pointwise inequality constraints. Examples include the reduced-space active set algorithm vinewtonrsls found in PETSc. When applied to discretized infinite-dimensional problems, PDAS exhibit local superlinear convergence thanks to their equivalence to a semismooth Newton method (SSN). However, for many problem classes the number of iterations, to reach convergence, grows without bound under mesh refinement. In this paper we numerically study P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26622","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.26622/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":"2607.26622","created_at":"2026-07-30T01:21:36.498008+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.26622v1","created_at":"2026-07-30T01:21:36.498008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26622","created_at":"2026-07-30T01:21:36.498008+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5RF3RVHWVOV","created_at":"2026-07-30T01:21:36.498008+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5RF3RVHWVOVC3U6","created_at":"2026-07-30T01:21:36.498008+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5RF3RVH","created_at":"2026-07-30T01:21:36.498008+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/N5RF3RVHWVOVC3U6AANS6FRKBQ","json":"https://pith.science/pith/N5RF3RVHWVOVC3U6AANS6FRKBQ.json","graph_json":"https://pith.science/api/pith-number/N5RF3RVHWVOVC3U6AANS6FRKBQ/graph.json","events_json":"https://pith.science/api/pith-number/N5RF3RVHWVOVC3U6AANS6FRKBQ/events.json","paper":"https://pith.science/paper/N5RF3RVH"},"agent_actions":{"view_html":"https://pith.science/pith/N5RF3RVHWVOVC3U6AANS6FRKBQ","download_json":"https://pith.science/pith/N5RF3RVHWVOVC3U6AANS6FRKBQ.json","view_paper":"https://pith.science/paper/N5RF3RVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.26622&json=true","fetch_graph":"https://pith.science/api/pith-number/N5RF3RVHWVOVC3U6AANS6FRKBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/N5RF3RVHWVOVC3U6AANS6FRKBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5RF3RVHWVOVC3U6AANS6FRKBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5RF3RVHWVOVC3U6AANS6FRKBQ/action/storage_attestation","attest_author":"https://pith.science/pith/N5RF3RVHWVOVC3U6AANS6FRKBQ/action/author_attestation","sign_citation":"https://pith.science/pith/N5RF3RVHWVOVC3U6AANS6FRKBQ/action/citation_signature","submit_replication":"https://pith.science/pith/N5RF3RVHWVOVC3U6AANS6FRKBQ/action/replication_record"}},"created_at":"2026-07-30T01:21:36.498008+00:00","updated_at":"2026-07-30T01:21:36.498008+00:00"}