{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3XKPDCJB64TS5NDRGLR33Z7HFW","short_pith_number":"pith:3XKPDCJB","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"},"canonical_sha256":"ddd4f18921f7272eb47132e3bde7e72d895de3232bc4bd88dd77d4c6457be5e2","source":{"kind":"arxiv","id":"2506.09769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09769","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09769v1","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09769","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"3XKPDCJB64TS","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"pith_short_16","alias_value":"3XKPDCJB64TS5NDR","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"pith_short_8","alias_value":"3XKPDCJB","created_at":"2026-07-05T11:19:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3XKPDCJB64TS5NDRGLR33Z7HFW","target":"record","payload":{"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"},"canonical_sha256":"ddd4f18921f7272eb47132e3bde7e72d895de3232bc4bd88dd77d4c6457be5e2","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"},"source_kind":"arxiv","source_id":"2506.09769","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-05T11:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uN5hStycLkVQ9jGncCpwgH5TBl1f4bIKwTMBs0h2s6YiLiXR5VlPMY5uRmIzQh9t7R6CqpBtFPW2jUfxhYvhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:46:38.337512Z"},"content_sha256":"da4a4738cd5234b9e72c3f2e640822351d82b35881d7fffdd93156326ff927c6","schema_version":"1.0","event_id":"sha256:da4a4738cd5234b9e72c3f2e640822351d82b35881d7fffdd93156326ff927c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3XKPDCJB64TS5NDRGLR33Z7HFW","target":"graph","payload":{"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"},"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-05T11:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2c1aoAFgy0t6A1vWH/Bf5odN4SwT9/qLTtmJC/wHmCpqMNoljZGQvFAmOm3nF6LAi0berBU9kSzNiUsb5xwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:46:38.338312Z"},"content_sha256":"acc539733438a4c8d45101c5b32424b3969a02c5a70d81297b9219b563a51c66","schema_version":"1.0","event_id":"sha256:acc539733438a4c8d45101c5b32424b3969a02c5a70d81297b9219b563a51c66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/bundle.json","state_url":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/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-11T08:46:38Z","links":{"resolver":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW","bundle":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/bundle.json","state":"https://pith.science/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XKPDCJB64TS5NDRGLR33Z7HFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3XKPDCJB64TS5NDRGLR33Z7HFW","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":"c11cb0e625d891a6438770e24837637bcf577fbf971f89f1834ab37b4ddd30de","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-11T14:09:53Z","title_canon_sha256":"05b4e0dbd7934415869499c451c907bf31e7e287f45cd29d8483eb5a7dc1d197"},"schema_version":"1.0","source":{"id":"2506.09769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09769","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09769v1","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09769","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"3XKPDCJB64TS","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"pith_short_16","alias_value":"3XKPDCJB64TS5NDR","created_at":"2026-07-05T11:19:56Z"},{"alias_kind":"pith_short_8","alias_value":"3XKPDCJB","created_at":"2026-07-05T11:19:56Z"}],"graph_snapshots":[{"event_id":"sha256:acc539733438a4c8d45101c5b32424b3969a02c5a70d81297b9219b563a51c66","target":"graph","created_at":"2026-07-05T11:19:56Z","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/2506.09769/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Haruki Kainuma, Takayuki Nishio","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-11T14:09:53Z","title":"Load-Aware Training Scheduling for Model Circulation-based Decentralized Federated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09769","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:da4a4738cd5234b9e72c3f2e640822351d82b35881d7fffdd93156326ff927c6","target":"record","created_at":"2026-07-05T11:19:56Z","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":"c11cb0e625d891a6438770e24837637bcf577fbf971f89f1834ab37b4ddd30de","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-11T14:09:53Z","title_canon_sha256":"05b4e0dbd7934415869499c451c907bf31e7e287f45cd29d8483eb5a7dc1d197"},"schema_version":"1.0","source":{"id":"2506.09769","kind":"arxiv","version":1}},"canonical_sha256":"ddd4f18921f7272eb47132e3bde7e72d895de3232bc4bd88dd77d4c6457be5e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddd4f18921f7272eb47132e3bde7e72d895de3232bc4bd88dd77d4c6457be5e2","first_computed_at":"2026-07-05T11:19:56.717040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:56.717040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/yuRN/Q/fwriXsvk254Rx9QgbBjo4lZjotb3vNwxVyTVP6W5vWLV4bPcmLqVFPwbC+J74/2rMGwrRzv986YDDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:56.717568Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.09769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da4a4738cd5234b9e72c3f2e640822351d82b35881d7fffdd93156326ff927c6","sha256:acc539733438a4c8d45101c5b32424b3969a02c5a70d81297b9219b563a51c66"],"state_sha256":"d060822a4ae4444de77eb1db7b95848d375023bc3956024d6386470f0a33c76b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rZXVPgAmSIQ0batyOZbqvSvv8xx3hGQiTm7n/xZCw0JW0oGzDUbr8bNtBGCRtZ9FLfaMELWpKSWIhLsAskpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:46:38.343390Z","bundle_sha256":"e69c62f3979a12b6d9cb5fd2e7b82f00f826dd0d26cd46a839e692a8bb60036e"}}