{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:W4THONZJRBA7GKUB7QJOFIPHIP","short_pith_number":"pith:W4THONZJ","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"},"canonical_sha256":"b7267737298841f32a81fc12e2a1e743d244e8cefcb5852b3f9bb9754e1ae0da","source":{"kind":"arxiv","id":"2505.23949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.23949","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.23949v1","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23949","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"W4THONZJRBA7","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"pith_short_16","alias_value":"W4THONZJRBA7GKUB","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"pith_short_8","alias_value":"W4THONZJ","created_at":"2026-07-05T11:12:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:W4THONZJRBA7GKUB7QJOFIPHIP","target":"record","payload":{"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"},"canonical_sha256":"b7267737298841f32a81fc12e2a1e743d244e8cefcb5852b3f9bb9754e1ae0da","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"},"source_kind":"arxiv","source_id":"2505.23949","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-05T11:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhoboQDR9+nMfMZeHldfE4oaaQewa+C4l7anQro55ERZgntTbhbyH9jA0UbTfgEjCbRJKqjYeRDLURsiKeFdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:57:10.684372Z"},"content_sha256":"8ea43556afee5dd5de6f5c8f2c9f6fac5c89ad22af4c0a85217a36f2c6e99588","schema_version":"1.0","event_id":"sha256:8ea43556afee5dd5de6f5c8f2c9f6fac5c89ad22af4c0a85217a36f2c6e99588"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:W4THONZJRBA7GKUB7QJOFIPHIP","target":"graph","payload":{"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"},"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-05T11:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlwcymlIA9Bgc3BwtzXXXIMf8EIi8qCzvgGluyaxUYbRXv7YyvCxwJkXhHmIBr7SwIAlFjCyWVJcq37sIKpECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:57:10.684895Z"},"content_sha256":"abf4432d8fdeff744b3ac6a6cd7122ec7b95e5c5cebb70c9ff82876d3f84cc07","schema_version":"1.0","event_id":"sha256:abf4432d8fdeff744b3ac6a6cd7122ec7b95e5c5cebb70c9ff82876d3f84cc07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP/bundle.json","state_url":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4THONZJRBA7GKUB7QJOFIPHIP/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-08T00:57:10Z","links":{"resolver":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP","bundle":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP/bundle.json","state":"https://pith.science/pith/W4THONZJRBA7GKUB7QJOFIPHIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4THONZJRBA7GKUB7QJOFIPHIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:W4THONZJRBA7GKUB7QJOFIPHIP","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":"8490a0edfb2a0b2f31ac27f9746d8299840a9f4155752a5b4effb7c5541266ae","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T18:59:43Z","title_canon_sha256":"aa1f7d1b3be890996f7a0fa913162b146fb0f402038fe43d749782cd6b123194"},"schema_version":"1.0","source":{"id":"2505.23949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.23949","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.23949v1","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23949","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"W4THONZJRBA7","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"pith_short_16","alias_value":"W4THONZJRBA7GKUB","created_at":"2026-07-05T11:12:38Z"},{"alias_kind":"pith_short_8","alias_value":"W4THONZJ","created_at":"2026-07-05T11:12:38Z"}],"graph_snapshots":[{"event_id":"sha256:abf4432d8fdeff744b3ac6a6cd7122ec7b95e5c5cebb70c9ff82876d3f84cc07","target":"graph","created_at":"2026-07-05T11:12:38Z","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/2505.23949/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mehdi Makni, Rahul Mazumder, Xiang Meng","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23949","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:8ea43556afee5dd5de6f5c8f2c9f6fac5c89ad22af4c0a85217a36f2c6e99588","target":"record","created_at":"2026-07-05T11:12:38Z","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":"8490a0edfb2a0b2f31ac27f9746d8299840a9f4155752a5b4effb7c5541266ae","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T18:59:43Z","title_canon_sha256":"aa1f7d1b3be890996f7a0fa913162b146fb0f402038fe43d749782cd6b123194"},"schema_version":"1.0","source":{"id":"2505.23949","kind":"arxiv","version":1}},"canonical_sha256":"b7267737298841f32a81fc12e2a1e743d244e8cefcb5852b3f9bb9754e1ae0da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7267737298841f32a81fc12e2a1e743d244e8cefcb5852b3f9bb9754e1ae0da","first_computed_at":"2026-07-05T11:12:38.880116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:12:38.880116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7K9ziTfCG0UdRibquwVLFmfa+lbVly54WcJv3NwYS3n+vC27MwZ3Sd1WLIhN/gdgQ9TO6kB86sf0P+tZhXM/Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:12:38.880696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.23949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ea43556afee5dd5de6f5c8f2c9f6fac5c89ad22af4c0a85217a36f2c6e99588","sha256:abf4432d8fdeff744b3ac6a6cd7122ec7b95e5c5cebb70c9ff82876d3f84cc07"],"state_sha256":"d22394373ec3d4cf44bf7032a55407c28d00d5cb1fb913596b40e0626e90f99e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+I66oVA4DrB8JqRDS+RWN9Eh3ixrATh5BtVM34abW96j3l0n3nutaPv8lfYayRugzLMAxtn9lZBqs4OX09PQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T00:57:10.707017Z","bundle_sha256":"23618b82e368af61d211f4eec5c80d3bec1372f55511b52daf0fa9a498804f82"}}