{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TRGG7QFW7XQ4Q7N243IJGITOMT","short_pith_number":"pith:TRGG7QFW","schema_version":"1.0","canonical_sha256":"9c4c6fc0b6fde1c87dbae6d093226e64ecc7cbd1153f105e978dee40364e5f5e","source":{"kind":"arxiv","id":"2308.15568","version":7},"attestation_state":"computed","paper":{"title":"Over-Squashing in Graph Neural Networks: A Comprehensive survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Singh Akansha","submitted_at":"2023-08-29T18:46:15Z","abstract_excerpt":"Graph Neural Networks (GNNs) revolutionize machine learning for graph-structured data, effectively capturing complex relationships. They disseminate information through interconnected nodes, but long-range interactions face challenges known as \"over-squashing\". This survey delves into the challenge of over-squashing in Graph Neural Networks (GNNs), where long-range information dissemination is hindered, impacting tasks reliant on intricate long-distance interactions. It comprehensively explores the causes, consequences, and mitigation strategies for over-squashing. Various methodologies are 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":"2308.15568","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-08-29T18:46:15Z","cross_cats_sorted":[],"title_canon_sha256":"0a174f506694301b72fe1b26b2cfb17137f928030905c66f85013631dd132a6f","abstract_canon_sha256":"4d63dfe663a92f703cbc4b7e457ecbadd765506829846513002be746e0247315"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:39.819776Z","signature_b64":"xkKcGb/lmq7hmbGE69xFUwAayVGRh1nOkwVsuvD/tov29zZc+aHkeArpLiw8Wge/LOo2wMHahIzzjwC418UxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c4c6fc0b6fde1c87dbae6d093226e64ecc7cbd1153f105e978dee40364e5f5e","last_reissued_at":"2026-07-05T10:31:39.819123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:39.819123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Over-Squashing in Graph Neural Networks: A Comprehensive survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Singh Akansha","submitted_at":"2023-08-29T18:46:15Z","abstract_excerpt":"Graph Neural Networks (GNNs) revolutionize machine learning for graph-structured data, effectively capturing complex relationships. They disseminate information through interconnected nodes, but long-range interactions face challenges known as \"over-squashing\". This survey delves into the challenge of over-squashing in Graph Neural Networks (GNNs), where long-range information dissemination is hindered, impacting tasks reliant on intricate long-distance interactions. It comprehensively explores the causes, consequences, and mitigation strategies for over-squashing. Various methodologies are re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15568","kind":"arxiv","version":7},"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/2308.15568/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":"2308.15568","created_at":"2026-07-05T10:31:39.819204+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.15568v7","created_at":"2026-07-05T10:31:39.819204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15568","created_at":"2026-07-05T10:31:39.819204+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRGG7QFW7XQ4","created_at":"2026-07-05T10:31:39.819204+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRGG7QFW7XQ4Q7N2","created_at":"2026-07-05T10:31:39.819204+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRGG7QFW","created_at":"2026-07-05T10:31:39.819204+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01681","citing_title":"DeepGate4: Efficient and Effective Representation Learning for Circuit Design at Scale","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRGG7QFW7XQ4Q7N243IJGITOMT","json":"https://pith.science/pith/TRGG7QFW7XQ4Q7N243IJGITOMT.json","graph_json":"https://pith.science/api/pith-number/TRGG7QFW7XQ4Q7N243IJGITOMT/graph.json","events_json":"https://pith.science/api/pith-number/TRGG7QFW7XQ4Q7N243IJGITOMT/events.json","paper":"https://pith.science/paper/TRGG7QFW"},"agent_actions":{"view_html":"https://pith.science/pith/TRGG7QFW7XQ4Q7N243IJGITOMT","download_json":"https://pith.science/pith/TRGG7QFW7XQ4Q7N243IJGITOMT.json","view_paper":"https://pith.science/paper/TRGG7QFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.15568&json=true","fetch_graph":"https://pith.science/api/pith-number/TRGG7QFW7XQ4Q7N243IJGITOMT/graph.json","fetch_events":"https://pith.science/api/pith-number/TRGG7QFW7XQ4Q7N243IJGITOMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRGG7QFW7XQ4Q7N243IJGITOMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRGG7QFW7XQ4Q7N243IJGITOMT/action/storage_attestation","attest_author":"https://pith.science/pith/TRGG7QFW7XQ4Q7N243IJGITOMT/action/author_attestation","sign_citation":"https://pith.science/pith/TRGG7QFW7XQ4Q7N243IJGITOMT/action/citation_signature","submit_replication":"https://pith.science/pith/TRGG7QFW7XQ4Q7N243IJGITOMT/action/replication_record"}},"created_at":"2026-07-05T10:31:39.819204+00:00","updated_at":"2026-07-05T10:31:39.819204+00:00"}