{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NL7B4V4HFYETTA7EWSCAXY2RPD","short_pith_number":"pith:NL7B4V4H","canonical_record":{"source":{"id":"2503.11737","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T14:44:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"568916bbeb7c28cf13ff874a6f294086d91994d8bfb49d1aa69d7fecfceb4d48","abstract_canon_sha256":"6c11e9cc92d59ddc05b2b17c006055373edab72e02309d48fe0bc8f96b094d30"},"schema_version":"1.0"},"canonical_sha256":"6afe1e57872e093983e4b4840be35178d0142dd0372193ec02745c36e53f81ad","source":{"kind":"arxiv","id":"2503.11737","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.11737","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2503.11737v4","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11737","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"NL7B4V4HFYET","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"NL7B4V4HFYETTA7E","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"NL7B4V4H","created_at":"2026-07-05T11:38:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NL7B4V4HFYETTA7EWSCAXY2RPD","target":"record","payload":{"canonical_record":{"source":{"id":"2503.11737","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T14:44:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"568916bbeb7c28cf13ff874a6f294086d91994d8bfb49d1aa69d7fecfceb4d48","abstract_canon_sha256":"6c11e9cc92d59ddc05b2b17c006055373edab72e02309d48fe0bc8f96b094d30"},"schema_version":"1.0"},"canonical_sha256":"6afe1e57872e093983e4b4840be35178d0142dd0372193ec02745c36e53f81ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:27.973633Z","signature_b64":"A+x5tHCFRWK5qs6l5P9q4SJF0LLpfzvJsA1EwcFhVOLsH5XVl76Bpik/EGihwgUqSexqBqowj/XzFuxnGy3kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6afe1e57872e093983e4b4840be35178d0142dd0372193ec02745c36e53f81ad","last_reissued_at":"2026-07-05T11:38:27.973094Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:27.973094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.11737","source_version":4,"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-05T11:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTTIjkTY0+acoNt/P9obHAQqC+TJfRCWO00iLQJ7B9kKyOxgFpRBiVkqDRoNfxYAwl3y4AuOkVVlYUB+ZhBJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:11:44.878907Z"},"content_sha256":"bd072995704277968d686b1ba00ccbceba814e142dcd41eefefa57efbffeb481","schema_version":"1.0","event_id":"sha256:bd072995704277968d686b1ba00ccbceba814e142dcd41eefefa57efbffeb481"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NL7B4V4HFYETTA7EWSCAXY2RPD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-View Node Pruning for Accurate Graph Representation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Doheon Lee, Hanjin Kim, Jiseong Park, Jueun Choi, Seojin Kim, Sung Ju Hwang","submitted_at":"2025-03-14T14:44:54Z","abstract_excerpt":"Graph pooling, which compresses a whole graph into a smaller coarsened graph, is an essential component of graph representation learning. To efficiently compress a given graph, graph pooling methods often drop their nodes with attention-based scoring with the task loss. However, this often results in simply removing nodes with lower degrees without consideration of their feature-level relevance to the given task. To fix this problem, we propose a Multi-View Pruning(MVP), a graph pruning method based on a multi-view framework and reconstruction loss. Given a graph, MVP first constructs multiple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11737","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/2503.11737/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-05T11:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HseecGaqY6y/IMUluVh6mi3hkMkTX3HXwQhhjGw5lc6qX7Ko/azdpGRrd6EFwUCwxb5DYQfbkn+3LLt5rhVlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:11:44.879440Z"},"content_sha256":"499d691eceb188fa1fee6edd05d5bee170351be7379f940092cdf6d41a4d4d52","schema_version":"1.0","event_id":"sha256:499d691eceb188fa1fee6edd05d5bee170351be7379f940092cdf6d41a4d4d52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NL7B4V4HFYETTA7EWSCAXY2RPD/bundle.json","state_url":"https://pith.science/pith/NL7B4V4HFYETTA7EWSCAXY2RPD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NL7B4V4HFYETTA7EWSCAXY2RPD/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-19T07:11:44Z","links":{"resolver":"https://pith.science/pith/NL7B4V4HFYETTA7EWSCAXY2RPD","bundle":"https://pith.science/pith/NL7B4V4HFYETTA7EWSCAXY2RPD/bundle.json","state":"https://pith.science/pith/NL7B4V4HFYETTA7EWSCAXY2RPD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NL7B4V4HFYETTA7EWSCAXY2RPD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NL7B4V4HFYETTA7EWSCAXY2RPD","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":"6c11e9cc92d59ddc05b2b17c006055373edab72e02309d48fe0bc8f96b094d30","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T14:44:54Z","title_canon_sha256":"568916bbeb7c28cf13ff874a6f294086d91994d8bfb49d1aa69d7fecfceb4d48"},"schema_version":"1.0","source":{"id":"2503.11737","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.11737","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2503.11737v4","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11737","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"NL7B4V4HFYET","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"NL7B4V4HFYETTA7E","created_at":"2026-07-05T11:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"NL7B4V4H","created_at":"2026-07-05T11:38:27Z"}],"graph_snapshots":[{"event_id":"sha256:499d691eceb188fa1fee6edd05d5bee170351be7379f940092cdf6d41a4d4d52","target":"graph","created_at":"2026-07-05T11:38:27Z","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/2503.11737/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph pooling, which compresses a whole graph into a smaller coarsened graph, is an essential component of graph representation learning. To efficiently compress a given graph, graph pooling methods often drop their nodes with attention-based scoring with the task loss. However, this often results in simply removing nodes with lower degrees without consideration of their feature-level relevance to the given task. To fix this problem, we propose a Multi-View Pruning(MVP), a graph pruning method based on a multi-view framework and reconstruction loss. Given a graph, MVP first constructs multiple","authors_text":"Doheon Lee, Hanjin Kim, Jiseong Park, Jueun Choi, Seojin Kim, Sung Ju Hwang","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T14:44:54Z","title":"Multi-View Node Pruning for Accurate Graph Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11737","kind":"arxiv","version":4},"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:bd072995704277968d686b1ba00ccbceba814e142dcd41eefefa57efbffeb481","target":"record","created_at":"2026-07-05T11:38:27Z","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":"6c11e9cc92d59ddc05b2b17c006055373edab72e02309d48fe0bc8f96b094d30","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-14T14:44:54Z","title_canon_sha256":"568916bbeb7c28cf13ff874a6f294086d91994d8bfb49d1aa69d7fecfceb4d48"},"schema_version":"1.0","source":{"id":"2503.11737","kind":"arxiv","version":4}},"canonical_sha256":"6afe1e57872e093983e4b4840be35178d0142dd0372193ec02745c36e53f81ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6afe1e57872e093983e4b4840be35178d0142dd0372193ec02745c36e53f81ad","first_computed_at":"2026-07-05T11:38:27.973094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:27.973094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A+x5tHCFRWK5qs6l5P9q4SJF0LLpfzvJsA1EwcFhVOLsH5XVl76Bpik/EGihwgUqSexqBqowj/XzFuxnGy3kDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:27.973633Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.11737","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd072995704277968d686b1ba00ccbceba814e142dcd41eefefa57efbffeb481","sha256:499d691eceb188fa1fee6edd05d5bee170351be7379f940092cdf6d41a4d4d52"],"state_sha256":"11c888db668848244afcedab8fa5c742fdc6058cf2314c25df8eb593d76350e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeZR1dIDaWUfmFwBWAw61S9dqV3IYJHtQikTiLzDbaH4zXY1zlDiI7wEgHXvtYgS5hDAu2Vz4q85Fx77ITciBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T07:11:44.884615Z","bundle_sha256":"067074f638a4a39a5da522f9f16344aa173819926f9da57e348815b9194fa140"}}