{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NDKSJTMU7THRVSREGBZN5U5D42","short_pith_number":"pith:NDKSJTMU","canonical_record":{"source":{"id":"1107.1358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-07T11:58:52Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"2e47fd15edd3695ed3f5f92cd40b91c5e48c38e016423ca685e8c1b6f6dd60b7","abstract_canon_sha256":"2523cfa2dec83aad1e592dce88e01a954bc25d591f0147a91f3df49d9e03720c"},"schema_version":"1.0"},"canonical_sha256":"68d524cd94fccf1aca243072ded3a3e6bf2cb6d33e233e39a5e282d83591fb01","source":{"kind":"arxiv","id":"1107.1358","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1358","created_at":"2026-05-18T04:03:09Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1358v2","created_at":"2026-05-18T04:03:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1358","created_at":"2026-05-18T04:03:09Z"},{"alias_kind":"pith_short_12","alias_value":"NDKSJTMU7THR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NDKSJTMU7THRVSRE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NDKSJTMU","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NDKSJTMU7THRVSREGBZN5U5D42","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-07T11:58:52Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"2e47fd15edd3695ed3f5f92cd40b91c5e48c38e016423ca685e8c1b6f6dd60b7","abstract_canon_sha256":"2523cfa2dec83aad1e592dce88e01a954bc25d591f0147a91f3df49d9e03720c"},"schema_version":"1.0"},"canonical_sha256":"68d524cd94fccf1aca243072ded3a3e6bf2cb6d33e233e39a5e282d83591fb01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:09.188839Z","signature_b64":"ZltqSBgBC7dg1FNbKwYj1Y6sO6rGOEcc69AEzamU336CnJFHrFcU1vK69zg0I8lzGMzMsonqj/q6oK19Il8SDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68d524cd94fccf1aca243072ded3a3e6bf2cb6d33e233e39a5e282d83591fb01","last_reissued_at":"2026-05-18T04:03:09.188049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:09.188049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1358","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:03:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYmRNbcjIkHGYcOl3Go98A6xRYwS6EeU/d8IrC/+ppfRnnJ1vtgmvrI/qaPKMeFKpsmXfoz2wv1SFCAOjCTMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:28:14.553563Z"},"content_sha256":"a81c64adf42c0c9cec8eee403db36379836fc2907f2068a38ba8ea443cf114b2","schema_version":"1.0","event_id":"sha256:a81c64adf42c0c9cec8eee403db36379836fc2907f2068a38ba8ea443cf114b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NDKSJTMU7THRVSREGBZN5U5D42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Furthest Hyperplane Problem and Maximal Margin Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Edo Liberty, Omri Weinstein, Roy Schwartz, Shachar Lovett, Zohar Karnin","submitted_at":"2011-07-07T11:58:52Z","abstract_excerpt":"This paper introduces the Furthest Hyperplane Problem (FHP), which is an unsupervised counterpart of Support Vector Machines. Given a set of n points in Rd, the objective is to produce the hyperplane (passing through the origin) which maximizes the separation margin, that is, the minimal distance between the hyperplane and any input point. To the best of our knowledge, this is the first paper achieving provable results regarding FHP. We provide both lower and upper bounds to this NP-hard problem. First, we give a simple randomized algorithm whose running time is n^O(1/{\\theta}^2) where {\\theta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1358","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:03:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ya7TklNJeHClVB1HXZ0Nf5Zm4nt6oKR0W4JiPzR3sg3AW3/VdxVjHKjS0ELsJ++Iti32eK5KsC7/Ay6Dr+RLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:28:14.554178Z"},"content_sha256":"2f11ff80790437070eb2eb341852f44d87e4e7d187b06a3d4dd07cb75a84b011","schema_version":"1.0","event_id":"sha256:2f11ff80790437070eb2eb341852f44d87e4e7d187b06a3d4dd07cb75a84b011"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDKSJTMU7THRVSREGBZN5U5D42/bundle.json","state_url":"https://pith.science/pith/NDKSJTMU7THRVSREGBZN5U5D42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDKSJTMU7THRVSREGBZN5U5D42/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T09:28:14Z","links":{"resolver":"https://pith.science/pith/NDKSJTMU7THRVSREGBZN5U5D42","bundle":"https://pith.science/pith/NDKSJTMU7THRVSREGBZN5U5D42/bundle.json","state":"https://pith.science/pith/NDKSJTMU7THRVSREGBZN5U5D42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDKSJTMU7THRVSREGBZN5U5D42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NDKSJTMU7THRVSREGBZN5U5D42","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":"2523cfa2dec83aad1e592dce88e01a954bc25d591f0147a91f3df49d9e03720c","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-07T11:58:52Z","title_canon_sha256":"2e47fd15edd3695ed3f5f92cd40b91c5e48c38e016423ca685e8c1b6f6dd60b7"},"schema_version":"1.0","source":{"id":"1107.1358","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1358","created_at":"2026-05-18T04:03:09Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1358v2","created_at":"2026-05-18T04:03:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1358","created_at":"2026-05-18T04:03:09Z"},{"alias_kind":"pith_short_12","alias_value":"NDKSJTMU7THR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NDKSJTMU7THRVSRE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NDKSJTMU","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:2f11ff80790437070eb2eb341852f44d87e4e7d187b06a3d4dd07cb75a84b011","target":"graph","created_at":"2026-05-18T04:03:09Z","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"},"paper":{"abstract_excerpt":"This paper introduces the Furthest Hyperplane Problem (FHP), which is an unsupervised counterpart of Support Vector Machines. Given a set of n points in Rd, the objective is to produce the hyperplane (passing through the origin) which maximizes the separation margin, that is, the minimal distance between the hyperplane and any input point. To the best of our knowledge, this is the first paper achieving provable results regarding FHP. We provide both lower and upper bounds to this NP-hard problem. First, we give a simple randomized algorithm whose running time is n^O(1/{\\theta}^2) where {\\theta","authors_text":"Edo Liberty, Omri Weinstein, Roy Schwartz, Shachar Lovett, Zohar Karnin","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-07T11:58:52Z","title":"On the Furthest Hyperplane Problem and Maximal Margin Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1358","kind":"arxiv","version":2},"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:a81c64adf42c0c9cec8eee403db36379836fc2907f2068a38ba8ea443cf114b2","target":"record","created_at":"2026-05-18T04:03:09Z","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":"2523cfa2dec83aad1e592dce88e01a954bc25d591f0147a91f3df49d9e03720c","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-07T11:58:52Z","title_canon_sha256":"2e47fd15edd3695ed3f5f92cd40b91c5e48c38e016423ca685e8c1b6f6dd60b7"},"schema_version":"1.0","source":{"id":"1107.1358","kind":"arxiv","version":2}},"canonical_sha256":"68d524cd94fccf1aca243072ded3a3e6bf2cb6d33e233e39a5e282d83591fb01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68d524cd94fccf1aca243072ded3a3e6bf2cb6d33e233e39a5e282d83591fb01","first_computed_at":"2026-05-18T04:03:09.188049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:09.188049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZltqSBgBC7dg1FNbKwYj1Y6sO6rGOEcc69AEzamU336CnJFHrFcU1vK69zg0I8lzGMzMsonqj/q6oK19Il8SDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:09.188839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1358","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a81c64adf42c0c9cec8eee403db36379836fc2907f2068a38ba8ea443cf114b2","sha256:2f11ff80790437070eb2eb341852f44d87e4e7d187b06a3d4dd07cb75a84b011"],"state_sha256":"d70c356c5113f0e94caa83e1770e839752019d18e1a4da6852cb5d92a26bad36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"152gNGv0nG8hfGVXNZdAWiD/SKvq5gM+r0o47KvwtB2tfi8mhsPkTKA+d4pZbM5eGXmKHW4BP4L+uAF14Tk0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:28:14.557138Z","bundle_sha256":"4eac1175abd4f93bf8e1ca3d384dff43389f45d3eef83737548b6c687e91b73b"}}