{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SMYXFXYLWKBNSWBQXVSS6VYYVN","short_pith_number":"pith:SMYXFXYL","schema_version":"1.0","canonical_sha256":"933172df0bb282d95830bd652f5718ab6410785dfa82effcabdb81233cdb5e2d","source":{"kind":"arxiv","id":"2009.02535","version":3},"attestation_state":"computed","paper":{"title":"A Class of Optimal Structures for Node Computations in Message Passing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Kui Cai, Liang Zhou, Xuan He","submitted_at":"2020-09-05T13:52:01Z","abstract_excerpt":"Consider the computations at a node in a message passing algorithm. Assume that the node has incoming and outgoing messages $\\mathbf{x} = (x_1, x_2, \\ldots, x_n)$ and $\\mathbf{y} = (y_1, y_2, \\ldots, y_n)$, respectively. In this paper, we investigate a class of structures that can be adopted by the node for computing $\\mathbf{y}$ from $\\mathbf{x}$, where each $y_j, j = 1, 2, \\ldots, n$ is computed via a binary tree with leaves $\\mathbf{x}$ excluding $x_j$. We make three main contributions regarding this class of structures. First, we prove that the minimum complexity of such a structure is $3n"},"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":"2009.02535","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-05T13:52:01Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"ec8c6660b290878d1a15f079225f732eb376cb161bec5640a5db983c4f864227","abstract_canon_sha256":"81bac392ed6a1349439981791af3e4ff5f9fa9c6037a84b13155f7e6763cb718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:06.333077Z","signature_b64":"7eULnvcn5zYKPlZ1XKCxqs126Y/+TDG50zgWfekmLgbEpTpBXVuvWc5iQ1+kp4yyIe5O8t2faDgMcyQiKTNMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"933172df0bb282d95830bd652f5718ab6410785dfa82effcabdb81233cdb5e2d","last_reissued_at":"2026-07-05T03:21:06.332599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:06.332599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Class of Optimal Structures for Node Computations in Message Passing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Kui Cai, Liang Zhou, Xuan He","submitted_at":"2020-09-05T13:52:01Z","abstract_excerpt":"Consider the computations at a node in a message passing algorithm. Assume that the node has incoming and outgoing messages $\\mathbf{x} = (x_1, x_2, \\ldots, x_n)$ and $\\mathbf{y} = (y_1, y_2, \\ldots, y_n)$, respectively. In this paper, we investigate a class of structures that can be adopted by the node for computing $\\mathbf{y}$ from $\\mathbf{x}$, where each $y_j, j = 1, 2, \\ldots, n$ is computed via a binary tree with leaves $\\mathbf{x}$ excluding $x_j$. We make three main contributions regarding this class of structures. First, we prove that the minimum complexity of such a structure is $3n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.02535","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/2009.02535/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":"2009.02535","created_at":"2026-07-05T03:21:06.332659+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.02535v3","created_at":"2026-07-05T03:21:06.332659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.02535","created_at":"2026-07-05T03:21:06.332659+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMYXFXYLWKBN","created_at":"2026-07-05T03:21:06.332659+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMYXFXYLWKBNSWBQ","created_at":"2026-07-05T03:21:06.332659+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMYXFXYL","created_at":"2026-07-05T03:21:06.332659+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/SMYXFXYLWKBNSWBQXVSS6VYYVN","json":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN.json","graph_json":"https://pith.science/api/pith-number/SMYXFXYLWKBNSWBQXVSS6VYYVN/graph.json","events_json":"https://pith.science/api/pith-number/SMYXFXYLWKBNSWBQXVSS6VYYVN/events.json","paper":"https://pith.science/paper/SMYXFXYL"},"agent_actions":{"view_html":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN","download_json":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN.json","view_paper":"https://pith.science/paper/SMYXFXYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.02535&json=true","fetch_graph":"https://pith.science/api/pith-number/SMYXFXYLWKBNSWBQXVSS6VYYVN/graph.json","fetch_events":"https://pith.science/api/pith-number/SMYXFXYLWKBNSWBQXVSS6VYYVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/action/storage_attestation","attest_author":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/action/author_attestation","sign_citation":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/action/citation_signature","submit_replication":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/action/replication_record"}},"created_at":"2026-07-05T03:21:06.332659+00:00","updated_at":"2026-07-05T03:21:06.332659+00:00"}