{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DGHU3H6TFTCANC6RXUKEBHVZZ2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4c97ec46a48d37fff6599b5ac3ed33a2e28032d16bb7de44fee5a68d6be56fab","cross_cats_sorted":["cs.CC","cs.CG","cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-08T21:19:34Z","title_canon_sha256":"7ef7568c65835238ba8419941d664956527485035fe037a09b47856df5c1277c"},"schema_version":"1.0","source":{"id":"1909.03547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.03547","created_at":"2026-07-05T00:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1909.03547v1","created_at":"2026-07-05T00:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.03547","created_at":"2026-07-05T00:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"DGHU3H6TFTCA","created_at":"2026-07-05T00:03:06Z"},{"alias_kind":"pith_short_16","alias_value":"DGHU3H6TFTCANC6R","created_at":"2026-07-05T00:03:06Z"},{"alias_kind":"pith_short_8","alias_value":"DGHU3H6T","created_at":"2026-07-05T00:03:06Z"}],"graph_snapshots":[{"event_id":"sha256:0bbda7948f238943d992917923a6f1f313ac6d8c12222e31b9e062b1895be591","target":"graph","created_at":"2026-07-05T00:03:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.03547/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gillat Kol, Mark Braverman, Raghuvansh R. Saxena, Shay Moran","cross_cats":["cs.CC","cs.CG","cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-08T21:19:34Z","title":"Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.03547","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:105025ffb64ad4491e605e1598771225636c5f99a06dae20908601151e817949","target":"record","created_at":"2026-07-05T00:03:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4c97ec46a48d37fff6599b5ac3ed33a2e28032d16bb7de44fee5a68d6be56fab","cross_cats_sorted":["cs.CC","cs.CG","cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-08T21:19:34Z","title_canon_sha256":"7ef7568c65835238ba8419941d664956527485035fe037a09b47856df5c1277c"},"schema_version":"1.0","source":{"id":"1909.03547","kind":"arxiv","version":1}},"canonical_sha256":"198f4d9fd32cc4068bd1bd14409eb9ce9572560411c98730d1b04e675d6e264c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"198f4d9fd32cc4068bd1bd14409eb9ce9572560411c98730d1b04e675d6e264c","first_computed_at":"2026-07-05T00:03:06.641646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:03:06.641646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WkLZcaeUvx4hgWr5ZqDvArlpbc3C53MWTn6XDY15o4NNKT7El0lF1Etx80JFHM3IZRr4yRfcWcyHeeAcEBr9AA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:03:06.642107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.03547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:105025ffb64ad4491e605e1598771225636c5f99a06dae20908601151e817949","sha256:0bbda7948f238943d992917923a6f1f313ac6d8c12222e31b9e062b1895be591"],"state_sha256":"78519009a1a9f1320a489a8964af4e6b94180587c6cfab922ac70e3c0f4738e9"}