{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HR24PEKNWC24YI4OBRTR2F6ONQ","short_pith_number":"pith:HR24PEKN","schema_version":"1.0","canonical_sha256":"3c75c7914db0b5cc238e0c671d17ce6c1235beb7d8c5835d3df42ff9efff8fef","source":{"kind":"arxiv","id":"2309.03988","version":3},"attestation_state":"computed","paper":{"title":"Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Oliver Hinder","submitted_at":"2023-09-07T19:43:32Z","abstract_excerpt":"We analyze restarted PDHG on totally unimodular linear programs. In particular, we show that restarted PDHG finds an $\\epsilon$-optimal solution in $O( H m_1^{2.5} \\sqrt{\\textbf{nnz}(A)} \\log(H m_2 /\\epsilon) )$ matrix-vector multiplies where $m_1$ is the number of constraints, $m_2$ the number of variables, $\\textbf{nnz}(A)$ is the number of nonzeros in the constraint matrix, $H$ is the largest absolute coefficient in the right hand side or objective vector, and $\\epsilon$ is the distance to optimality of the outputted solution."},"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":"2309.03988","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-07T19:43:32Z","cross_cats_sorted":[],"title_canon_sha256":"87ff88ed9e4f312aebdfdda93f5ae00a8764f25b60bd850ea305bf0aa9164a99","abstract_canon_sha256":"bd7b5199fda3506289e188582d2ad0a438c1a3d0aec4cc032f397fe260317d97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:06.569704Z","signature_b64":"iOLOa0e8rE0whn2Nd7i2wHD/D29++VMA1ws9/z6q7xx6XA+KKzPGSBacmlF7IoRDSftv0phUUP9vhq0p5W3dAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c75c7914db0b5cc238e0c671d17ce6c1235beb7d8c5835d3df42ff9efff8fef","last_reissued_at":"2026-07-05T09:55:06.569270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:06.569270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Oliver Hinder","submitted_at":"2023-09-07T19:43:32Z","abstract_excerpt":"We analyze restarted PDHG on totally unimodular linear programs. In particular, we show that restarted PDHG finds an $\\epsilon$-optimal solution in $O( H m_1^{2.5} \\sqrt{\\textbf{nnz}(A)} \\log(H m_2 /\\epsilon) )$ matrix-vector multiplies where $m_1$ is the number of constraints, $m_2$ the number of variables, $\\textbf{nnz}(A)$ is the number of nonzeros in the constraint matrix, $H$ is the largest absolute coefficient in the right hand side or objective vector, and $\\epsilon$ is the distance to optimality of the outputted solution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.03988","kind":"arxiv","version":3},"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/2309.03988/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":"2309.03988","created_at":"2026-07-05T09:55:06.569333+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.03988v3","created_at":"2026-07-05T09:55:06.569333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.03988","created_at":"2026-07-05T09:55:06.569333+00:00"},{"alias_kind":"pith_short_12","alias_value":"HR24PEKNWC24","created_at":"2026-07-05T09:55:06.569333+00:00"},{"alias_kind":"pith_short_16","alias_value":"HR24PEKNWC24YI4O","created_at":"2026-07-05T09:55:06.569333+00:00"},{"alias_kind":"pith_short_8","alias_value":"HR24PEKN","created_at":"2026-07-05T09:55:06.569333+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.04043","citing_title":"Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HR24PEKNWC24YI4OBRTR2F6ONQ","json":"https://pith.science/pith/HR24PEKNWC24YI4OBRTR2F6ONQ.json","graph_json":"https://pith.science/api/pith-number/HR24PEKNWC24YI4OBRTR2F6ONQ/graph.json","events_json":"https://pith.science/api/pith-number/HR24PEKNWC24YI4OBRTR2F6ONQ/events.json","paper":"https://pith.science/paper/HR24PEKN"},"agent_actions":{"view_html":"https://pith.science/pith/HR24PEKNWC24YI4OBRTR2F6ONQ","download_json":"https://pith.science/pith/HR24PEKNWC24YI4OBRTR2F6ONQ.json","view_paper":"https://pith.science/paper/HR24PEKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.03988&json=true","fetch_graph":"https://pith.science/api/pith-number/HR24PEKNWC24YI4OBRTR2F6ONQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HR24PEKNWC24YI4OBRTR2F6ONQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HR24PEKNWC24YI4OBRTR2F6ONQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HR24PEKNWC24YI4OBRTR2F6ONQ/action/storage_attestation","attest_author":"https://pith.science/pith/HR24PEKNWC24YI4OBRTR2F6ONQ/action/author_attestation","sign_citation":"https://pith.science/pith/HR24PEKNWC24YI4OBRTR2F6ONQ/action/citation_signature","submit_replication":"https://pith.science/pith/HR24PEKNWC24YI4OBRTR2F6ONQ/action/replication_record"}},"created_at":"2026-07-05T09:55:06.569333+00:00","updated_at":"2026-07-05T09:55:06.569333+00:00"}