{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ERI4RNGVMX5A32KGJ6AMS6PTPI","short_pith_number":"pith:ERI4RNGV","canonical_record":{"source":{"id":"1410.4573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-16T20:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"0896c29e65b49e7a700beb03ef91d4fc617f11996c291fcd268ca35ce9723fd8","abstract_canon_sha256":"ab65bbe22e59f9e5895ba6e1ebae7ce10f5430026fe9c6fdbfbcbe74ba519050"},"schema_version":"1.0"},"canonical_sha256":"2451c8b4d565fa0de9464f80c979f37a212da453123c9e7db74c70187910f767","source":{"kind":"arxiv","id":"1410.4573","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4573","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4573v1","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4573","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"ERI4RNGVMX5A","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ERI4RNGVMX5A32KG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ERI4RNGV","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ERI4RNGVMX5A32KGJ6AMS6PTPI","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-16T20:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"0896c29e65b49e7a700beb03ef91d4fc617f11996c291fcd268ca35ce9723fd8","abstract_canon_sha256":"ab65bbe22e59f9e5895ba6e1ebae7ce10f5430026fe9c6fdbfbcbe74ba519050"},"schema_version":"1.0"},"canonical_sha256":"2451c8b4d565fa0de9464f80c979f37a212da453123c9e7db74c70187910f767","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:22.740351Z","signature_b64":"W8rnbCKNiHesbMoyXqIehxvspRFh3IPSzBBRrrDr3bFu3/ovhQpvX74kQ9nVuq7tZfSzicqtlieBnZj1y1mjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2451c8b4d565fa0de9464f80c979f37a212da453123c9e7db74c70187910f767","last_reissued_at":"2026-05-18T00:45:22.739830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:22.739830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4573","source_version":1,"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":"KuPMvda+xsy8U8PvGlTvZ1C87fQhL5KIqQMMRssSi6gFBTxvvTdLi0FO8D2S2ry8el/oms5zO79yZrEu/ErwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:20:57.474280Z"},"content_sha256":"5c466be27c5ace936b4fc823e77b315822518d87e3c6ab33bf31fa83c7e0edd2","schema_version":"1.0","event_id":"sha256:5c466be27c5ace936b4fc823e77b315822518d87e3c6ab33bf31fa83c7e0edd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ERI4RNGVMX5A32KGJ6AMS6PTPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning a hyperplane regressor 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, Sanjit S. Batra, Siddarth Sabharwal, Suresh Chandra","submitted_at":"2014-10-16T20:04:49Z","abstract_excerpt":"The capacity of a learning machine is measured by its Vapnik-Chervonenkis dimension, and learning machines with a low VC dimension generalize better. It is well known that the VC dimension of SVMs can be very large or unbounded, even though they generally yield state-of-the-art learning performance. In this paper, we show how to learn a hyperplane regressor by minimizing an exact, or \\boldmath{$\\Theta$} bound on its VC dimension. The proposed approach, termed as the Minimal Complexity Machine (MCM) Regressor, involves solving a simple linear programming problem. Experimental results show, that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4573","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":""},"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":"en4BHRXeqM2iZqMX5GbU15q8I/478RImX1MALY9wfmLEe9ECeD+UxqnctSh7A44vwK0iEDbxsG+dwEy8H07BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:20:57.474652Z"},"content_sha256":"1deca62492d2bf8be011dd2f943c5cad22649b6362a2b88c331ac0640ed38d43","schema_version":"1.0","event_id":"sha256:1deca62492d2bf8be011dd2f943c5cad22649b6362a2b88c331ac0640ed38d43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/bundle.json","state_url":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/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-27T17:20:57Z","links":{"resolver":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI","bundle":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/bundle.json","state":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ERI4RNGVMX5A32KGJ6AMS6PTPI","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":"ab65bbe22e59f9e5895ba6e1ebae7ce10f5430026fe9c6fdbfbcbe74ba519050","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-16T20:04:49Z","title_canon_sha256":"0896c29e65b49e7a700beb03ef91d4fc617f11996c291fcd268ca35ce9723fd8"},"schema_version":"1.0","source":{"id":"1410.4573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4573","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4573v1","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4573","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"ERI4RNGVMX5A","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ERI4RNGVMX5A32KG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ERI4RNGV","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:1deca62492d2bf8be011dd2f943c5cad22649b6362a2b88c331ac0640ed38d43","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 capacity of a learning machine is measured by its Vapnik-Chervonenkis dimension, and learning machines with a low VC dimension generalize better. It is well known that the VC dimension of SVMs can be very large or unbounded, even though they generally yield state-of-the-art learning performance. In this paper, we show how to learn a hyperplane regressor by minimizing an exact, or \\boldmath{$\\Theta$} bound on its VC dimension. The proposed approach, termed as the Minimal Complexity Machine (MCM) Regressor, involves solving a simple linear programming problem. Experimental results show, that","authors_text":"Jayadeva, Sanjit S. Batra, Siddarth Sabharwal, Suresh Chandra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-16T20:04:49Z","title":"Learning a hyperplane regressor by minimizing an exact bound on the VC dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4573","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:5c466be27c5ace936b4fc823e77b315822518d87e3c6ab33bf31fa83c7e0edd2","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":"ab65bbe22e59f9e5895ba6e1ebae7ce10f5430026fe9c6fdbfbcbe74ba519050","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-16T20:04:49Z","title_canon_sha256":"0896c29e65b49e7a700beb03ef91d4fc617f11996c291fcd268ca35ce9723fd8"},"schema_version":"1.0","source":{"id":"1410.4573","kind":"arxiv","version":1}},"canonical_sha256":"2451c8b4d565fa0de9464f80c979f37a212da453123c9e7db74c70187910f767","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2451c8b4d565fa0de9464f80c979f37a212da453123c9e7db74c70187910f767","first_computed_at":"2026-05-18T00:45:22.739830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:22.739830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W8rnbCKNiHesbMoyXqIehxvspRFh3IPSzBBRrrDr3bFu3/ovhQpvX74kQ9nVuq7tZfSzicqtlieBnZj1y1mjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:22.740351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c466be27c5ace936b4fc823e77b315822518d87e3c6ab33bf31fa83c7e0edd2","sha256:1deca62492d2bf8be011dd2f943c5cad22649b6362a2b88c331ac0640ed38d43"],"state_sha256":"cd63fad22836587021a58b2cfbe4928b2fafe53d48ecd1b6bae4210ddf352437"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYN48FlW+WmUToT83MZkFDbr9urzLV9uknwXUbYVITDtMuMBXjATIaer3c4tLBYSHoZ2Et9zjQ7dN2hv8aiBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:20:57.476615Z","bundle_sha256":"35bf72ad34134d84c2b176bf19f3f0703fe767b4866192a76f5da4b21f32ae33"}}