{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KCDYPYPQBKPQBN2KDLHUWUD5ZK","short_pith_number":"pith:KCDYPYPQ","schema_version":"1.0","canonical_sha256":"508787e1f00a9f00b74a1acf4b507dcaadfc1423737a695fbe1745147bc37d7c","source":{"kind":"arxiv","id":"2605.23424","version":1},"attestation_state":"computed","paper":{"title":"Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Reza Deylam Salehi","submitted_at":"2026-05-22T09:35:05Z","abstract_excerpt":"In-network learning (INL) trains distributed neural modules by exchanging latent activations and backpropagated errors over a communication graph. This letter proposes Dijkstra-pruned INL (D-INL), which removes non-tree links by retaining a capacity-aware shortest-path tree rooted at the fusion node. To balance sparsity and predictive information, local routing (or aggregation) is modeled as a finite-rate stochastic gate with rate $R_g=I(Z; T)$. We derive a rate-distortion-generalization bound and validate the method on a reproducible distributed-classification experiment, where D-INL reduces "},"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":"2605.23424","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-22T09:35:05Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"e2007f7f482f069be8ab6aaab688722a9a8c16a30b4405069eb6fc4c302c0df2","abstract_canon_sha256":"ba53f439cc71a0d29e76067bb2fbecede886098d1f09c06932ca09dfbe8e2e3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:53.723839Z","signature_b64":"Pl6f3ihrTtRWmjLYyFBQ3CPFfO2QH5uocM0GjJtll/MJn8w5DtDbQ4imPq5esG6raY2A9z/YbwgdrJ4Dzv1sBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"508787e1f00a9f00b74a1acf4b507dcaadfc1423737a695fbe1745147bc37d7c","last_reissued_at":"2026-05-25T02:01:53.723164Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:53.723164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Reza Deylam Salehi","submitted_at":"2026-05-22T09:35:05Z","abstract_excerpt":"In-network learning (INL) trains distributed neural modules by exchanging latent activations and backpropagated errors over a communication graph. This letter proposes Dijkstra-pruned INL (D-INL), which removes non-tree links by retaining a capacity-aware shortest-path tree rooted at the fusion node. To balance sparsity and predictive information, local routing (or aggregation) is modeled as a finite-rate stochastic gate with rate $R_g=I(Z; T)$. We derive a rate-distortion-generalization bound and validate the method on a reproducible distributed-classification experiment, where D-INL reduces "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23424","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/2605.23424/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":"2605.23424","created_at":"2026-05-25T02:01:53.723290+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23424v1","created_at":"2026-05-25T02:01:53.723290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23424","created_at":"2026-05-25T02:01:53.723290+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCDYPYPQBKPQ","created_at":"2026-05-25T02:01:53.723290+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCDYPYPQBKPQBN2K","created_at":"2026-05-25T02:01:53.723290+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCDYPYPQ","created_at":"2026-05-25T02:01:53.723290+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/KCDYPYPQBKPQBN2KDLHUWUD5ZK","json":"https://pith.science/pith/KCDYPYPQBKPQBN2KDLHUWUD5ZK.json","graph_json":"https://pith.science/api/pith-number/KCDYPYPQBKPQBN2KDLHUWUD5ZK/graph.json","events_json":"https://pith.science/api/pith-number/KCDYPYPQBKPQBN2KDLHUWUD5ZK/events.json","paper":"https://pith.science/paper/KCDYPYPQ"},"agent_actions":{"view_html":"https://pith.science/pith/KCDYPYPQBKPQBN2KDLHUWUD5ZK","download_json":"https://pith.science/pith/KCDYPYPQBKPQBN2KDLHUWUD5ZK.json","view_paper":"https://pith.science/paper/KCDYPYPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23424&json=true","fetch_graph":"https://pith.science/api/pith-number/KCDYPYPQBKPQBN2KDLHUWUD5ZK/graph.json","fetch_events":"https://pith.science/api/pith-number/KCDYPYPQBKPQBN2KDLHUWUD5ZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCDYPYPQBKPQBN2KDLHUWUD5ZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCDYPYPQBKPQBN2KDLHUWUD5ZK/action/storage_attestation","attest_author":"https://pith.science/pith/KCDYPYPQBKPQBN2KDLHUWUD5ZK/action/author_attestation","sign_citation":"https://pith.science/pith/KCDYPYPQBKPQBN2KDLHUWUD5ZK/action/citation_signature","submit_replication":"https://pith.science/pith/KCDYPYPQBKPQBN2KDLHUWUD5ZK/action/replication_record"}},"created_at":"2026-05-25T02:01:53.723290+00:00","updated_at":"2026-05-25T02:01:53.723290+00:00"}