{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YPVL5ODCS645CM3L3ODHKR6EVZ","short_pith_number":"pith:YPVL5ODC","canonical_record":{"source":{"id":"2508.02291","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-04T10:59:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"21be8ed0cfd9783340f950c87ff111456993650945992d880181dcb070f28306","abstract_canon_sha256":"86a2aaad1190d0fc2e377dbdea0eb12244aa01be9b7e6583c53f196b562e42d8"},"schema_version":"1.0"},"canonical_sha256":"c3eabeb86297b9d1336bdb867547c4ae76951d284a2971cde7d257ad09b54c1c","source":{"kind":"arxiv","id":"2508.02291","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.02291","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2508.02291v3","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02291","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"YPVL5ODCS645","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"YPVL5ODCS645CM3L","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"YPVL5ODC","created_at":"2026-05-21T01:05:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YPVL5ODCS645CM3L3ODHKR6EVZ","target":"record","payload":{"canonical_record":{"source":{"id":"2508.02291","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-04T10:59:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"21be8ed0cfd9783340f950c87ff111456993650945992d880181dcb070f28306","abstract_canon_sha256":"86a2aaad1190d0fc2e377dbdea0eb12244aa01be9b7e6583c53f196b562e42d8"},"schema_version":"1.0"},"canonical_sha256":"c3eabeb86297b9d1336bdb867547c4ae76951d284a2971cde7d257ad09b54c1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:07.437717Z","signature_b64":"WQqAwzq/L2PGqDgRoCqnXPeuvriI9tARYTOABR6PrdQLotPwPbxX1sKfE6VOE+TwRixHAibfE+3z4dweDCcuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3eabeb86297b9d1336bdb867547c4ae76951d284a2971cde7d257ad09b54c1c","last_reissued_at":"2026-05-21T01:05:07.436881Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:07.436881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.02291","source_version":3,"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-05-21T01:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+CWwb6E4laFuqkj4tK1FVsSpc5GMhDuZ+vrs0X2hxGtoNMfqiZnV6/lo8reoYWe9RQntpHVunWas4shtejpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:00:55.809280Z"},"content_sha256":"4a86c8d6c721223dc79ee2936b893b19e442dab247844a284c78a360beff6c3a","schema_version":"1.0","event_id":"sha256:4a86c8d6c721223dc79ee2936b893b19e442dab247844a284c78a360beff6c3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YPVL5ODCS645CM3L3ODHKR6EVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FAIR-Pruner: A Flexible Framework for Automatic Layer-Wise Pruning via Tolerance of Difference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bingyi Jing, Chengyao Yu, Chenqing Lin, Kim Khoa Nguyen, Mohamed Cheriet, Mostafa Hussien, Ruixing Ming","submitted_at":"2025-08-04T10:59:07Z","abstract_excerpt":"Structured pruning is a standard tool for compressing deep neural networks, but its practical performance depends on how sparsity is allocated across layers. We propose FAIR-Pruner, a search-free framework for adaptive layer-wise structured pruning. FAIR-Pruner uses two within-layer rankings: a removal-oriented signal that proposes candidate units and a protection-oriented signal that identifies task-sensitive units. Its core component, Tolerance of Difference (ToD), measures the overlap between the removal prefix and the protected tail, and uses a shared tolerance level to induce non-uniform "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02291","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/2508.02291/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-05-21T01:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBMNt5kPLt4H9vjMbvM5liiNZHT0dMogOuGf12gD243Cy3uXCEfjLMQq001oMMuh+9X8rLHx/lYXywj8OZ8EDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:00:55.809662Z"},"content_sha256":"9eef6e6267ff916d8e7054cd1cd48628712074628531d83e6bf92e9ba4088a6d","schema_version":"1.0","event_id":"sha256:9eef6e6267ff916d8e7054cd1cd48628712074628531d83e6bf92e9ba4088a6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPVL5ODCS645CM3L3ODHKR6EVZ/bundle.json","state_url":"https://pith.science/pith/YPVL5ODCS645CM3L3ODHKR6EVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPVL5ODCS645CM3L3ODHKR6EVZ/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-06-03T00:00:55Z","links":{"resolver":"https://pith.science/pith/YPVL5ODCS645CM3L3ODHKR6EVZ","bundle":"https://pith.science/pith/YPVL5ODCS645CM3L3ODHKR6EVZ/bundle.json","state":"https://pith.science/pith/YPVL5ODCS645CM3L3ODHKR6EVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPVL5ODCS645CM3L3ODHKR6EVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YPVL5ODCS645CM3L3ODHKR6EVZ","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":"86a2aaad1190d0fc2e377dbdea0eb12244aa01be9b7e6583c53f196b562e42d8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-04T10:59:07Z","title_canon_sha256":"21be8ed0cfd9783340f950c87ff111456993650945992d880181dcb070f28306"},"schema_version":"1.0","source":{"id":"2508.02291","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.02291","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2508.02291v3","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02291","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"YPVL5ODCS645","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"YPVL5ODCS645CM3L","created_at":"2026-05-21T01:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"YPVL5ODC","created_at":"2026-05-21T01:05:07Z"}],"graph_snapshots":[{"event_id":"sha256:9eef6e6267ff916d8e7054cd1cd48628712074628531d83e6bf92e9ba4088a6d","target":"graph","created_at":"2026-05-21T01:05:07Z","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/2508.02291/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Structured pruning is a standard tool for compressing deep neural networks, but its practical performance depends on how sparsity is allocated across layers. We propose FAIR-Pruner, a search-free framework for adaptive layer-wise structured pruning. FAIR-Pruner uses two within-layer rankings: a removal-oriented signal that proposes candidate units and a protection-oriented signal that identifies task-sensitive units. Its core component, Tolerance of Difference (ToD), measures the overlap between the removal prefix and the protected tail, and uses a shared tolerance level to induce non-uniform ","authors_text":"Bingyi Jing, Chengyao Yu, Chenqing Lin, Kim Khoa Nguyen, Mohamed Cheriet, Mostafa Hussien, Ruixing Ming","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-04T10:59:07Z","title":"FAIR-Pruner: A Flexible Framework for Automatic Layer-Wise Pruning via Tolerance of Difference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02291","kind":"arxiv","version":3},"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:4a86c8d6c721223dc79ee2936b893b19e442dab247844a284c78a360beff6c3a","target":"record","created_at":"2026-05-21T01:05:07Z","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":"86a2aaad1190d0fc2e377dbdea0eb12244aa01be9b7e6583c53f196b562e42d8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-04T10:59:07Z","title_canon_sha256":"21be8ed0cfd9783340f950c87ff111456993650945992d880181dcb070f28306"},"schema_version":"1.0","source":{"id":"2508.02291","kind":"arxiv","version":3}},"canonical_sha256":"c3eabeb86297b9d1336bdb867547c4ae76951d284a2971cde7d257ad09b54c1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3eabeb86297b9d1336bdb867547c4ae76951d284a2971cde7d257ad09b54c1c","first_computed_at":"2026-05-21T01:05:07.436881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:07.436881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WQqAwzq/L2PGqDgRoCqnXPeuvriI9tARYTOABR6PrdQLotPwPbxX1sKfE6VOE+TwRixHAibfE+3z4dweDCcuDg==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:07.437717Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.02291","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a86c8d6c721223dc79ee2936b893b19e442dab247844a284c78a360beff6c3a","sha256:9eef6e6267ff916d8e7054cd1cd48628712074628531d83e6bf92e9ba4088a6d"],"state_sha256":"f33bf1012c1b59fbf2edd4d5a5fc3e5881401baab83bc233f71daf7d664bcd79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brwyHBxhNsHJnYXbygGwiyRCHM0VBze1gt8Awf4z1kepVroJ2BpJu6441AkZ5jbND3nQGPVb5pnutTTVns/aCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:00:55.811629Z","bundle_sha256":"334283f00838e629bffbc0d7c2e48feb26e2dad7bdce211ac09e66e2f115f246"}}