{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:U2DGEMRNAXOJXOPTNWNTW3WYCA","short_pith_number":"pith:U2DGEMRN","schema_version":"1.0","canonical_sha256":"a68662322d05dc9bb9f36d9b3b6ed8100e77762d2aee19acb10535b944f441a6","source":{"kind":"arxiv","id":"2410.04043","version":4},"attestation_state":"computed","paper":{"title":"Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Zikai Xiong","submitted_at":"2024-10-05T05:35:09Z","abstract_excerpt":"The restarted primal-dual hybrid gradient method (rPDHG) has recently emerged as an important tool for solving large-scale linear programs (LPs). For LPs with unique optima, we present an iteration bound of $O\\left(\\kappa\\Phi\\cdot\\ln\\left(\\frac{\\kappa\\Phi\\|w^*\\|}{\\varepsilon}\\right)\\right)$, where $\\varepsilon$ is the target tolerance, $\\kappa$ is the standard matrix condition number, $\\|w^*\\|$ is the norm of the optimal solution, and $\\Phi$ is a geometric condition number of the LP sublevel sets. This iteration bound is \"accessible\" in the sense that computing it is typically no more difficul"},"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":"2410.04043","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-05T05:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"cbf90dfa0495e1a44d9e07649061e634dd9b43982d1d47926add41ad91b80311","abstract_canon_sha256":"1cc0b86228b619c1b459395837c4a71777f6b4df5056caf5025a15cd772c7989"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:47.098797Z","signature_b64":"oj+SVKUv8Jf2iMPQdaY4fmB4NdEe2I0gqGtlqMqCZnP0bgZaAvUtNlTkl9hIjjk8H7J13RcS5SySdTI2Q22HCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a68662322d05dc9bb9f36d9b3b6ed8100e77762d2aee19acb10535b944f441a6","last_reissued_at":"2026-05-20T00:02:47.098278Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:47.098278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Zikai Xiong","submitted_at":"2024-10-05T05:35:09Z","abstract_excerpt":"The restarted primal-dual hybrid gradient method (rPDHG) has recently emerged as an important tool for solving large-scale linear programs (LPs). For LPs with unique optima, we present an iteration bound of $O\\left(\\kappa\\Phi\\cdot\\ln\\left(\\frac{\\kappa\\Phi\\|w^*\\|}{\\varepsilon}\\right)\\right)$, where $\\varepsilon$ is the target tolerance, $\\kappa$ is the standard matrix condition number, $\\|w^*\\|$ is the norm of the optimal solution, and $\\Phi$ is a geometric condition number of the LP sublevel sets. This iteration bound is \"accessible\" in the sense that computing it is typically no more difficul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04043","kind":"arxiv","version":4},"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/2410.04043/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":"2410.04043","created_at":"2026-05-20T00:02:47.098353+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.04043v4","created_at":"2026-05-20T00:02:47.098353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04043","created_at":"2026-05-20T00:02:47.098353+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2DGEMRNAXOJ","created_at":"2026-05-20T00:02:47.098353+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2DGEMRNAXOJXOPT","created_at":"2026-05-20T00:02:47.098353+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2DGEMRN","created_at":"2026-05-20T00:02:47.098353+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/U2DGEMRNAXOJXOPTNWNTW3WYCA","json":"https://pith.science/pith/U2DGEMRNAXOJXOPTNWNTW3WYCA.json","graph_json":"https://pith.science/api/pith-number/U2DGEMRNAXOJXOPTNWNTW3WYCA/graph.json","events_json":"https://pith.science/api/pith-number/U2DGEMRNAXOJXOPTNWNTW3WYCA/events.json","paper":"https://pith.science/paper/U2DGEMRN"},"agent_actions":{"view_html":"https://pith.science/pith/U2DGEMRNAXOJXOPTNWNTW3WYCA","download_json":"https://pith.science/pith/U2DGEMRNAXOJXOPTNWNTW3WYCA.json","view_paper":"https://pith.science/paper/U2DGEMRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.04043&json=true","fetch_graph":"https://pith.science/api/pith-number/U2DGEMRNAXOJXOPTNWNTW3WYCA/graph.json","fetch_events":"https://pith.science/api/pith-number/U2DGEMRNAXOJXOPTNWNTW3WYCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2DGEMRNAXOJXOPTNWNTW3WYCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2DGEMRNAXOJXOPTNWNTW3WYCA/action/storage_attestation","attest_author":"https://pith.science/pith/U2DGEMRNAXOJXOPTNWNTW3WYCA/action/author_attestation","sign_citation":"https://pith.science/pith/U2DGEMRNAXOJXOPTNWNTW3WYCA/action/citation_signature","submit_replication":"https://pith.science/pith/U2DGEMRNAXOJXOPTNWNTW3WYCA/action/replication_record"}},"created_at":"2026-05-20T00:02:47.098353+00:00","updated_at":"2026-05-20T00:02:47.098353+00:00"}