{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LLECQVIS6UQ3BB5CIEA6DIQEI4","short_pith_number":"pith:LLECQVIS","schema_version":"1.0","canonical_sha256":"5ac8285512f521b087a24101e1a204472e7bc926f914423315538942170f354a","source":{"kind":"arxiv","id":"2405.19453","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Split Points for Error-Resilient SplitFed Learning","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chamani Shiranthika, Ivan V. Baji\\'c, Parvaneh Saeedi","submitted_at":"2024-05-29T19:03:27Z","abstract_excerpt":"Recent advancements in decentralized learning, such as Federated Learning (FL), Split Learning (SL), and Split Federated Learning (SplitFed), have expanded the potentials of machine learning. SplitFed aims to minimize the computational burden on individual clients in FL and parallelize SL while maintaining privacy. This study investigates the resilience of SplitFed to packet loss at model split points. It explores various parameter aggregation strategies of SplitFed by examining the impact of splitting the model at different points-either shallow split or deep split-on the final global model p"},"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":"2405.19453","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.AI","submitted_at":"2024-05-29T19:03:27Z","cross_cats_sorted":[],"title_canon_sha256":"a855ab3892770b3a9b6923b909d4be051d01d1082e347af86da334ef162268b5","abstract_canon_sha256":"b04e97566e6749774e088e7dc01d4ef28184af4a41c9340098b9b48f31ea6261"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:25:07.720047Z","signature_b64":"DMqbSE+uPS53z5F6u4d7sDweXG/3vxXs6wbAx2mVAyJRZEF2r315JvJ3B4HxnAkQJmoy0nyd/5IihWwLJZ6lBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ac8285512f521b087a24101e1a204472e7bc926f914423315538942170f354a","last_reissued_at":"2026-07-05T08:25:07.719581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:25:07.719581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Split Points for Error-Resilient SplitFed Learning","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chamani Shiranthika, Ivan V. Baji\\'c, Parvaneh Saeedi","submitted_at":"2024-05-29T19:03:27Z","abstract_excerpt":"Recent advancements in decentralized learning, such as Federated Learning (FL), Split Learning (SL), and Split Federated Learning (SplitFed), have expanded the potentials of machine learning. SplitFed aims to minimize the computational burden on individual clients in FL and parallelize SL while maintaining privacy. This study investigates the resilience of SplitFed to packet loss at model split points. It explores various parameter aggregation strategies of SplitFed by examining the impact of splitting the model at different points-either shallow split or deep split-on the final global model p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19453","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/2405.19453/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":"2405.19453","created_at":"2026-07-05T08:25:07.719639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.19453v1","created_at":"2026-07-05T08:25:07.719639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19453","created_at":"2026-07-05T08:25:07.719639+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLECQVIS6UQ3","created_at":"2026-07-05T08:25:07.719639+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLECQVIS6UQ3BB5C","created_at":"2026-07-05T08:25:07.719639+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLECQVIS","created_at":"2026-07-05T08:25:07.719639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18432","citing_title":"A New Pathway to Integrated Learning and Communication (ILAC): Large AI Model and Hyperdimensional Computing for Communication","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLECQVIS6UQ3BB5CIEA6DIQEI4","json":"https://pith.science/pith/LLECQVIS6UQ3BB5CIEA6DIQEI4.json","graph_json":"https://pith.science/api/pith-number/LLECQVIS6UQ3BB5CIEA6DIQEI4/graph.json","events_json":"https://pith.science/api/pith-number/LLECQVIS6UQ3BB5CIEA6DIQEI4/events.json","paper":"https://pith.science/paper/LLECQVIS"},"agent_actions":{"view_html":"https://pith.science/pith/LLECQVIS6UQ3BB5CIEA6DIQEI4","download_json":"https://pith.science/pith/LLECQVIS6UQ3BB5CIEA6DIQEI4.json","view_paper":"https://pith.science/paper/LLECQVIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.19453&json=true","fetch_graph":"https://pith.science/api/pith-number/LLECQVIS6UQ3BB5CIEA6DIQEI4/graph.json","fetch_events":"https://pith.science/api/pith-number/LLECQVIS6UQ3BB5CIEA6DIQEI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLECQVIS6UQ3BB5CIEA6DIQEI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLECQVIS6UQ3BB5CIEA6DIQEI4/action/storage_attestation","attest_author":"https://pith.science/pith/LLECQVIS6UQ3BB5CIEA6DIQEI4/action/author_attestation","sign_citation":"https://pith.science/pith/LLECQVIS6UQ3BB5CIEA6DIQEI4/action/citation_signature","submit_replication":"https://pith.science/pith/LLECQVIS6UQ3BB5CIEA6DIQEI4/action/replication_record"}},"created_at":"2026-07-05T08:25:07.719639+00:00","updated_at":"2026-07-05T08:25:07.719639+00:00"}