{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3XKPDCJB64TS5NDRGLR33Z7HFW","short_pith_number":"pith:3XKPDCJB","schema_version":"1.0","canonical_sha256":"ddd4f18921f7272eb47132e3bde7e72d895de3232bc4bd88dd77d4c6457be5e2","source":{"kind":"arxiv","id":"2506.09769","version":1},"attestation_state":"computed","paper":{"title":"Load-Aware Training Scheduling for Model Circulation-based Decentralized Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Haruki Kainuma, Takayuki Nishio","submitted_at":"2025-06-11T14:09:53Z","abstract_excerpt":"This paper proposes Load-aware Tram-FL, an extension of Tram-FL that introduces a training scheduling mechanism to minimize total training time in decentralized federated learning by accounting for both computational and communication loads. The scheduling problem is formulated as a global optimization task, which-though intractable in its original form-is made solvable by decomposing it into node-wise subproblems. To promote balanced data utilization under non-IID distributions, a variance constraint is introduced, while the overall training latency, including both computation and communicati"},"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":"2506.09769","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-11T14:09:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"05b4e0dbd7934415869499c451c907bf31e7e287f45cd29d8483eb5a7dc1d197","abstract_canon_sha256":"c11cb0e625d891a6438770e24837637bcf577fbf971f89f1834ab37b4ddd30de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:56.717568Z","signature_b64":"/yuRN/Q/fwriXsvk254Rx9QgbBjo4lZjotb3vNwxVyTVP6W5vWLV4bPcmLqVFPwbC+J74/2rMGwrRzv986YDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddd4f18921f7272eb47132e3bde7e72d895de3232bc4bd88dd77d4c6457be5e2","last_reissued_at":"2026-07-05T11:19:56.717040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:56.717040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Load-Aware Training Scheduling for Model Circulation-based Decentralized Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Haruki Kainuma, Takayuki Nishio","submitted_at":"2025-06-11T14:09:53Z","abstract_excerpt":"This paper proposes Load-aware Tram-FL, an extension of Tram-FL that introduces a training scheduling mechanism to minimize total training time in decentralized federated learning by accounting for both computational and communication loads. The scheduling problem is formulated as a global optimization task, which-though intractable in its original form-is made solvable by decomposing it into node-wise subproblems. To promote balanced data utilization under non-IID distributions, a variance constraint is introduced, while the overall training latency, including both computation and communicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09769","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/2506.09769/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":"2506.09769","created_at":"2026-07-05T11:19:56.717096+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.09769v1","created_at":"2026-07-05T11:19:56.717096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09769","created_at":"2026-07-05T11:19:56.717096+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XKPDCJB64TS","created_at":"2026-07-05T11:19:56.717096+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XKPDCJB64TS5NDR","created_at":"2026-07-05T11:19:56.717096+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XKPDCJB","created_at":"2026-07-05T11:19:56.717096+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/3XKPDCJB64TS5NDRGLR33Z7HFW","json":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW.json","graph_json":"https://pith.science/api/pith-number/3XKPDCJB64TS5NDRGLR33Z7HFW/graph.json","events_json":"https://pith.science/api/pith-number/3XKPDCJB64TS5NDRGLR33Z7HFW/events.json","paper":"https://pith.science/paper/3XKPDCJB"},"agent_actions":{"view_html":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW","download_json":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW.json","view_paper":"https://pith.science/paper/3XKPDCJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.09769&json=true","fetch_graph":"https://pith.science/api/pith-number/3XKPDCJB64TS5NDRGLR33Z7HFW/graph.json","fetch_events":"https://pith.science/api/pith-number/3XKPDCJB64TS5NDRGLR33Z7HFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/action/storage_attestation","attest_author":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/action/author_attestation","sign_citation":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/action/citation_signature","submit_replication":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/action/replication_record"}},"created_at":"2026-07-05T11:19:56.717096+00:00","updated_at":"2026-07-05T11:19:56.717096+00:00"}