{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AU7HICEPJM6ORKCZESZCAGKPLB","short_pith_number":"pith:AU7HICEP","schema_version":"1.0","canonical_sha256":"053e74088f4b3ce8a85924b220194f58720bb1706216cf9e6a02c50beda61ac1","source":{"kind":"arxiv","id":"2106.02310","version":1},"attestation_state":"computed","paper":{"title":"FedCCEA : A Practical Approach of Client Contribution Evaluation for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.GT"],"primary_cat":"cs.LG","authors_text":"DongHee Kim, Kwangsu Kim, Sung Kuk Shyn","submitted_at":"2021-06-04T07:42:56Z","abstract_excerpt":"Client contribution evaluation, also known as data valuation, is a crucial approach in federated learning(FL) for client selection and incentive allocation. However, due to restrictions of accessibility of raw data, only limited information such as local weights and local data size of each client is open for quantifying the client contribution. Using data size from available information, we introduce an empirical evaluation method called Federated Client Contribution Evaluation through Accuracy Approximation(FedCCEA). This method builds the Accuracy Approximation Model(AAM), which estimates a "},"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":"2106.02310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-04T07:42:56Z","cross_cats_sorted":["cs.AI","cs.DC","cs.GT"],"title_canon_sha256":"ed9d13090aa0cc2eb4e6dca7995683a09b721e0fcfdaae7c98a80808db343799","abstract_canon_sha256":"7b264354ec22b86510ec91f29751154ba08ea513f46620bf63482a5bb0be9cd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:18.059908Z","signature_b64":"rXL6HJdMZNYaHMc+008Phh5J2n1wUKtT1qkiIC+JdtkX1Ljj8PDOYXFJwVlboO2LLvi6ZJESgyJeWr8VNplQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"053e74088f4b3ce8a85924b220194f58720bb1706216cf9e6a02c50beda61ac1","last_reissued_at":"2026-07-05T02:46:18.059444Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:18.059444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FedCCEA : A Practical Approach of Client Contribution Evaluation for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.GT"],"primary_cat":"cs.LG","authors_text":"DongHee Kim, Kwangsu Kim, Sung Kuk Shyn","submitted_at":"2021-06-04T07:42:56Z","abstract_excerpt":"Client contribution evaluation, also known as data valuation, is a crucial approach in federated learning(FL) for client selection and incentive allocation. However, due to restrictions of accessibility of raw data, only limited information such as local weights and local data size of each client is open for quantifying the client contribution. Using data size from available information, we introduce an empirical evaluation method called Federated Client Contribution Evaluation through Accuracy Approximation(FedCCEA). This method builds the Accuracy Approximation Model(AAM), which estimates a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02310","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/2106.02310/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":"2106.02310","created_at":"2026-07-05T02:46:18.059495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.02310v1","created_at":"2026-07-05T02:46:18.059495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02310","created_at":"2026-07-05T02:46:18.059495+00:00"},{"alias_kind":"pith_short_12","alias_value":"AU7HICEPJM6O","created_at":"2026-07-05T02:46:18.059495+00:00"},{"alias_kind":"pith_short_16","alias_value":"AU7HICEPJM6ORKCZ","created_at":"2026-07-05T02:46:18.059495+00:00"},{"alias_kind":"pith_short_8","alias_value":"AU7HICEP","created_at":"2026-07-05T02:46:18.059495+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15573","citing_title":"Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems","ref_index":126,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AU7HICEPJM6ORKCZESZCAGKPLB","json":"https://pith.science/pith/AU7HICEPJM6ORKCZESZCAGKPLB.json","graph_json":"https://pith.science/api/pith-number/AU7HICEPJM6ORKCZESZCAGKPLB/graph.json","events_json":"https://pith.science/api/pith-number/AU7HICEPJM6ORKCZESZCAGKPLB/events.json","paper":"https://pith.science/paper/AU7HICEP"},"agent_actions":{"view_html":"https://pith.science/pith/AU7HICEPJM6ORKCZESZCAGKPLB","download_json":"https://pith.science/pith/AU7HICEPJM6ORKCZESZCAGKPLB.json","view_paper":"https://pith.science/paper/AU7HICEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.02310&json=true","fetch_graph":"https://pith.science/api/pith-number/AU7HICEPJM6ORKCZESZCAGKPLB/graph.json","fetch_events":"https://pith.science/api/pith-number/AU7HICEPJM6ORKCZESZCAGKPLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AU7HICEPJM6ORKCZESZCAGKPLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AU7HICEPJM6ORKCZESZCAGKPLB/action/storage_attestation","attest_author":"https://pith.science/pith/AU7HICEPJM6ORKCZESZCAGKPLB/action/author_attestation","sign_citation":"https://pith.science/pith/AU7HICEPJM6ORKCZESZCAGKPLB/action/citation_signature","submit_replication":"https://pith.science/pith/AU7HICEPJM6ORKCZESZCAGKPLB/action/replication_record"}},"created_at":"2026-07-05T02:46:18.059495+00:00","updated_at":"2026-07-05T02:46:18.059495+00:00"}