{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YMTZEZBVCEUYC5RBLXWAPL44UM","short_pith_number":"pith:YMTZEZBV","canonical_record":{"source":{"id":"2501.01118","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-02T07:35:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f9c01a89a5187b829547d7c07578bf3dbf9562edc1ab6548c2436946158cce88","abstract_canon_sha256":"5716472c11bc4f753ba3604dec2d20e7225fbf08ea1f3e2351900c2067e086ee"},"schema_version":"1.0"},"canonical_sha256":"c32792643511298176215dec07af9ca3141a1712fd2e12ab5ba6d33327b87ff6","source":{"kind":"arxiv","id":"2501.01118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.01118","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"arxiv_version","alias_value":"2501.01118v1","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.01118","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"pith_short_12","alias_value":"YMTZEZBVCEUY","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"pith_short_16","alias_value":"YMTZEZBVCEUYC5RB","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"pith_short_8","alias_value":"YMTZEZBV","created_at":"2026-07-05T09:56:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YMTZEZBVCEUYC5RBLXWAPL44UM","target":"record","payload":{"canonical_record":{"source":{"id":"2501.01118","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-02T07:35:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f9c01a89a5187b829547d7c07578bf3dbf9562edc1ab6548c2436946158cce88","abstract_canon_sha256":"5716472c11bc4f753ba3604dec2d20e7225fbf08ea1f3e2351900c2067e086ee"},"schema_version":"1.0"},"canonical_sha256":"c32792643511298176215dec07af9ca3141a1712fd2e12ab5ba6d33327b87ff6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:14.998792Z","signature_b64":"WuYIHO7aG1mglhmHHof8GtBecMhVnGFFC/efLR8fxgXiQjPwCVsD0yQQDTkHaLRZP76dUzx0R50Gk4xBmTcECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c32792643511298176215dec07af9ca3141a1712fd2e12ab5ba6d33327b87ff6","last_reissued_at":"2026-07-05T09:56:14.998332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:14.998332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.01118","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-05T09:56:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Icw8Z4PY+3BD0oyM2rfE52EogWnkEtux9FhdC9tw43TXTFJQRxT+TeGIYzCXF4oW7vzL0W1rFznowNdQeYKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:42:39.549301Z"},"content_sha256":"5c9a0f33ab10bad60df2fa20edeea40d5187f871d5f8042262091f13b94269b3","schema_version":"1.0","event_id":"sha256:5c9a0f33ab10bad60df2fa20edeea40d5187f871d5f8042262091f13b94269b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YMTZEZBVCEUYC5RBLXWAPL44UM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pruning-based Data Selection and Network Fusion for Efficient Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hasnain Irshad Bhatti, Humaira Kousar, Jaekyun Moon","submitted_at":"2025-01-02T07:35:53Z","abstract_excerpt":"Efficient data selection is essential for improving the training efficiency of deep neural networks and reducing the associated annotation costs. However, traditional methods tend to be computationally expensive, limiting their scalability and real-world applicability. We introduce PruneFuse, a novel method that combines pruning and network fusion to enhance data selection and accelerate network training. In PruneFuse, the original dense network is pruned to generate a smaller surrogate model that efficiently selects the most informative samples from the dataset. Once this iterative data selec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.01118","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/2501.01118/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-05T09:56:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJOgd1bSnxJt5YJ5EB7yvgjYzElShpTWwIIxIwXkUQoeXFmQO618prGBW0itVc7NU+s3quH4bsTfVcnvq3X2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:42:39.549896Z"},"content_sha256":"c40efbe984d6896ed67480e7901fc96046cc419eb7f3e93a9d40787846c8e2ed","schema_version":"1.0","event_id":"sha256:c40efbe984d6896ed67480e7901fc96046cc419eb7f3e93a9d40787846c8e2ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMTZEZBVCEUYC5RBLXWAPL44UM/bundle.json","state_url":"https://pith.science/pith/YMTZEZBVCEUYC5RBLXWAPL44UM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMTZEZBVCEUYC5RBLXWAPL44UM/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-11T10:42:39Z","links":{"resolver":"https://pith.science/pith/YMTZEZBVCEUYC5RBLXWAPL44UM","bundle":"https://pith.science/pith/YMTZEZBVCEUYC5RBLXWAPL44UM/bundle.json","state":"https://pith.science/pith/YMTZEZBVCEUYC5RBLXWAPL44UM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMTZEZBVCEUYC5RBLXWAPL44UM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YMTZEZBVCEUYC5RBLXWAPL44UM","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":"5716472c11bc4f753ba3604dec2d20e7225fbf08ea1f3e2351900c2067e086ee","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-02T07:35:53Z","title_canon_sha256":"f9c01a89a5187b829547d7c07578bf3dbf9562edc1ab6548c2436946158cce88"},"schema_version":"1.0","source":{"id":"2501.01118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.01118","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"arxiv_version","alias_value":"2501.01118v1","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.01118","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"pith_short_12","alias_value":"YMTZEZBVCEUY","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"pith_short_16","alias_value":"YMTZEZBVCEUYC5RB","created_at":"2026-07-05T09:56:14Z"},{"alias_kind":"pith_short_8","alias_value":"YMTZEZBV","created_at":"2026-07-05T09:56:14Z"}],"graph_snapshots":[{"event_id":"sha256:c40efbe984d6896ed67480e7901fc96046cc419eb7f3e93a9d40787846c8e2ed","target":"graph","created_at":"2026-07-05T09:56:14Z","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/2501.01118/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient data selection is essential for improving the training efficiency of deep neural networks and reducing the associated annotation costs. However, traditional methods tend to be computationally expensive, limiting their scalability and real-world applicability. We introduce PruneFuse, a novel method that combines pruning and network fusion to enhance data selection and accelerate network training. In PruneFuse, the original dense network is pruned to generate a smaller surrogate model that efficiently selects the most informative samples from the dataset. Once this iterative data selec","authors_text":"Hasnain Irshad Bhatti, Humaira Kousar, Jaekyun Moon","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-02T07:35:53Z","title":"Pruning-based Data Selection and Network Fusion for Efficient Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.01118","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:5c9a0f33ab10bad60df2fa20edeea40d5187f871d5f8042262091f13b94269b3","target":"record","created_at":"2026-07-05T09:56:14Z","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":"5716472c11bc4f753ba3604dec2d20e7225fbf08ea1f3e2351900c2067e086ee","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-02T07:35:53Z","title_canon_sha256":"f9c01a89a5187b829547d7c07578bf3dbf9562edc1ab6548c2436946158cce88"},"schema_version":"1.0","source":{"id":"2501.01118","kind":"arxiv","version":1}},"canonical_sha256":"c32792643511298176215dec07af9ca3141a1712fd2e12ab5ba6d33327b87ff6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c32792643511298176215dec07af9ca3141a1712fd2e12ab5ba6d33327b87ff6","first_computed_at":"2026-07-05T09:56:14.998332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:56:14.998332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WuYIHO7aG1mglhmHHof8GtBecMhVnGFFC/efLR8fxgXiQjPwCVsD0yQQDTkHaLRZP76dUzx0R50Gk4xBmTcECA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:56:14.998792Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.01118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c9a0f33ab10bad60df2fa20edeea40d5187f871d5f8042262091f13b94269b3","sha256:c40efbe984d6896ed67480e7901fc96046cc419eb7f3e93a9d40787846c8e2ed"],"state_sha256":"3fa2f6705542126b1f7050850752b88574d2a694d2bc24915216c022191e918b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UjfyQTNCXKHgUlxuKepz+uhAXgbUkozMQiTJq9WkDg4f3HHfTkWlMKhy5r15y7ItukUldM1pG5R4SFhjhD8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T10:42:39.615133Z","bundle_sha256":"3a8e9aeb4d851e68a6df759e4a5c129479586c87aebf18c330aaa99f8601bf30"}}