{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:W4THONZJRBA7GKUB7QJOFIPHIP","short_pith_number":"pith:W4THONZJ","schema_version":"1.0","canonical_sha256":"b7267737298841f32a81fc12e2a1e743d244e8cefcb5852b3f9bb9754e1ae0da","source":{"kind":"arxiv","id":"2505.23949","version":1},"attestation_state":"computed","paper":{"title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mehdi Makni, Rahul Mazumder, Xiang Meng","submitted_at":"2025-05-29T18:59:43Z","abstract_excerpt":"Network pruning reduces the computational requirements of large neural networks, with N:M sparsity -- retaining only N out of every M consecutive weights -- offering a compelling balance between compressed model quality and hardware acceleration. However, N:M sparsity only accelerates forward-pass computations, as N:M patterns are not preserved during matrix transposition, limiting efficiency during training where both passes are computationally intensive. While transposable N:M sparsity has been proposed to address this limitation, existing methods for finding transposable N:M sparse masks ei"},"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":"2505.23949","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T18:59:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"aa1f7d1b3be890996f7a0fa913162b146fb0f402038fe43d749782cd6b123194","abstract_canon_sha256":"8490a0edfb2a0b2f31ac27f9746d8299840a9f4155752a5b4effb7c5541266ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:38.880696Z","signature_b64":"7K9ziTfCG0UdRibquwVLFmfa+lbVly54WcJv3NwYS3n+vC27MwZ3Sd1WLIhN/gdgQ9TO6kB86sf0P+tZhXM/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7267737298841f32a81fc12e2a1e743d244e8cefcb5852b3f9bb9754e1ae0da","last_reissued_at":"2026-07-05T11:12:38.880116Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:38.880116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mehdi Makni, Rahul Mazumder, Xiang Meng","submitted_at":"2025-05-29T18:59:43Z","abstract_excerpt":"Network pruning reduces the computational requirements of large neural networks, with N:M sparsity -- retaining only N out of every M consecutive weights -- offering a compelling balance between compressed model quality and hardware acceleration. However, N:M sparsity only accelerates forward-pass computations, as N:M patterns are not preserved during matrix transposition, limiting efficiency during training where both passes are computationally intensive. While transposable N:M sparsity has been proposed to address this limitation, existing methods for finding transposable N:M sparse masks ei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23949","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/2505.23949/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":"2505.23949","created_at":"2026-07-05T11:12:38.880179+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23949v1","created_at":"2026-07-05T11:12:38.880179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23949","created_at":"2026-07-05T11:12:38.880179+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4THONZJRBA7","created_at":"2026-07-05T11:12:38.880179+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4THONZJRBA7GKUB","created_at":"2026-07-05T11:12:38.880179+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4THONZJ","created_at":"2026-07-05T11:12:38.880179+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/W4THONZJRBA7GKUB7QJOFIPHIP","json":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP.json","graph_json":"https://pith.science/api/pith-number/W4THONZJRBA7GKUB7QJOFIPHIP/graph.json","events_json":"https://pith.science/api/pith-number/W4THONZJRBA7GKUB7QJOFIPHIP/events.json","paper":"https://pith.science/paper/W4THONZJ"},"agent_actions":{"view_html":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP","download_json":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP.json","view_paper":"https://pith.science/paper/W4THONZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23949&json=true","fetch_graph":"https://pith.science/api/pith-number/W4THONZJRBA7GKUB7QJOFIPHIP/graph.json","fetch_events":"https://pith.science/api/pith-number/W4THONZJRBA7GKUB7QJOFIPHIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP/action/storage_attestation","attest_author":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP/action/author_attestation","sign_citation":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP/action/citation_signature","submit_replication":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP/action/replication_record"}},"created_at":"2026-07-05T11:12:38.880179+00:00","updated_at":"2026-07-05T11:12:38.880179+00:00"}