{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:O2DBMEWT276YAIEKWD3Y3IBTDP","short_pith_number":"pith:O2DBMEWT","schema_version":"1.0","canonical_sha256":"76861612d3d7fd80208ab0f78da0331bf46c2032ac66257614fa384484bcd714","source":{"kind":"arxiv","id":"2306.07030","version":1},"attestation_state":"computed","paper":{"title":"Resource Efficient Neural Networks Using Hessian Based Pruning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Jack Chong, Lihui Chen, Manas Gupta","submitted_at":"2023-06-12T11:09:16Z","abstract_excerpt":"Neural network pruning is a practical way for reducing the size of trained models and the number of floating-point operations. One way of pruning is to use the relative Hessian trace to calculate sensitivity of each channel, as compared to the more common magnitude pruning approach. However, the stochastic approach used to estimate the Hessian trace needs to iterate over many times before it can converge. This can be time-consuming when used for larger models with many millions of parameters. To address this problem, we modify the existing approach by estimating the Hessian trace using FP16 pr"},"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":"2306.07030","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2023-06-12T11:09:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2752a2df435c149d2ea31cdfe2ea2ca7417eca0bbdde291b58ed497867ad981d","abstract_canon_sha256":"20a7cba7fbf1a2804bb8cbd1c0724d1abe30a9e15261b7c2ac68ccb2e9c869b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:46.831649Z","signature_b64":"6qLVFS6PkaC5Ifmex0yRvmIyN8OrH4B0+0xGC0T2SNyRHDGe/KcyxKFHWOngoA0joywbHddASQ2VH+eYbaVjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76861612d3d7fd80208ab0f78da0331bf46c2032ac66257614fa384484bcd714","last_reissued_at":"2026-07-05T06:19:46.831252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:46.831252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Efficient Neural Networks Using Hessian Based Pruning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Jack Chong, Lihui Chen, Manas Gupta","submitted_at":"2023-06-12T11:09:16Z","abstract_excerpt":"Neural network pruning is a practical way for reducing the size of trained models and the number of floating-point operations. One way of pruning is to use the relative Hessian trace to calculate sensitivity of each channel, as compared to the more common magnitude pruning approach. However, the stochastic approach used to estimate the Hessian trace needs to iterate over many times before it can converge. This can be time-consuming when used for larger models with many millions of parameters. To address this problem, we modify the existing approach by estimating the Hessian trace using FP16 pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07030","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/2306.07030/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":"2306.07030","created_at":"2026-07-05T06:19:46.831324+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.07030v1","created_at":"2026-07-05T06:19:46.831324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07030","created_at":"2026-07-05T06:19:46.831324+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2DBMEWT276Y","created_at":"2026-07-05T06:19:46.831324+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2DBMEWT276YAIEK","created_at":"2026-07-05T06:19:46.831324+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2DBMEWT","created_at":"2026-07-05T06:19:46.831324+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.13296","citing_title":"Enhanced Pruning Strategy for Multi-Component Neural Architectures Using Component-Aware Graph Analysis","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O2DBMEWT276YAIEKWD3Y3IBTDP","json":"https://pith.science/pith/O2DBMEWT276YAIEKWD3Y3IBTDP.json","graph_json":"https://pith.science/api/pith-number/O2DBMEWT276YAIEKWD3Y3IBTDP/graph.json","events_json":"https://pith.science/api/pith-number/O2DBMEWT276YAIEKWD3Y3IBTDP/events.json","paper":"https://pith.science/paper/O2DBMEWT"},"agent_actions":{"view_html":"https://pith.science/pith/O2DBMEWT276YAIEKWD3Y3IBTDP","download_json":"https://pith.science/pith/O2DBMEWT276YAIEKWD3Y3IBTDP.json","view_paper":"https://pith.science/paper/O2DBMEWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.07030&json=true","fetch_graph":"https://pith.science/api/pith-number/O2DBMEWT276YAIEKWD3Y3IBTDP/graph.json","fetch_events":"https://pith.science/api/pith-number/O2DBMEWT276YAIEKWD3Y3IBTDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2DBMEWT276YAIEKWD3Y3IBTDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2DBMEWT276YAIEKWD3Y3IBTDP/action/storage_attestation","attest_author":"https://pith.science/pith/O2DBMEWT276YAIEKWD3Y3IBTDP/action/author_attestation","sign_citation":"https://pith.science/pith/O2DBMEWT276YAIEKWD3Y3IBTDP/action/citation_signature","submit_replication":"https://pith.science/pith/O2DBMEWT276YAIEKWD3Y3IBTDP/action/replication_record"}},"created_at":"2026-07-05T06:19:46.831324+00:00","updated_at":"2026-07-05T06:19:46.831324+00:00"}