{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4PQIZDUDYWILSFANGP5Y2MAITP","short_pith_number":"pith:4PQIZDUD","schema_version":"1.0","canonical_sha256":"e3e08c8e83c590b9140d33fb8d30089bfd90b8ecf6265ac53b2c549fded63764","source":{"kind":"arxiv","id":"2105.07264","version":2},"attestation_state":"computed","paper":{"title":"Neural Trees for Learning on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.RO"],"primary_cat":"cs.LG","authors_text":"Lisa Peng, Luca Carlone, Rajat Talak, Siyi Hu","submitted_at":"2021-05-15T17:08:20Z","abstract_excerpt":"Graph Neural Networks (GNNs) have emerged as a flexible and powerful approach for learning over graphs. Despite this success, existing GNNs are constrained by their local message-passing architecture and are provably limited in their expressive power. In this work, we propose a new GNN architecture -- the Neural Tree. The neural tree architecture does not perform message passing on the input graph, but on a tree-structured graph, called the H-tree, that is constructed from the input graph. Nodes in the H-tree correspond to subgraphs in the input graph, and they are reorganized in a hierarchica"},"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":"2105.07264","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-15T17:08:20Z","cross_cats_sorted":["cs.CV","cs.RO"],"title_canon_sha256":"d612965f140989dd69c561749cb9c4e05e812a511c34c2aeb36b1b262f3476a9","abstract_canon_sha256":"607d31bbd05d95e007c08de85d47a5d0973c81151306568a2f8c4e76216cd0df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:41.054041Z","signature_b64":"ocG5YSF3Zgvp7HkIvgPFxtX0MC7JduoTGJpaZ8qcCCX1bFBdwWxq8/NC6nS1NaBr3p+LIKVRIfA9N3bS/SeHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3e08c8e83c590b9140d33fb8d30089bfd90b8ecf6265ac53b2c549fded63764","last_reissued_at":"2026-07-05T03:26:41.053495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:41.053495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Trees for Learning on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.RO"],"primary_cat":"cs.LG","authors_text":"Lisa Peng, Luca Carlone, Rajat Talak, Siyi Hu","submitted_at":"2021-05-15T17:08:20Z","abstract_excerpt":"Graph Neural Networks (GNNs) have emerged as a flexible and powerful approach for learning over graphs. Despite this success, existing GNNs are constrained by their local message-passing architecture and are provably limited in their expressive power. In this work, we propose a new GNN architecture -- the Neural Tree. The neural tree architecture does not perform message passing on the input graph, but on a tree-structured graph, called the H-tree, that is constructed from the input graph. Nodes in the H-tree correspond to subgraphs in the input graph, and they are reorganized in a hierarchica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.07264","kind":"arxiv","version":2},"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/2105.07264/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":"2105.07264","created_at":"2026-07-05T03:26:41.053558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.07264v2","created_at":"2026-07-05T03:26:41.053558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.07264","created_at":"2026-07-05T03:26:41.053558+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PQIZDUDYWIL","created_at":"2026-07-05T03:26:41.053558+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PQIZDUDYWILSFAN","created_at":"2026-07-05T03:26:41.053558+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PQIZDUD","created_at":"2026-07-05T03:26:41.053558+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/4PQIZDUDYWILSFANGP5Y2MAITP","json":"https://pith.science/pith/4PQIZDUDYWILSFANGP5Y2MAITP.json","graph_json":"https://pith.science/api/pith-number/4PQIZDUDYWILSFANGP5Y2MAITP/graph.json","events_json":"https://pith.science/api/pith-number/4PQIZDUDYWILSFANGP5Y2MAITP/events.json","paper":"https://pith.science/paper/4PQIZDUD"},"agent_actions":{"view_html":"https://pith.science/pith/4PQIZDUDYWILSFANGP5Y2MAITP","download_json":"https://pith.science/pith/4PQIZDUDYWILSFANGP5Y2MAITP.json","view_paper":"https://pith.science/paper/4PQIZDUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.07264&json=true","fetch_graph":"https://pith.science/api/pith-number/4PQIZDUDYWILSFANGP5Y2MAITP/graph.json","fetch_events":"https://pith.science/api/pith-number/4PQIZDUDYWILSFANGP5Y2MAITP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PQIZDUDYWILSFANGP5Y2MAITP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PQIZDUDYWILSFANGP5Y2MAITP/action/storage_attestation","attest_author":"https://pith.science/pith/4PQIZDUDYWILSFANGP5Y2MAITP/action/author_attestation","sign_citation":"https://pith.science/pith/4PQIZDUDYWILSFANGP5Y2MAITP/action/citation_signature","submit_replication":"https://pith.science/pith/4PQIZDUDYWILSFANGP5Y2MAITP/action/replication_record"}},"created_at":"2026-07-05T03:26:41.053558+00:00","updated_at":"2026-07-05T03:26:41.053558+00:00"}