{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7GGFLMRQGUNDMF4PODRAOD6QFE","short_pith_number":"pith:7GGFLMRQ","schema_version":"1.0","canonical_sha256":"f98c55b230351a36178f70e2070fd0290e604330e6b193fc5feeee6a2ac6a056","source":{"kind":"arxiv","id":"1212.0171","version":1},"attestation_state":"computed","paper":{"title":"Message-Passing Algorithms for Quadratic Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Nicholas Ruozzi, Sekhar Tatikonda","submitted_at":"2012-12-02T00:34:04Z","abstract_excerpt":"Gaussian belief propagation (GaBP) is an iterative algorithm for computing the mean of a multivariate Gaussian distribution, or equivalently, the minimum of a multivariate positive definite quadratic function. Sufficient conditions, such as walk-summability, that guarantee the convergence and correctness of GaBP are known, but GaBP may fail to converge to the correct solution given an arbitrary positive definite quadratic function. As was observed in previous work, the GaBP algorithm fails to converge if the computation trees produced by the algorithm are not positive definite. In this work, w"},"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":"1212.0171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-02T00:34:04Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"ed82f2edaff9bef70f20acf5ce95b49fb7cba26d4ac5ac7df0e5c19d5ec454ad","abstract_canon_sha256":"f8a65cb7402035217196c1eb134e3070133a01b515772329a29396e06dd7fbef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:21.210060Z","signature_b64":"0zTQh6YJGnNbm9E2YrvZZn+OZqW1uG/hizPWpwYto4OIxDxqhoizJ8EIl0HapQsNQr1lIfbeFLzX6/UvWWZODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f98c55b230351a36178f70e2070fd0290e604330e6b193fc5feeee6a2ac6a056","last_reissued_at":"2026-05-18T03:03:21.209549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:21.209549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message-Passing Algorithms for Quadratic Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Nicholas Ruozzi, Sekhar Tatikonda","submitted_at":"2012-12-02T00:34:04Z","abstract_excerpt":"Gaussian belief propagation (GaBP) is an iterative algorithm for computing the mean of a multivariate Gaussian distribution, or equivalently, the minimum of a multivariate positive definite quadratic function. Sufficient conditions, such as walk-summability, that guarantee the convergence and correctness of GaBP are known, but GaBP may fail to converge to the correct solution given an arbitrary positive definite quadratic function. As was observed in previous work, the GaBP algorithm fails to converge if the computation trees produced by the algorithm are not positive definite. In this work, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0171","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":"1212.0171","created_at":"2026-05-18T03:03:21.209628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0171v1","created_at":"2026-05-18T03:03:21.209628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0171","created_at":"2026-05-18T03:03:21.209628+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GGFLMRQGUND","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GGFLMRQGUNDMF4P","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GGFLMRQ","created_at":"2026-05-18T12:26:56.085431+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/7GGFLMRQGUNDMF4PODRAOD6QFE","json":"https://pith.science/pith/7GGFLMRQGUNDMF4PODRAOD6QFE.json","graph_json":"https://pith.science/api/pith-number/7GGFLMRQGUNDMF4PODRAOD6QFE/graph.json","events_json":"https://pith.science/api/pith-number/7GGFLMRQGUNDMF4PODRAOD6QFE/events.json","paper":"https://pith.science/paper/7GGFLMRQ"},"agent_actions":{"view_html":"https://pith.science/pith/7GGFLMRQGUNDMF4PODRAOD6QFE","download_json":"https://pith.science/pith/7GGFLMRQGUNDMF4PODRAOD6QFE.json","view_paper":"https://pith.science/paper/7GGFLMRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0171&json=true","fetch_graph":"https://pith.science/api/pith-number/7GGFLMRQGUNDMF4PODRAOD6QFE/graph.json","fetch_events":"https://pith.science/api/pith-number/7GGFLMRQGUNDMF4PODRAOD6QFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GGFLMRQGUNDMF4PODRAOD6QFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GGFLMRQGUNDMF4PODRAOD6QFE/action/storage_attestation","attest_author":"https://pith.science/pith/7GGFLMRQGUNDMF4PODRAOD6QFE/action/author_attestation","sign_citation":"https://pith.science/pith/7GGFLMRQGUNDMF4PODRAOD6QFE/action/citation_signature","submit_replication":"https://pith.science/pith/7GGFLMRQGUNDMF4PODRAOD6QFE/action/replication_record"}},"created_at":"2026-05-18T03:03:21.209628+00:00","updated_at":"2026-05-18T03:03:21.209628+00:00"}