{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NG3UI3Z227W5WNXYSRZG74XZUV","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":"c25644be4e8bcace613b0c9708d384be82b2475c65a7df5e9bef4d8914528848","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-08-24T16:11:41Z","title_canon_sha256":"4e8e665a2e60590032db14180426aed0fe796a3d8607deda0a47a1ea361e1ef3"},"schema_version":"1.0","source":{"id":"2508.17431","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.17431","created_at":"2026-05-20T00:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2508.17431v4","created_at":"2026-05-20T00:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.17431","created_at":"2026-05-20T00:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"NG3UI3Z227W5","created_at":"2026-05-20T00:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"NG3UI3Z227W5WNXY","created_at":"2026-05-20T00:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"NG3UI3Z2","created_at":"2026-05-20T00:05:32Z"}],"graph_snapshots":[{"event_id":"sha256:821af17ab0e14b0f53753eca7ef877e009bff87d99ad42cf70e5a2bfc8a7118a","target":"graph","created_at":"2026-05-20T00:05:32Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Experimental results on eight benchmark datasets demonstrate that FedKLPR achieves substantial communication savings while maintaining competitive accuracy. Compared with state-of-the-art methods, FedKLPR reduces communication cost by 40%--42% on ResNet-50 while achieving superior overall performance."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that the combination of KL-Divergence Regularization Loss, KL-Divergence-aggregation Weight, Pruning-ratio-aggregation Weight, and Cross-Round Recovery will continue to preserve accuracy when pruning ratios and non-IID severity increase beyond the tested benchmark settings."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FedKLPR adds KL-regularized training, prune-weighted aggregation, and cross-round recovery to federated learning for re-ID, claiming 40-42% lower communication on ResNet-50 with competitive accuracy across eight datasets."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"FedKLPR combines KL-divergence guidance with pruning and weighted aggregation to cut communication costs in federated person re-identification by 40-42 percent."}],"snapshot_sha256":"8157c1c08b7ff4ffe591a5b928bb47bd2127c06d6efb2d4a18064892a3defc79"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"23f56e2bf9f43f58b2d8359c610f825f8abbbad3021be823f519303b0080c328"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.17431/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Person re-identification (re-ID) is a fundamental task in intelligent surveillance and public safety. Federated learning (FL) provides a privacy-preserving paradigm for collaborative model training without centralized data collection. However, deploying FL in real-world re-ID systems remains challenging due to statistical heterogeneity caused by non-IID client data and the substantial communication overhead incurred by frequent transmission of large-scale models. To address these challenges, we propose FedKLPR, a lightweight and communication-efficient federated learning framework for person r","authors_text":"Po-Hsien Yu, Shao-Yi Chien, Yu-Syuan Tseng","cross_cats":["cs.AI","cs.LG"],"headline":"FedKLPR combines KL-divergence guidance with pruning and weighted aggregation to cut communication costs in federated person re-identification by 40-42 percent.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-08-24T16:11:41Z","title":"FedKLPR: KL-Guided Pruning-Aware Federated Learning for Person Re-Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.17431","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-18T20:53:59.950295Z","id":"30e7ea04-7e99-4dbc-b395-2e260638e93e","model_set":{"reader":"grok-4.3"},"one_line_summary":"FedKLPR adds KL-regularized training, prune-weighted aggregation, and cross-round recovery to federated learning for re-ID, claiming 40-42% lower communication on ResNet-50 with competitive accuracy across eight datasets.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"FedKLPR combines KL-divergence guidance with pruning and weighted aggregation to cut communication costs in federated person re-identification by 40-42 percent.","strongest_claim":"Experimental results on eight benchmark datasets demonstrate that FedKLPR achieves substantial communication savings while maintaining competitive accuracy. Compared with state-of-the-art methods, FedKLPR reduces communication cost by 40%--42% on ResNet-50 while achieving superior overall performance.","weakest_assumption":"The assumption that the combination of KL-Divergence Regularization Loss, KL-Divergence-aggregation Weight, Pruning-ratio-aggregation Weight, and Cross-Round Recovery will continue to preserve accuracy when pruning ratios and non-IID severity increase beyond the tested benchmark settings."}},"verdict_id":"30e7ea04-7e99-4dbc-b395-2e260638e93e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:04de3a401ef6f150634a641a8224cf4bbfa989ec968975b16fdb1a7922fc52ba","target":"record","created_at":"2026-05-20T00:05:32Z","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":"c25644be4e8bcace613b0c9708d384be82b2475c65a7df5e9bef4d8914528848","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-08-24T16:11:41Z","title_canon_sha256":"4e8e665a2e60590032db14180426aed0fe796a3d8607deda0a47a1ea361e1ef3"},"schema_version":"1.0","source":{"id":"2508.17431","kind":"arxiv","version":4}},"canonical_sha256":"69b7446f3ad7eddb36f894726ff2f9a57857efc4afd552489878d086f055098d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69b7446f3ad7eddb36f894726ff2f9a57857efc4afd552489878d086f055098d","first_computed_at":"2026-05-20T00:05:32.974069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:32.974069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4vKT3vHzMJvCkXwpkcZC14asUjYIXOWh6Fz8LFnNvNYUlcEVegEi7k2F9oIsZgwyiDU53Ta5uoaN34mN8NkPAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:32.974973Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.17431","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04de3a401ef6f150634a641a8224cf4bbfa989ec968975b16fdb1a7922fc52ba","sha256:821af17ab0e14b0f53753eca7ef877e009bff87d99ad42cf70e5a2bfc8a7118a"],"state_sha256":"f2c79230c53e6083b1d57a5217a96e667a265b242ce8a82f4fde220524a9749d"}