{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QLQWZDDO5UQT4QWQQBZWUKHOZC","short_pith_number":"pith:QLQWZDDO","schema_version":"1.0","canonical_sha256":"82e16c8c6eed213e42d080736a28eec8987230a99760adca32bd33a327a35156","source":{"kind":"arxiv","id":"2305.10391","version":3},"attestation_state":"computed","paper":{"title":"Optimality of Message-Passing Architectures for Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aseem Baranwal, Aukosh Jagannath, Kimon Fountoulakis","submitted_at":"2023-05-17T17:31:20Z","abstract_excerpt":"We study the node classification problem on feature-decorated graphs in the sparse setting, i.e., when the expected degree of a node is $O(1)$ in the number of nodes, in the fixed-dimensional asymptotic regime, i.e., the dimension of the feature data is fixed while the number of nodes is large. Such graphs are typically known to be locally tree-like. We introduce a notion of Bayes optimality for node classification tasks, called asymptotic local Bayes optimality, and compute the optimal classifier according to this criterion for a fairly general statistical data model with arbitrary distributi"},"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":"2305.10391","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-17T17:31:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a1811b69510cc7b8da1c0ae93ae52c5321767ec8f3f4f819890a2f54a5cb3de8","abstract_canon_sha256":"8bb311fd7894446360f4341615e128fffee4e26b092a26607127a4d57c88fbf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:39.673810Z","signature_b64":"0IdQ+BQ2rie7pGEGgVPubu3i2X9ATIRqsuOC9STDwlSENvEJ2MjHER3x7H9N5wH0i9Rc5l5lI6uIYDJxCeYjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82e16c8c6eed213e42d080736a28eec8987230a99760adca32bd33a327a35156","last_reissued_at":"2026-07-05T09:58:39.673358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:39.673358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimality of Message-Passing Architectures for Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aseem Baranwal, Aukosh Jagannath, Kimon Fountoulakis","submitted_at":"2023-05-17T17:31:20Z","abstract_excerpt":"We study the node classification problem on feature-decorated graphs in the sparse setting, i.e., when the expected degree of a node is $O(1)$ in the number of nodes, in the fixed-dimensional asymptotic regime, i.e., the dimension of the feature data is fixed while the number of nodes is large. Such graphs are typically known to be locally tree-like. We introduce a notion of Bayes optimality for node classification tasks, called asymptotic local Bayes optimality, and compute the optimal classifier according to this criterion for a fairly general statistical data model with arbitrary distributi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.10391","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/2305.10391/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":"2305.10391","created_at":"2026-07-05T09:58:39.673416+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.10391v3","created_at":"2026-07-05T09:58:39.673416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10391","created_at":"2026-07-05T09:58:39.673416+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLQWZDDO5UQT","created_at":"2026-07-05T09:58:39.673416+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLQWZDDO5UQT4QWQ","created_at":"2026-07-05T09:58:39.673416+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLQWZDDO","created_at":"2026-07-05T09:58:39.673416+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/QLQWZDDO5UQT4QWQQBZWUKHOZC","json":"https://pith.science/pith/QLQWZDDO5UQT4QWQQBZWUKHOZC.json","graph_json":"https://pith.science/api/pith-number/QLQWZDDO5UQT4QWQQBZWUKHOZC/graph.json","events_json":"https://pith.science/api/pith-number/QLQWZDDO5UQT4QWQQBZWUKHOZC/events.json","paper":"https://pith.science/paper/QLQWZDDO"},"agent_actions":{"view_html":"https://pith.science/pith/QLQWZDDO5UQT4QWQQBZWUKHOZC","download_json":"https://pith.science/pith/QLQWZDDO5UQT4QWQQBZWUKHOZC.json","view_paper":"https://pith.science/paper/QLQWZDDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.10391&json=true","fetch_graph":"https://pith.science/api/pith-number/QLQWZDDO5UQT4QWQQBZWUKHOZC/graph.json","fetch_events":"https://pith.science/api/pith-number/QLQWZDDO5UQT4QWQQBZWUKHOZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLQWZDDO5UQT4QWQQBZWUKHOZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLQWZDDO5UQT4QWQQBZWUKHOZC/action/storage_attestation","attest_author":"https://pith.science/pith/QLQWZDDO5UQT4QWQQBZWUKHOZC/action/author_attestation","sign_citation":"https://pith.science/pith/QLQWZDDO5UQT4QWQQBZWUKHOZC/action/citation_signature","submit_replication":"https://pith.science/pith/QLQWZDDO5UQT4QWQQBZWUKHOZC/action/replication_record"}},"created_at":"2026-07-05T09:58:39.673416+00:00","updated_at":"2026-07-05T09:58:39.673416+00:00"}