{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AIYIRFMDJO3JMKCJL3LOHBTWAL","short_pith_number":"pith:AIYIRFMD","schema_version":"1.0","canonical_sha256":"02308895834bb69628495ed6e3867602c013186cebe542537cde2c0e5612de3b","source":{"kind":"arxiv","id":"2607.19334","version":1},"attestation_state":"computed","paper":{"title":"Fundamental limits of distributed multiclass classification from simple binary decisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Ayalvadi Ganesh, Ioannis Papageorgiou, Parimal Parag, Sidharth Jaggi, Srinivas Nomula","submitted_at":"2026-07-21T17:53:44Z","abstract_excerpt":"We consider the problem of constructing a $K$-class classifier from the combination of $O(\\log K)$ simple binary classifiers -- this is a natural paradigm to construct a sophisticated classifier in a distributed manner with each agent performing a relatively straightforward task. We study the fundamental performance limits of such a classifier when the corresponding binary classifiers are hyperplanes. For a stylized Gaussian setting where the $K$ class centers are independent Gaussian points in $\\mathbb R^d$ and the observations are corrupted by Gaussian noise, we derive explicit performance b"},"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":"2607.19334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-07-21T17:53:44Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"92fdd59fc7ca0f4500b3b747ef0396b485b78068a6700ccd9c6d775055f7a3da","abstract_canon_sha256":"1dfb058dd5397a2224c9aff407392aa953e7aaf78378a321eb3822a295b9d895"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T01:24:37.619585Z","signature_b64":"+cw7To8sv00MRAsn/w+TZBz7vMHnQNMwndMK5ZGWcOZvkZd1dGeJ2ehS16HGV/oTffFkMg6wp76HFKDuHMnvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02308895834bb69628495ed6e3867602c013186cebe542537cde2c0e5612de3b","last_reissued_at":"2026-07-22T01:24:37.618751Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T01:24:37.618751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental limits of distributed multiclass classification from simple binary decisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Ayalvadi Ganesh, Ioannis Papageorgiou, Parimal Parag, Sidharth Jaggi, Srinivas Nomula","submitted_at":"2026-07-21T17:53:44Z","abstract_excerpt":"We consider the problem of constructing a $K$-class classifier from the combination of $O(\\log K)$ simple binary classifiers -- this is a natural paradigm to construct a sophisticated classifier in a distributed manner with each agent performing a relatively straightforward task. We study the fundamental performance limits of such a classifier when the corresponding binary classifiers are hyperplanes. For a stylized Gaussian setting where the $K$ class centers are independent Gaussian points in $\\mathbb R^d$ and the observations are corrupted by Gaussian noise, we derive explicit performance b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19334","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/2607.19334/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":"2607.19334","created_at":"2026-07-22T01:24:37.619190+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.19334v1","created_at":"2026-07-22T01:24:37.619190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19334","created_at":"2026-07-22T01:24:37.619190+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIYIRFMDJO3J","created_at":"2026-07-22T01:24:37.619190+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIYIRFMDJO3JMKCJ","created_at":"2026-07-22T01:24:37.619190+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIYIRFMD","created_at":"2026-07-22T01:24:37.619190+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/AIYIRFMDJO3JMKCJL3LOHBTWAL","json":"https://pith.science/pith/AIYIRFMDJO3JMKCJL3LOHBTWAL.json","graph_json":"https://pith.science/api/pith-number/AIYIRFMDJO3JMKCJL3LOHBTWAL/graph.json","events_json":"https://pith.science/api/pith-number/AIYIRFMDJO3JMKCJL3LOHBTWAL/events.json","paper":"https://pith.science/paper/AIYIRFMD"},"agent_actions":{"view_html":"https://pith.science/pith/AIYIRFMDJO3JMKCJL3LOHBTWAL","download_json":"https://pith.science/pith/AIYIRFMDJO3JMKCJL3LOHBTWAL.json","view_paper":"https://pith.science/paper/AIYIRFMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.19334&json=true","fetch_graph":"https://pith.science/api/pith-number/AIYIRFMDJO3JMKCJL3LOHBTWAL/graph.json","fetch_events":"https://pith.science/api/pith-number/AIYIRFMDJO3JMKCJL3LOHBTWAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIYIRFMDJO3JMKCJL3LOHBTWAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIYIRFMDJO3JMKCJL3LOHBTWAL/action/storage_attestation","attest_author":"https://pith.science/pith/AIYIRFMDJO3JMKCJL3LOHBTWAL/action/author_attestation","sign_citation":"https://pith.science/pith/AIYIRFMDJO3JMKCJL3LOHBTWAL/action/citation_signature","submit_replication":"https://pith.science/pith/AIYIRFMDJO3JMKCJL3LOHBTWAL/action/replication_record"}},"created_at":"2026-07-22T01:24:37.619190+00:00","updated_at":"2026-07-22T01:24:37.619190+00:00"}