{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:G4MNI2NR5VLN7SBEPVKAF2YOW3","short_pith_number":"pith:G4MNI2NR","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"},"canonical_sha256":"3718d469b1ed56dfc8247d5402eb0eb6def6f527ea1b22ba151f3170f60b82c8","source":{"kind":"arxiv","id":"1409.7140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7140","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7140v1","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7140","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"G4MNI2NR5VLN","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G4MNI2NR5VLN7SBE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G4MNI2NR","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:G4MNI2NR5VLN7SBEPVKAF2YOW3","target":"record","payload":{"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"},"canonical_sha256":"3718d469b1ed56dfc8247d5402eb0eb6def6f527ea1b22ba151f3170f60b82c8","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"},"source_kind":"arxiv","source_id":"1409.7140","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldzklou7KA/f3jLGqpOfqcoT6Czl1gmFu3kz4zXxUu10kNoh8IX3CJqbEYzTpO/ygBdqIKAamf4ObJttcjnHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:26:48.024887Z"},"content_sha256":"a2ef863252f0f63a228f3f4ccc56e340ffe26bfcb9396504e16d70597692cf16","schema_version":"1.0","event_id":"sha256:a2ef863252f0f63a228f3f4ccc56e340ffe26bfcb9396504e16d70597692cf16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:G4MNI2NR5VLN7SBEPVKAF2YOW3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ZmDqcjwYqJrXe55HDN4hBIcnBnARXj1DwPosyUw2RV6rVzcI/tFU0+HMiEts4XIwdttbXvf7NSvF6Bx9GL+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:26:48.025500Z"},"content_sha256":"e19105623bafc90234d79302dce60186b07fc5c6396365466d48a3e96e51e885","schema_version":"1.0","event_id":"sha256:e19105623bafc90234d79302dce60186b07fc5c6396365466d48a3e96e51e885"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/bundle.json","state_url":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T04:26:48Z","links":{"resolver":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3","bundle":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/bundle.json","state":"https://pith.science/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4MNI2NR5VLN7SBEPVKAF2YOW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G4MNI2NR5VLN7SBEPVKAF2YOW3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"96aea87bf0947f7dbf8619af16c270056f55931786dce398fa123d3090156c26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-25T02:31:36Z","title_canon_sha256":"bd61ed71b0cafbbb289b09eabd11c925d593d5563cd988acd5592379f92d7159"},"schema_version":"1.0","source":{"id":"1409.7140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7140","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7140v1","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7140","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"G4MNI2NR5VLN","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G4MNI2NR5VLN7SBE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G4MNI2NR","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:e19105623bafc90234d79302dce60186b07fc5c6396365466d48a3e96e51e885","target":"graph","created_at":"2026-05-18T02:41:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dean Richert, Jorge Cortes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-25T02:31:36Z","title":"Robust distributed linear programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7140","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a2ef863252f0f63a228f3f4ccc56e340ffe26bfcb9396504e16d70597692cf16","target":"record","created_at":"2026-05-18T02:41:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"96aea87bf0947f7dbf8619af16c270056f55931786dce398fa123d3090156c26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-25T02:31:36Z","title_canon_sha256":"bd61ed71b0cafbbb289b09eabd11c925d593d5563cd988acd5592379f92d7159"},"schema_version":"1.0","source":{"id":"1409.7140","kind":"arxiv","version":1}},"canonical_sha256":"3718d469b1ed56dfc8247d5402eb0eb6def6f527ea1b22ba151f3170f60b82c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3718d469b1ed56dfc8247d5402eb0eb6def6f527ea1b22ba151f3170f60b82c8","first_computed_at":"2026-05-18T02:41:59.062127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:59.062127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yTsmRGVy9R3m4xVx2BJEARuyYqZf1FI9IC9qfhONhMS18jReQFWRIf2NG3ZLbVbNXJfYxXaa7D4OCkVTxrKyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:59.062689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2ef863252f0f63a228f3f4ccc56e340ffe26bfcb9396504e16d70597692cf16","sha256:e19105623bafc90234d79302dce60186b07fc5c6396365466d48a3e96e51e885"],"state_sha256":"7db4280368f54b4d61b9e9db73957a8d17c57d6533881fc596034df862b15f1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnxkIfBO32sgb4g019+VtyI65f5ozKNUa3bqRsSfIYgHeAFptvcg8xpanCtGIrdILG7YwcK3oW9rJP4QF33dDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T04:26:48.028542Z","bundle_sha256":"9e61c228951ecbfc19d8ee3f078f7955342c9a53ff3a3ec5dff47da6107a3f65"}}