{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RTJEDT5GWGFIGUMUXZ7GJC6JHI","short_pith_number":"pith:RTJEDT5G","schema_version":"1.0","canonical_sha256":"8cd241cfa6b18a835194be7e648bc93a2b04d138dd183588573c1ec0cfea076a","source":{"kind":"arxiv","id":"1811.12629","version":4},"attestation_state":"computed","paper":{"title":"LoAdaBoost: loss-based AdaBoost federated machine learning with reduced computational complexity on IID and non-IID intensive care data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dianbo Liu, Hao Deng, Li Huang, Shifa Zhang, Yifeng Yin, Zeng Fu","submitted_at":"2018-11-30T06:05:21Z","abstract_excerpt":"Intensive care data are valuable for improvement of health care, policy making and many other purposes. Vast amount of such data are stored in different locations, on many different devices and in different data silos. Sharing data among different sources is a big challenge due to regulatory, operational and security reasons. One potential solution is federated machine learning, which is a method that sends machine learning algorithms simultaneously to all data sources, trains models in each source and aggregates the learned models. This strategy allows utilization of valuable data without mov"},"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":"1811.12629","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-30T06:05:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ca4ebb58b2fc26221cd1149467a7bfed1e270b7951468ad2110d9940addc37d4","abstract_canon_sha256":"8635e412dd7313b5e90c52b81501baa785af93a23100e0dc406b87f74e103ea9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:37.790333Z","signature_b64":"CEfJ7+sBTMKuc0dr3qsvH38TXXIzYQ7geey/4KTXmAeq1g/KyHvJoMy49P6MAAb0BYYxgrNFqO1LgnlfkF48Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd241cfa6b18a835194be7e648bc93a2b04d138dd183588573c1ec0cfea076a","last_reissued_at":"2026-07-05T01:26:37.789805Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:37.789805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoAdaBoost: loss-based AdaBoost federated machine learning with reduced computational complexity on IID and non-IID intensive care data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dianbo Liu, Hao Deng, Li Huang, Shifa Zhang, Yifeng Yin, Zeng Fu","submitted_at":"2018-11-30T06:05:21Z","abstract_excerpt":"Intensive care data are valuable for improvement of health care, policy making and many other purposes. Vast amount of such data are stored in different locations, on many different devices and in different data silos. Sharing data among different sources is a big challenge due to regulatory, operational and security reasons. One potential solution is federated machine learning, which is a method that sends machine learning algorithms simultaneously to all data sources, trains models in each source and aggregates the learned models. This strategy allows utilization of valuable data without mov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12629","kind":"arxiv","version":4},"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/1811.12629/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":"1811.12629","created_at":"2026-07-05T01:26:37.789881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12629v4","created_at":"2026-07-05T01:26:37.789881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12629","created_at":"2026-07-05T01:26:37.789881+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTJEDT5GWGFI","created_at":"2026-07-05T01:26:37.789881+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTJEDT5GWGFIGUMU","created_at":"2026-07-05T01:26:37.789881+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTJEDT5G","created_at":"2026-07-05T01:26:37.789881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.06426","citing_title":"Multi-hop Federated Private Data Augmentation with Sample Compression","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RTJEDT5GWGFIGUMUXZ7GJC6JHI","json":"https://pith.science/pith/RTJEDT5GWGFIGUMUXZ7GJC6JHI.json","graph_json":"https://pith.science/api/pith-number/RTJEDT5GWGFIGUMUXZ7GJC6JHI/graph.json","events_json":"https://pith.science/api/pith-number/RTJEDT5GWGFIGUMUXZ7GJC6JHI/events.json","paper":"https://pith.science/paper/RTJEDT5G"},"agent_actions":{"view_html":"https://pith.science/pith/RTJEDT5GWGFIGUMUXZ7GJC6JHI","download_json":"https://pith.science/pith/RTJEDT5GWGFIGUMUXZ7GJC6JHI.json","view_paper":"https://pith.science/paper/RTJEDT5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12629&json=true","fetch_graph":"https://pith.science/api/pith-number/RTJEDT5GWGFIGUMUXZ7GJC6JHI/graph.json","fetch_events":"https://pith.science/api/pith-number/RTJEDT5GWGFIGUMUXZ7GJC6JHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTJEDT5GWGFIGUMUXZ7GJC6JHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTJEDT5GWGFIGUMUXZ7GJC6JHI/action/storage_attestation","attest_author":"https://pith.science/pith/RTJEDT5GWGFIGUMUXZ7GJC6JHI/action/author_attestation","sign_citation":"https://pith.science/pith/RTJEDT5GWGFIGUMUXZ7GJC6JHI/action/citation_signature","submit_replication":"https://pith.science/pith/RTJEDT5GWGFIGUMUXZ7GJC6JHI/action/replication_record"}},"created_at":"2026-07-05T01:26:37.789881+00:00","updated_at":"2026-07-05T01:26:37.789881+00:00"}