{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SMYXFXYLWKBNSWBQXVSS6VYYVN","short_pith_number":"pith:SMYXFXYL","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"},"canonical_sha256":"933172df0bb282d95830bd652f5718ab6410785dfa82effcabdb81233cdb5e2d","source":{"kind":"arxiv","id":"2009.02535","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.02535","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"arxiv_version","alias_value":"2009.02535v3","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.02535","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"pith_short_12","alias_value":"SMYXFXYLWKBN","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"pith_short_16","alias_value":"SMYXFXYLWKBNSWBQ","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"pith_short_8","alias_value":"SMYXFXYL","created_at":"2026-07-05T03:21:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SMYXFXYLWKBNSWBQXVSS6VYYVN","target":"record","payload":{"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"},"canonical_sha256":"933172df0bb282d95830bd652f5718ab6410785dfa82effcabdb81233cdb5e2d","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"},"source_kind":"arxiv","source_id":"2009.02535","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:21:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTUbAo52v19tAWGNO/oqB7zUSULp77W3VTmohmCO33kgRuB7MrxRlQExfkep0o2bkGNqZj+RSch3vORG2sZIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:47:14.869465Z"},"content_sha256":"d4c51d8c1e14b99c403341556dd5adda6f8831c2f0a10fff30760b1f65fa184a","schema_version":"1.0","event_id":"sha256:d4c51d8c1e14b99c403341556dd5adda6f8831c2f0a10fff30760b1f65fa184a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SMYXFXYLWKBNSWBQXVSS6VYYVN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:21:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03iG734JUfJXH0sz6s24sL57kBG1cjhTNFjV2gXM4nJanIHel6V6MND7FJrQjrWs4aijvFfvj2FKLVamuS7pAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:47:14.869834Z"},"content_sha256":"cd2948f3f3ec7e2f57e50a97a9d43c22f048bfca18d2c35b81f405416d3e0559","schema_version":"1.0","event_id":"sha256:cd2948f3f3ec7e2f57e50a97a9d43c22f048bfca18d2c35b81f405416d3e0559"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/bundle.json","state_url":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T08:47:14Z","links":{"resolver":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN","bundle":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/bundle.json","state":"https://pith.science/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMYXFXYLWKBNSWBQXVSS6VYYVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SMYXFXYLWKBNSWBQXVSS6VYYVN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"81bac392ed6a1349439981791af3e4ff5f9fa9c6037a84b13155f7e6763cb718","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-05T13:52:01Z","title_canon_sha256":"ec8c6660b290878d1a15f079225f732eb376cb161bec5640a5db983c4f864227"},"schema_version":"1.0","source":{"id":"2009.02535","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.02535","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"arxiv_version","alias_value":"2009.02535v3","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.02535","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"pith_short_12","alias_value":"SMYXFXYLWKBN","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"pith_short_16","alias_value":"SMYXFXYLWKBNSWBQ","created_at":"2026-07-05T03:21:06Z"},{"alias_kind":"pith_short_8","alias_value":"SMYXFXYL","created_at":"2026-07-05T03:21:06Z"}],"graph_snapshots":[{"event_id":"sha256:cd2948f3f3ec7e2f57e50a97a9d43c22f048bfca18d2c35b81f405416d3e0559","target":"graph","created_at":"2026-07-05T03:21:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.02535/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kui Cai, Liang Zhou, Xuan He","cross_cats":["cs.AR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-05T13:52:01Z","title":"A Class of Optimal Structures for Node Computations in Message Passing Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.02535","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d4c51d8c1e14b99c403341556dd5adda6f8831c2f0a10fff30760b1f65fa184a","target":"record","created_at":"2026-07-05T03:21:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"81bac392ed6a1349439981791af3e4ff5f9fa9c6037a84b13155f7e6763cb718","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-05T13:52:01Z","title_canon_sha256":"ec8c6660b290878d1a15f079225f732eb376cb161bec5640a5db983c4f864227"},"schema_version":"1.0","source":{"id":"2009.02535","kind":"arxiv","version":3}},"canonical_sha256":"933172df0bb282d95830bd652f5718ab6410785dfa82effcabdb81233cdb5e2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"933172df0bb282d95830bd652f5718ab6410785dfa82effcabdb81233cdb5e2d","first_computed_at":"2026-07-05T03:21:06.332599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:21:06.332599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7eULnvcn5zYKPlZ1XKCxqs126Y/+TDG50zgWfekmLgbEpTpBXVuvWc5iQ1+kp4yyIe5O8t2faDgMcyQiKTNMAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:21:06.333077Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.02535","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4c51d8c1e14b99c403341556dd5adda6f8831c2f0a10fff30760b1f65fa184a","sha256:cd2948f3f3ec7e2f57e50a97a9d43c22f048bfca18d2c35b81f405416d3e0559"],"state_sha256":"55b9d253e3350cd40d3b5ce94b7f9ad4f5284931d75c9b171248e48d229139bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quapLuSVz3AhcqnooU3uomv3bkrvWB+MRy3XyazoYhMg2z7MsHp/qJICZSbgCcctm43M/ij6XbbX/bwk5DmwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:47:14.871743Z","bundle_sha256":"894260387003d070e184eccae9aef81f2683b032e5e187657fbc5b9174003413"}}