{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TOXJ65IJVDUNMQVAFU6GM4ZCFX","short_pith_number":"pith:TOXJ65IJ","schema_version":"1.0","canonical_sha256":"9bae9f7509a8e8d642a02d3c6673222dfa6e2f0f15cf75bd980db52164e1951b","source":{"kind":"arxiv","id":"2501.15592","version":1},"attestation_state":"computed","paper":{"title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NE","math.IT"],"primary_cat":"cs.LG","authors_text":"Salimeh Yasaei Sekeh, Soheil Gharatappeh","submitted_at":"2025-01-26T16:40:59Z","abstract_excerpt":"Iterative magnitude pruning methods (IMPs), proven to be successful in reducing the number of insignificant nodes in over-parameterized deep neural networks (DNNs), have been getting an enormous amount of attention with the rapid deployment of DNNs into cutting-edge technologies with computation and memory constraints. Despite IMPs popularity in pruning networks, a fundamental limitation of existing IMP algorithms is the significant training time required for each pruning iteration. Our paper introduces a novel \\textit{stopping criterion} for IMPs that monitors information and gradient flows b"},"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":"2501.15592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-26T16:40:59Z","cross_cats_sorted":["cs.IT","cs.NE","math.IT"],"title_canon_sha256":"9a57856a7c6985b26b801186bef71e25de9b66d1fade78c69c926881fef942c1","abstract_canon_sha256":"ccc1c26e45698781b5179c7fe9a0c4a65c91c3edff2216ab5c74356c34ec2b07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:49.548686Z","signature_b64":"JcI5hUGURviMpP4F9VqVP4CLVs/cmrocxtPisDhVo/g6ZlJb4Aq6BexbVkDtIO9gD8YMHL3V08XhL5RIYrcTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bae9f7509a8e8d642a02d3c6673222dfa6e2f0f15cf75bd980db52164e1951b","last_reissued_at":"2026-07-05T10:05:49.548172Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:49.548172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NE","math.IT"],"primary_cat":"cs.LG","authors_text":"Salimeh Yasaei Sekeh, Soheil Gharatappeh","submitted_at":"2025-01-26T16:40:59Z","abstract_excerpt":"Iterative magnitude pruning methods (IMPs), proven to be successful in reducing the number of insignificant nodes in over-parameterized deep neural networks (DNNs), have been getting an enormous amount of attention with the rapid deployment of DNNs into cutting-edge technologies with computation and memory constraints. Despite IMPs popularity in pruning networks, a fundamental limitation of existing IMP algorithms is the significant training time required for each pruning iteration. Our paper introduces a novel \\textit{stopping criterion} for IMPs that monitors information and gradient flows b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15592","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.15592/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":"2501.15592","created_at":"2026-07-05T10:05:49.548233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15592v1","created_at":"2026-07-05T10:05:49.548233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15592","created_at":"2026-07-05T10:05:49.548233+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOXJ65IJVDUN","created_at":"2026-07-05T10:05:49.548233+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOXJ65IJVDUNMQVA","created_at":"2026-07-05T10:05:49.548233+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOXJ65IJ","created_at":"2026-07-05T10:05:49.548233+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOXJ65IJVDUNMQVAFU6GM4ZCFX","json":"https://pith.science/pith/TOXJ65IJVDUNMQVAFU6GM4ZCFX.json","graph_json":"https://pith.science/api/pith-number/TOXJ65IJVDUNMQVAFU6GM4ZCFX/graph.json","events_json":"https://pith.science/api/pith-number/TOXJ65IJVDUNMQVAFU6GM4ZCFX/events.json","paper":"https://pith.science/paper/TOXJ65IJ"},"agent_actions":{"view_html":"https://pith.science/pith/TOXJ65IJVDUNMQVAFU6GM4ZCFX","download_json":"https://pith.science/pith/TOXJ65IJVDUNMQVAFU6GM4ZCFX.json","view_paper":"https://pith.science/paper/TOXJ65IJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15592&json=true","fetch_graph":"https://pith.science/api/pith-number/TOXJ65IJVDUNMQVAFU6GM4ZCFX/graph.json","fetch_events":"https://pith.science/api/pith-number/TOXJ65IJVDUNMQVAFU6GM4ZCFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOXJ65IJVDUNMQVAFU6GM4ZCFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOXJ65IJVDUNMQVAFU6GM4ZCFX/action/storage_attestation","attest_author":"https://pith.science/pith/TOXJ65IJVDUNMQVAFU6GM4ZCFX/action/author_attestation","sign_citation":"https://pith.science/pith/TOXJ65IJVDUNMQVAFU6GM4ZCFX/action/citation_signature","submit_replication":"https://pith.science/pith/TOXJ65IJVDUNMQVAFU6GM4ZCFX/action/replication_record"}},"created_at":"2026-07-05T10:05:49.548233+00:00","updated_at":"2026-07-05T10:05:49.548233+00:00"}