{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LLHQLKS7U6O7SU4ICVKCDRRWC4","short_pith_number":"pith:LLHQLKS7","schema_version":"1.0","canonical_sha256":"5acf05aa5fa79df95388155421c6361718db0d369644d4472536600ded76e5dd","source":{"kind":"arxiv","id":"2204.01640","version":2},"attestation_state":"computed","paper":{"title":"APP: Anytime Progressive Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Bharat Runwal, Diganta Misra, Irina Rish, Tianlong Chen, Zhangyang Wang","submitted_at":"2022-04-04T16:38:55Z","abstract_excerpt":"With the latest advances in deep learning, there has been a lot of focus on the online learning paradigm due to its relevance in practical settings. Although many methods have been investigated for optimal learning settings in scenarios where the data stream is continuous over time, sparse networks training in such settings have often been overlooked. In this paper, we explore the problem of training a neural network with a target sparsity in a particular case of online learning: the anytime learning at macroscale paradigm (ALMA). We propose a novel way of progressive pruning, referred to as \\"},"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":"2204.01640","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T16:38:55Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"bb4c2a69c48fa53c56a77fb33e636ca7207834509b18e80c5feb32e7b3ae4796","abstract_canon_sha256":"3aac1b04f8f8531fa7d7896ce91f7d8d2a6a9ddbd568fb9fe67ee6849355482b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:31.347742Z","signature_b64":"4U/gsBkLP2KKjFxIU6qU56cj2BZnCOE1Xf/32sO9XL5dmibz5sgv9jqCz/ECKGdplCPZy/7MWa5FOyUDdlPRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5acf05aa5fa79df95388155421c6361718db0d369644d4472536600ded76e5dd","last_reissued_at":"2026-07-05T04:28:31.347269Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:31.347269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"APP: Anytime Progressive Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Bharat Runwal, Diganta Misra, Irina Rish, Tianlong Chen, Zhangyang Wang","submitted_at":"2022-04-04T16:38:55Z","abstract_excerpt":"With the latest advances in deep learning, there has been a lot of focus on the online learning paradigm due to its relevance in practical settings. Although many methods have been investigated for optimal learning settings in scenarios where the data stream is continuous over time, sparse networks training in such settings have often been overlooked. In this paper, we explore the problem of training a neural network with a target sparsity in a particular case of online learning: the anytime learning at macroscale paradigm (ALMA). We propose a novel way of progressive pruning, referred to as \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.01640","kind":"arxiv","version":2},"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/2204.01640/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":"2204.01640","created_at":"2026-07-05T04:28:31.347343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.01640v2","created_at":"2026-07-05T04:28:31.347343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.01640","created_at":"2026-07-05T04:28:31.347343+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLHQLKS7U6O7","created_at":"2026-07-05T04:28:31.347343+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLHQLKS7U6O7SU4I","created_at":"2026-07-05T04:28:31.347343+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLHQLKS7","created_at":"2026-07-05T04:28:31.347343+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16136","citing_title":"SDBench: A Comprehensive Benchmark Suite for Speaker Diarization","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLHQLKS7U6O7SU4ICVKCDRRWC4","json":"https://pith.science/pith/LLHQLKS7U6O7SU4ICVKCDRRWC4.json","graph_json":"https://pith.science/api/pith-number/LLHQLKS7U6O7SU4ICVKCDRRWC4/graph.json","events_json":"https://pith.science/api/pith-number/LLHQLKS7U6O7SU4ICVKCDRRWC4/events.json","paper":"https://pith.science/paper/LLHQLKS7"},"agent_actions":{"view_html":"https://pith.science/pith/LLHQLKS7U6O7SU4ICVKCDRRWC4","download_json":"https://pith.science/pith/LLHQLKS7U6O7SU4ICVKCDRRWC4.json","view_paper":"https://pith.science/paper/LLHQLKS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.01640&json=true","fetch_graph":"https://pith.science/api/pith-number/LLHQLKS7U6O7SU4ICVKCDRRWC4/graph.json","fetch_events":"https://pith.science/api/pith-number/LLHQLKS7U6O7SU4ICVKCDRRWC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLHQLKS7U6O7SU4ICVKCDRRWC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLHQLKS7U6O7SU4ICVKCDRRWC4/action/storage_attestation","attest_author":"https://pith.science/pith/LLHQLKS7U6O7SU4ICVKCDRRWC4/action/author_attestation","sign_citation":"https://pith.science/pith/LLHQLKS7U6O7SU4ICVKCDRRWC4/action/citation_signature","submit_replication":"https://pith.science/pith/LLHQLKS7U6O7SU4ICVKCDRRWC4/action/replication_record"}},"created_at":"2026-07-05T04:28:31.347343+00:00","updated_at":"2026-07-05T04:28:31.347343+00:00"}