{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QS2ZA6KNQWPZW4P25ZLFN2NI2Q","short_pith_number":"pith:QS2ZA6KN","schema_version":"1.0","canonical_sha256":"84b590794d859f9b71faee5656e9a8d420e837da622ad7b676dcb9dd0a59791a","source":{"kind":"arxiv","id":"1509.04538","version":1},"attestation_state":"computed","paper":{"title":"Decentralized gradient algorithm for solution of a linear equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SY","authors_text":"A. Stephen Morse, Brian D. O. Anderson, Shaoshuai Mou, Uwe Helmke","submitted_at":"2015-09-15T13:24:57Z","abstract_excerpt":"The paper develops a technique for solving a linear equation $Ax=b$ with a square and nonsingular matrix $A$, using a decentralized gradient algorithm. In the language of control theory, there are $n$ agents, each storing at time $t$ an $n$-vector, call it $x_i(t)$, and a graphical structure associating with each agent a vertex of a fixed, undirected and connected but otherwise arbitrary graph $\\mathcal G$ with vertex set and edge set $\\mathcal V$ and $\\mathcal E$ respectively. We provide differential equation update laws for the $x_i$ with the property that each $x_i$ converges to the solutio"},"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":"1509.04538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-15T13:24:57Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"528f9ef703a212aa74159e0d6c3d7214c21e1d281808b7d94153f22e5958656c","abstract_canon_sha256":"34a1c15af3ec56b1f794b8e59d9e25780842cff85f6b113c99bbd0103bdab88f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:58.622521Z","signature_b64":"G+qn14dl13+z3Z5R+IriiSidAEBUVzjeieEILWj2U43At6qksXzcbKSaOecz2sy7jkH1zvwT/zYzlroGhEMTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84b590794d859f9b71faee5656e9a8d420e837da622ad7b676dcb9dd0a59791a","last_reissued_at":"2026-05-18T01:32:58.621794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:58.621794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized gradient algorithm for solution of a linear equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SY","authors_text":"A. Stephen Morse, Brian D. O. Anderson, Shaoshuai Mou, Uwe Helmke","submitted_at":"2015-09-15T13:24:57Z","abstract_excerpt":"The paper develops a technique for solving a linear equation $Ax=b$ with a square and nonsingular matrix $A$, using a decentralized gradient algorithm. In the language of control theory, there are $n$ agents, each storing at time $t$ an $n$-vector, call it $x_i(t)$, and a graphical structure associating with each agent a vertex of a fixed, undirected and connected but otherwise arbitrary graph $\\mathcal G$ with vertex set and edge set $\\mathcal V$ and $\\mathcal E$ respectively. We provide differential equation update laws for the $x_i$ with the property that each $x_i$ converges to the solutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04538","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":"1509.04538","created_at":"2026-05-18T01:32:58.621921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04538v1","created_at":"2026-05-18T01:32:58.621921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04538","created_at":"2026-05-18T01:32:58.621921+00:00"},{"alias_kind":"pith_short_12","alias_value":"QS2ZA6KNQWPZ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QS2ZA6KNQWPZW4P2","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QS2ZA6KN","created_at":"2026-05-18T12:29:37.295048+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/QS2ZA6KNQWPZW4P25ZLFN2NI2Q","json":"https://pith.science/pith/QS2ZA6KNQWPZW4P25ZLFN2NI2Q.json","graph_json":"https://pith.science/api/pith-number/QS2ZA6KNQWPZW4P25ZLFN2NI2Q/graph.json","events_json":"https://pith.science/api/pith-number/QS2ZA6KNQWPZW4P25ZLFN2NI2Q/events.json","paper":"https://pith.science/paper/QS2ZA6KN"},"agent_actions":{"view_html":"https://pith.science/pith/QS2ZA6KNQWPZW4P25ZLFN2NI2Q","download_json":"https://pith.science/pith/QS2ZA6KNQWPZW4P25ZLFN2NI2Q.json","view_paper":"https://pith.science/paper/QS2ZA6KN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04538&json=true","fetch_graph":"https://pith.science/api/pith-number/QS2ZA6KNQWPZW4P25ZLFN2NI2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/QS2ZA6KNQWPZW4P25ZLFN2NI2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QS2ZA6KNQWPZW4P25ZLFN2NI2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QS2ZA6KNQWPZW4P25ZLFN2NI2Q/action/storage_attestation","attest_author":"https://pith.science/pith/QS2ZA6KNQWPZW4P25ZLFN2NI2Q/action/author_attestation","sign_citation":"https://pith.science/pith/QS2ZA6KNQWPZW4P25ZLFN2NI2Q/action/citation_signature","submit_replication":"https://pith.science/pith/QS2ZA6KNQWPZW4P25ZLFN2NI2Q/action/replication_record"}},"created_at":"2026-05-18T01:32:58.621921+00:00","updated_at":"2026-05-18T01:32:58.621921+00:00"}