{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A4DNV3CSCKPA35XUL22SAD3VJP","short_pith_number":"pith:A4DNV3CS","schema_version":"1.0","canonical_sha256":"0706daec52129e0df6f45eb5200f754bc2e1f23e30323b98f58ad705fa97c460","source":{"kind":"arxiv","id":"2406.01942","version":3},"attestation_state":"computed","paper":{"title":"The Role of Level-Set Geometry on the Performance of PDHG for Conic Linear Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Robert M. Freund, Zikai Xiong","submitted_at":"2024-06-04T03:50:12Z","abstract_excerpt":"We consider solving huge-scale instances of (convex) conic linear optimization problems, at the scale where matrix-factorization-free methods are attractive or necessary. The restarted primal-dual hybrid gradient method (rPDHG) -- with heuristic enhancements and GPU implementation -- has been very successful in solving huge-scale linear programming (LP) problems; however its application to more general conic convex optimization problems is not so well-studied. We analyze the theoretical and practical performance of rPDHG for general (convex) conic linear optimization, and LP as a special case "},"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":"2406.01942","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T03:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"da68ea454872a8667a40b7b7cdbf4a347f074d4cd0285cee6c5be7fd0d02fbce","abstract_canon_sha256":"12c66b7dd7d45c2b633d7a4812c2b7881418da8b3b6d92a720b53a041b5f3dd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:56.266608Z","signature_b64":"fnHkV4TVpFINVAVBb0aZhVXF/Na1eneYLVp0SEfILWGzPrUuJGI6+tHy7fDgEXTnLF+j/7dXIMuosdlvtDg8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0706daec52129e0df6f45eb5200f754bc2e1f23e30323b98f58ad705fa97c460","last_reissued_at":"2026-07-05T08:43:56.266135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:56.266135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Role of Level-Set Geometry on the Performance of PDHG for Conic Linear Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Robert M. Freund, Zikai Xiong","submitted_at":"2024-06-04T03:50:12Z","abstract_excerpt":"We consider solving huge-scale instances of (convex) conic linear optimization problems, at the scale where matrix-factorization-free methods are attractive or necessary. The restarted primal-dual hybrid gradient method (rPDHG) -- with heuristic enhancements and GPU implementation -- has been very successful in solving huge-scale linear programming (LP) problems; however its application to more general conic convex optimization problems is not so well-studied. We analyze the theoretical and practical performance of rPDHG for general (convex) conic linear optimization, and LP as a special case "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01942","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/2406.01942/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":"2406.01942","created_at":"2026-07-05T08:43:56.266192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.01942v3","created_at":"2026-07-05T08:43:56.266192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01942","created_at":"2026-07-05T08:43:56.266192+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4DNV3CSCKPA","created_at":"2026-07-05T08:43:56.266192+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4DNV3CSCKPA35XU","created_at":"2026-07-05T08:43:56.266192+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4DNV3CS","created_at":"2026-07-05T08:43:56.266192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30502","citing_title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2409.14715","citing_title":"A New Crossover Algorithm for LP Inspired by the Spiral Dynamic of PDHG","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2410.04043","citing_title":"Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A4DNV3CSCKPA35XUL22SAD3VJP","json":"https://pith.science/pith/A4DNV3CSCKPA35XUL22SAD3VJP.json","graph_json":"https://pith.science/api/pith-number/A4DNV3CSCKPA35XUL22SAD3VJP/graph.json","events_json":"https://pith.science/api/pith-number/A4DNV3CSCKPA35XUL22SAD3VJP/events.json","paper":"https://pith.science/paper/A4DNV3CS"},"agent_actions":{"view_html":"https://pith.science/pith/A4DNV3CSCKPA35XUL22SAD3VJP","download_json":"https://pith.science/pith/A4DNV3CSCKPA35XUL22SAD3VJP.json","view_paper":"https://pith.science/paper/A4DNV3CS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.01942&json=true","fetch_graph":"https://pith.science/api/pith-number/A4DNV3CSCKPA35XUL22SAD3VJP/graph.json","fetch_events":"https://pith.science/api/pith-number/A4DNV3CSCKPA35XUL22SAD3VJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4DNV3CSCKPA35XUL22SAD3VJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4DNV3CSCKPA35XUL22SAD3VJP/action/storage_attestation","attest_author":"https://pith.science/pith/A4DNV3CSCKPA35XUL22SAD3VJP/action/author_attestation","sign_citation":"https://pith.science/pith/A4DNV3CSCKPA35XUL22SAD3VJP/action/citation_signature","submit_replication":"https://pith.science/pith/A4DNV3CSCKPA35XUL22SAD3VJP/action/replication_record"}},"created_at":"2026-07-05T08:43:56.266192+00:00","updated_at":"2026-07-05T08:43:56.266192+00:00"}