{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DGHU3H6TFTCANC6RXUKEBHVZZ2","short_pith_number":"pith:DGHU3H6T","schema_version":"1.0","canonical_sha256":"198f4d9fd32cc4068bd1bd14409eb9ce9572560411c98730d1b04e675d6e264c","source":{"kind":"arxiv","id":"1909.03547","version":1},"attestation_state":"computed","paper":{"title":"Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Gillat Kol, Mark Braverman, Raghuvansh R. Saxena, Shay Moran","submitted_at":"2019-09-08T21:19:34Z","abstract_excerpt":"We study the Convex Set Disjointness (CSD) problem, where two players have input sets taken from an arbitrary fixed domain~$U\\subseteq \\mathbb{R}^d$ of size $\\lvert U\\rvert = n$. Their mutual goal is to decide using minimum communication whether the convex hulls of their sets intersect (equivalently, whether their sets can be separated by a hyperplane).\n  Different forms of this problem naturally arise in distributed learning and optimization: it is equivalent to {\\em Distributed Linear Program (LP) Feasibility} -- a basic task in distributed optimization, and it is tightly linked to {\\it Dist"},"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":"1909.03547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-08T21:19:34Z","cross_cats_sorted":["cs.CC","cs.CG","cs.DM","cs.LG"],"title_canon_sha256":"7ef7568c65835238ba8419941d664956527485035fe037a09b47856df5c1277c","abstract_canon_sha256":"4c97ec46a48d37fff6599b5ac3ed33a2e28032d16bb7de44fee5a68d6be56fab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:06.642107Z","signature_b64":"WkLZcaeUvx4hgWr5ZqDvArlpbc3C53MWTn6XDY15o4NNKT7El0lF1Etx80JFHM3IZRr4yRfcWcyHeeAcEBr9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"198f4d9fd32cc4068bd1bd14409eb9ce9572560411c98730d1b04e675d6e264c","last_reissued_at":"2026-07-05T00:03:06.641646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:06.641646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Gillat Kol, Mark Braverman, Raghuvansh R. Saxena, Shay Moran","submitted_at":"2019-09-08T21:19:34Z","abstract_excerpt":"We study the Convex Set Disjointness (CSD) problem, where two players have input sets taken from an arbitrary fixed domain~$U\\subseteq \\mathbb{R}^d$ of size $\\lvert U\\rvert = n$. Their mutual goal is to decide using minimum communication whether the convex hulls of their sets intersect (equivalently, whether their sets can be separated by a hyperplane).\n  Different forms of this problem naturally arise in distributed learning and optimization: it is equivalent to {\\em Distributed Linear Program (LP) Feasibility} -- a basic task in distributed optimization, and it is tightly linked to {\\it Dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.03547","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/1909.03547/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":"1909.03547","created_at":"2026-07-05T00:03:06.641703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.03547v1","created_at":"2026-07-05T00:03:06.641703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.03547","created_at":"2026-07-05T00:03:06.641703+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGHU3H6TFTCA","created_at":"2026-07-05T00:03:06.641703+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGHU3H6TFTCANC6R","created_at":"2026-07-05T00:03:06.641703+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGHU3H6T","created_at":"2026-07-05T00:03:06.641703+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09565","citing_title":"Online Set Learning from Precision and Recall Feedback","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGHU3H6TFTCANC6RXUKEBHVZZ2","json":"https://pith.science/pith/DGHU3H6TFTCANC6RXUKEBHVZZ2.json","graph_json":"https://pith.science/api/pith-number/DGHU3H6TFTCANC6RXUKEBHVZZ2/graph.json","events_json":"https://pith.science/api/pith-number/DGHU3H6TFTCANC6RXUKEBHVZZ2/events.json","paper":"https://pith.science/paper/DGHU3H6T"},"agent_actions":{"view_html":"https://pith.science/pith/DGHU3H6TFTCANC6RXUKEBHVZZ2","download_json":"https://pith.science/pith/DGHU3H6TFTCANC6RXUKEBHVZZ2.json","view_paper":"https://pith.science/paper/DGHU3H6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.03547&json=true","fetch_graph":"https://pith.science/api/pith-number/DGHU3H6TFTCANC6RXUKEBHVZZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/DGHU3H6TFTCANC6RXUKEBHVZZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGHU3H6TFTCANC6RXUKEBHVZZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGHU3H6TFTCANC6RXUKEBHVZZ2/action/storage_attestation","attest_author":"https://pith.science/pith/DGHU3H6TFTCANC6RXUKEBHVZZ2/action/author_attestation","sign_citation":"https://pith.science/pith/DGHU3H6TFTCANC6RXUKEBHVZZ2/action/citation_signature","submit_replication":"https://pith.science/pith/DGHU3H6TFTCANC6RXUKEBHVZZ2/action/replication_record"}},"created_at":"2026-07-05T00:03:06.641703+00:00","updated_at":"2026-07-05T00:03:06.641703+00:00"}