{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EHNKC6UFDJOJO5TY5LD34VHKEI","short_pith_number":"pith:EHNKC6UF","schema_version":"1.0","canonical_sha256":"21daa17a851a5c977678eac7be54ea221411d8e09984e26d611e3dd43eb3158e","source":{"kind":"arxiv","id":"1301.4679","version":2},"attestation_state":"computed","paper":{"title":"Cellular Tree Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"DMA, G\\'erard Biau (LPMA, INRIA Paris - Rocquencourt), LSTA, Luc Devroye (SOCS)","submitted_at":"2013-01-20T20:01:54Z","abstract_excerpt":"The cellular tree classifier model addresses a fundamental problem in the design of classifiers for a parallel or distributed computing world: Given a data set, is it sufficient to apply a majority rule for classification, or shall one split the data into two or more parts and send each part to a potentially different computer (or cell) for further processing? At first sight, it seems impossible to define with this paradigm a consistent classifier as no cell knows the \"original data size\", $n$. However, we show that this is not so by exhibiting two different consistent classifiers. The consist"},"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":"1301.4679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-20T20:01:54Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"79ecda4540f247b253866239da9d257e038c2e091e7140d586aef60f3469898d","abstract_canon_sha256":"49b783f9851cb92aa400f5b6a5a8185a66b87d9f42c67ef81680c1e961514424"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:59.084545Z","signature_b64":"KPX6c5XJPfjKvqQr+gwEPaDQzMgpIIzatkADPOi0GoJsBXj8UlVXrzHvbLkYi2u73VzPC14IUrBZ/OnpV6L+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21daa17a851a5c977678eac7be54ea221411d8e09984e26d611e3dd43eb3158e","last_reissued_at":"2026-05-18T03:19:59.084057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:59.084057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cellular Tree Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"DMA, G\\'erard Biau (LPMA, INRIA Paris - Rocquencourt), LSTA, Luc Devroye (SOCS)","submitted_at":"2013-01-20T20:01:54Z","abstract_excerpt":"The cellular tree classifier model addresses a fundamental problem in the design of classifiers for a parallel or distributed computing world: Given a data set, is it sufficient to apply a majority rule for classification, or shall one split the data into two or more parts and send each part to a potentially different computer (or cell) for further processing? At first sight, it seems impossible to define with this paradigm a consistent classifier as no cell knows the \"original data size\", $n$. However, we show that this is not so by exhibiting two different consistent classifiers. The consist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4679","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1301.4679","created_at":"2026-05-18T03:19:59.084126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4679v2","created_at":"2026-05-18T03:19:59.084126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4679","created_at":"2026-05-18T03:19:59.084126+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHNKC6UFDJOJ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHNKC6UFDJOJO5TY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHNKC6UF","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EHNKC6UFDJOJO5TY5LD34VHKEI","json":"https://pith.science/pith/EHNKC6UFDJOJO5TY5LD34VHKEI.json","graph_json":"https://pith.science/api/pith-number/EHNKC6UFDJOJO5TY5LD34VHKEI/graph.json","events_json":"https://pith.science/api/pith-number/EHNKC6UFDJOJO5TY5LD34VHKEI/events.json","paper":"https://pith.science/paper/EHNKC6UF"},"agent_actions":{"view_html":"https://pith.science/pith/EHNKC6UFDJOJO5TY5LD34VHKEI","download_json":"https://pith.science/pith/EHNKC6UFDJOJO5TY5LD34VHKEI.json","view_paper":"https://pith.science/paper/EHNKC6UF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4679&json=true","fetch_graph":"https://pith.science/api/pith-number/EHNKC6UFDJOJO5TY5LD34VHKEI/graph.json","fetch_events":"https://pith.science/api/pith-number/EHNKC6UFDJOJO5TY5LD34VHKEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHNKC6UFDJOJO5TY5LD34VHKEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHNKC6UFDJOJO5TY5LD34VHKEI/action/storage_attestation","attest_author":"https://pith.science/pith/EHNKC6UFDJOJO5TY5LD34VHKEI/action/author_attestation","sign_citation":"https://pith.science/pith/EHNKC6UFDJOJO5TY5LD34VHKEI/action/citation_signature","submit_replication":"https://pith.science/pith/EHNKC6UFDJOJO5TY5LD34VHKEI/action/replication_record"}},"created_at":"2026-05-18T03:19:59.084126+00:00","updated_at":"2026-05-18T03:19:59.084126+00:00"}