{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J7CXPOEIKKRW33KJRQAHOBBRVU","short_pith_number":"pith:J7CXPOEI","canonical_record":{"source":{"id":"1408.2803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-12T18:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"d65abed2127f90dc7c8609e16331347bf27c601a1aa732b77ce37e616a3405cd","abstract_canon_sha256":"8bc92f49b528980d0e0335a0e2a857438d92e22bef9dc3d5f45fe04f5527d56a"},"schema_version":"1.0"},"canonical_sha256":"4fc577b88852a36ded498c00770431ad19a165b13d88df66de1e715604bd77fb","source":{"kind":"arxiv","id":"1408.2803","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2803","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2803v2","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2803","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"J7CXPOEIKKRW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J7CXPOEIKKRW33KJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J7CXPOEI","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J7CXPOEIKKRW33KJRQAHOBBRVU","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-12T18:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"d65abed2127f90dc7c8609e16331347bf27c601a1aa732b77ce37e616a3405cd","abstract_canon_sha256":"8bc92f49b528980d0e0335a0e2a857438d92e22bef9dc3d5f45fe04f5527d56a"},"schema_version":"1.0"},"canonical_sha256":"4fc577b88852a36ded498c00770431ad19a165b13d88df66de1e715604bd77fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:22.781232Z","signature_b64":"WOQaGd8zXl4sAtwnw+SeSBzfPIXKtfw/hln4otjoSsZ3Op97JlGhUgpaGrWX3rLdj9uhRWH/ljcDarIr5beQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fc577b88852a36ded498c00770431ad19a165b13d88df66de1e715604bd77fb","last_reissued_at":"2026-05-18T00:45:22.780561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:22.780561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2803","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-18T00:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpo3Y3PpsgGPzfkVV9XDiTIjzXq3eQlrz7R18UoLXvESvNcfdvHoJCVtxKGmdU+xDcjWQ3jEK2YWE5ptqkc9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:48:53.059806Z"},"content_sha256":"6977c72a30a7c981837246ceb3e6f6e2a4cd20e653d764e03e989f72931b239c","schema_version":"1.0","event_id":"sha256:6977c72a30a7c981837246ceb3e6f6e2a4cd20e653d764e03e989f72931b239c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J7CXPOEIKKRW33KJRQAHOBBRVU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning a hyperplane classifier by minimizing an exact bound on the VC dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jayadeva","submitted_at":"2014-08-12T18:57:48Z","abstract_excerpt":"The VC dimension measures the capacity of a learning machine, and a low VC dimension leads to good generalization. While SVMs produce state-of-the-art learning performance, it is well known that the VC dimension of a SVM can be unbounded; despite good results in practice, there is no guarantee of good generalization. In this paper, we show how to learn a hyperplane classifier by minimizing an exact, or \\boldmath{$\\Theta$} bound on its VC dimension. The proposed approach, termed as the Minimal Complexity Machine (MCM), involves solving a simple linear programming problem. Experimental results s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2803","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-18T00:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRfRH8R6vnGztiD5nOPpmHP/ttLmdu0zZfvAWmcjxTavawFO6yaBAaLxTo4G3BM/MD7YyUobhu9GzrH+1iEQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:48:53.060144Z"},"content_sha256":"dfd0ebe99ce79dfb355ea9c8fc66cc155f413d6cf9ccc34f38720d834663eac6","schema_version":"1.0","event_id":"sha256:dfd0ebe99ce79dfb355ea9c8fc66cc155f413d6cf9ccc34f38720d834663eac6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7CXPOEIKKRW33KJRQAHOBBRVU/bundle.json","state_url":"https://pith.science/pith/J7CXPOEIKKRW33KJRQAHOBBRVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7CXPOEIKKRW33KJRQAHOBBRVU/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-06-27T18:48:53Z","links":{"resolver":"https://pith.science/pith/J7CXPOEIKKRW33KJRQAHOBBRVU","bundle":"https://pith.science/pith/J7CXPOEIKKRW33KJRQAHOBBRVU/bundle.json","state":"https://pith.science/pith/J7CXPOEIKKRW33KJRQAHOBBRVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7CXPOEIKKRW33KJRQAHOBBRVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J7CXPOEIKKRW33KJRQAHOBBRVU","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":"8bc92f49b528980d0e0335a0e2a857438d92e22bef9dc3d5f45fe04f5527d56a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-12T18:57:48Z","title_canon_sha256":"d65abed2127f90dc7c8609e16331347bf27c601a1aa732b77ce37e616a3405cd"},"schema_version":"1.0","source":{"id":"1408.2803","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2803","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2803v2","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2803","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"J7CXPOEIKKRW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J7CXPOEIKKRW33KJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J7CXPOEI","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:dfd0ebe99ce79dfb355ea9c8fc66cc155f413d6cf9ccc34f38720d834663eac6","target":"graph","created_at":"2026-05-18T00:45:22Z","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":"The VC dimension measures the capacity of a learning machine, and a low VC dimension leads to good generalization. While SVMs produce state-of-the-art learning performance, it is well known that the VC dimension of a SVM can be unbounded; despite good results in practice, there is no guarantee of good generalization. In this paper, we show how to learn a hyperplane classifier by minimizing an exact, or \\boldmath{$\\Theta$} bound on its VC dimension. The proposed approach, termed as the Minimal Complexity Machine (MCM), involves solving a simple linear programming problem. Experimental results s","authors_text":"Jayadeva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-12T18:57:48Z","title":"Learning a hyperplane classifier by minimizing an exact bound on the VC dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2803","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:6977c72a30a7c981837246ceb3e6f6e2a4cd20e653d764e03e989f72931b239c","target":"record","created_at":"2026-05-18T00:45:22Z","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":"8bc92f49b528980d0e0335a0e2a857438d92e22bef9dc3d5f45fe04f5527d56a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-12T18:57:48Z","title_canon_sha256":"d65abed2127f90dc7c8609e16331347bf27c601a1aa732b77ce37e616a3405cd"},"schema_version":"1.0","source":{"id":"1408.2803","kind":"arxiv","version":2}},"canonical_sha256":"4fc577b88852a36ded498c00770431ad19a165b13d88df66de1e715604bd77fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fc577b88852a36ded498c00770431ad19a165b13d88df66de1e715604bd77fb","first_computed_at":"2026-05-18T00:45:22.780561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:22.780561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WOQaGd8zXl4sAtwnw+SeSBzfPIXKtfw/hln4otjoSsZ3Op97JlGhUgpaGrWX3rLdj9uhRWH/ljcDarIr5beQCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:22.781232Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2803","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6977c72a30a7c981837246ceb3e6f6e2a4cd20e653d764e03e989f72931b239c","sha256:dfd0ebe99ce79dfb355ea9c8fc66cc155f413d6cf9ccc34f38720d834663eac6"],"state_sha256":"c3e7deb3096fea13c42b8db6bab37f2579283ef46e6d75e5dc0aaa20fa2b46a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Csoa+Hq5rvWeM2L1dd87Tm+/XOHYkz7rpn8rcjw5yqsZDUL+hVEM7mtexy4QUcrbyI3HCrhKn2VG/aeqPTtqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:48:53.062008Z","bundle_sha256":"4cf24446df73a8a19f15f89ade7460a707f0427f08f19c1697e84cdec4009ecc"}}