{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:77APN6VCYBB3RPYGGQYMHQJOSP","short_pith_number":"pith:77APN6VC","schema_version":"1.0","canonical_sha256":"ffc0f6faa2c043b8bf063430c3c12e93ef4ec8f2a3be9a0bd4c32110eafcd6b7","source":{"kind":"arxiv","id":"1701.00554","version":2},"attestation_state":"computed","paper":{"title":"Exponential Convergence of a Distributed Algorithm for Solving Linear Algebraic Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedich, A. Stephen Morse, Ji Liu, Tamer Basar","submitted_at":"2017-01-02T23:36:16Z","abstract_excerpt":"In a recent paper, a distributed algorithm was proposed for solving linear algebraic equations of the form $Ax = b$ assuming that the equation has at least one solution. The equation is presumed to be solved by $m$ agents assuming that each agent knows a subset of the rows of the matrix $[A \\; b]$, the current estimates of the equation's solution generated by each of its neighbors, and nothing more. Neighbor relationships are represented by a time-dependent directed graph $N(t)$ whose vertices correspond to agents and whose arcs characterize neighbor relationships. Sufficient conditions on $N("},"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":"1701.00554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-02T23:36:16Z","cross_cats_sorted":[],"title_canon_sha256":"f667d02975bb21e3d26180f75ab0423a496f1a7c91b5787d07f046bebc5c9064","abstract_canon_sha256":"0695e6e6045ef7172794de3e39a57688656682749a883c07eb1981bb02de4c43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:20.368003Z","signature_b64":"ResOH6jUgfLx4HV2WH/c67spZZlGnz4iTy+Rd0mLfSYLzNs29iyvJgydxMPrZyckxVPquwQfHBxyQc88BgShAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffc0f6faa2c043b8bf063430c3c12e93ef4ec8f2a3be9a0bd4c32110eafcd6b7","last_reissued_at":"2026-05-18T00:53:20.367609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:20.367609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Convergence of a Distributed Algorithm for Solving Linear Algebraic Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedich, A. Stephen Morse, Ji Liu, Tamer Basar","submitted_at":"2017-01-02T23:36:16Z","abstract_excerpt":"In a recent paper, a distributed algorithm was proposed for solving linear algebraic equations of the form $Ax = b$ assuming that the equation has at least one solution. The equation is presumed to be solved by $m$ agents assuming that each agent knows a subset of the rows of the matrix $[A \\; b]$, the current estimates of the equation's solution generated by each of its neighbors, and nothing more. Neighbor relationships are represented by a time-dependent directed graph $N(t)$ whose vertices correspond to agents and whose arcs characterize neighbor relationships. Sufficient conditions on $N("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00554","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":"1701.00554","created_at":"2026-05-18T00:53:20.367670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00554v2","created_at":"2026-05-18T00:53:20.367670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00554","created_at":"2026-05-18T00:53:20.367670+00:00"},{"alias_kind":"pith_short_12","alias_value":"77APN6VCYBB3","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"77APN6VCYBB3RPYG","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"77APN6VC","created_at":"2026-05-18T12:31:03.183658+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/77APN6VCYBB3RPYGGQYMHQJOSP","json":"https://pith.science/pith/77APN6VCYBB3RPYGGQYMHQJOSP.json","graph_json":"https://pith.science/api/pith-number/77APN6VCYBB3RPYGGQYMHQJOSP/graph.json","events_json":"https://pith.science/api/pith-number/77APN6VCYBB3RPYGGQYMHQJOSP/events.json","paper":"https://pith.science/paper/77APN6VC"},"agent_actions":{"view_html":"https://pith.science/pith/77APN6VCYBB3RPYGGQYMHQJOSP","download_json":"https://pith.science/pith/77APN6VCYBB3RPYGGQYMHQJOSP.json","view_paper":"https://pith.science/paper/77APN6VC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00554&json=true","fetch_graph":"https://pith.science/api/pith-number/77APN6VCYBB3RPYGGQYMHQJOSP/graph.json","fetch_events":"https://pith.science/api/pith-number/77APN6VCYBB3RPYGGQYMHQJOSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77APN6VCYBB3RPYGGQYMHQJOSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77APN6VCYBB3RPYGGQYMHQJOSP/action/storage_attestation","attest_author":"https://pith.science/pith/77APN6VCYBB3RPYGGQYMHQJOSP/action/author_attestation","sign_citation":"https://pith.science/pith/77APN6VCYBB3RPYGGQYMHQJOSP/action/citation_signature","submit_replication":"https://pith.science/pith/77APN6VCYBB3RPYGGQYMHQJOSP/action/replication_record"}},"created_at":"2026-05-18T00:53:20.367670+00:00","updated_at":"2026-05-18T00:53:20.367670+00:00"}