{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:46VRBTNQZNFY5GN7W5WGE5DHEK","short_pith_number":"pith:46VRBTNQ","canonical_record":{"source":{"id":"2411.12781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-11-19T08:42:15Z","cross_cats_sorted":[],"title_canon_sha256":"ae5a2b954a3ad404cc38bae096725c73c7a83d17c8474b8e6940a7a75a2c0ed3","abstract_canon_sha256":"a33be1315868c5464f387928b1d5d3cd125e6f5fb07f44c04511291de4ad8907"},"schema_version":"1.0"},"canonical_sha256":"e7ab10cdb0cb4b8e99bfb76c62746722bf3085848c7fee368ea95473ed9f6821","source":{"kind":"arxiv","id":"2411.12781","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12781","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12781v1","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12781","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"pith_short_12","alias_value":"46VRBTNQZNFY","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"pith_short_16","alias_value":"46VRBTNQZNFY5GN7","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"pith_short_8","alias_value":"46VRBTNQ","created_at":"2026-07-05T09:38:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:46VRBTNQZNFY5GN7W5WGE5DHEK","target":"record","payload":{"canonical_record":{"source":{"id":"2411.12781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-11-19T08:42:15Z","cross_cats_sorted":[],"title_canon_sha256":"ae5a2b954a3ad404cc38bae096725c73c7a83d17c8474b8e6940a7a75a2c0ed3","abstract_canon_sha256":"a33be1315868c5464f387928b1d5d3cd125e6f5fb07f44c04511291de4ad8907"},"schema_version":"1.0"},"canonical_sha256":"e7ab10cdb0cb4b8e99bfb76c62746722bf3085848c7fee368ea95473ed9f6821","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:00.336803Z","signature_b64":"xd7MJIvCDBHrPuHmR/Y0L7DNLT2QmurbWJF/KT3GuAmeVenuTU/mcaAMNPwoxX9/DTqHPWH1/XjCJWbRotK6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7ab10cdb0cb4b8e99bfb76c62746722bf3085848c7fee368ea95473ed9f6821","last_reissued_at":"2026-07-05T09:38:00.336397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:00.336397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.12781","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-05T09:38:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmkFiiyZ/lHboFvLFtXgAcCG07IfYU/lp2SUiJdxEDkYnCTIHw6ADKzF2WqXz88DprwadmHzNfGWXnrpwR2lCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:53:52.097194Z"},"content_sha256":"c1bb91bed65f6595e838342e3351136185d1f9b23a7c8e7e2f10af8dd16ccb4d","schema_version":"1.0","event_id":"sha256:c1bb91bed65f6595e838342e3351136185d1f9b23a7c8e7e2f10af8dd16ccb4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:46VRBTNQZNFY5GN7W5WGE5DHEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FGP: Feature-Gradient-Prune for Efficient Convolutional Layer Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jiajun Bu, Jiasheng Sun, Jie Song, Liangcheng Li, Qingsong Lv, Sheng Zhou, Sun Qiao, Xu Zhang, Yun Gao","submitted_at":"2024-11-19T08:42:15Z","abstract_excerpt":"To reduce computational overhead while maintaining model performance, model pruning techniques have been proposed. Among these, structured pruning, which removes entire convolutional channels or layers, significantly enhances computational efficiency and is compatible with hardware acceleration. However, existing pruning methods that rely solely on image features or gradients often result in the retention of redundant channels, negatively impacting inference efficiency. To address this issue, this paper introduces a novel pruning method called Feature-Gradient Pruning (FGP). This approach inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12781","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/2411.12781/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-05T09:38:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOyoaA0SQH/n7MbmsIhP6SbAak95Zmq9Hwa8CPEsqF/RsqDXj3W1cnnxdYy0ORnO5qUKJNCi+rs9fXsVWm1SCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:53:52.097730Z"},"content_sha256":"dea58342c5709176c719c99f498318310c41acb6b8591728e6c60ebbabd7da23","schema_version":"1.0","event_id":"sha256:dea58342c5709176c719c99f498318310c41acb6b8591728e6c60ebbabd7da23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46VRBTNQZNFY5GN7W5WGE5DHEK/bundle.json","state_url":"https://pith.science/pith/46VRBTNQZNFY5GN7W5WGE5DHEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46VRBTNQZNFY5GN7W5WGE5DHEK/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-08-22T19:53:52Z","links":{"resolver":"https://pith.science/pith/46VRBTNQZNFY5GN7W5WGE5DHEK","bundle":"https://pith.science/pith/46VRBTNQZNFY5GN7W5WGE5DHEK/bundle.json","state":"https://pith.science/pith/46VRBTNQZNFY5GN7W5WGE5DHEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46VRBTNQZNFY5GN7W5WGE5DHEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:46VRBTNQZNFY5GN7W5WGE5DHEK","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":"a33be1315868c5464f387928b1d5d3cd125e6f5fb07f44c04511291de4ad8907","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-11-19T08:42:15Z","title_canon_sha256":"ae5a2b954a3ad404cc38bae096725c73c7a83d17c8474b8e6940a7a75a2c0ed3"},"schema_version":"1.0","source":{"id":"2411.12781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12781","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12781v1","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12781","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"pith_short_12","alias_value":"46VRBTNQZNFY","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"pith_short_16","alias_value":"46VRBTNQZNFY5GN7","created_at":"2026-07-05T09:38:00Z"},{"alias_kind":"pith_short_8","alias_value":"46VRBTNQ","created_at":"2026-07-05T09:38:00Z"}],"graph_snapshots":[{"event_id":"sha256:dea58342c5709176c719c99f498318310c41acb6b8591728e6c60ebbabd7da23","target":"graph","created_at":"2026-07-05T09:38:00Z","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/2411.12781/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To reduce computational overhead while maintaining model performance, model pruning techniques have been proposed. Among these, structured pruning, which removes entire convolutional channels or layers, significantly enhances computational efficiency and is compatible with hardware acceleration. However, existing pruning methods that rely solely on image features or gradients often result in the retention of redundant channels, negatively impacting inference efficiency. To address this issue, this paper introduces a novel pruning method called Feature-Gradient Pruning (FGP). This approach inte","authors_text":"Jiajun Bu, Jiasheng Sun, Jie Song, Liangcheng Li, Qingsong Lv, Sheng Zhou, Sun Qiao, Xu Zhang, Yun Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-11-19T08:42:15Z","title":"FGP: Feature-Gradient-Prune for Efficient Convolutional Layer Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12781","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:c1bb91bed65f6595e838342e3351136185d1f9b23a7c8e7e2f10af8dd16ccb4d","target":"record","created_at":"2026-07-05T09:38:00Z","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":"a33be1315868c5464f387928b1d5d3cd125e6f5fb07f44c04511291de4ad8907","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-11-19T08:42:15Z","title_canon_sha256":"ae5a2b954a3ad404cc38bae096725c73c7a83d17c8474b8e6940a7a75a2c0ed3"},"schema_version":"1.0","source":{"id":"2411.12781","kind":"arxiv","version":1}},"canonical_sha256":"e7ab10cdb0cb4b8e99bfb76c62746722bf3085848c7fee368ea95473ed9f6821","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7ab10cdb0cb4b8e99bfb76c62746722bf3085848c7fee368ea95473ed9f6821","first_computed_at":"2026-07-05T09:38:00.336397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:00.336397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xd7MJIvCDBHrPuHmR/Y0L7DNLT2QmurbWJF/KT3GuAmeVenuTU/mcaAMNPwoxX9/DTqHPWH1/XjCJWbRotK6BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:00.336803Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.12781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1bb91bed65f6595e838342e3351136185d1f9b23a7c8e7e2f10af8dd16ccb4d","sha256:dea58342c5709176c719c99f498318310c41acb6b8591728e6c60ebbabd7da23"],"state_sha256":"b53ac7efb74421b4dad32e7e502a7d0dafea02fa3196b69868de378cb22dab7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qukarJ7r7HVKw2ASc9pmSQbHPQAbbgx9wDTHwMSh75x4jjT/esW8WrMLzSbV6Xr+3aNIEexjBZhSR5h+MvIYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T19:53:52.102891Z","bundle_sha256":"8f37b2e5455f7ac36eb7c046dd19378138d5b24cba787e5e2825d4189557bb75"}}