{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ANGZYXE3BFY4SXTJMP5IXRVWKO","short_pith_number":"pith:ANGZYXE3","schema_version":"1.0","canonical_sha256":"034d9c5c9b0971c95e6963fa8bc6b653b53e455f9025d7138e2b998015cbeb0f","source":{"kind":"arxiv","id":"2607.17282","version":1},"attestation_state":"computed","paper":{"title":"An Iterative Geometric Approach to Optimizing Separating Hyperplanes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akos Hajnal","submitted_at":"2026-07-19T15:00:49Z","abstract_excerpt":"Given a binary-labeled linearly separable dataset, and the objective is to compute the maximum-margin separating hyperplane, also known as the hard-margin Support Vector Machine (SVM) classifier. This paper investigates whether, if given an initial separating hyperplane, can it be exploited to reach this unique optimum more efficiently. We present a geometric approach that gradually improves the alignment of the hyperplane, starting from an initial separating hyperplane, while preserving separation and continuously increasing its margin until convergence to the global optimum. At each iteratio"},"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":"2607.17282","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-19T15:00:49Z","cross_cats_sorted":[],"title_canon_sha256":"dbd01b88a0b48b9d5ea8f4f8a2261b929769426dbb547a42643ce54b33f223b6","abstract_canon_sha256":"39cb5305e3150a9db3ce5c87b338c45a8b3df5a27789ba62d10f218eb440629a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:25.252412Z","signature_b64":"qGU9Kt3sb6hd+/KAeRvw1bMpMUTD5SUig8e+1jSBCiZB4pYjs8uBKyMClJhegD2Cix5hwtEeoiaNz9ygznaDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"034d9c5c9b0971c95e6963fa8bc6b653b53e455f9025d7138e2b998015cbeb0f","last_reissued_at":"2026-07-21T01:21:25.251571Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:25.251571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Iterative Geometric Approach to Optimizing Separating Hyperplanes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akos Hajnal","submitted_at":"2026-07-19T15:00:49Z","abstract_excerpt":"Given a binary-labeled linearly separable dataset, and the objective is to compute the maximum-margin separating hyperplane, also known as the hard-margin Support Vector Machine (SVM) classifier. This paper investigates whether, if given an initial separating hyperplane, can it be exploited to reach this unique optimum more efficiently. We present a geometric approach that gradually improves the alignment of the hyperplane, starting from an initial separating hyperplane, while preserving separation and continuously increasing its margin until convergence to the global optimum. At each iteratio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17282","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.17282/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.17282","created_at":"2026-07-21T01:21:25.252001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.17282v1","created_at":"2026-07-21T01:21:25.252001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17282","created_at":"2026-07-21T01:21:25.252001+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANGZYXE3BFY4","created_at":"2026-07-21T01:21:25.252001+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANGZYXE3BFY4SXTJ","created_at":"2026-07-21T01:21:25.252001+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANGZYXE3","created_at":"2026-07-21T01:21:25.252001+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/ANGZYXE3BFY4SXTJMP5IXRVWKO","json":"https://pith.science/pith/ANGZYXE3BFY4SXTJMP5IXRVWKO.json","graph_json":"https://pith.science/api/pith-number/ANGZYXE3BFY4SXTJMP5IXRVWKO/graph.json","events_json":"https://pith.science/api/pith-number/ANGZYXE3BFY4SXTJMP5IXRVWKO/events.json","paper":"https://pith.science/paper/ANGZYXE3"},"agent_actions":{"view_html":"https://pith.science/pith/ANGZYXE3BFY4SXTJMP5IXRVWKO","download_json":"https://pith.science/pith/ANGZYXE3BFY4SXTJMP5IXRVWKO.json","view_paper":"https://pith.science/paper/ANGZYXE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.17282&json=true","fetch_graph":"https://pith.science/api/pith-number/ANGZYXE3BFY4SXTJMP5IXRVWKO/graph.json","fetch_events":"https://pith.science/api/pith-number/ANGZYXE3BFY4SXTJMP5IXRVWKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANGZYXE3BFY4SXTJMP5IXRVWKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANGZYXE3BFY4SXTJMP5IXRVWKO/action/storage_attestation","attest_author":"https://pith.science/pith/ANGZYXE3BFY4SXTJMP5IXRVWKO/action/author_attestation","sign_citation":"https://pith.science/pith/ANGZYXE3BFY4SXTJMP5IXRVWKO/action/citation_signature","submit_replication":"https://pith.science/pith/ANGZYXE3BFY4SXTJMP5IXRVWKO/action/replication_record"}},"created_at":"2026-07-21T01:21:25.252001+00:00","updated_at":"2026-07-21T01:21:25.252001+00:00"}