{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VZM2SIIMLB22UM6O3AXSRF77WH","short_pith_number":"pith:VZM2SIIM","schema_version":"1.0","canonical_sha256":"ae59a9210c5875aa33ced82f2897ffb1e5cea5b233541fdc38f926d2150fbdeb","source":{"kind":"arxiv","id":"2009.09371","version":1},"attestation_state":"computed","paper":{"title":"Estimation of Individual Device Contributions for Incentivizing Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.LG","authors_text":"Narayan B. Mandayam, Ryoichi Shinkuma, Takayuki Nishio","submitted_at":"2020-09-20T07:03:27Z","abstract_excerpt":"Federated learning (FL) is an emerging technique used to train a machine-learning model collaboratively using the data and computation resource of the mobile devices without exposing privacy-sensitive user data.\n  Appropriate incentive mechanisms that motivate the data and mobile-device owner to participate in FL is key to building a sustainable platform for FL. However, it is difficult to evaluate the contribution level of the devices/owners to determine appropriate rewards without large computation and communication overhead.\n  This paper proposes a computation-and communication-efficient me"},"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":"2009.09371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-20T07:03:27Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"517871898ffadbe86b753a4b0ed8643c1784144f6fdc6d4e06b2a0c5eb940f20","abstract_canon_sha256":"bd656b2fe8796bffe752fa4fab5ff85ae1f305fde15b750b33ef1f6be95cf77f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:37.213573Z","signature_b64":"Dg34LmQB+7HDwQH0VUMak/qxES84759XUhnTFTQz+0RFr5xvN2HnabOmnQyp+xISHNap5bOfDJGvfdeWBZd8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae59a9210c5875aa33ced82f2897ffb1e5cea5b233541fdc38f926d2150fbdeb","last_reissued_at":"2026-07-05T01:36:37.213184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:37.213184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimation of Individual Device Contributions for Incentivizing Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.LG","authors_text":"Narayan B. Mandayam, Ryoichi Shinkuma, Takayuki Nishio","submitted_at":"2020-09-20T07:03:27Z","abstract_excerpt":"Federated learning (FL) is an emerging technique used to train a machine-learning model collaboratively using the data and computation resource of the mobile devices without exposing privacy-sensitive user data.\n  Appropriate incentive mechanisms that motivate the data and mobile-device owner to participate in FL is key to building a sustainable platform for FL. However, it is difficult to evaluate the contribution level of the devices/owners to determine appropriate rewards without large computation and communication overhead.\n  This paper proposes a computation-and communication-efficient me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.09371","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/2009.09371/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":"2009.09371","created_at":"2026-07-05T01:36:37.213244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.09371v1","created_at":"2026-07-05T01:36:37.213244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.09371","created_at":"2026-07-05T01:36:37.213244+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZM2SIIMLB22","created_at":"2026-07-05T01:36:37.213244+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZM2SIIMLB22UM6O","created_at":"2026-07-05T01:36:37.213244+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZM2SIIM","created_at":"2026-07-05T01:36:37.213244+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":125,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VZM2SIIMLB22UM6O3AXSRF77WH","json":"https://pith.science/pith/VZM2SIIMLB22UM6O3AXSRF77WH.json","graph_json":"https://pith.science/api/pith-number/VZM2SIIMLB22UM6O3AXSRF77WH/graph.json","events_json":"https://pith.science/api/pith-number/VZM2SIIMLB22UM6O3AXSRF77WH/events.json","paper":"https://pith.science/paper/VZM2SIIM"},"agent_actions":{"view_html":"https://pith.science/pith/VZM2SIIMLB22UM6O3AXSRF77WH","download_json":"https://pith.science/pith/VZM2SIIMLB22UM6O3AXSRF77WH.json","view_paper":"https://pith.science/paper/VZM2SIIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.09371&json=true","fetch_graph":"https://pith.science/api/pith-number/VZM2SIIMLB22UM6O3AXSRF77WH/graph.json","fetch_events":"https://pith.science/api/pith-number/VZM2SIIMLB22UM6O3AXSRF77WH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZM2SIIMLB22UM6O3AXSRF77WH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZM2SIIMLB22UM6O3AXSRF77WH/action/storage_attestation","attest_author":"https://pith.science/pith/VZM2SIIMLB22UM6O3AXSRF77WH/action/author_attestation","sign_citation":"https://pith.science/pith/VZM2SIIMLB22UM6O3AXSRF77WH/action/citation_signature","submit_replication":"https://pith.science/pith/VZM2SIIMLB22UM6O3AXSRF77WH/action/replication_record"}},"created_at":"2026-07-05T01:36:37.213244+00:00","updated_at":"2026-07-05T01:36:37.213244+00:00"}