{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BO34RBPIDGTANHIWXILSBIKI6V","short_pith_number":"pith:BO34RBPI","schema_version":"1.0","canonical_sha256":"0bb7c885e819a6069d16ba1720a148f576c204d9fba73bf58cfc4d677cc673bc","source":{"kind":"arxiv","id":"2410.13761","version":1},"attestation_state":"computed","paper":{"title":"GDeR: Safeguarding Efficiency, Balancing, and Robustness via Prototypical Graph Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dawei Cheng, Dingshuo Chen, Guibin Zhang, Haonan Dong, Kai Wang, Kun Wang, Tianlong Chen, Yuchen Zhang, Yuxuan Liang, Zhixun Li","submitted_at":"2024-10-17T16:56:01Z","abstract_excerpt":"Training high-quality deep models necessitates vast amounts of data, resulting in overwhelming computational and memory demands. Recently, data pruning, distillation, and coreset selection have been developed to streamline data volume by retaining, synthesizing, or selecting a small yet informative subset from the full set. Among these methods, data pruning incurs the least additional training cost and offers the most practical acceleration benefits. However, it is the most vulnerable, often suffering significant performance degradation with imbalanced or biased data schema, thus raising conce"},"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":"2410.13761","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-17T16:56:01Z","cross_cats_sorted":[],"title_canon_sha256":"325922292cabf71acc047abfc82b35d020378493b0b822859cfcb6f5a1185efe","abstract_canon_sha256":"4615d720c0e68e88898a7318620ff2633c3b1486aa057f755be2c1d827e534b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:05.400070Z","signature_b64":"a77jftCp0BNnSGKvGJbiflu8HNhcqvqR1wz/LdGNEfvGbZ59/UWEjRKI177d5AZqBbtm5XEuT1wKLtr6hnF6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bb7c885e819a6069d16ba1720a148f576c204d9fba73bf58cfc4d677cc673bc","last_reissued_at":"2026-07-05T09:22:05.399590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:05.399590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GDeR: Safeguarding Efficiency, Balancing, and Robustness via Prototypical Graph Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dawei Cheng, Dingshuo Chen, Guibin Zhang, Haonan Dong, Kai Wang, Kun Wang, Tianlong Chen, Yuchen Zhang, Yuxuan Liang, Zhixun Li","submitted_at":"2024-10-17T16:56:01Z","abstract_excerpt":"Training high-quality deep models necessitates vast amounts of data, resulting in overwhelming computational and memory demands. Recently, data pruning, distillation, and coreset selection have been developed to streamline data volume by retaining, synthesizing, or selecting a small yet informative subset from the full set. Among these methods, data pruning incurs the least additional training cost and offers the most practical acceleration benefits. However, it is the most vulnerable, often suffering significant performance degradation with imbalanced or biased data schema, thus raising conce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13761","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/2410.13761/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":"2410.13761","created_at":"2026-07-05T09:22:05.399648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.13761v1","created_at":"2026-07-05T09:22:05.399648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13761","created_at":"2026-07-05T09:22:05.399648+00:00"},{"alias_kind":"pith_short_12","alias_value":"BO34RBPIDGTA","created_at":"2026-07-05T09:22:05.399648+00:00"},{"alias_kind":"pith_short_16","alias_value":"BO34RBPIDGTANHIW","created_at":"2026-07-05T09:22:05.399648+00:00"},{"alias_kind":"pith_short_8","alias_value":"BO34RBPI","created_at":"2026-07-05T09:22:05.399648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06280","citing_title":"IceBerg: Debiased Self-Training for Class-Imbalanced Node Classification","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BO34RBPIDGTANHIWXILSBIKI6V","json":"https://pith.science/pith/BO34RBPIDGTANHIWXILSBIKI6V.json","graph_json":"https://pith.science/api/pith-number/BO34RBPIDGTANHIWXILSBIKI6V/graph.json","events_json":"https://pith.science/api/pith-number/BO34RBPIDGTANHIWXILSBIKI6V/events.json","paper":"https://pith.science/paper/BO34RBPI"},"agent_actions":{"view_html":"https://pith.science/pith/BO34RBPIDGTANHIWXILSBIKI6V","download_json":"https://pith.science/pith/BO34RBPIDGTANHIWXILSBIKI6V.json","view_paper":"https://pith.science/paper/BO34RBPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.13761&json=true","fetch_graph":"https://pith.science/api/pith-number/BO34RBPIDGTANHIWXILSBIKI6V/graph.json","fetch_events":"https://pith.science/api/pith-number/BO34RBPIDGTANHIWXILSBIKI6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BO34RBPIDGTANHIWXILSBIKI6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BO34RBPIDGTANHIWXILSBIKI6V/action/storage_attestation","attest_author":"https://pith.science/pith/BO34RBPIDGTANHIWXILSBIKI6V/action/author_attestation","sign_citation":"https://pith.science/pith/BO34RBPIDGTANHIWXILSBIKI6V/action/citation_signature","submit_replication":"https://pith.science/pith/BO34RBPIDGTANHIWXILSBIKI6V/action/replication_record"}},"created_at":"2026-07-05T09:22:05.399648+00:00","updated_at":"2026-07-05T09:22:05.399648+00:00"}