{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:K2KZHSPJHTRGYM43PKA5R6O6XT","short_pith_number":"pith:K2KZHSPJ","schema_version":"1.0","canonical_sha256":"569593c9e93ce26c339b7a81d8f9debcc21cb1b7586d399fb82065c909ab25be","source":{"kind":"arxiv","id":"2312.16560","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreaching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Federico Errica, Francesco Alesiani, Henrik Christiansen, Mathias Niepert, Takashi Maruyama, Viktor Zaverkin","submitted_at":"2023-12-27T12:49:27Z","abstract_excerpt":"Long-range interactions are essential for the correct description of complex systems in many scientific fields. The price to pay for including them in the calculations, however, is a dramatic increase in the overall computational costs. Recently, deep graph networks have been employed as efficient, data-driven models for predicting properties of complex systems represented as graphs. These models rely on a message passing strategy that should, in principle, capture long-range information without explicitly modeling the corresponding interactions. In practice, most deep graph networks cannot re"},"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":"2312.16560","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-12-27T12:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"738036247af82305223ddded429ac3053348843a18b848a6e2977388d386f55c","abstract_canon_sha256":"cb2c3c3559aaa1a64a83ae4bebf9606f0fb6f1857881c6b3e664cfa394369874"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:22.811508Z","signature_b64":"axE83UuKsGqc3nVnNvzMf7HYwtVym74roWKTQut/VcQGZl4GFSZCiB7V+tK1joDh7aOHkz6WX5gFc0mkps+5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"569593c9e93ce26c339b7a81d8f9debcc21cb1b7586d399fb82065c909ab25be","last_reissued_at":"2026-07-05T11:01:22.810985Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:22.810985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreaching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Federico Errica, Francesco Alesiani, Henrik Christiansen, Mathias Niepert, Takashi Maruyama, Viktor Zaverkin","submitted_at":"2023-12-27T12:49:27Z","abstract_excerpt":"Long-range interactions are essential for the correct description of complex systems in many scientific fields. The price to pay for including them in the calculations, however, is a dramatic increase in the overall computational costs. Recently, deep graph networks have been employed as efficient, data-driven models for predicting properties of complex systems represented as graphs. These models rely on a message passing strategy that should, in principle, capture long-range information without explicitly modeling the corresponding interactions. In practice, most deep graph networks cannot re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16560","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/2312.16560/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":"2312.16560","created_at":"2026-07-05T11:01:22.811045+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.16560v3","created_at":"2026-07-05T11:01:22.811045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16560","created_at":"2026-07-05T11:01:22.811045+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2KZHSPJHTRG","created_at":"2026-07-05T11:01:22.811045+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2KZHSPJHTRGYM43","created_at":"2026-07-05T11:01:22.811045+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2KZHSPJ","created_at":"2026-07-05T11:01:22.811045+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03068","citing_title":"Learn When and Where to Connect: Adaptive Virtual Nodes for Dynamic Message Passing on Graphs","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K2KZHSPJHTRGYM43PKA5R6O6XT","json":"https://pith.science/pith/K2KZHSPJHTRGYM43PKA5R6O6XT.json","graph_json":"https://pith.science/api/pith-number/K2KZHSPJHTRGYM43PKA5R6O6XT/graph.json","events_json":"https://pith.science/api/pith-number/K2KZHSPJHTRGYM43PKA5R6O6XT/events.json","paper":"https://pith.science/paper/K2KZHSPJ"},"agent_actions":{"view_html":"https://pith.science/pith/K2KZHSPJHTRGYM43PKA5R6O6XT","download_json":"https://pith.science/pith/K2KZHSPJHTRGYM43PKA5R6O6XT.json","view_paper":"https://pith.science/paper/K2KZHSPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.16560&json=true","fetch_graph":"https://pith.science/api/pith-number/K2KZHSPJHTRGYM43PKA5R6O6XT/graph.json","fetch_events":"https://pith.science/api/pith-number/K2KZHSPJHTRGYM43PKA5R6O6XT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2KZHSPJHTRGYM43PKA5R6O6XT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2KZHSPJHTRGYM43PKA5R6O6XT/action/storage_attestation","attest_author":"https://pith.science/pith/K2KZHSPJHTRGYM43PKA5R6O6XT/action/author_attestation","sign_citation":"https://pith.science/pith/K2KZHSPJHTRGYM43PKA5R6O6XT/action/citation_signature","submit_replication":"https://pith.science/pith/K2KZHSPJHTRGYM43PKA5R6O6XT/action/replication_record"}},"created_at":"2026-07-05T11:01:22.811045+00:00","updated_at":"2026-07-05T11:01:22.811045+00:00"}