{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BVN67PRAVFICATYRQONKAARWOO","short_pith_number":"pith:BVN67PRA","schema_version":"1.0","canonical_sha256":"0d5befbe20a950204f11839aa00236739a53e9e4d3e95c6139f67a6e96d87217","source":{"kind":"arxiv","id":"1805.09719","version":3},"attestation_state":"computed","paper":{"title":"Learning convex polyhedra with margin","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aryeh Kontorovich, Eran Kaufman, Gabriel Nivasch, Lee-Ad Gottlieb","submitted_at":"2018-05-24T15:07:14Z","abstract_excerpt":"We present an improved algorithm for {\\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \\log t$ halfspaces with constant-size margins in time polynomial in $t$ (where $t$ is the number of halfspaces forming an optimal polyhedron). We also identify distinct generalizations of the notion of margin from hyperplanes to polyhedra and investigate how they relate geometrically; this result may have ramifications beyond the learning setting."},"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":"1805.09719","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-24T15:07:14Z","cross_cats_sorted":["cs.CC","cs.CG","stat.ML"],"title_canon_sha256":"156463384e15d21387d6b11f9dca2c77c2a94d58e08359134604f694cfc061c2","abstract_canon_sha256":"012478b22dc27ce71284e4f8acc86380354000487e3ddf47386d426aa989cb68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:08.510738Z","signature_b64":"P8pvocu442FTkQGJakRwzzCzstvCCGP93uhF3f7cZXzCUjPV0rEVuLqAxvtKcZHd8Ecmsng9cfZ8CDdwShLLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d5befbe20a950204f11839aa00236739a53e9e4d3e95c6139f67a6e96d87217","last_reissued_at":"2026-07-05T03:28:08.510326Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:08.510326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning convex polyhedra with margin","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aryeh Kontorovich, Eran Kaufman, Gabriel Nivasch, Lee-Ad Gottlieb","submitted_at":"2018-05-24T15:07:14Z","abstract_excerpt":"We present an improved algorithm for {\\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \\log t$ halfspaces with constant-size margins in time polynomial in $t$ (where $t$ is the number of halfspaces forming an optimal polyhedron). We also identify distinct generalizations of the notion of margin from hyperplanes to polyhedra and investigate how they relate geometrically; this result may have ramifications beyond the learning setting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09719","kind":"arxiv","version":3},"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/1805.09719/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":"1805.09719","created_at":"2026-07-05T03:28:08.510392+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09719v3","created_at":"2026-07-05T03:28:08.510392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09719","created_at":"2026-07-05T03:28:08.510392+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVN67PRAVFIC","created_at":"2026-07-05T03:28:08.510392+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVN67PRAVFICATYR","created_at":"2026-07-05T03:28:08.510392+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVN67PRA","created_at":"2026-07-05T03:28:08.510392+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/BVN67PRAVFICATYRQONKAARWOO","json":"https://pith.science/pith/BVN67PRAVFICATYRQONKAARWOO.json","graph_json":"https://pith.science/api/pith-number/BVN67PRAVFICATYRQONKAARWOO/graph.json","events_json":"https://pith.science/api/pith-number/BVN67PRAVFICATYRQONKAARWOO/events.json","paper":"https://pith.science/paper/BVN67PRA"},"agent_actions":{"view_html":"https://pith.science/pith/BVN67PRAVFICATYRQONKAARWOO","download_json":"https://pith.science/pith/BVN67PRAVFICATYRQONKAARWOO.json","view_paper":"https://pith.science/paper/BVN67PRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09719&json=true","fetch_graph":"https://pith.science/api/pith-number/BVN67PRAVFICATYRQONKAARWOO/graph.json","fetch_events":"https://pith.science/api/pith-number/BVN67PRAVFICATYRQONKAARWOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVN67PRAVFICATYRQONKAARWOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVN67PRAVFICATYRQONKAARWOO/action/storage_attestation","attest_author":"https://pith.science/pith/BVN67PRAVFICATYRQONKAARWOO/action/author_attestation","sign_citation":"https://pith.science/pith/BVN67PRAVFICATYRQONKAARWOO/action/citation_signature","submit_replication":"https://pith.science/pith/BVN67PRAVFICATYRQONKAARWOO/action/replication_record"}},"created_at":"2026-07-05T03:28:08.510392+00:00","updated_at":"2026-07-05T03:28:08.510392+00:00"}