{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LOXL4ZGG2TYU23Z3UK7D22SZE2","short_pith_number":"pith:LOXL4ZGG","schema_version":"1.0","canonical_sha256":"5baebe64c6d4f14d6f3ba2be3d6a592682024fe261934878034456cc9740c959","source":{"kind":"arxiv","id":"1911.11134","version":3},"attestation_state":"computed","paper":{"title":"Rigging the Lottery: Making All Tickets Winners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Erich Elsen, Jacob Menick, Pablo Samuel Castro, Trevor Gale, Utku Evci","submitted_at":"2019-11-25T18:58:53Z","abstract_excerpt":"Many applications require sparse neural networks due to space or inference time restrictions. There is a large body of work on training dense networks to yield sparse networks for inference, but this limits the size of the largest trainable sparse model to that of the largest trainable dense model. In this paper we introduce a method to train sparse neural networks with a fixed parameter count and a fixed computational cost throughout training, without sacrificing accuracy relative to existing dense-to-sparse training methods. Our method updates the topology of the sparse network during traini"},"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":"1911.11134","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-11-25T18:58:53Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"1820b113a4dd63baac03907246ac6a7cd6fcc7314a331e7288d970d3d8e49d8c","abstract_canon_sha256":"5ef7d9446f481c08317978e203b7d0490b63af8e01c8c5a33075a66b5e9a8077"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:05.965068Z","signature_b64":"64nhy7pUZcoDBM38pZtvxjZWgqiBJmdtQrb+yRoS0lJFi1yy1fGFlsng3LnkfWuRkgGAojxfjiZ4TT9y+SIvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5baebe64c6d4f14d6f3ba2be3d6a592682024fe261934878034456cc9740c959","last_reissued_at":"2026-07-05T03:00:05.964518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:05.964518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rigging the Lottery: Making All Tickets Winners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Erich Elsen, Jacob Menick, Pablo Samuel Castro, Trevor Gale, Utku Evci","submitted_at":"2019-11-25T18:58:53Z","abstract_excerpt":"Many applications require sparse neural networks due to space or inference time restrictions. There is a large body of work on training dense networks to yield sparse networks for inference, but this limits the size of the largest trainable sparse model to that of the largest trainable dense model. In this paper we introduce a method to train sparse neural networks with a fixed parameter count and a fixed computational cost throughout training, without sacrificing accuracy relative to existing dense-to-sparse training methods. Our method updates the topology of the sparse network during traini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.11134","kind":"arxiv","version":3},"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/1911.11134/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":"1911.11134","created_at":"2026-07-05T03:00:05.964578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.11134v3","created_at":"2026-07-05T03:00:05.964578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.11134","created_at":"2026-07-05T03:00:05.964578+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOXL4ZGG2TYU","created_at":"2026-07-05T03:00:05.964578+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOXL4ZGG2TYU23Z3","created_at":"2026-07-05T03:00:05.964578+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOXL4ZGG","created_at":"2026-07-05T03:00:05.964578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00170","citing_title":"Scaling Up Thermodynamic AI Models","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2602.23405","citing_title":"Isotropic Activation Functions Enable Deindividuated Neurons and Adaptive Topologies","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13278","citing_title":"DroneScan-YOLO: Redundancy-Aware Lightweight Detection for Tiny Objects in UAV Imagery","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LOXL4ZGG2TYU23Z3UK7D22SZE2","json":"https://pith.science/pith/LOXL4ZGG2TYU23Z3UK7D22SZE2.json","graph_json":"https://pith.science/api/pith-number/LOXL4ZGG2TYU23Z3UK7D22SZE2/graph.json","events_json":"https://pith.science/api/pith-number/LOXL4ZGG2TYU23Z3UK7D22SZE2/events.json","paper":"https://pith.science/paper/LOXL4ZGG"},"agent_actions":{"view_html":"https://pith.science/pith/LOXL4ZGG2TYU23Z3UK7D22SZE2","download_json":"https://pith.science/pith/LOXL4ZGG2TYU23Z3UK7D22SZE2.json","view_paper":"https://pith.science/paper/LOXL4ZGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.11134&json=true","fetch_graph":"https://pith.science/api/pith-number/LOXL4ZGG2TYU23Z3UK7D22SZE2/graph.json","fetch_events":"https://pith.science/api/pith-number/LOXL4ZGG2TYU23Z3UK7D22SZE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOXL4ZGG2TYU23Z3UK7D22SZE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOXL4ZGG2TYU23Z3UK7D22SZE2/action/storage_attestation","attest_author":"https://pith.science/pith/LOXL4ZGG2TYU23Z3UK7D22SZE2/action/author_attestation","sign_citation":"https://pith.science/pith/LOXL4ZGG2TYU23Z3UK7D22SZE2/action/citation_signature","submit_replication":"https://pith.science/pith/LOXL4ZGG2TYU23Z3UK7D22SZE2/action/replication_record"}},"created_at":"2026-07-05T03:00:05.964578+00:00","updated_at":"2026-07-05T03:00:05.964578+00:00"}