{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AVXW6DDHQ2PTNVXCKZOCK4FB22","short_pith_number":"pith:AVXW6DDH","canonical_record":{"source":{"id":"2412.01575","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-12-02T14:57:14Z","cross_cats_sorted":[],"title_canon_sha256":"1008d9c0342ce46badec07f37fb2a7b8638b835ed1f694f9a2ce3920c5f1ccef","abstract_canon_sha256":"69cd51c9fb4fa8b15df34d31d55eb574ea744b53dc0efaad8dc8c81563f4bac4"},"schema_version":"1.0"},"canonical_sha256":"056f6f0c67869f36d6e2565c2570a1d6b0d9e5cdf1486f1da1aa9f3700e5646d","source":{"kind":"arxiv","id":"2412.01575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.01575","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"2412.01575v1","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01575","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"AVXW6DDHQ2PT","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"pith_short_16","alias_value":"AVXW6DDHQ2PTNVXC","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"pith_short_8","alias_value":"AVXW6DDH","created_at":"2026-07-05T09:43:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AVXW6DDHQ2PTNVXCKZOCK4FB22","target":"record","payload":{"canonical_record":{"source":{"id":"2412.01575","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-12-02T14:57:14Z","cross_cats_sorted":[],"title_canon_sha256":"1008d9c0342ce46badec07f37fb2a7b8638b835ed1f694f9a2ce3920c5f1ccef","abstract_canon_sha256":"69cd51c9fb4fa8b15df34d31d55eb574ea744b53dc0efaad8dc8c81563f4bac4"},"schema_version":"1.0"},"canonical_sha256":"056f6f0c67869f36d6e2565c2570a1d6b0d9e5cdf1486f1da1aa9f3700e5646d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:15.434635Z","signature_b64":"gD1hUL6UCt2K7AiNhNMO3+kKOojgI8I2Pd3+YGB7Pyb5R+Bz19QdBSa80e0L6P5svq3V737qWUMovS66w1xuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"056f6f0c67869f36d6e2565c2570a1d6b0d9e5cdf1486f1da1aa9f3700e5646d","last_reissued_at":"2026-07-05T09:43:15.434169Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:15.434169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.01575","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-05T09:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CADwhH7UbzKjqfqZ6DTwESCcPDiJr7jhw28ICCG3KJWOU0ZQjSBxpfEJoRrxUc8LPVGxnxg6m+EngwmPQndMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:45:19.205926Z"},"content_sha256":"3d95e44ce3919d9edee615c60d00cb45ad64917a6814009675d1f6b6b1edd964","schema_version":"1.0","event_id":"sha256:3d95e44ce3919d9edee615c60d00cb45ad64917a6814009675d1f6b6b1edd964"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AVXW6DDHQ2PTNVXCKZOCK4FB22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardware architecture and routing-aware training for optimal memory usage: a case study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Jimmy Weber, Melika Payvand, Theo Ballet","submitted_at":"2024-12-02T14:57:14Z","abstract_excerpt":"Efficient deployment of neural networks on resource-constrained hardware demands optimal use of on-chip memory. In event-based processors, this is particularly critical for routing architectures, where substantial memory is dedicated to managing network connectivity. While prior work has focused on optimizing event routing during hardware design, optimizing memory utilization for routing during network training remains underexplored. Key challenges include: (i) integrating routing into the loss function, which often introduces non-differentiability, and (ii) computational expense in evaluating"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01575","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/2412.01575/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-05T09:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7YVTXIUtaFooK6bnG9aV5GKwYSZo8dPr2bfxtWx8Xmd64BsA6bNWQzvFGVcg1YOsUDPa89h/PC8GKVmaVF5JDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:45:19.206511Z"},"content_sha256":"147fe0d8da0c7a4b53b1706abe0351940052cd933c9c7ab8dc9ace2ff7031f18","schema_version":"1.0","event_id":"sha256:147fe0d8da0c7a4b53b1706abe0351940052cd933c9c7ab8dc9ace2ff7031f18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVXW6DDHQ2PTNVXCKZOCK4FB22/bundle.json","state_url":"https://pith.science/pith/AVXW6DDHQ2PTNVXCKZOCK4FB22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVXW6DDHQ2PTNVXCKZOCK4FB22/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-07T01:45:19Z","links":{"resolver":"https://pith.science/pith/AVXW6DDHQ2PTNVXCKZOCK4FB22","bundle":"https://pith.science/pith/AVXW6DDHQ2PTNVXCKZOCK4FB22/bundle.json","state":"https://pith.science/pith/AVXW6DDHQ2PTNVXCKZOCK4FB22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVXW6DDHQ2PTNVXCKZOCK4FB22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AVXW6DDHQ2PTNVXCKZOCK4FB22","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":"69cd51c9fb4fa8b15df34d31d55eb574ea744b53dc0efaad8dc8c81563f4bac4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-12-02T14:57:14Z","title_canon_sha256":"1008d9c0342ce46badec07f37fb2a7b8638b835ed1f694f9a2ce3920c5f1ccef"},"schema_version":"1.0","source":{"id":"2412.01575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.01575","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"2412.01575v1","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01575","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"AVXW6DDHQ2PT","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"pith_short_16","alias_value":"AVXW6DDHQ2PTNVXC","created_at":"2026-07-05T09:43:15Z"},{"alias_kind":"pith_short_8","alias_value":"AVXW6DDH","created_at":"2026-07-05T09:43:15Z"}],"graph_snapshots":[{"event_id":"sha256:147fe0d8da0c7a4b53b1706abe0351940052cd933c9c7ab8dc9ace2ff7031f18","target":"graph","created_at":"2026-07-05T09:43:15Z","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/2412.01575/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient deployment of neural networks on resource-constrained hardware demands optimal use of on-chip memory. In event-based processors, this is particularly critical for routing architectures, where substantial memory is dedicated to managing network connectivity. While prior work has focused on optimizing event routing during hardware design, optimizing memory utilization for routing during network training remains underexplored. Key challenges include: (i) integrating routing into the loss function, which often introduces non-differentiability, and (ii) computational expense in evaluating","authors_text":"Jimmy Weber, Melika Payvand, Theo Ballet","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-12-02T14:57:14Z","title":"Hardware architecture and routing-aware training for optimal memory usage: a case study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01575","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:3d95e44ce3919d9edee615c60d00cb45ad64917a6814009675d1f6b6b1edd964","target":"record","created_at":"2026-07-05T09:43:15Z","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":"69cd51c9fb4fa8b15df34d31d55eb574ea744b53dc0efaad8dc8c81563f4bac4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-12-02T14:57:14Z","title_canon_sha256":"1008d9c0342ce46badec07f37fb2a7b8638b835ed1f694f9a2ce3920c5f1ccef"},"schema_version":"1.0","source":{"id":"2412.01575","kind":"arxiv","version":1}},"canonical_sha256":"056f6f0c67869f36d6e2565c2570a1d6b0d9e5cdf1486f1da1aa9f3700e5646d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"056f6f0c67869f36d6e2565c2570a1d6b0d9e5cdf1486f1da1aa9f3700e5646d","first_computed_at":"2026-07-05T09:43:15.434169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:43:15.434169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gD1hUL6UCt2K7AiNhNMO3+kKOojgI8I2Pd3+YGB7Pyb5R+Bz19QdBSa80e0L6P5svq3V737qWUMovS66w1xuAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:43:15.434635Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.01575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d95e44ce3919d9edee615c60d00cb45ad64917a6814009675d1f6b6b1edd964","sha256:147fe0d8da0c7a4b53b1706abe0351940052cd933c9c7ab8dc9ace2ff7031f18"],"state_sha256":"5fe3df893894f63648adbb610b1d51c58ef2f5f67475b95f78739f5a04b7c046"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4UP7BER28ma3SyZcLp+/u9zyQiiJPhJPEUvtlpbVaHbJAA35lyZMoLOBHG8aRNZ5jk2zCG0PvKGdIm12MOZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:45:19.212335Z","bundle_sha256":"8a64291db00845006553f091512a3f8ecb2b485e0e63dd92987baa27f3e79064"}}