{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VLVQEXIUY5JQ367WHWUAH3I5T2","short_pith_number":"pith:VLVQEXIU","schema_version":"1.0","canonical_sha256":"aaeb025d14c7530dfbf63da803ed1d9ea3dfe8e9a9647abb619a2eeca345db95","source":{"kind":"arxiv","id":"2102.01350","version":1},"attestation_state":"computed","paper":{"title":"Graph Coarsening with Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chen Cai, Dingkang Wang, Yusu Wang","submitted_at":"2021-02-02T06:50:07Z","abstract_excerpt":"As large-scale graphs become increasingly more prevalent, it poses significant computational challenges to process, extract and analyze large graph data. Graph coarsening is one popular technique to reduce the size of a graph while maintaining essential properties. Despite rich graph coarsening literature, there is only limited exploration of data-driven methods in the field. In this work, we leverage the recent progress of deep learning on graphs for graph coarsening. We first propose a framework for measuring the quality of coarsening algorithm and show that depending on the goal, we need to"},"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":"2102.01350","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T06:50:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bc6e579b18cf5a3996d937494afe69df8cda4dfd415a496fa78eab5a718604d2","abstract_canon_sha256":"de6ee75936cb0fe314066e5db45214178d6f7d42a96cbdd542b3fe59d4baf7cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:11:29.954337Z","signature_b64":"HmSKcWv4ox35OD01p2xArykEkpLs6dtuecq2tXboLmgAp7n9U/GHwlbF6dlgQwQ7moTRDbHLfP6M3eZbqky8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaeb025d14c7530dfbf63da803ed1d9ea3dfe8e9a9647abb619a2eeca345db95","last_reissued_at":"2026-07-05T02:11:29.953925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:11:29.953925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Coarsening with Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chen Cai, Dingkang Wang, Yusu Wang","submitted_at":"2021-02-02T06:50:07Z","abstract_excerpt":"As large-scale graphs become increasingly more prevalent, it poses significant computational challenges to process, extract and analyze large graph data. Graph coarsening is one popular technique to reduce the size of a graph while maintaining essential properties. Despite rich graph coarsening literature, there is only limited exploration of data-driven methods in the field. In this work, we leverage the recent progress of deep learning on graphs for graph coarsening. We first propose a framework for measuring the quality of coarsening algorithm and show that depending on the goal, we need to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01350","kind":"arxiv","version":1},"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/2102.01350/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":"2102.01350","created_at":"2026-07-05T02:11:29.953988+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.01350v1","created_at":"2026-07-05T02:11:29.953988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01350","created_at":"2026-07-05T02:11:29.953988+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLVQEXIUY5JQ","created_at":"2026-07-05T02:11:29.953988+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLVQEXIUY5JQ367W","created_at":"2026-07-05T02:11:29.953988+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLVQEXIU","created_at":"2026-07-05T02:11:29.953988+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.29148","citing_title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2","json":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2.json","graph_json":"https://pith.science/api/pith-number/VLVQEXIUY5JQ367WHWUAH3I5T2/graph.json","events_json":"https://pith.science/api/pith-number/VLVQEXIUY5JQ367WHWUAH3I5T2/events.json","paper":"https://pith.science/paper/VLVQEXIU"},"agent_actions":{"view_html":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2","download_json":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2.json","view_paper":"https://pith.science/paper/VLVQEXIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.01350&json=true","fetch_graph":"https://pith.science/api/pith-number/VLVQEXIUY5JQ367WHWUAH3I5T2/graph.json","fetch_events":"https://pith.science/api/pith-number/VLVQEXIUY5JQ367WHWUAH3I5T2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/action/storage_attestation","attest_author":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/action/author_attestation","sign_citation":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/action/citation_signature","submit_replication":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/action/replication_record"}},"created_at":"2026-07-05T02:11:29.953988+00:00","updated_at":"2026-07-05T02:11:29.953988+00:00"}