{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BMMAXM2K2TXPIKZ6SXCFSEBIOM","short_pith_number":"pith:BMMAXM2K","canonical_record":{"source":{"id":"2509.04244","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NE","submitted_at":"2025-09-04T14:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"c3e44b72021c1d5bb233d4d4bb36d35195cf3528479c60c8cfa5dd940b119e02","abstract_canon_sha256":"0dd593467bf26a3c150d00c6892dbc7df35cd304e2fc6c8e23423c71c9857778"},"schema_version":"1.0"},"canonical_sha256":"0b180bb34ad4eef42b3e95c45910287337d2354c669f8c912f717148f5d8814a","source":{"kind":"arxiv","id":"2509.04244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.04244","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2509.04244v1","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04244","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"BMMAXM2K2TXP","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"BMMAXM2K2TXPIKZ6","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"BMMAXM2K","created_at":"2026-07-05T12:04:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BMMAXM2K2TXPIKZ6SXCFSEBIOM","target":"record","payload":{"canonical_record":{"source":{"id":"2509.04244","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NE","submitted_at":"2025-09-04T14:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"c3e44b72021c1d5bb233d4d4bb36d35195cf3528479c60c8cfa5dd940b119e02","abstract_canon_sha256":"0dd593467bf26a3c150d00c6892dbc7df35cd304e2fc6c8e23423c71c9857778"},"schema_version":"1.0"},"canonical_sha256":"0b180bb34ad4eef42b3e95c45910287337d2354c669f8c912f717148f5d8814a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:56.199895Z","signature_b64":"KvsosvAkvAuJz3iDoFj/kmCy1ifHSML/KeLerEKMWvCBzYpP9gPNgRtmBaY5iRFd6OFc7Fs5fuh3SRoIFQByAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b180bb34ad4eef42b3e95c45910287337d2354c669f8c912f717148f5d8814a","last_reissued_at":"2026-07-05T12:04:56.199366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:56.199366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.04244","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+QL0KX9NPOQxl7aNmFIpCwWFspB8wKKuwUHlK7NNSPdQTyZHi04troOakgQTJetsz9N7xqqanmliFkyr9GfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T22:11:56.255826Z"},"content_sha256":"eee78f43123d48cb0ae9c73968512d7f1a1625342f4c38d29b58d989a3c01cd9","schema_version":"1.0","event_id":"sha256:eee78f43123d48cb0ae9c73968512d7f1a1625342f4c38d29b58d989a3c01cd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BMMAXM2K2TXPIKZ6SXCFSEBIOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integrating Pruning with Quantization for Efficient Deep Neural Networks Compression","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ali Azarpeyvand, Babak Rokh, Sara Makenali","submitted_at":"2025-09-04T14:17:28Z","abstract_excerpt":"Deep Neural Networks (DNNs) have achieved significant advances in a wide range of applications. However, their deployment on resource-constrained devices remains a challenge due to the large number of layers and parameters, which result in considerable computational and memory demands. To address this issue, pruning and quantization are two widely used compression techniques, commonly applied individually in most studies to reduce model size and enhance processing speed. Nevertheless, combining these two techniques can yield even greater compression benefits. Effectively integrating pruning an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04244","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/2509.04244/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCPxLzojWlsszMmGmqckWLjHuTUvH/88OzBVEHPqCLdQ0thJh7E3rkn1EOiNgTBeMa1u6eamMLLwqT984onjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T22:11:56.256209Z"},"content_sha256":"36d8c023fe2f4cadd14251cf283a2ace3c3b0cde9b177ec0c88afb724460882d","schema_version":"1.0","event_id":"sha256:36d8c023fe2f4cadd14251cf283a2ace3c3b0cde9b177ec0c88afb724460882d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMMAXM2K2TXPIKZ6SXCFSEBIOM/bundle.json","state_url":"https://pith.science/pith/BMMAXM2K2TXPIKZ6SXCFSEBIOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMMAXM2K2TXPIKZ6SXCFSEBIOM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-13T22:11:56Z","links":{"resolver":"https://pith.science/pith/BMMAXM2K2TXPIKZ6SXCFSEBIOM","bundle":"https://pith.science/pith/BMMAXM2K2TXPIKZ6SXCFSEBIOM/bundle.json","state":"https://pith.science/pith/BMMAXM2K2TXPIKZ6SXCFSEBIOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMMAXM2K2TXPIKZ6SXCFSEBIOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BMMAXM2K2TXPIKZ6SXCFSEBIOM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0dd593467bf26a3c150d00c6892dbc7df35cd304e2fc6c8e23423c71c9857778","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NE","submitted_at":"2025-09-04T14:17:28Z","title_canon_sha256":"c3e44b72021c1d5bb233d4d4bb36d35195cf3528479c60c8cfa5dd940b119e02"},"schema_version":"1.0","source":{"id":"2509.04244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.04244","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2509.04244v1","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04244","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"BMMAXM2K2TXP","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"BMMAXM2K2TXPIKZ6","created_at":"2026-07-05T12:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"BMMAXM2K","created_at":"2026-07-05T12:04:56Z"}],"graph_snapshots":[{"event_id":"sha256:36d8c023fe2f4cadd14251cf283a2ace3c3b0cde9b177ec0c88afb724460882d","target":"graph","created_at":"2026-07-05T12:04:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.04244/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep Neural Networks (DNNs) have achieved significant advances in a wide range of applications. However, their deployment on resource-constrained devices remains a challenge due to the large number of layers and parameters, which result in considerable computational and memory demands. To address this issue, pruning and quantization are two widely used compression techniques, commonly applied individually in most studies to reduce model size and enhance processing speed. Nevertheless, combining these two techniques can yield even greater compression benefits. Effectively integrating pruning an","authors_text":"Ali Azarpeyvand, Babak Rokh, Sara Makenali","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NE","submitted_at":"2025-09-04T14:17:28Z","title":"Integrating Pruning with Quantization for Efficient Deep Neural Networks Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04244","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eee78f43123d48cb0ae9c73968512d7f1a1625342f4c38d29b58d989a3c01cd9","target":"record","created_at":"2026-07-05T12:04:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0dd593467bf26a3c150d00c6892dbc7df35cd304e2fc6c8e23423c71c9857778","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NE","submitted_at":"2025-09-04T14:17:28Z","title_canon_sha256":"c3e44b72021c1d5bb233d4d4bb36d35195cf3528479c60c8cfa5dd940b119e02"},"schema_version":"1.0","source":{"id":"2509.04244","kind":"arxiv","version":1}},"canonical_sha256":"0b180bb34ad4eef42b3e95c45910287337d2354c669f8c912f717148f5d8814a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b180bb34ad4eef42b3e95c45910287337d2354c669f8c912f717148f5d8814a","first_computed_at":"2026-07-05T12:04:56.199366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:04:56.199366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KvsosvAkvAuJz3iDoFj/kmCy1ifHSML/KeLerEKMWvCBzYpP9gPNgRtmBaY5iRFd6OFc7Fs5fuh3SRoIFQByAA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:04:56.199895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.04244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eee78f43123d48cb0ae9c73968512d7f1a1625342f4c38d29b58d989a3c01cd9","sha256:36d8c023fe2f4cadd14251cf283a2ace3c3b0cde9b177ec0c88afb724460882d"],"state_sha256":"844a2b8fafe0a00aa24a2ae0b2dfd18b713f2f188727a1b3fc4dd95ce25d1846"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5dWk/ORglpynYVj5ckoEZ+Ld9tS3t17PjPZ9RbgCiabNQ/kZrnXTQyYE9+sb+LnGYkKmkqyB0Mf/UTqVhho8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T22:11:56.258420Z","bundle_sha256":"cf12a543c4d804b2707c2f3a459e8268bc0058298b2c86ccc68ce6bc5dff87cd"}}