{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ERI4RNGVMX5A32KGJ6AMS6PTPI","short_pith_number":"pith:ERI4RNGV","schema_version":"1.0","canonical_sha256":"2451c8b4d565fa0de9464f80c979f37a212da453123c9e7db74c70187910f767","source":{"kind":"arxiv","id":"1410.4573","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.4573","created_at":"2026-05-18T00:45:22.739917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4573v1","created_at":"2026-05-18T00:45:22.739917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4573","created_at":"2026-05-18T00:45:22.739917+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERI4RNGVMX5A","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERI4RNGVMX5A32KG","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERI4RNGV","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI","json":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI.json","graph_json":"https://pith.science/api/pith-number/ERI4RNGVMX5A32KGJ6AMS6PTPI/graph.json","events_json":"https://pith.science/api/pith-number/ERI4RNGVMX5A32KGJ6AMS6PTPI/events.json","paper":"https://pith.science/paper/ERI4RNGV"},"agent_actions":{"view_html":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI","download_json":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI.json","view_paper":"https://pith.science/paper/ERI4RNGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4573&json=true","fetch_graph":"https://pith.science/api/pith-number/ERI4RNGVMX5A32KGJ6AMS6PTPI/graph.json","fetch_events":"https://pith.science/api/pith-number/ERI4RNGVMX5A32KGJ6AMS6PTPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/action/storage_attestation","attest_author":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/action/author_attestation","sign_citation":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/action/citation_signature","submit_replication":"https://pith.science/pith/ERI4RNGVMX5A32KGJ6AMS6PTPI/action/replication_record"}},"created_at":"2026-05-18T00:45:22.739917+00:00","updated_at":"2026-05-18T00:45:22.739917+00:00"}