{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GBJA5XNBUUVSFTG65D4CHOUUQJ","short_pith_number":"pith:GBJA5XNB","schema_version":"1.0","canonical_sha256":"30520edda1a52b22ccdee8f823ba94826e3291b5e758daea505c7ad839c949f6","source":{"kind":"arxiv","id":"2310.01668","version":2},"attestation_state":"computed","paper":{"title":"Locality-Aware Graph-Rewiring in GNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ameya Velingker, Amin Saberi, Federico Barbero, Francesco Di Giovanni, Michael Bronstein","submitted_at":"2023-10-02T21:59:44Z","abstract_excerpt":"Graph Neural Networks (GNNs) are popular models for machine learning on graphs that typically follow the message-passing paradigm, whereby the feature of a node is updated recursively upon aggregating information over its neighbors. While exchanging messages over the input graph endows GNNs with a strong inductive bias, it can also make GNNs susceptible to over-squashing, thereby preventing them from capturing long-range interactions in the given graph. To rectify this issue, graph rewiring techniques have been proposed as a means of improving information flow by altering the graph connectivit"},"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":"2310.01668","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T21:59:44Z","cross_cats_sorted":[],"title_canon_sha256":"98cacdacc2c9e06a41edad85963664bdf95793eeb16a13ea7b08a6d0886519c7","abstract_canon_sha256":"3782009ec04f9f5abcbfe7c184c16a3f51112cfa119adbdb63a2d7c4b251e424"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:15:40.018291Z","signature_b64":"fs0a/pQIulHp/+tuZo7xJk+pfcemB2hYryxDS07rIT8BvOZXtfSW0uEuK3jQrtICccnH/ni3SVHD/0PRxUH2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30520edda1a52b22ccdee8f823ba94826e3291b5e758daea505c7ad839c949f6","last_reissued_at":"2026-07-05T08:15:40.017794Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:15:40.017794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locality-Aware Graph-Rewiring in GNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ameya Velingker, Amin Saberi, Federico Barbero, Francesco Di Giovanni, Michael Bronstein","submitted_at":"2023-10-02T21:59:44Z","abstract_excerpt":"Graph Neural Networks (GNNs) are popular models for machine learning on graphs that typically follow the message-passing paradigm, whereby the feature of a node is updated recursively upon aggregating information over its neighbors. While exchanging messages over the input graph endows GNNs with a strong inductive bias, it can also make GNNs susceptible to over-squashing, thereby preventing them from capturing long-range interactions in the given graph. To rectify this issue, graph rewiring techniques have been proposed as a means of improving information flow by altering the graph connectivit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01668","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/2310.01668/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":"2310.01668","created_at":"2026-07-05T08:15:40.017861+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.01668v2","created_at":"2026-07-05T08:15:40.017861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01668","created_at":"2026-07-05T08:15:40.017861+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBJA5XNBUUVS","created_at":"2026-07-05T08:15:40.017861+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBJA5XNBUUVSFTG6","created_at":"2026-07-05T08:15:40.017861+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBJA5XNB","created_at":"2026-07-05T08:15:40.017861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06777","citing_title":"Asynchronous Message Passing for Addressing Oversquashing in Graph Neural Networks","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GBJA5XNBUUVSFTG65D4CHOUUQJ","json":"https://pith.science/pith/GBJA5XNBUUVSFTG65D4CHOUUQJ.json","graph_json":"https://pith.science/api/pith-number/GBJA5XNBUUVSFTG65D4CHOUUQJ/graph.json","events_json":"https://pith.science/api/pith-number/GBJA5XNBUUVSFTG65D4CHOUUQJ/events.json","paper":"https://pith.science/paper/GBJA5XNB"},"agent_actions":{"view_html":"https://pith.science/pith/GBJA5XNBUUVSFTG65D4CHOUUQJ","download_json":"https://pith.science/pith/GBJA5XNBUUVSFTG65D4CHOUUQJ.json","view_paper":"https://pith.science/paper/GBJA5XNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.01668&json=true","fetch_graph":"https://pith.science/api/pith-number/GBJA5XNBUUVSFTG65D4CHOUUQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GBJA5XNBUUVSFTG65D4CHOUUQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBJA5XNBUUVSFTG65D4CHOUUQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBJA5XNBUUVSFTG65D4CHOUUQJ/action/storage_attestation","attest_author":"https://pith.science/pith/GBJA5XNBUUVSFTG65D4CHOUUQJ/action/author_attestation","sign_citation":"https://pith.science/pith/GBJA5XNBUUVSFTG65D4CHOUUQJ/action/citation_signature","submit_replication":"https://pith.science/pith/GBJA5XNBUUVSFTG65D4CHOUUQJ/action/replication_record"}},"created_at":"2026-07-05T08:15:40.017861+00:00","updated_at":"2026-07-05T08:15:40.017861+00:00"}