{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VLVQEXIUY5JQ367WHWUAH3I5T2","short_pith_number":"pith:VLVQEXIU","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"},"canonical_sha256":"aaeb025d14c7530dfbf63da803ed1d9ea3dfe8e9a9647abb619a2eeca345db95","source":{"kind":"arxiv","id":"2102.01350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01350","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01350v1","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01350","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"VLVQEXIUY5JQ","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"pith_short_16","alias_value":"VLVQEXIUY5JQ367W","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"pith_short_8","alias_value":"VLVQEXIU","created_at":"2026-07-05T02:11:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VLVQEXIUY5JQ367WHWUAH3I5T2","target":"record","payload":{"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"},"canonical_sha256":"aaeb025d14c7530dfbf63da803ed1d9ea3dfe8e9a9647abb619a2eeca345db95","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"},"source_kind":"arxiv","source_id":"2102.01350","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-07-05T02:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L40ySPvaJcj3IzVcqVX7XOqupOGCG4kEry9XHAycMNxFraW6fwwJEql4XfQ9Hk5z2eD506GiKwUMkQ11mhq4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:39:38.929869Z"},"content_sha256":"a80f28086580ab46cc152c70730ecf2ff9f63dcfc8c259dbafbc76d16a093cf2","schema_version":"1.0","event_id":"sha256:a80f28086580ab46cc152c70730ecf2ff9f63dcfc8c259dbafbc76d16a093cf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VLVQEXIUY5JQ367WHWUAH3I5T2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xv8b8WR0b+heyN6qtFV+Pv8SOfhsy+yTdM0av2KfdPJa/PbHFLxxFskiQGWI0ln5nyjvJN8sqPvGIuUaGVI5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:39:38.930798Z"},"content_sha256":"bed09de2e63b3b83d81b4d28516a541298c11c574481b06c50c8d48ecf5fde4d","schema_version":"1.0","event_id":"sha256:bed09de2e63b3b83d81b4d28516a541298c11c574481b06c50c8d48ecf5fde4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/bundle.json","state_url":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/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-08-06T16:39:38Z","links":{"resolver":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2","bundle":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/bundle.json","state":"https://pith.science/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLVQEXIUY5JQ367WHWUAH3I5T2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VLVQEXIUY5JQ367WHWUAH3I5T2","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":"de6ee75936cb0fe314066e5db45214178d6f7d42a96cbdd542b3fe59d4baf7cc","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T06:50:07Z","title_canon_sha256":"bc6e579b18cf5a3996d937494afe69df8cda4dfd415a496fa78eab5a718604d2"},"schema_version":"1.0","source":{"id":"2102.01350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01350","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01350v1","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01350","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"VLVQEXIUY5JQ","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"pith_short_16","alias_value":"VLVQEXIUY5JQ367W","created_at":"2026-07-05T02:11:29Z"},{"alias_kind":"pith_short_8","alias_value":"VLVQEXIU","created_at":"2026-07-05T02:11:29Z"}],"graph_snapshots":[{"event_id":"sha256:bed09de2e63b3b83d81b4d28516a541298c11c574481b06c50c8d48ecf5fde4d","target":"graph","created_at":"2026-07-05T02:11:29Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.01350/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chen Cai, Dingkang Wang, Yusu Wang","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T06:50:07Z","title":"Graph Coarsening with Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01350","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a80f28086580ab46cc152c70730ecf2ff9f63dcfc8c259dbafbc76d16a093cf2","target":"record","created_at":"2026-07-05T02:11:29Z","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":"de6ee75936cb0fe314066e5db45214178d6f7d42a96cbdd542b3fe59d4baf7cc","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T06:50:07Z","title_canon_sha256":"bc6e579b18cf5a3996d937494afe69df8cda4dfd415a496fa78eab5a718604d2"},"schema_version":"1.0","source":{"id":"2102.01350","kind":"arxiv","version":1}},"canonical_sha256":"aaeb025d14c7530dfbf63da803ed1d9ea3dfe8e9a9647abb619a2eeca345db95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aaeb025d14c7530dfbf63da803ed1d9ea3dfe8e9a9647abb619a2eeca345db95","first_computed_at":"2026-07-05T02:11:29.953925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:11:29.953925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HmSKcWv4ox35OD01p2xArykEkpLs6dtuecq2tXboLmgAp7n9U/GHwlbF6dlgQwQ7moTRDbHLfP6M3eZbqky8Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:11:29.954337Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.01350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a80f28086580ab46cc152c70730ecf2ff9f63dcfc8c259dbafbc76d16a093cf2","sha256:bed09de2e63b3b83d81b4d28516a541298c11c574481b06c50c8d48ecf5fde4d"],"state_sha256":"a9e6c6fa0a242aca44a85127e0f25171bceee9a726752b4f95773d8cd7a1b6a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1BFdVeKRRZQGqgQD0DPQarMGnJnE3gN3MUhr0VFqqfRmXqaXfZevJLeEiyaLij/SBgpmA0AvYIasXM5laZUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T16:39:38.939454Z","bundle_sha256":"de6cb91008039b583c5c33271907654678e0f37ca88d7f47b463fe99d8bff742"}}