{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZWOLAJ4CZXT4QN3T3BSSIDBGFC","short_pith_number":"pith:ZWOLAJ4C","canonical_record":{"source":{"id":"2605.13021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:24:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b24fa0e421af66cb838fbef494b483a887782c507aea5bbce0855b49a79edb13","abstract_canon_sha256":"fe6a930ed2bc435a18aa90737d8739fa6e5467504bd9399eaf808540f7401410"},"schema_version":"1.0"},"canonical_sha256":"cd9cb02782cde7c83773d865240c2628a41ba2f4e5d7dc70f9285801809864b7","source":{"kind":"arxiv","id":"2605.13021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13021","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13021v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13021","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZWOLAJ4CZXT4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZWOLAJ4CZXT4QN3T","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZWOLAJ4C","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZWOLAJ4CZXT4QN3T3BSSIDBGFC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:24:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b24fa0e421af66cb838fbef494b483a887782c507aea5bbce0855b49a79edb13","abstract_canon_sha256":"fe6a930ed2bc435a18aa90737d8739fa6e5467504bd9399eaf808540f7401410"},"schema_version":"1.0"},"canonical_sha256":"cd9cb02782cde7c83773d865240c2628a41ba2f4e5d7dc70f9285801809864b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:00.029962Z","signature_b64":"NzCwFxY6ioF/nnfd0Ze2mM6ktmbhbbZnpXpv42sP1RqtQGyMjKBF2Pb9HE8m323D4MrR8XuZ5kahl0yGkNHjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd9cb02782cde7c83773d865240c2628a41ba2f4e5d7dc70f9285801809864b7","last_reissued_at":"2026-05-18T03:09:00.029228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:00.029228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13021","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zb1UiQ6zIegQZJWM/j9hK4jEiUdjLyYQhmE9KGPJ85L6NLLkqBqOuLVNmX/Lj0cQaDKkbKDAa/jfoz9NzsR8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:55:38.933265Z"},"content_sha256":"24f2d05750123453fc88cdc3f7f26a4e0a16c07ebb788943090408a6a734d315","schema_version":"1.0","event_id":"sha256:24f2d05750123453fc88cdc3f7f26a4e0a16c07ebb788943090408a6a734d315"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZWOLAJ4CZXT4QN3T3BSSIDBGFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A non-selfishness principle enables linear-memory graph coarsening with near-linear runtime.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bin Lu, Chenghu Zhou, Kun Zhang, Meng Jin, Shengbo Chen, Xinbing Wang, Xu Bai","submitted_at":"2026-05-13T05:24:35Z","abstract_excerpt":"Graph coarsening is a graph dimensionality reduction technique that aims to construct a smaller and more tractable graph while preserving the essential structural and semantic properties of the original graph. However, most existing methods rely on pair-wise similarity matching, where each node independently searches for its best partner based on global information. This selfishness matching paradigm incurs substantial computational and memory overhead. To address this problem, we shift to a non-selfishness principle that prioritizes the collective interference of neighborhood in coarsening, a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"NOPE achieves linear memory consumption and near-linear computational complexity in the number of nodes; NOPE* reduces O(δ · d) interference evaluation to O(d) based on the local isotropy assumption and yields 1.8-10× speedup while producing coarsened graphs that support comparable or superior learning performance.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The local isotropy assumption invoked to simplify interference evaluation from O(δ · d) to O(d) for high-degree nodes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"NOPE coarsens graphs via neighborhood interference rather than selfish pairwise matching to reach linear memory and near-linear time, with NOPE* variant delivering 1.8-10x speedups and comparable or better learning results than full graphs or LLM reasoning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A non-selfishness principle enables linear-memory graph coarsening with near-linear runtime.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b227053b043989e6d8214ebe980aaa4bd48c5e20f1cae4b54f3b33ffd691be1b"},"source":{"id":"2605.13021","kind":"arxiv","version":1},"verdict":{"id":"a7f6bf5d-ba13-4f01-a691-93a6950f8ab6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:25:08.274930Z","strongest_claim":"NOPE achieves linear memory consumption and near-linear computational complexity in the number of nodes; NOPE* reduces O(δ · d) interference evaluation to O(d) based on the local isotropy assumption and yields 1.8-10× speedup while producing coarsened graphs that support comparable or superior learning performance.","one_line_summary":"NOPE coarsens graphs via neighborhood interference rather than selfish pairwise matching to reach linear memory and near-linear time, with NOPE* variant delivering 1.8-10x speedups and comparable or better learning results than full graphs or LLM reasoning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The local isotropy assumption invoked to simplify interference evaluation from O(δ · d) to O(d) for high-degree nodes.","pith_extraction_headline":"A non-selfishness principle enables linear-memory graph coarsening with near-linear runtime."},"references":{"count":15,"sample":[{"doi":"","year":2024,"title":"raph- skeleton: 1% nodes are sufficient to represent billion- scale graph","work_id":"40fa2330-48e1-4157-9397-6d584513e8a6","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Graph coarsening via convolution match- ing for scalable graph neural network training","work_id":"8848830c-795c-4b8a-b37a-106d921768e5","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Query preserving graph compression","work_id":"70487e8b-9ade-4c02-8b07-c999c2694463","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Taglas: An atlas of text-attributed graph datasets in the era of large graph and language models.arXiv preprint arXiv:2406.14683,","work_id":"d4e0e2c3-4991-4fdf-85cf-80f77ddc7f39","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Harnessing explanations: Llm-to-lm interpreter for enhanced text-attributed graph representation learning","work_id":"49666b8d-06bd-4548-be4a-587555730e50","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"7127029e1763968d9fb1df29c3395a10f0bf01f5456982ab36fe9134fdad3ba4","internal_anchors":1},"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"},"verdict_id":"a7f6bf5d-ba13-4f01-a691-93a6950f8ab6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rv3qkgKaGJJDIJ4eu3WxK0AeudFpxr7KLCHcJnvG6S29a4T2R6Ztqaf3w1IRqlCfnEWrWzybQ/gq1/I6ozpjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:55:38.934300Z"},"content_sha256":"601f7e31d3269bcfb1391970cc231c3583dbe4b2ad8a2ce24e73b69339c58459","schema_version":"1.0","event_id":"sha256:601f7e31d3269bcfb1391970cc231c3583dbe4b2ad8a2ce24e73b69339c58459"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWOLAJ4CZXT4QN3T3BSSIDBGFC/bundle.json","state_url":"https://pith.science/pith/ZWOLAJ4CZXT4QN3T3BSSIDBGFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWOLAJ4CZXT4QN3T3BSSIDBGFC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T20:55:38Z","links":{"resolver":"https://pith.science/pith/ZWOLAJ4CZXT4QN3T3BSSIDBGFC","bundle":"https://pith.science/pith/ZWOLAJ4CZXT4QN3T3BSSIDBGFC/bundle.json","state":"https://pith.science/pith/ZWOLAJ4CZXT4QN3T3BSSIDBGFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWOLAJ4CZXT4QN3T3BSSIDBGFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZWOLAJ4CZXT4QN3T3BSSIDBGFC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fe6a930ed2bc435a18aa90737d8739fa6e5467504bd9399eaf808540f7401410","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:24:35Z","title_canon_sha256":"b24fa0e421af66cb838fbef494b483a887782c507aea5bbce0855b49a79edb13"},"schema_version":"1.0","source":{"id":"2605.13021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13021","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13021v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13021","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZWOLAJ4CZXT4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZWOLAJ4CZXT4QN3T","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZWOLAJ4C","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:601f7e31d3269bcfb1391970cc231c3583dbe4b2ad8a2ce24e73b69339c58459","target":"graph","created_at":"2026-05-18T03:09:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"NOPE achieves linear memory consumption and near-linear computational complexity in the number of nodes; NOPE* reduces O(δ · d) interference evaluation to O(d) based on the local isotropy assumption and yields 1.8-10× speedup while producing coarsened graphs that support comparable or superior learning performance."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The local isotropy assumption invoked to simplify interference evaluation from O(δ · d) to O(d) for high-degree nodes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"NOPE coarsens graphs via neighborhood interference rather than selfish pairwise matching to reach linear memory and near-linear time, with NOPE* variant delivering 1.8-10x speedups and comparable or better learning results than full graphs or LLM reasoning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A non-selfishness principle enables linear-memory graph coarsening with near-linear runtime."}],"snapshot_sha256":"b227053b043989e6d8214ebe980aaa4bd48c5e20f1cae4b54f3b33ffd691be1b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Graph coarsening is a graph dimensionality reduction technique that aims to construct a smaller and more tractable graph while preserving the essential structural and semantic properties of the original graph. However, most existing methods rely on pair-wise similarity matching, where each node independently searches for its best partner based on global information. This selfishness matching paradigm incurs substantial computational and memory overhead. To address this problem, we shift to a non-selfishness principle that prioritizes the collective interference of neighborhood in coarsening, a","authors_text":"Bin Lu, Chenghu Zhou, Kun Zhang, Meng Jin, Shengbo Chen, Xinbing Wang, Xu Bai","cross_cats":["cs.AI"],"headline":"A non-selfishness principle enables linear-memory graph coarsening with near-linear runtime.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:24:35Z","title":"Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle"},"references":{"count":15,"internal_anchors":1,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"raph- skeleton: 1% nodes are sufficient to represent billion- scale graph","work_id":"40fa2330-48e1-4157-9397-6d584513e8a6","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Graph coarsening via convolution match- ing for scalable graph neural network training","work_id":"8848830c-795c-4b8a-b37a-106d921768e5","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Query preserving graph compression","work_id":"70487e8b-9ade-4c02-8b07-c999c2694463","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Taglas: An atlas of text-attributed graph datasets in the era of large graph and language models.arXiv preprint arXiv:2406.14683,","work_id":"d4e0e2c3-4991-4fdf-85cf-80f77ddc7f39","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Harnessing explanations: Llm-to-lm interpreter for enhanced text-attributed graph representation learning","work_id":"49666b8d-06bd-4548-be4a-587555730e50","year":2024}],"snapshot_sha256":"7127029e1763968d9fb1df29c3395a10f0bf01f5456982ab36fe9134fdad3ba4"},"source":{"id":"2605.13021","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:25:08.274930Z","id":"a7f6bf5d-ba13-4f01-a691-93a6950f8ab6","model_set":{"reader":"grok-4.3"},"one_line_summary":"NOPE coarsens graphs via neighborhood interference rather than selfish pairwise matching to reach linear memory and near-linear time, with NOPE* variant delivering 1.8-10x speedups and comparable or better learning results than full graphs or LLM reasoning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A non-selfishness principle enables linear-memory graph coarsening with near-linear runtime.","strongest_claim":"NOPE achieves linear memory consumption and near-linear computational complexity in the number of nodes; NOPE* reduces O(δ · d) interference evaluation to O(d) based on the local isotropy assumption and yields 1.8-10× speedup while producing coarsened graphs that support comparable or superior learning performance.","weakest_assumption":"The local isotropy assumption invoked to simplify interference evaluation from O(δ · d) to O(d) for high-degree nodes."}},"verdict_id":"a7f6bf5d-ba13-4f01-a691-93a6950f8ab6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:24f2d05750123453fc88cdc3f7f26a4e0a16c07ebb788943090408a6a734d315","target":"record","created_at":"2026-05-18T03:09:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fe6a930ed2bc435a18aa90737d8739fa6e5467504bd9399eaf808540f7401410","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:24:35Z","title_canon_sha256":"b24fa0e421af66cb838fbef494b483a887782c507aea5bbce0855b49a79edb13"},"schema_version":"1.0","source":{"id":"2605.13021","kind":"arxiv","version":1}},"canonical_sha256":"cd9cb02782cde7c83773d865240c2628a41ba2f4e5d7dc70f9285801809864b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd9cb02782cde7c83773d865240c2628a41ba2f4e5d7dc70f9285801809864b7","first_computed_at":"2026-05-18T03:09:00.029228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:00.029228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NzCwFxY6ioF/nnfd0Ze2mM6ktmbhbbZnpXpv42sP1RqtQGyMjKBF2Pb9HE8m323D4MrR8XuZ5kahl0yGkNHjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:00.029962Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24f2d05750123453fc88cdc3f7f26a4e0a16c07ebb788943090408a6a734d315","sha256:601f7e31d3269bcfb1391970cc231c3583dbe4b2ad8a2ce24e73b69339c58459"],"state_sha256":"de533e285875f356c4dbcddd11cd041d81580b97a52a7f685d43bb5f2b4dbf18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITNBGXDLBMOZ48KQybVB/aV3fU5bGbk9Eoa5/pcOS0orAbNE0AJS5ErOl1HgOq5D8FHJBL5CFAGbRvFOcgqpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:55:38.938433Z","bundle_sha256":"4cd8b1f1efab3355393388bac7dab34f13f43c99d60db3da1f246625e0fc8d58"}}