{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L2UDCMYHPNXV4VLGXBNA5RKLLB","short_pith_number":"pith:L2UDCMYH","schema_version":"1.0","canonical_sha256":"5ea83133077b6f5e5566b85a0ec54b584d9c67f48e0503b876cf3c9763fdde9a","source":{"kind":"arxiv","id":"1502.06784","version":2},"attestation_state":"computed","paper":{"title":"Asynchronous Algorithms for Solving Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tarek A. Lahlou, Thomas A. Baran","submitted_at":"2015-02-24T12:35:55Z","abstract_excerpt":"In this paper we design and analyze algorithms for asynchronously solving linear programs using nonlinear signal processing structures. In particular, we discuss a general procedure for generating these structures such that a fixed-point of the structure is within a change of basis the minimizer of an associated linear program. We discuss methods for organizing the computation into distributed implementations and provide a treatment of convergence. The presented algorithms are accompanied by numerical simulations of the Chebyshev center and basis pursuit problems."},"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":"1502.06784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-24T12:35:55Z","cross_cats_sorted":[],"title_canon_sha256":"21bbc76bb301b4379e0a102031a16a69162140e910bce3bd342a43c5f0ea5baf","abstract_canon_sha256":"adacfb36be113c0dcd76ebbb13b72b595f63e531ae9b2c7497ded58dea01d543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:55.428514Z","signature_b64":"1l0dCGDoXxCdYzGBbQDCbUYJQ7e3EzFvx8XEwmzK1wSVGp9tfhVgYAqxKxcFoTRNJbN3d1uCHN60vZMWJtLvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ea83133077b6f5e5566b85a0ec54b584d9c67f48e0503b876cf3c9763fdde9a","last_reissued_at":"2026-05-18T02:25:55.428052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:55.428052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Algorithms for Solving Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tarek A. Lahlou, Thomas A. Baran","submitted_at":"2015-02-24T12:35:55Z","abstract_excerpt":"In this paper we design and analyze algorithms for asynchronously solving linear programs using nonlinear signal processing structures. In particular, we discuss a general procedure for generating these structures such that a fixed-point of the structure is within a change of basis the minimizer of an associated linear program. We discuss methods for organizing the computation into distributed implementations and provide a treatment of convergence. The presented algorithms are accompanied by numerical simulations of the Chebyshev center and basis pursuit problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06784","kind":"arxiv","version":2},"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":"1502.06784","created_at":"2026-05-18T02:25:55.428136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06784v2","created_at":"2026-05-18T02:25:55.428136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06784","created_at":"2026-05-18T02:25:55.428136+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2UDCMYHPNXV","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2UDCMYHPNXV4VLG","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2UDCMYH","created_at":"2026-05-18T12:29:29.992203+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/L2UDCMYHPNXV4VLGXBNA5RKLLB","json":"https://pith.science/pith/L2UDCMYHPNXV4VLGXBNA5RKLLB.json","graph_json":"https://pith.science/api/pith-number/L2UDCMYHPNXV4VLGXBNA5RKLLB/graph.json","events_json":"https://pith.science/api/pith-number/L2UDCMYHPNXV4VLGXBNA5RKLLB/events.json","paper":"https://pith.science/paper/L2UDCMYH"},"agent_actions":{"view_html":"https://pith.science/pith/L2UDCMYHPNXV4VLGXBNA5RKLLB","download_json":"https://pith.science/pith/L2UDCMYHPNXV4VLGXBNA5RKLLB.json","view_paper":"https://pith.science/paper/L2UDCMYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06784&json=true","fetch_graph":"https://pith.science/api/pith-number/L2UDCMYHPNXV4VLGXBNA5RKLLB/graph.json","fetch_events":"https://pith.science/api/pith-number/L2UDCMYHPNXV4VLGXBNA5RKLLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2UDCMYHPNXV4VLGXBNA5RKLLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2UDCMYHPNXV4VLGXBNA5RKLLB/action/storage_attestation","attest_author":"https://pith.science/pith/L2UDCMYHPNXV4VLGXBNA5RKLLB/action/author_attestation","sign_citation":"https://pith.science/pith/L2UDCMYHPNXV4VLGXBNA5RKLLB/action/citation_signature","submit_replication":"https://pith.science/pith/L2UDCMYHPNXV4VLGXBNA5RKLLB/action/replication_record"}},"created_at":"2026-05-18T02:25:55.428136+00:00","updated_at":"2026-05-18T02:25:55.428136+00:00"}