{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LSEUUMZUJRZHWQITZFA4TZFFMM","short_pith_number":"pith:LSEUUMZU","canonical_record":{"source":{"id":"2404.04900","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-07T09:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"36be3b5e4c38e87572c9e8aa5915fd8beb1d57d1d2e422af3e16db13cf7f7362","abstract_canon_sha256":"3c9670770ec4f4ee0abe63b10981117f2c204c9242aee93f2cb532876627b9fc"},"schema_version":"1.0"},"canonical_sha256":"5c894a33344c727b4113c941c9e4a5632ac6e07571e9762098ab8ac5bc6bb4a2","source":{"kind":"arxiv","id":"2404.04900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.04900","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"2404.04900v1","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04900","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"LSEUUMZUJRZH","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"pith_short_16","alias_value":"LSEUUMZUJRZHWQIT","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"pith_short_8","alias_value":"LSEUUMZU","created_at":"2026-07-05T08:05:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LSEUUMZUJRZHWQITZFA4TZFFMM","target":"record","payload":{"canonical_record":{"source":{"id":"2404.04900","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-07T09:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"36be3b5e4c38e87572c9e8aa5915fd8beb1d57d1d2e422af3e16db13cf7f7362","abstract_canon_sha256":"3c9670770ec4f4ee0abe63b10981117f2c204c9242aee93f2cb532876627b9fc"},"schema_version":"1.0"},"canonical_sha256":"5c894a33344c727b4113c941c9e4a5632ac6e07571e9762098ab8ac5bc6bb4a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:05:23.393790Z","signature_b64":"p30fX1q23nn5zBjoyXS+xFtTrnyoXZoz7mN0mRD9WyPrX8mIYh7lUa8nRLOQY1H4y4VuqXLVckCj/GoRqx1PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c894a33344c727b4113c941c9e4a5632ac6e07571e9762098ab8ac5bc6bb4a2","last_reissued_at":"2026-07-05T08:05:23.393340Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:05:23.393340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.04900","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-05T08:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"900tj/PLZgBnIGIISrOqimQafvG3W6lyFC+xBHhPr3CUNdaXpNSSxEqKApPyzcnTLCwUx6TPFWAepzKygIMbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T00:53:37.216675Z"},"content_sha256":"a9152641212debd9899ce8fd444139d0e0fc7c32a3ff148daf450a5cec2b1b0f","schema_version":"1.0","event_id":"sha256:a9152641212debd9899ce8fd444139d0e0fc7c32a3ff148daf450a5cec2b1b0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LSEUUMZUJRZHWQITZFA4TZFFMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Radial Networks: Dynamic Layer Routing for High-Performance Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ahmed S. AbouElhamayed, Carly Jiang, Jordan Dotzel, Mohamed Abdelfattah, Yash Akhauri, Zhiru Zhang","submitted_at":"2024-04-07T09:52:31Z","abstract_excerpt":"Large language models (LLMs) often struggle with strict memory, latency, and power demands. To meet these demands, various forms of dynamic sparsity have been proposed that reduce compute on an input-by-input basis. These methods improve over static methods by exploiting the variance across individual inputs, which has steadily grown with the exponential increase in training data. Yet, the increasing depth within modern models, currently with hundreds of layers, has opened opportunities for dynamic layer sparsity, which skips the computation for entire layers. In this work, we explore the prac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04900","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.04900/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-05T08:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xIq/Ef8Cxb/c97IfejNTMtfYqsuPR3ZYBOpd1MCQeFRcXUu/PIDKZCcbE1oz7JFyVb3q9Krotblw4lYlNqg+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T00:53:37.217064Z"},"content_sha256":"7e7700632ef4cb720a79db1654e80769169c8c055a9dd2b702bd6df2b9205465","schema_version":"1.0","event_id":"sha256:7e7700632ef4cb720a79db1654e80769169c8c055a9dd2b702bd6df2b9205465"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSEUUMZUJRZHWQITZFA4TZFFMM/bundle.json","state_url":"https://pith.science/pith/LSEUUMZUJRZHWQITZFA4TZFFMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSEUUMZUJRZHWQITZFA4TZFFMM/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-20T00:53:37Z","links":{"resolver":"https://pith.science/pith/LSEUUMZUJRZHWQITZFA4TZFFMM","bundle":"https://pith.science/pith/LSEUUMZUJRZHWQITZFA4TZFFMM/bundle.json","state":"https://pith.science/pith/LSEUUMZUJRZHWQITZFA4TZFFMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSEUUMZUJRZHWQITZFA4TZFFMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LSEUUMZUJRZHWQITZFA4TZFFMM","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":"3c9670770ec4f4ee0abe63b10981117f2c204c9242aee93f2cb532876627b9fc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-07T09:52:31Z","title_canon_sha256":"36be3b5e4c38e87572c9e8aa5915fd8beb1d57d1d2e422af3e16db13cf7f7362"},"schema_version":"1.0","source":{"id":"2404.04900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.04900","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"2404.04900v1","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04900","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"LSEUUMZUJRZH","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"pith_short_16","alias_value":"LSEUUMZUJRZHWQIT","created_at":"2026-07-05T08:05:23Z"},{"alias_kind":"pith_short_8","alias_value":"LSEUUMZU","created_at":"2026-07-05T08:05:23Z"}],"graph_snapshots":[{"event_id":"sha256:7e7700632ef4cb720a79db1654e80769169c8c055a9dd2b702bd6df2b9205465","target":"graph","created_at":"2026-07-05T08:05:23Z","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/2404.04900/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models (LLMs) often struggle with strict memory, latency, and power demands. To meet these demands, various forms of dynamic sparsity have been proposed that reduce compute on an input-by-input basis. These methods improve over static methods by exploiting the variance across individual inputs, which has steadily grown with the exponential increase in training data. Yet, the increasing depth within modern models, currently with hundreds of layers, has opened opportunities for dynamic layer sparsity, which skips the computation for entire layers. In this work, we explore the prac","authors_text":"Ahmed S. AbouElhamayed, Carly Jiang, Jordan Dotzel, Mohamed Abdelfattah, Yash Akhauri, Zhiru Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-07T09:52:31Z","title":"Radial Networks: Dynamic Layer Routing for High-Performance Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04900","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:a9152641212debd9899ce8fd444139d0e0fc7c32a3ff148daf450a5cec2b1b0f","target":"record","created_at":"2026-07-05T08:05:23Z","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":"3c9670770ec4f4ee0abe63b10981117f2c204c9242aee93f2cb532876627b9fc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-07T09:52:31Z","title_canon_sha256":"36be3b5e4c38e87572c9e8aa5915fd8beb1d57d1d2e422af3e16db13cf7f7362"},"schema_version":"1.0","source":{"id":"2404.04900","kind":"arxiv","version":1}},"canonical_sha256":"5c894a33344c727b4113c941c9e4a5632ac6e07571e9762098ab8ac5bc6bb4a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c894a33344c727b4113c941c9e4a5632ac6e07571e9762098ab8ac5bc6bb4a2","first_computed_at":"2026-07-05T08:05:23.393340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:05:23.393340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p30fX1q23nn5zBjoyXS+xFtTrnyoXZoz7mN0mRD9WyPrX8mIYh7lUa8nRLOQY1H4y4VuqXLVckCj/GoRqx1PCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:05:23.393790Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.04900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9152641212debd9899ce8fd444139d0e0fc7c32a3ff148daf450a5cec2b1b0f","sha256:7e7700632ef4cb720a79db1654e80769169c8c055a9dd2b702bd6df2b9205465"],"state_sha256":"14481e3e00ff301709eba19403ad0158557f28fc8a6dbf17ceb39315d6d623b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jOFFHE+lZ6WIFSAlXmXYbHrch/CNmPLMYcoEfaVp7Dgv4mP2e64Y/91B+vcK+PyoiFQzyyDXYtkBMewNuhHyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T00:53:37.219746Z","bundle_sha256":"eb9d2f142f6ffefbb0c0ee7b8cd354756de5971f3117c13b2f4b83f1742a43dc"}}