{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6VWWGGE4R3CZKZVQDC4AGW4LDV","short_pith_number":"pith:6VWWGGE4","schema_version":"1.0","canonical_sha256":"f56d63189c8ec59566b018b8035b8b1d437bd5eeed5b163b3a3983e74e0c037f","source":{"kind":"arxiv","id":"2301.13142","version":2},"attestation_state":"computed","paper":{"title":"Self-Compressing Neural Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"James Imber, Szabolcs Cs\\'efalvay","submitted_at":"2023-01-30T18:22:28Z","abstract_excerpt":"This work focuses on reducing neural network size, which is a major driver of neural network execution time, power consumption, bandwidth, and memory footprint. A key challenge is to reduce size in a manner that can be exploited readily for efficient training and inference without the need for specialized hardware. We propose Self-Compression: a simple, general method that simultaneously achieves two goals: (1) removing redundant weights, and (2) reducing the number of bits required to represent the remaining weights. This is achieved using a generalized loss function to minimize overall netwo"},"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":"2301.13142","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-30T18:22:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"18f94f46fc520c7fc908b86d17e320dc44d35a53c54614e528a7d3967a63358a","abstract_canon_sha256":"a512c87a7b31c668c8f191128bfbed9c51bf7cc3886bb8352b8b57a91b6ec0c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:27.734296Z","signature_b64":"CX6l4cCrdGu1Ty2NJL15wUb+xZjouEec+DYrFhS6SaAE/LfUcqGB54tLxxFAd/oR8dVfj3hEhqwwWlTRT28tBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f56d63189c8ec59566b018b8035b8b1d437bd5eeed5b163b3a3983e74e0c037f","last_reissued_at":"2026-07-05T11:22:27.733785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:27.733785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Compressing Neural Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"James Imber, Szabolcs Cs\\'efalvay","submitted_at":"2023-01-30T18:22:28Z","abstract_excerpt":"This work focuses on reducing neural network size, which is a major driver of neural network execution time, power consumption, bandwidth, and memory footprint. A key challenge is to reduce size in a manner that can be exploited readily for efficient training and inference without the need for specialized hardware. We propose Self-Compression: a simple, general method that simultaneously achieves two goals: (1) removing redundant weights, and (2) reducing the number of bits required to represent the remaining weights. This is achieved using a generalized loss function to minimize overall netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.13142","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/2301.13142/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":"2301.13142","created_at":"2026-07-05T11:22:27.733862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.13142v2","created_at":"2026-07-05T11:22:27.733862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.13142","created_at":"2026-07-05T11:22:27.733862+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VWWGGE4R3CZ","created_at":"2026-07-05T11:22:27.733862+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VWWGGE4R3CZKZVQ","created_at":"2026-07-05T11:22:27.733862+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VWWGGE4","created_at":"2026-07-05T11:22:27.733862+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.00350","citing_title":"Optimizing Deep Neural Networks using Safety-Guided Self Compression","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6VWWGGE4R3CZKZVQDC4AGW4LDV","json":"https://pith.science/pith/6VWWGGE4R3CZKZVQDC4AGW4LDV.json","graph_json":"https://pith.science/api/pith-number/6VWWGGE4R3CZKZVQDC4AGW4LDV/graph.json","events_json":"https://pith.science/api/pith-number/6VWWGGE4R3CZKZVQDC4AGW4LDV/events.json","paper":"https://pith.science/paper/6VWWGGE4"},"agent_actions":{"view_html":"https://pith.science/pith/6VWWGGE4R3CZKZVQDC4AGW4LDV","download_json":"https://pith.science/pith/6VWWGGE4R3CZKZVQDC4AGW4LDV.json","view_paper":"https://pith.science/paper/6VWWGGE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.13142&json=true","fetch_graph":"https://pith.science/api/pith-number/6VWWGGE4R3CZKZVQDC4AGW4LDV/graph.json","fetch_events":"https://pith.science/api/pith-number/6VWWGGE4R3CZKZVQDC4AGW4LDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VWWGGE4R3CZKZVQDC4AGW4LDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VWWGGE4R3CZKZVQDC4AGW4LDV/action/storage_attestation","attest_author":"https://pith.science/pith/6VWWGGE4R3CZKZVQDC4AGW4LDV/action/author_attestation","sign_citation":"https://pith.science/pith/6VWWGGE4R3CZKZVQDC4AGW4LDV/action/citation_signature","submit_replication":"https://pith.science/pith/6VWWGGE4R3CZKZVQDC4AGW4LDV/action/replication_record"}},"created_at":"2026-07-05T11:22:27.733862+00:00","updated_at":"2026-07-05T11:22:27.733862+00:00"}