{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LVOTFG6L6R4CHW7VDYM2R25RBZ","short_pith_number":"pith:LVOTFG6L","schema_version":"1.0","canonical_sha256":"5d5d329bcbf47823dbf51e19a8ebb10e593ab738d94ba6c2fcfb9800ac9ca41b","source":{"kind":"arxiv","id":"2412.11496","version":2},"attestation_state":"computed","paper":{"title":"Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiale Cheng, Nan Liu, Qinyi Lu, Wei Kang","submitted_at":"2024-12-16T07:16:41Z","abstract_excerpt":"The growing privacy concerns in distributed learning have led to the widespread adoption of secure aggregation techniques in distributed machine learning systems, such as federated learning. Motivated by a coded gradient aggregation problem in a user-helper-master hierarchical network setting with straggling communication links, we formulate a new secure hierarchical coded gradient aggregation problem. In our setting, \\( K \\) users communicate with the master through an intermediate layer of \\( N \\) helpers, who can communicate with each other. With a resiliency threshold of \\( N_r \\) for stra"},"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":"2412.11496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-12-16T07:16:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"71b81dbaedda0a8efb57e8a58a7d21b23928b77d86cc8024cd49fd86fbd30f79","abstract_canon_sha256":"08a96063a9f1c7e291e3387d2a020da5fd4e050fd6557f17fafe512d3c9f47a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:14.171928Z","signature_b64":"C2rNTeN1JF6kmduBKlCUWDxVFXhaEmbZHRGGbmTNRCQZbfcgLQd04NICRnLGQB7C6MIX1Yg+dAZr/I6R8mzJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d5d329bcbf47823dbf51e19a8ebb10e593ab738d94ba6c2fcfb9800ac9ca41b","last_reissued_at":"2026-07-05T10:53:14.171408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:14.171408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiale Cheng, Nan Liu, Qinyi Lu, Wei Kang","submitted_at":"2024-12-16T07:16:41Z","abstract_excerpt":"The growing privacy concerns in distributed learning have led to the widespread adoption of secure aggregation techniques in distributed machine learning systems, such as federated learning. Motivated by a coded gradient aggregation problem in a user-helper-master hierarchical network setting with straggling communication links, we formulate a new secure hierarchical coded gradient aggregation problem. In our setting, \\( K \\) users communicate with the master through an intermediate layer of \\( N \\) helpers, who can communicate with each other. With a resiliency threshold of \\( N_r \\) for stra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11496","kind":"arxiv","version":2},"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.11496/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":"2412.11496","created_at":"2026-07-05T10:53:14.171474+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.11496v2","created_at":"2026-07-05T10:53:14.171474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11496","created_at":"2026-07-05T10:53:14.171474+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVOTFG6L6R4C","created_at":"2026-07-05T10:53:14.171474+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVOTFG6L6R4CHW7V","created_at":"2026-07-05T10:53:14.171474+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVOTFG6L","created_at":"2026-07-05T10:53:14.171474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26344","citing_title":"On the Capacity of Hierarchical Secure Aggregation with Groupwise Keys","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01849","citing_title":"Optimal Communication Rate of Secure Aggregation over Ring Networks with Pairwise Keys","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LVOTFG6L6R4CHW7VDYM2R25RBZ","json":"https://pith.science/pith/LVOTFG6L6R4CHW7VDYM2R25RBZ.json","graph_json":"https://pith.science/api/pith-number/LVOTFG6L6R4CHW7VDYM2R25RBZ/graph.json","events_json":"https://pith.science/api/pith-number/LVOTFG6L6R4CHW7VDYM2R25RBZ/events.json","paper":"https://pith.science/paper/LVOTFG6L"},"agent_actions":{"view_html":"https://pith.science/pith/LVOTFG6L6R4CHW7VDYM2R25RBZ","download_json":"https://pith.science/pith/LVOTFG6L6R4CHW7VDYM2R25RBZ.json","view_paper":"https://pith.science/paper/LVOTFG6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.11496&json=true","fetch_graph":"https://pith.science/api/pith-number/LVOTFG6L6R4CHW7VDYM2R25RBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LVOTFG6L6R4CHW7VDYM2R25RBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVOTFG6L6R4CHW7VDYM2R25RBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVOTFG6L6R4CHW7VDYM2R25RBZ/action/storage_attestation","attest_author":"https://pith.science/pith/LVOTFG6L6R4CHW7VDYM2R25RBZ/action/author_attestation","sign_citation":"https://pith.science/pith/LVOTFG6L6R4CHW7VDYM2R25RBZ/action/citation_signature","submit_replication":"https://pith.science/pith/LVOTFG6L6R4CHW7VDYM2R25RBZ/action/replication_record"}},"created_at":"2026-07-05T10:53:14.171474+00:00","updated_at":"2026-07-05T10:53:14.171474+00:00"}