{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7BFDQHY2SWMDSWO4YTFSLNOMQY","short_pith_number":"pith:7BFDQHY2","schema_version":"1.0","canonical_sha256":"f84a381f1a95983959dcc4cb25b5cc8639a8a81ce2cda3bed6dffaa5c6b0bebc","source":{"kind":"arxiv","id":"2111.14522","version":3},"attestation_state":"computed","paper":{"title":"Understanding over-squashing and bottlenecks on graphs via curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Benjamin Paul Chamberlain, Francesco Di Giovanni, Jake Topping, Michael M. Bronstein, Xiaowen Dong","submitted_at":"2021-11-29T13:27:56Z","abstract_excerpt":"Most graph neural networks (GNNs) use the message passing paradigm, in which node features are propagated on the input graph. Recent works pointed to the distortion of information flowing from distant nodes as a factor limiting the efficiency of message passing for tasks relying on long-distance interactions. This phenomenon, referred to as 'over-squashing', has been heuristically attributed to graph bottlenecks where the number of $k$-hop neighbors grows rapidly with $k$. We provide a precise description of the over-squashing phenomenon in GNNs and analyze how it arises from bottlenecks in th"},"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":"2111.14522","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-11-29T13:27:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b664b9cf547fcdf17e83f3ef098d49ae93496b637ebb48815917542ccebdc96e","abstract_canon_sha256":"46b678bdceabe32b3e37c8d38887689e4ac04a568fd885183df4473bd37b0556"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:15:22.522895Z","signature_b64":"AoNzdNPUQJTwKlYanRlLtTAD7Co52xbxCaioAQQX3jwx2Sj+KRoIq2tTM9BRFuoYjpe3oxeKO6jEpoZaJOA2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f84a381f1a95983959dcc4cb25b5cc8639a8a81ce2cda3bed6dffaa5c6b0bebc","last_reissued_at":"2026-07-05T05:15:22.522363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:15:22.522363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding over-squashing and bottlenecks on graphs via curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Benjamin Paul Chamberlain, Francesco Di Giovanni, Jake Topping, Michael M. Bronstein, Xiaowen Dong","submitted_at":"2021-11-29T13:27:56Z","abstract_excerpt":"Most graph neural networks (GNNs) use the message passing paradigm, in which node features are propagated on the input graph. Recent works pointed to the distortion of information flowing from distant nodes as a factor limiting the efficiency of message passing for tasks relying on long-distance interactions. This phenomenon, referred to as 'over-squashing', has been heuristically attributed to graph bottlenecks where the number of $k$-hop neighbors grows rapidly with $k$. We provide a precise description of the over-squashing phenomenon in GNNs and analyze how it arises from bottlenecks in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14522","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/2111.14522/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":"2111.14522","created_at":"2026-07-05T05:15:22.522419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.14522v3","created_at":"2026-07-05T05:15:22.522419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14522","created_at":"2026-07-05T05:15:22.522419+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BFDQHY2SWMD","created_at":"2026-07-05T05:15:22.522419+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BFDQHY2SWMDSWO4","created_at":"2026-07-05T05:15:22.522419+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BFDQHY2","created_at":"2026-07-05T05:15:22.522419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19185","citing_title":"AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09432","citing_title":"Graph Mamba Operator: A Latent Simulator for Interacting Particle Systems","ref_index":108,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07327","citing_title":"Six Open Questions in Machine-Learned Interatomic Potential Foundation Models","ref_index":120,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05046","citing_title":"Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning","ref_index":178,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10038","citing_title":"Learning the Universe with the 2nd Generation of CAMELS: Varying 35 parameters of the IllustrisTNG model in (50Mpc/h)^3 boxes","ref_index":82,"is_internal_anchor":false},{"citing_arxiv_id":"2601.01123","citing_title":"Learning from Historical Activations in Graph Neural Networks","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2511.06443","citing_title":"How Wide and How Deep? Mitigating Over-Squashing of GNNs via Channel Capacity Constrained Estimation","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10975","citing_title":"Hierarchical Multi-Scale Graph Neural Networks: Scalable Heterophilous Learning with Oversmoothing and Oversquashing Mitigation","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26301","citing_title":"Cheeger--Hodge Contrastive Learning for Structurally Robust Graph Representation Learning","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08870","citing_title":"TopoGeoScore: A Self-Supervised Source-Only Geometric Framework for OOD Checkpoint Selection","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01542","citing_title":"Mesh Based Simulations with Spatial and Temporal awareness","ref_index":154,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14211","citing_title":"Ollivier-Ricci Curvature of Riemannian Manifolds and Directed Graphs with Applications to Graph Neural Networks","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7BFDQHY2SWMDSWO4YTFSLNOMQY","json":"https://pith.science/pith/7BFDQHY2SWMDSWO4YTFSLNOMQY.json","graph_json":"https://pith.science/api/pith-number/7BFDQHY2SWMDSWO4YTFSLNOMQY/graph.json","events_json":"https://pith.science/api/pith-number/7BFDQHY2SWMDSWO4YTFSLNOMQY/events.json","paper":"https://pith.science/paper/7BFDQHY2"},"agent_actions":{"view_html":"https://pith.science/pith/7BFDQHY2SWMDSWO4YTFSLNOMQY","download_json":"https://pith.science/pith/7BFDQHY2SWMDSWO4YTFSLNOMQY.json","view_paper":"https://pith.science/paper/7BFDQHY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.14522&json=true","fetch_graph":"https://pith.science/api/pith-number/7BFDQHY2SWMDSWO4YTFSLNOMQY/graph.json","fetch_events":"https://pith.science/api/pith-number/7BFDQHY2SWMDSWO4YTFSLNOMQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BFDQHY2SWMDSWO4YTFSLNOMQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BFDQHY2SWMDSWO4YTFSLNOMQY/action/storage_attestation","attest_author":"https://pith.science/pith/7BFDQHY2SWMDSWO4YTFSLNOMQY/action/author_attestation","sign_citation":"https://pith.science/pith/7BFDQHY2SWMDSWO4YTFSLNOMQY/action/citation_signature","submit_replication":"https://pith.science/pith/7BFDQHY2SWMDSWO4YTFSLNOMQY/action/replication_record"}},"created_at":"2026-07-05T05:15:22.522419+00:00","updated_at":"2026-07-05T05:15:22.522419+00:00"}