{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G4MNI2NR5VLN7SBEPVKAF2YOW3","short_pith_number":"pith:G4MNI2NR","schema_version":"1.0","canonical_sha256":"3718d469b1ed56dfc8247d5402eb0eb6def6f527ea1b22ba151f3170f60b82c8","source":{"kind":"arxiv","id":"1409.7140","version":1},"attestation_state":"computed","paper":{"title":"Robust distributed linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dean Richert, Jorge Cortes","submitted_at":"2014-09-25T02:31:36Z","abstract_excerpt":"This paper presents a robust, distributed algorithm to solve general linear programs. The algorithm design builds on the characterization of the solutions of the linear program as saddle points of a modified Lagrangian function. We show that the resulting continuous-time saddle-point algorithm is provably correct but, in general, not distributed because of a global parameter associated with the nonsmooth exact penalty function employed to encode the inequality constraints of the linear program. This motivates the design of a discontinuous saddle-point dynamics that, while enjoying the same con"},"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":"1409.7140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-25T02:31:36Z","cross_cats_sorted":[],"title_canon_sha256":"bd61ed71b0cafbbb289b09eabd11c925d593d5563cd988acd5592379f92d7159","abstract_canon_sha256":"96aea87bf0947f7dbf8619af16c270056f55931786dce398fa123d3090156c26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:59.062689Z","signature_b64":"yTsmRGVy9R3m4xVx2BJEARuyYqZf1FI9IC9qfhONhMS18jReQFWRIf2NG3ZLbVbNXJfYxXaa7D4OCkVTxrKyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3718d469b1ed56dfc8247d5402eb0eb6def6f527ea1b22ba151f3170f60b82c8","last_reissued_at":"2026-05-18T02:41:59.062127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:59.062127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust distributed linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dean Richert, Jorge Cortes","submitted_at":"2014-09-25T02:31:36Z","abstract_excerpt":"This paper presents a robust, distributed algorithm to solve general linear programs. The algorithm design builds on the characterization of the solutions of the linear program as saddle points of a modified Lagrangian function. We show that the resulting continuous-time saddle-point algorithm is provably correct but, in general, not distributed because of a global parameter associated with the nonsmooth exact penalty function employed to encode the inequality constraints of the linear program. This motivates the design of a discontinuous saddle-point dynamics that, while enjoying the same con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7140","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":""},"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":"1409.7140","created_at":"2026-05-18T02:41:59.062213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7140v1","created_at":"2026-05-18T02:41:59.062213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7140","created_at":"2026-05-18T02:41:59.062213+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4MNI2NR5VLN","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4MNI2NR5VLN7SBE","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4MNI2NR","created_at":"2026-05-18T12:28:28.263976+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/G4MNI2NR5VLN7SBEPVKAF2YOW3","json":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3.json","graph_json":"https://pith.science/api/pith-number/G4MNI2NR5VLN7SBEPVKAF2YOW3/graph.json","events_json":"https://pith.science/api/pith-number/G4MNI2NR5VLN7SBEPVKAF2YOW3/events.json","paper":"https://pith.science/paper/G4MNI2NR"},"agent_actions":{"view_html":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3","download_json":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3.json","view_paper":"https://pith.science/paper/G4MNI2NR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7140&json=true","fetch_graph":"https://pith.science/api/pith-number/G4MNI2NR5VLN7SBEPVKAF2YOW3/graph.json","fetch_events":"https://pith.science/api/pith-number/G4MNI2NR5VLN7SBEPVKAF2YOW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/action/storage_attestation","attest_author":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/action/author_attestation","sign_citation":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/action/citation_signature","submit_replication":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/action/replication_record"}},"created_at":"2026-05-18T02:41:59.062213+00:00","updated_at":"2026-05-18T02:41:59.062213+00:00"}