{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MGM6JWNLSZYO7BBRYJ6BQNOGO6","short_pith_number":"pith:MGM6JWNL","schema_version":"1.0","canonical_sha256":"6199e4d9ab9670ef8431c27c1835c677be41ec9c65347e8e8ea50777c54b1461","source":{"kind":"arxiv","id":"1401.7388","version":1},"attestation_state":"computed","paper":{"title":"Bounding Embeddings of VC Classes into Maximum Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin I. P. Rubinstein, J. Hyam Rubinstein, Peter L. Bartlett","submitted_at":"2014-01-29T02:09:10Z","abstract_excerpt":"One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. To-date this statement is known to be true for maximum classes---those that possess maximum cardinality for their VC dimension. The most promising approach to positively resolving the conjecture is by embedding general VC classes into maximum classes without super-linear increase to their VC dimensions, as such embeddings would extend the known compression schemes to all VC clas"},"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":"1401.7388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-29T02:09:10Z","cross_cats_sorted":["math.CO","stat.ML"],"title_canon_sha256":"658cbe6f9ec1bb4fcf5a185639bd202864c03ec6aa61aa3809ef7165490131a2","abstract_canon_sha256":"70ca510bd36fcae65457fc938384f1128cdeb34fa34b2e1262c887b0e968327a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:25.180064Z","signature_b64":"2fVuDaUmbtPr/hACvIQk3Ae9gRHmGeyUbgMcZZSOHA5eQ0D6sjozARk3aBbC4fCNUivJb2A68gxwj+BUJa0BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6199e4d9ab9670ef8431c27c1835c677be41ec9c65347e8e8ea50777c54b1461","last_reissued_at":"2026-05-18T03:00:25.179364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:25.179364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding Embeddings of VC Classes into Maximum Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin I. P. Rubinstein, J. Hyam Rubinstein, Peter L. Bartlett","submitted_at":"2014-01-29T02:09:10Z","abstract_excerpt":"One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. To-date this statement is known to be true for maximum classes---those that possess maximum cardinality for their VC dimension. The most promising approach to positively resolving the conjecture is by embedding general VC classes into maximum classes without super-linear increase to their VC dimensions, as such embeddings would extend the known compression schemes to all VC clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7388","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":"1401.7388","created_at":"2026-05-18T03:00:25.179475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7388v1","created_at":"2026-05-18T03:00:25.179475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7388","created_at":"2026-05-18T03:00:25.179475+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGM6JWNLSZYO","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGM6JWNLSZYO7BBR","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGM6JWNL","created_at":"2026-05-18T12:28:38.356838+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/MGM6JWNLSZYO7BBRYJ6BQNOGO6","json":"https://pith.science/pith/MGM6JWNLSZYO7BBRYJ6BQNOGO6.json","graph_json":"https://pith.science/api/pith-number/MGM6JWNLSZYO7BBRYJ6BQNOGO6/graph.json","events_json":"https://pith.science/api/pith-number/MGM6JWNLSZYO7BBRYJ6BQNOGO6/events.json","paper":"https://pith.science/paper/MGM6JWNL"},"agent_actions":{"view_html":"https://pith.science/pith/MGM6JWNLSZYO7BBRYJ6BQNOGO6","download_json":"https://pith.science/pith/MGM6JWNLSZYO7BBRYJ6BQNOGO6.json","view_paper":"https://pith.science/paper/MGM6JWNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7388&json=true","fetch_graph":"https://pith.science/api/pith-number/MGM6JWNLSZYO7BBRYJ6BQNOGO6/graph.json","fetch_events":"https://pith.science/api/pith-number/MGM6JWNLSZYO7BBRYJ6BQNOGO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGM6JWNLSZYO7BBRYJ6BQNOGO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGM6JWNLSZYO7BBRYJ6BQNOGO6/action/storage_attestation","attest_author":"https://pith.science/pith/MGM6JWNLSZYO7BBRYJ6BQNOGO6/action/author_attestation","sign_citation":"https://pith.science/pith/MGM6JWNLSZYO7BBRYJ6BQNOGO6/action/citation_signature","submit_replication":"https://pith.science/pith/MGM6JWNLSZYO7BBRYJ6BQNOGO6/action/replication_record"}},"created_at":"2026-05-18T03:00:25.179475+00:00","updated_at":"2026-05-18T03:00:25.179475+00:00"}