{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HUVSDZTMXUYIRR3UZHW24YG7OY","short_pith_number":"pith:HUVSDZTM","canonical_record":{"source":{"id":"2606.06148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-04T13:24:05Z","cross_cats_sorted":[],"title_canon_sha256":"83c8d2ed06dbaf5e660d30feee9a500180a870685b1e7a9cb804f2b8af48ae84","abstract_canon_sha256":"6f0113fd79341099de38e5d189b156f9ce5f9afa2a40a8e38e93fa47bd01639a"},"schema_version":"1.0"},"canonical_sha256":"3d2b21e66cbd3088c774c9edae60df761d39101480b34430a6509b1567fc71ad","source":{"kind":"arxiv","id":"2606.06148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06148","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06148v1","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06148","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"HUVSDZTMXUYI","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"pith_short_16","alias_value":"HUVSDZTMXUYIRR3U","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"pith_short_8","alias_value":"HUVSDZTM","created_at":"2026-06-05T01:15:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HUVSDZTMXUYIRR3UZHW24YG7OY","target":"record","payload":{"canonical_record":{"source":{"id":"2606.06148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-04T13:24:05Z","cross_cats_sorted":[],"title_canon_sha256":"83c8d2ed06dbaf5e660d30feee9a500180a870685b1e7a9cb804f2b8af48ae84","abstract_canon_sha256":"6f0113fd79341099de38e5d189b156f9ce5f9afa2a40a8e38e93fa47bd01639a"},"schema_version":"1.0"},"canonical_sha256":"3d2b21e66cbd3088c774c9edae60df761d39101480b34430a6509b1567fc71ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:35.265209Z","signature_b64":"ILP4hYU/6yClTS0PoErXinnytOqKvzEgBwB59HmtIfhUrF7Gb9E0mgUmPCfEVQkOALZ+C3RgrQ5XSVoamExfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d2b21e66cbd3088c774c9edae60df761d39101480b34430a6509b1567fc71ad","last_reissued_at":"2026-06-05T01:15:35.264804Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:35.264804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.06148","source_version":1,"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-06-05T01:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6aMpEPkA/tj6l8ukskCg4iFSy96yH0pw53zXW6MO+veKGriwDXa8LLqBlaChHM6OQtLe3aoIuqyrL7BTsymLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:27:53.571984Z"},"content_sha256":"4201c730b2b372e8345286b87d8ec603d42009150858bfaef8cc911b9121b3bd","schema_version":"1.0","event_id":"sha256:4201c730b2b372e8345286b87d8ec603d42009150858bfaef8cc911b9121b3bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HUVSDZTMXUYIRR3UZHW24YG7OY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight list replicability bounds via a novel sphere covering theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ari Blondal, Chavdar Lalov, Hamed Hatami, Pooya Hatami, Sivan Tretiak","submitted_at":"2026-06-04T13:24:05Z","abstract_excerpt":"In recent years, list replicability has emerged as a framework for formalizing reproducibility in learning theory. A central question is how the required list size relates to the accuracy parameter and natural complexity measures of the hypothesis class.\n  To achieve sharp bounds on list replicability, we prove a novel topological sphere covering theorem, derived from the Borsuk-Ulam theorem. Specifically, if the $d$-sphere is covered by open sets, each of which lies in an open hemisphere, then $d+1$ of these sets must have a common intersection. Using this result, we obtain a sharp bound on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06148","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/2606.06148/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-06-05T01:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjeabR5Wj7nrgXG5Om0kw9teyszKSxGxiy2q8B/Or0MjD2IKZEK6IOvd+QmQyABq3ub1GeKcj/KNJ9+hisK+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:27:53.572368Z"},"content_sha256":"d14e29808466c2851e9d7f60ea46ec5281b04ff901ec5daaa83ba3a5615a4ce1","schema_version":"1.0","event_id":"sha256:d14e29808466c2851e9d7f60ea46ec5281b04ff901ec5daaa83ba3a5615a4ce1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUVSDZTMXUYIRR3UZHW24YG7OY/bundle.json","state_url":"https://pith.science/pith/HUVSDZTMXUYIRR3UZHW24YG7OY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUVSDZTMXUYIRR3UZHW24YG7OY/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-07-07T14:27:53Z","links":{"resolver":"https://pith.science/pith/HUVSDZTMXUYIRR3UZHW24YG7OY","bundle":"https://pith.science/pith/HUVSDZTMXUYIRR3UZHW24YG7OY/bundle.json","state":"https://pith.science/pith/HUVSDZTMXUYIRR3UZHW24YG7OY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUVSDZTMXUYIRR3UZHW24YG7OY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HUVSDZTMXUYIRR3UZHW24YG7OY","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":"6f0113fd79341099de38e5d189b156f9ce5f9afa2a40a8e38e93fa47bd01639a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-04T13:24:05Z","title_canon_sha256":"83c8d2ed06dbaf5e660d30feee9a500180a870685b1e7a9cb804f2b8af48ae84"},"schema_version":"1.0","source":{"id":"2606.06148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06148","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06148v1","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06148","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"HUVSDZTMXUYI","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"pith_short_16","alias_value":"HUVSDZTMXUYIRR3U","created_at":"2026-06-05T01:15:35Z"},{"alias_kind":"pith_short_8","alias_value":"HUVSDZTM","created_at":"2026-06-05T01:15:35Z"}],"graph_snapshots":[{"event_id":"sha256:d14e29808466c2851e9d7f60ea46ec5281b04ff901ec5daaa83ba3a5615a4ce1","target":"graph","created_at":"2026-06-05T01:15:35Z","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/2606.06148/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, list replicability has emerged as a framework for formalizing reproducibility in learning theory. A central question is how the required list size relates to the accuracy parameter and natural complexity measures of the hypothesis class.\n  To achieve sharp bounds on list replicability, we prove a novel topological sphere covering theorem, derived from the Borsuk-Ulam theorem. Specifically, if the $d$-sphere is covered by open sets, each of which lies in an open hemisphere, then $d+1$ of these sets must have a common intersection. Using this result, we obtain a sharp bound on t","authors_text":"Ari Blondal, Chavdar Lalov, Hamed Hatami, Pooya Hatami, Sivan Tretiak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-04T13:24:05Z","title":"Tight list replicability bounds via a novel sphere covering theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06148","kind":"arxiv","version":1},"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:4201c730b2b372e8345286b87d8ec603d42009150858bfaef8cc911b9121b3bd","target":"record","created_at":"2026-06-05T01:15:35Z","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":"6f0113fd79341099de38e5d189b156f9ce5f9afa2a40a8e38e93fa47bd01639a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-04T13:24:05Z","title_canon_sha256":"83c8d2ed06dbaf5e660d30feee9a500180a870685b1e7a9cb804f2b8af48ae84"},"schema_version":"1.0","source":{"id":"2606.06148","kind":"arxiv","version":1}},"canonical_sha256":"3d2b21e66cbd3088c774c9edae60df761d39101480b34430a6509b1567fc71ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d2b21e66cbd3088c774c9edae60df761d39101480b34430a6509b1567fc71ad","first_computed_at":"2026-06-05T01:15:35.264804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:15:35.264804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ILP4hYU/6yClTS0PoErXinnytOqKvzEgBwB59HmtIfhUrF7Gb9E0mgUmPCfEVQkOALZ+C3RgrQ5XSVoamExfCA==","signature_status":"signed_v1","signed_at":"2026-06-05T01:15:35.265209Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.06148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4201c730b2b372e8345286b87d8ec603d42009150858bfaef8cc911b9121b3bd","sha256:d14e29808466c2851e9d7f60ea46ec5281b04ff901ec5daaa83ba3a5615a4ce1"],"state_sha256":"6210a2d433e591c3a27fc90e87ababf83edeab1f9cdf42c99787d89339d76dba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAM/R4/JYq/4VIXGFOHgibNo/7hxnwFENddMq4hKRdBL6U9vpPJ+JTuWDQNrB3Lp6ef2ymMqE+aHbgGMRrnvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T14:27:53.574293Z","bundle_sha256":"da83d850fd0c0c3def513513c80823058b88684da05405e61bc60788977fe171"}}