{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HOANYGHJKOTATYJIX3KJAMBVTY","short_pith_number":"pith:HOANYGHJ","schema_version":"1.0","canonical_sha256":"3b80dc18e953a609e128bed49030359e2d1bd22958f7b310bb897ab9814d1482","source":{"kind":"arxiv","id":"2606.03428","version":1},"attestation_state":"computed","paper":{"title":"PrimeSVT: An Automated Memory-aware Pruning Framework with Prioritized Compression Policy for Spiking Vision Transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Achyuta Muthuvelan, Alberto Marchisio, Muhammad Shafique, Rachmad Vidya Wicaksana Putra","submitted_at":"2026-06-02T10:18:00Z","abstract_excerpt":"The large sizes of Spiking Vision Transformers (SViTs) still hinder their embedded implementation, highlighting the need for model compression. State-of-the-art works compress SViT models through unstructured pruning, which needs specialized hardware accelerators for their specific sparsity patterns to maximize efficiency gains. Moreover, their manual approach requires a huge design time to find an appropriate pruning setting for each network, thus making this approach not scalable. To address this limitation, we propose PrimeSVT, a novel framework that performs automated memory-aware structur"},"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":"2606.03428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-06-02T10:18:00Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"44e9d95b42286426734096fe528a255a2fe2ce7b671ce685748f52f0831e09aa","abstract_canon_sha256":"9bc7cf1ad788e69d86596282ac83ce6807407e7e5a8afeaa8d6816cbe9f71586"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:57.562815Z","signature_b64":"lCDXgd+f6A8GcHBlz1CWAIx8p/cXyC6W3mpAcKsFh+EeR5mNNBHM1E9tO1OhUm8XwRFz0i7Gskh+2yF9ZDq1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b80dc18e953a609e128bed49030359e2d1bd22958f7b310bb897ab9814d1482","last_reissued_at":"2026-06-03T01:05:57.562469Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:57.562469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PrimeSVT: An Automated Memory-aware Pruning Framework with Prioritized Compression Policy for Spiking Vision Transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Achyuta Muthuvelan, Alberto Marchisio, Muhammad Shafique, Rachmad Vidya Wicaksana Putra","submitted_at":"2026-06-02T10:18:00Z","abstract_excerpt":"The large sizes of Spiking Vision Transformers (SViTs) still hinder their embedded implementation, highlighting the need for model compression. State-of-the-art works compress SViT models through unstructured pruning, which needs specialized hardware accelerators for their specific sparsity patterns to maximize efficiency gains. Moreover, their manual approach requires a huge design time to find an appropriate pruning setting for each network, thus making this approach not scalable. To address this limitation, we propose PrimeSVT, a novel framework that performs automated memory-aware structur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03428","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/2606.03428/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":"2606.03428","created_at":"2026-06-03T01:05:57.562531+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.03428v1","created_at":"2026-06-03T01:05:57.562531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03428","created_at":"2026-06-03T01:05:57.562531+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOANYGHJKOTA","created_at":"2026-06-03T01:05:57.562531+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOANYGHJKOTATYJI","created_at":"2026-06-03T01:05:57.562531+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOANYGHJ","created_at":"2026-06-03T01:05:57.562531+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HOANYGHJKOTATYJIX3KJAMBVTY","json":"https://pith.science/pith/HOANYGHJKOTATYJIX3KJAMBVTY.json","graph_json":"https://pith.science/api/pith-number/HOANYGHJKOTATYJIX3KJAMBVTY/graph.json","events_json":"https://pith.science/api/pith-number/HOANYGHJKOTATYJIX3KJAMBVTY/events.json","paper":"https://pith.science/paper/HOANYGHJ"},"agent_actions":{"view_html":"https://pith.science/pith/HOANYGHJKOTATYJIX3KJAMBVTY","download_json":"https://pith.science/pith/HOANYGHJKOTATYJIX3KJAMBVTY.json","view_paper":"https://pith.science/paper/HOANYGHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.03428&json=true","fetch_graph":"https://pith.science/api/pith-number/HOANYGHJKOTATYJIX3KJAMBVTY/graph.json","fetch_events":"https://pith.science/api/pith-number/HOANYGHJKOTATYJIX3KJAMBVTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOANYGHJKOTATYJIX3KJAMBVTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOANYGHJKOTATYJIX3KJAMBVTY/action/storage_attestation","attest_author":"https://pith.science/pith/HOANYGHJKOTATYJIX3KJAMBVTY/action/author_attestation","sign_citation":"https://pith.science/pith/HOANYGHJKOTATYJIX3KJAMBVTY/action/citation_signature","submit_replication":"https://pith.science/pith/HOANYGHJKOTATYJIX3KJAMBVTY/action/replication_record"}},"created_at":"2026-06-03T01:05:57.562531+00:00","updated_at":"2026-06-03T01:05:57.562531+00:00"}