{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:H4M5ATPS2ADR2MLGRX6GMH5PAY","short_pith_number":"pith:H4M5ATPS","schema_version":"1.0","canonical_sha256":"3f19d04df2d0071d31668dfc661faf0621a142cb26d9338281a15e7f49b5ca9d","source":{"kind":"arxiv","id":"2404.13648","version":1},"attestation_state":"computed","paper":{"title":"Data-independent Module-aware Pruning for Hierarchical Vision Transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Joey Tianyi Zhou, Yang He","submitted_at":"2024-04-21T12:50:38Z","abstract_excerpt":"Hierarchical vision transformers (ViTs) have two advantages over conventional ViTs. First, hierarchical ViTs achieve linear computational complexity with respect to image size by local self-attention. Second, hierarchical ViTs create hierarchical feature maps by merging image patches in deeper layers for dense prediction. However, existing pruning methods ignore the unique properties of hierarchical ViTs and use the magnitude value as the weight importance. This approach leads to two main drawbacks. First, the \"local\" attention weights are compared at a \"global\" level, which may cause some \"lo"},"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":"2404.13648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-04-21T12:50:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bae9bd01adc338ac3dfcbedf53d81dbe011089fc27684c7442357adaee90ba98","abstract_canon_sha256":"2a34fa402bac53ecf97a85c45abbe37091456dca98db9f99e08adae524ea3e26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:35.416096Z","signature_b64":"MZJzSTGmuNvxbzhQIIAAHkk0dyRiNJX3pD1Avz3OEc49rQXvTtQzDSXE/CvEwbED3k8paLlU187dDit1+gKiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f19d04df2d0071d31668dfc661faf0621a142cb26d9338281a15e7f49b5ca9d","last_reissued_at":"2026-07-05T08:10:35.415603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:35.415603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-independent Module-aware Pruning for Hierarchical Vision Transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Joey Tianyi Zhou, Yang He","submitted_at":"2024-04-21T12:50:38Z","abstract_excerpt":"Hierarchical vision transformers (ViTs) have two advantages over conventional ViTs. First, hierarchical ViTs achieve linear computational complexity with respect to image size by local self-attention. Second, hierarchical ViTs create hierarchical feature maps by merging image patches in deeper layers for dense prediction. However, existing pruning methods ignore the unique properties of hierarchical ViTs and use the magnitude value as the weight importance. This approach leads to two main drawbacks. First, the \"local\" attention weights are compared at a \"global\" level, which may cause some \"lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13648","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/2404.13648/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":"2404.13648","created_at":"2026-07-05T08:10:35.415657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.13648v1","created_at":"2026-07-05T08:10:35.415657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13648","created_at":"2026-07-05T08:10:35.415657+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4M5ATPS2ADR","created_at":"2026-07-05T08:10:35.415657+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4M5ATPS2ADR2MLG","created_at":"2026-07-05T08:10:35.415657+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4M5ATPS","created_at":"2026-07-05T08:10:35.415657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.18376","citing_title":"Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H4M5ATPS2ADR2MLGRX6GMH5PAY","json":"https://pith.science/pith/H4M5ATPS2ADR2MLGRX6GMH5PAY.json","graph_json":"https://pith.science/api/pith-number/H4M5ATPS2ADR2MLGRX6GMH5PAY/graph.json","events_json":"https://pith.science/api/pith-number/H4M5ATPS2ADR2MLGRX6GMH5PAY/events.json","paper":"https://pith.science/paper/H4M5ATPS"},"agent_actions":{"view_html":"https://pith.science/pith/H4M5ATPS2ADR2MLGRX6GMH5PAY","download_json":"https://pith.science/pith/H4M5ATPS2ADR2MLGRX6GMH5PAY.json","view_paper":"https://pith.science/paper/H4M5ATPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.13648&json=true","fetch_graph":"https://pith.science/api/pith-number/H4M5ATPS2ADR2MLGRX6GMH5PAY/graph.json","fetch_events":"https://pith.science/api/pith-number/H4M5ATPS2ADR2MLGRX6GMH5PAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4M5ATPS2ADR2MLGRX6GMH5PAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4M5ATPS2ADR2MLGRX6GMH5PAY/action/storage_attestation","attest_author":"https://pith.science/pith/H4M5ATPS2ADR2MLGRX6GMH5PAY/action/author_attestation","sign_citation":"https://pith.science/pith/H4M5ATPS2ADR2MLGRX6GMH5PAY/action/citation_signature","submit_replication":"https://pith.science/pith/H4M5ATPS2ADR2MLGRX6GMH5PAY/action/replication_record"}},"created_at":"2026-07-05T08:10:35.415657+00:00","updated_at":"2026-07-05T08:10:35.415657+00:00"}