{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:B4CI7JK3ILIDPKPKMPSDBNPGIU","short_pith_number":"pith:B4CI7JK3","schema_version":"1.0","canonical_sha256":"0f048fa55b42d037a9ea63e430b5e6451aa456719762f28a2152a0a4481ffa3c","source":{"kind":"arxiv","id":"0811.2518","version":3},"attestation_state":"computed","paper":{"title":"Gaussian Belief Propagation: Theory and Aplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Danny Bickson","submitted_at":"2008-11-15T18:37:36Z","abstract_excerpt":"The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we develop a solution based upon Gaussian belief propagation (GaBP) that does not involve direct matrix inversion. The iterative nature of our approach allows for a distributed message-passing implementation of the solution algorithm. In the first part of this thesis, we address the properties of the GaBP solver. We characterize the rate of convergence, enhance its message-passing efficiency by introducing a broadcast v"},"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":"0811.2518","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-11-15T18:37:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6d5f75d80449b84d103c46533985713089b664e1b083296018dc8b6f5b7637ee","abstract_canon_sha256":"72dc7671aff3c239cc780bdf33da093a65dd34bb0e29e3f7bb388595d74f6690"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:45:57.385054Z","signature_b64":"HHNdGz6IE862j61nHmfKXaimTNymVAXciXQXNev2bgnyoXCswwRYw2YvsP6n4tzQWdFQ6ukJMK4/n012QPYpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f048fa55b42d037a9ea63e430b5e6451aa456719762f28a2152a0a4481ffa3c","last_reissued_at":"2026-07-04T15:45:57.384700Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:45:57.384700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian Belief Propagation: Theory and Aplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Danny Bickson","submitted_at":"2008-11-15T18:37:36Z","abstract_excerpt":"The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we develop a solution based upon Gaussian belief propagation (GaBP) that does not involve direct matrix inversion. The iterative nature of our approach allows for a distributed message-passing implementation of the solution algorithm. In the first part of this thesis, we address the properties of the GaBP solver. We characterize the rate of convergence, enhance its message-passing efficiency by introducing a broadcast v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2518","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0811.2518/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0811.2518","created_at":"2026-07-04T15:45:57.384762+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.2518v3","created_at":"2026-07-04T15:45:57.384762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2518","created_at":"2026-07-04T15:45:57.384762+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4CI7JK3ILID","created_at":"2026-07-04T15:45:57.384762+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4CI7JK3ILIDPKPK","created_at":"2026-07-04T15:45:57.384762+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4CI7JK3","created_at":"2026-07-04T15:45:57.384762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.06250","citing_title":"Breaking Time: A Fully Gaussian Framework for Distributed and Continuous-Time SLAM","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B4CI7JK3ILIDPKPKMPSDBNPGIU","json":"https://pith.science/pith/B4CI7JK3ILIDPKPKMPSDBNPGIU.json","graph_json":"https://pith.science/api/pith-number/B4CI7JK3ILIDPKPKMPSDBNPGIU/graph.json","events_json":"https://pith.science/api/pith-number/B4CI7JK3ILIDPKPKMPSDBNPGIU/events.json","paper":"https://pith.science/paper/B4CI7JK3"},"agent_actions":{"view_html":"https://pith.science/pith/B4CI7JK3ILIDPKPKMPSDBNPGIU","download_json":"https://pith.science/pith/B4CI7JK3ILIDPKPKMPSDBNPGIU.json","view_paper":"https://pith.science/paper/B4CI7JK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.2518&json=true","fetch_graph":"https://pith.science/api/pith-number/B4CI7JK3ILIDPKPKMPSDBNPGIU/graph.json","fetch_events":"https://pith.science/api/pith-number/B4CI7JK3ILIDPKPKMPSDBNPGIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4CI7JK3ILIDPKPKMPSDBNPGIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4CI7JK3ILIDPKPKMPSDBNPGIU/action/storage_attestation","attest_author":"https://pith.science/pith/B4CI7JK3ILIDPKPKMPSDBNPGIU/action/author_attestation","sign_citation":"https://pith.science/pith/B4CI7JK3ILIDPKPKMPSDBNPGIU/action/citation_signature","submit_replication":"https://pith.science/pith/B4CI7JK3ILIDPKPKMPSDBNPGIU/action/replication_record"}},"created_at":"2026-07-04T15:45:57.384762+00:00","updated_at":"2026-07-04T15:45:57.384762+00:00"}