{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JMO4NUN2DEIENECUV2APGIU7NK","short_pith_number":"pith:JMO4NUN2","canonical_record":{"source":{"id":"2206.13254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-27T12:39:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"44954117173af4083456c5db05f528c430f9acde255a14162a08409401205461","abstract_canon_sha256":"4dbdc27c0b985aed5e044ffa2e9f36ba8f46bbb4c6ba2cd6c8cc2c2c22260084"},"schema_version":"1.0"},"canonical_sha256":"4b1dc6d1ba1910469054ae80f3229f6a9fca8088d0e74b6ccf7b388dcf7874f2","source":{"kind":"arxiv","id":"2206.13254","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.13254","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"2206.13254v2","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.13254","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"JMO4NUN2DEIE","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"pith_short_16","alias_value":"JMO4NUN2DEIENECU","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"pith_short_8","alias_value":"JMO4NUN2","created_at":"2026-07-05T08:42:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JMO4NUN2DEIENECUV2APGIU7NK","target":"record","payload":{"canonical_record":{"source":{"id":"2206.13254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-27T12:39:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"44954117173af4083456c5db05f528c430f9acde255a14162a08409401205461","abstract_canon_sha256":"4dbdc27c0b985aed5e044ffa2e9f36ba8f46bbb4c6ba2cd6c8cc2c2c22260084"},"schema_version":"1.0"},"canonical_sha256":"4b1dc6d1ba1910469054ae80f3229f6a9fca8088d0e74b6ccf7b388dcf7874f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:28.018667Z","signature_b64":"XUywtI40mskxjyoV0NDCkEe6WDu/+kFmgzdNoi5lHHht8tscGyCASuq7lvSLG7AG222iJh8DJ4t8ftSE2f3rAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b1dc6d1ba1910469054ae80f3229f6a9fca8088d0e74b6ccf7b388dcf7874f2","last_reissued_at":"2026-07-05T08:42:28.018216Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:28.018216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.13254","source_version":2,"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-07-05T08:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8eYhAcO8udPJFi+9wD3gfK4did1P/K51o9Oh1uJViwQXMVVAzjNtpEziyqfHl/W1lfHeThm3f6m1l6oNN5LCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:51:21.174905Z"},"content_sha256":"bd46a30bc7d7fa1ddf3011505717a66c282f6f79d6949dc9008597b8778840dd","schema_version":"1.0","event_id":"sha256:bd46a30bc7d7fa1ddf3011505717a66c282f6f79d6949dc9008597b8778840dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JMO4NUN2DEIENECUV2APGIU7NK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample compression schemes for balls in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DM","authors_text":"Fionn Mc Inerney, J\\'er\\'emie Chalopin, S\\'ebastien Ratel, Victor Chepoi, Yann Vax\\`es","submitted_at":"2022-06-27T12:39:36Z","abstract_excerpt":"One of the open problems in machine learning is whether any set-family of VC-dimension $d$ admits a sample compression scheme of size $O(d)$. In this paper, we study this problem for balls in graphs. For a ball $B=B_r(x)$ of a graph $G=(V,E)$, a realizable sample for $B$ is a signed subset $X=(X^+,X^-)$ of $V$ such that $B$ contains $X^+$ and is disjoint from $X^-$. A proper sample compression scheme of size $k$ consists of a compressor and a reconstructor. The compressor maps any realizable sample $X$ to a subsample $X'$ of size at most $k$. The reconstructor maps each such subsample $X'$ to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.13254","kind":"arxiv","version":2},"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/2206.13254/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"},"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-07-05T08:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lq141gwj0s9F3M+ta3SCUh70JDZIId9ElY3pPk8B/u2QU9lPhstpJWdBMAe/ej4NzYWDWudwhqeinvfwh0tDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:51:21.175876Z"},"content_sha256":"d65a73251a2c515eb86ea9bf68c3b780deb0285007993ba63ff391645c7c5633","schema_version":"1.0","event_id":"sha256:d65a73251a2c515eb86ea9bf68c3b780deb0285007993ba63ff391645c7c5633"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMO4NUN2DEIENECUV2APGIU7NK/bundle.json","state_url":"https://pith.science/pith/JMO4NUN2DEIENECUV2APGIU7NK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMO4NUN2DEIENECUV2APGIU7NK/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-08-03T19:51:21Z","links":{"resolver":"https://pith.science/pith/JMO4NUN2DEIENECUV2APGIU7NK","bundle":"https://pith.science/pith/JMO4NUN2DEIENECUV2APGIU7NK/bundle.json","state":"https://pith.science/pith/JMO4NUN2DEIENECUV2APGIU7NK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMO4NUN2DEIENECUV2APGIU7NK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JMO4NUN2DEIENECUV2APGIU7NK","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":"4dbdc27c0b985aed5e044ffa2e9f36ba8f46bbb4c6ba2cd6c8cc2c2c22260084","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-27T12:39:36Z","title_canon_sha256":"44954117173af4083456c5db05f528c430f9acde255a14162a08409401205461"},"schema_version":"1.0","source":{"id":"2206.13254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.13254","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"2206.13254v2","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.13254","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"JMO4NUN2DEIE","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"pith_short_16","alias_value":"JMO4NUN2DEIENECU","created_at":"2026-07-05T08:42:28Z"},{"alias_kind":"pith_short_8","alias_value":"JMO4NUN2","created_at":"2026-07-05T08:42:28Z"}],"graph_snapshots":[{"event_id":"sha256:d65a73251a2c515eb86ea9bf68c3b780deb0285007993ba63ff391645c7c5633","target":"graph","created_at":"2026-07-05T08:42:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.13254/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the open problems in machine learning is whether any set-family of VC-dimension $d$ admits a sample compression scheme of size $O(d)$. In this paper, we study this problem for balls in graphs. For a ball $B=B_r(x)$ of a graph $G=(V,E)$, a realizable sample for $B$ is a signed subset $X=(X^+,X^-)$ of $V$ such that $B$ contains $X^+$ and is disjoint from $X^-$. A proper sample compression scheme of size $k$ consists of a compressor and a reconstructor. The compressor maps any realizable sample $X$ to a subsample $X'$ of size at most $k$. The reconstructor maps each such subsample $X'$ to ","authors_text":"Fionn Mc Inerney, J\\'er\\'emie Chalopin, S\\'ebastien Ratel, Victor Chepoi, Yann Vax\\`es","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-27T12:39:36Z","title":"Sample compression schemes for balls in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.13254","kind":"arxiv","version":2},"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:bd46a30bc7d7fa1ddf3011505717a66c282f6f79d6949dc9008597b8778840dd","target":"record","created_at":"2026-07-05T08:42:28Z","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":"4dbdc27c0b985aed5e044ffa2e9f36ba8f46bbb4c6ba2cd6c8cc2c2c22260084","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-27T12:39:36Z","title_canon_sha256":"44954117173af4083456c5db05f528c430f9acde255a14162a08409401205461"},"schema_version":"1.0","source":{"id":"2206.13254","kind":"arxiv","version":2}},"canonical_sha256":"4b1dc6d1ba1910469054ae80f3229f6a9fca8088d0e74b6ccf7b388dcf7874f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b1dc6d1ba1910469054ae80f3229f6a9fca8088d0e74b6ccf7b388dcf7874f2","first_computed_at":"2026-07-05T08:42:28.018216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:42:28.018216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XUywtI40mskxjyoV0NDCkEe6WDu/+kFmgzdNoi5lHHht8tscGyCASuq7lvSLG7AG222iJh8DJ4t8ftSE2f3rAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:42:28.018667Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.13254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd46a30bc7d7fa1ddf3011505717a66c282f6f79d6949dc9008597b8778840dd","sha256:d65a73251a2c515eb86ea9bf68c3b780deb0285007993ba63ff391645c7c5633"],"state_sha256":"dd53ffc3a554f7ed0627c40f7f416d17f4270ff940a51d3e2e626767c34d5367"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uU7WobjDpesC6Ad5Sl9sDGiiFdPnbPbiawvMMr8GL8PYjd8+7CVuahE6UMTBEumUbBBfT2jA0mM02FTTojxPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:51:21.190422Z","bundle_sha256":"24a2a67707164e4d5e5b445b09db5b2c32f06cc2fb65cdede6d8c0fa633dfcd0"}}