{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:F72DXSHC6R6UJOFN5IL2ABUOHV","short_pith_number":"pith:F72DXSHC","schema_version":"1.0","canonical_sha256":"2ff43bc8e2f47d44b8adea17a0068e3d401c8a7b35120b7bb94b1bd88f273dde","source":{"kind":"arxiv","id":"2102.04592","version":1},"attestation_state":"computed","paper":{"title":"Infeasibility detection with primal-dual hybrid gradient for large-scale linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Applegate, Haihao Lu, Mateo D\\'iaz, Miles Lubin","submitted_at":"2021-02-09T01:08:51Z","abstract_excerpt":"We study the problem of detecting infeasibility of large-scale linear programming problems using the primal-dual hybrid gradient method (PDHG) of Chambolle and Pock (2011). The literature on PDHG has mostly focused on settings where the problem at hand is assumed to be feasible. When the problem is not feasible, the iterates of the algorithm do not converge. In this scenario, we show that the iterates diverge at a controlled rate towards a well-defined ray. The direction of this ray is known as the infimal displacement vector $v$. The first contribution of our work is to prove that this vector"},"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":"2102.04592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-09T01:08:51Z","cross_cats_sorted":[],"title_canon_sha256":"8aac291ab02a6f47efd22894257b2105bf1a19688c8125a237ce0c045a86af90","abstract_canon_sha256":"00491f8343eebdc55ed30684a98ab1f3a8ed1440e9e0d933437379daa1960e8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:02.219740Z","signature_b64":"r4Z+rzeo0DSgtp99iUnS0IIEN/CKzcAGPPx1M+qfFb5vJL1kwb+yeN0caERgjvGcs50fHuxB+UcmHDhmVfa1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ff43bc8e2f47d44b8adea17a0068e3d401c8a7b35120b7bb94b1bd88f273dde","last_reissued_at":"2026-07-05T02:14:02.219305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:02.219305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infeasibility detection with primal-dual hybrid gradient for large-scale linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Applegate, Haihao Lu, Mateo D\\'iaz, Miles Lubin","submitted_at":"2021-02-09T01:08:51Z","abstract_excerpt":"We study the problem of detecting infeasibility of large-scale linear programming problems using the primal-dual hybrid gradient method (PDHG) of Chambolle and Pock (2011). The literature on PDHG has mostly focused on settings where the problem at hand is assumed to be feasible. When the problem is not feasible, the iterates of the algorithm do not converge. In this scenario, we show that the iterates diverge at a controlled rate towards a well-defined ray. The direction of this ray is known as the infimal displacement vector $v$. The first contribution of our work is to prove that this vector"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04592","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/2102.04592/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":"2102.04592","created_at":"2026-07-05T02:14:02.219365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.04592v1","created_at":"2026-07-05T02:14:02.219365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04592","created_at":"2026-07-05T02:14:02.219365+00:00"},{"alias_kind":"pith_short_12","alias_value":"F72DXSHC6R6U","created_at":"2026-07-05T02:14:02.219365+00:00"},{"alias_kind":"pith_short_16","alias_value":"F72DXSHC6R6UJOFN","created_at":"2026-07-05T02:14:02.219365+00:00"},{"alias_kind":"pith_short_8","alias_value":"F72DXSHC","created_at":"2026-07-05T02:14:02.219365+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.16806","citing_title":"Accelerating a Linear Programming Algorithm on AMD GPUs","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F72DXSHC6R6UJOFN5IL2ABUOHV","json":"https://pith.science/pith/F72DXSHC6R6UJOFN5IL2ABUOHV.json","graph_json":"https://pith.science/api/pith-number/F72DXSHC6R6UJOFN5IL2ABUOHV/graph.json","events_json":"https://pith.science/api/pith-number/F72DXSHC6R6UJOFN5IL2ABUOHV/events.json","paper":"https://pith.science/paper/F72DXSHC"},"agent_actions":{"view_html":"https://pith.science/pith/F72DXSHC6R6UJOFN5IL2ABUOHV","download_json":"https://pith.science/pith/F72DXSHC6R6UJOFN5IL2ABUOHV.json","view_paper":"https://pith.science/paper/F72DXSHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.04592&json=true","fetch_graph":"https://pith.science/api/pith-number/F72DXSHC6R6UJOFN5IL2ABUOHV/graph.json","fetch_events":"https://pith.science/api/pith-number/F72DXSHC6R6UJOFN5IL2ABUOHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F72DXSHC6R6UJOFN5IL2ABUOHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F72DXSHC6R6UJOFN5IL2ABUOHV/action/storage_attestation","attest_author":"https://pith.science/pith/F72DXSHC6R6UJOFN5IL2ABUOHV/action/author_attestation","sign_citation":"https://pith.science/pith/F72DXSHC6R6UJOFN5IL2ABUOHV/action/citation_signature","submit_replication":"https://pith.science/pith/F72DXSHC6R6UJOFN5IL2ABUOHV/action/replication_record"}},"created_at":"2026-07-05T02:14:02.219365+00:00","updated_at":"2026-07-05T02:14:02.219365+00:00"}