{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EQROS6ZSJOIDBHRX32VOHF5OBM","short_pith_number":"pith:EQROS6ZS","schema_version":"1.0","canonical_sha256":"2422e97b324b90309e37deaae397ae0b0815a195e01f59e08d9c2735aa8bd2c3","source":{"kind":"arxiv","id":"2206.08164","version":4},"attestation_state":"computed","paper":{"title":"Long Range Graph Benchmark","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ali Parviz, Anh Tuan Luu, Dominique Beaini, Guy Wolf, Ladislav Ramp\\'a\\v{s}ek, Mikhail Galkin, Vijay Prakash Dwivedi","submitted_at":"2022-06-16T13:33:22Z","abstract_excerpt":"Graph Neural Networks (GNNs) that are based on the message passing (MP) paradigm generally exchange information between 1-hop neighbors to build node representations at each layer. In principle, such networks are not able to capture long-range interactions (LRI) that may be desired or necessary for learning a given task on graphs. Recently, there has been an increasing interest in development of Transformer-based methods for graphs that can consider full node connectivity beyond the original sparse structure, thus enabling the modeling of LRI. However, MP-GNNs that simply rely on 1-hop message"},"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":"2206.08164","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-16T13:33:22Z","cross_cats_sorted":[],"title_canon_sha256":"aa370938c1b0f4a1279b6be026d168b5f1bff83f59aaf93c6dff0460b109cfb7","abstract_canon_sha256":"7016980d35b6d03b33cf2faa7fd5baf6569e2f84337c78d565141543c089c91f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:22.308687Z","signature_b64":"4t0uJPjj+ugH+Hbixv0sDxbgvQvPixUgZoJRGVAdR0hQNdFhc7/bFEvFdDm23RgY5TEldttf59boxKAUiUbnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2422e97b324b90309e37deaae397ae0b0815a195e01f59e08d9c2735aa8bd2c3","last_reissued_at":"2026-07-05T07:17:22.308269Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:22.308269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long Range Graph Benchmark","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ali Parviz, Anh Tuan Luu, Dominique Beaini, Guy Wolf, Ladislav Ramp\\'a\\v{s}ek, Mikhail Galkin, Vijay Prakash Dwivedi","submitted_at":"2022-06-16T13:33:22Z","abstract_excerpt":"Graph Neural Networks (GNNs) that are based on the message passing (MP) paradigm generally exchange information between 1-hop neighbors to build node representations at each layer. In principle, such networks are not able to capture long-range interactions (LRI) that may be desired or necessary for learning a given task on graphs. Recently, there has been an increasing interest in development of Transformer-based methods for graphs that can consider full node connectivity beyond the original sparse structure, thus enabling the modeling of LRI. However, MP-GNNs that simply rely on 1-hop message"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.08164","kind":"arxiv","version":4},"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/2206.08164/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":"2206.08164","created_at":"2026-07-05T07:17:22.308326+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.08164v4","created_at":"2026-07-05T07:17:22.308326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.08164","created_at":"2026-07-05T07:17:22.308326+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQROS6ZSJOID","created_at":"2026-07-05T07:17:22.308326+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQROS6ZSJOIDBHRX","created_at":"2026-07-05T07:17:22.308326+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQROS6ZS","created_at":"2026-07-05T07:17:22.308326+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"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":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23708","citing_title":"Learning Dynamic Stability Landscapes in Synchronization Networks","ref_index":179,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21070","citing_title":"Towards Understanding Self-Pretraining for Sequence Classification","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05689","citing_title":"GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQROS6ZSJOIDBHRX32VOHF5OBM","json":"https://pith.science/pith/EQROS6ZSJOIDBHRX32VOHF5OBM.json","graph_json":"https://pith.science/api/pith-number/EQROS6ZSJOIDBHRX32VOHF5OBM/graph.json","events_json":"https://pith.science/api/pith-number/EQROS6ZSJOIDBHRX32VOHF5OBM/events.json","paper":"https://pith.science/paper/EQROS6ZS"},"agent_actions":{"view_html":"https://pith.science/pith/EQROS6ZSJOIDBHRX32VOHF5OBM","download_json":"https://pith.science/pith/EQROS6ZSJOIDBHRX32VOHF5OBM.json","view_paper":"https://pith.science/paper/EQROS6ZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.08164&json=true","fetch_graph":"https://pith.science/api/pith-number/EQROS6ZSJOIDBHRX32VOHF5OBM/graph.json","fetch_events":"https://pith.science/api/pith-number/EQROS6ZSJOIDBHRX32VOHF5OBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQROS6ZSJOIDBHRX32VOHF5OBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQROS6ZSJOIDBHRX32VOHF5OBM/action/storage_attestation","attest_author":"https://pith.science/pith/EQROS6ZSJOIDBHRX32VOHF5OBM/action/author_attestation","sign_citation":"https://pith.science/pith/EQROS6ZSJOIDBHRX32VOHF5OBM/action/citation_signature","submit_replication":"https://pith.science/pith/EQROS6ZSJOIDBHRX32VOHF5OBM/action/replication_record"}},"created_at":"2026-07-05T07:17:22.308326+00:00","updated_at":"2026-07-05T07:17:22.308326+00:00"}