{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SLYPOAO3WUVCW6WVMRGRU3UBJW","short_pith_number":"pith:SLYPOAO3","canonical_record":{"source":{"id":"1711.06935","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-18T22:40:27Z","cross_cats_sorted":[],"title_canon_sha256":"5e9b46a016da77adf6c920ab1dc59aaa0dbd13a121e89150b56da71ff490ac71","abstract_canon_sha256":"f1dfb6aa337ae14373610fcfb474d27ce6658483f6f6ad77296308e066e66497"},"schema_version":"1.0"},"canonical_sha256":"92f0f701dbb52a2b7ad5644d1a6e814da1419371ab4eb8f32d4373e2d25966bb","source":{"kind":"arxiv","id":"1711.06935","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06935","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06935v3","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06935","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"SLYPOAO3WUVC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SLYPOAO3WUVCW6WV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SLYPOAO3","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SLYPOAO3WUVCW6WVMRGRU3UBJW","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06935","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-18T22:40:27Z","cross_cats_sorted":[],"title_canon_sha256":"5e9b46a016da77adf6c920ab1dc59aaa0dbd13a121e89150b56da71ff490ac71","abstract_canon_sha256":"f1dfb6aa337ae14373610fcfb474d27ce6658483f6f6ad77296308e066e66497"},"schema_version":"1.0"},"canonical_sha256":"92f0f701dbb52a2b7ad5644d1a6e814da1419371ab4eb8f32d4373e2d25966bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:44.435332Z","signature_b64":"DtuAoWGAGrbgAk/OMz6lxQZv8J5nkH2VtRs47AACzjnSbON3taoeLFIQIztOAPgHSt4THrt/R89T91QbmFFgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92f0f701dbb52a2b7ad5644d1a6e814da1419371ab4eb8f32d4373e2d25966bb","last_reissued_at":"2026-05-17T23:47:44.434904Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:44.434904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06935","source_version":3,"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-05-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GeoBqi7rZaLRK1JAVDnZRJsCZ2xUbiOUB+PCvXKQQbzr0/aY+M52FTqxa7pI6RvQb6iXkcjXi5TCDQYqFvB0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:20:06.072729Z"},"content_sha256":"d0e2810928d13f1a31c7133f62ae7daddf1e0e7a903f3029e2f80ab984efe36a","schema_version":"1.0","event_id":"sha256:d0e2810928d13f1a31c7133f62ae7daddf1e0e7a903f3029e2f80ab984efe36a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SLYPOAO3WUVCW6WVMRGRU3UBJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interleaver Design for Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Keith M. Chugg, Peter A. Beerel, Sourya Dey","submitted_at":"2017-11-18T22:40:27Z","abstract_excerpt":"We propose a class of interleavers for a novel deep neural network (DNN) architecture that uses algorithmically pre-determined, structured sparsity to significantly lower memory and computational requirements, and speed up training. The interleavers guarantee clash-free memory accesses to eliminate idle operational cycles, optimize spread and dispersion to improve network performance, and are designed to ease the complexity of memory address computations in hardware. We present a design algorithm with mathematical proofs for these properties. We also explore interleaver variations and analyze "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06935","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8TwhPGVowNW1KiLZw1uX/wqjL5ASXM/wJah48UvC0VAwMPm7sZUG4rNLr08qqd1V2PjoCITlwrv5HuYg1caCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:20:06.073574Z"},"content_sha256":"57708e3f3519bdac22252ab7859807671ee8649795635c4f3de21dd4a75a235e","schema_version":"1.0","event_id":"sha256:57708e3f3519bdac22252ab7859807671ee8649795635c4f3de21dd4a75a235e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLYPOAO3WUVCW6WVMRGRU3UBJW/bundle.json","state_url":"https://pith.science/pith/SLYPOAO3WUVCW6WVMRGRU3UBJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLYPOAO3WUVCW6WVMRGRU3UBJW/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-06-06T23:20:06Z","links":{"resolver":"https://pith.science/pith/SLYPOAO3WUVCW6WVMRGRU3UBJW","bundle":"https://pith.science/pith/SLYPOAO3WUVCW6WVMRGRU3UBJW/bundle.json","state":"https://pith.science/pith/SLYPOAO3WUVCW6WVMRGRU3UBJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLYPOAO3WUVCW6WVMRGRU3UBJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SLYPOAO3WUVCW6WVMRGRU3UBJW","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":"f1dfb6aa337ae14373610fcfb474d27ce6658483f6f6ad77296308e066e66497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-18T22:40:27Z","title_canon_sha256":"5e9b46a016da77adf6c920ab1dc59aaa0dbd13a121e89150b56da71ff490ac71"},"schema_version":"1.0","source":{"id":"1711.06935","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06935","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06935v3","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06935","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"SLYPOAO3WUVC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SLYPOAO3WUVCW6WV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SLYPOAO3","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:57708e3f3519bdac22252ab7859807671ee8649795635c4f3de21dd4a75a235e","target":"graph","created_at":"2026-05-17T23:47:44Z","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"},"paper":{"abstract_excerpt":"We propose a class of interleavers for a novel deep neural network (DNN) architecture that uses algorithmically pre-determined, structured sparsity to significantly lower memory and computational requirements, and speed up training. The interleavers guarantee clash-free memory accesses to eliminate idle operational cycles, optimize spread and dispersion to improve network performance, and are designed to ease the complexity of memory address computations in hardware. We present a design algorithm with mathematical proofs for these properties. We also explore interleaver variations and analyze ","authors_text":"Keith M. Chugg, Peter A. Beerel, Sourya Dey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-18T22:40:27Z","title":"Interleaver Design for Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06935","kind":"arxiv","version":3},"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:d0e2810928d13f1a31c7133f62ae7daddf1e0e7a903f3029e2f80ab984efe36a","target":"record","created_at":"2026-05-17T23:47:44Z","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":"f1dfb6aa337ae14373610fcfb474d27ce6658483f6f6ad77296308e066e66497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-18T22:40:27Z","title_canon_sha256":"5e9b46a016da77adf6c920ab1dc59aaa0dbd13a121e89150b56da71ff490ac71"},"schema_version":"1.0","source":{"id":"1711.06935","kind":"arxiv","version":3}},"canonical_sha256":"92f0f701dbb52a2b7ad5644d1a6e814da1419371ab4eb8f32d4373e2d25966bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92f0f701dbb52a2b7ad5644d1a6e814da1419371ab4eb8f32d4373e2d25966bb","first_computed_at":"2026-05-17T23:47:44.434904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:44.434904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DtuAoWGAGrbgAk/OMz6lxQZv8J5nkH2VtRs47AACzjnSbON3taoeLFIQIztOAPgHSt4THrt/R89T91QbmFFgAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:44.435332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06935","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0e2810928d13f1a31c7133f62ae7daddf1e0e7a903f3029e2f80ab984efe36a","sha256:57708e3f3519bdac22252ab7859807671ee8649795635c4f3de21dd4a75a235e"],"state_sha256":"c136085f8368297d2f520e113818e9fed935d3a567fe46d658286b6f369baa77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/25bqubPypaso/BA9Bb0ruAi8w4lpQtAxvxODG56BiB1MZ5yAUHhryWnjXPNQsLnCOLsxdqjt8Nl6fPVzSPDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:20:06.078221Z","bundle_sha256":"752ab3d0fb7750b61d841ab100e5b0130f1b18cced7a39c95a0e77eccecd1c83"}}