{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:P64YKGDSMOCGAEZIXL3ASWOM2F","short_pith_number":"pith:P64YKGDS","canonical_record":{"source":{"id":"2607.05791","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-07T03:34:53Z","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"title_canon_sha256":"20345f773a5a70e0ea8c76502aedc8e2ebeb3e17ee0931cb5befff239f7cba08","abstract_canon_sha256":"20b5c26b09c749a87dee97777eaedd6f7bbe904671bd8cf711131a8b41ea3397"},"schema_version":"1.0"},"canonical_sha256":"7fb98518726384601328baf60959ccd164974675743fb0d19695d4e59128713b","source":{"kind":"arxiv","id":"2607.05791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05791","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05791v1","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05791","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"P64YKGDSMOCG","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"pith_short_16","alias_value":"P64YKGDSMOCGAEZI","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"pith_short_8","alias_value":"P64YKGDS","created_at":"2026-07-08T01:18:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:P64YKGDSMOCGAEZIXL3ASWOM2F","target":"record","payload":{"canonical_record":{"source":{"id":"2607.05791","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-07T03:34:53Z","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"title_canon_sha256":"20345f773a5a70e0ea8c76502aedc8e2ebeb3e17ee0931cb5befff239f7cba08","abstract_canon_sha256":"20b5c26b09c749a87dee97777eaedd6f7bbe904671bd8cf711131a8b41ea3397"},"schema_version":"1.0"},"canonical_sha256":"7fb98518726384601328baf60959ccd164974675743fb0d19695d4e59128713b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:46.022175Z","signature_b64":"cX8lWXnb96c5VAnbOOI5+kdOQ4upWReOo8fsJmXepFyuTfK3p1Rp6iJMoYQHppCRO0FxMGS0K1xOHHDZLmfxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fb98518726384601328baf60959ccd164974675743fb0d19695d4e59128713b","last_reissued_at":"2026-07-08T01:18:46.021749Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:46.021749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.05791","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-07-08T01:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUJx6sYonW8pgNA7//arYZgvmHMd8zAOkMGpJ6Mj4jlXhm/3w0bDvMMp467Z+qZjsfGZrLcLRWv0x8dblMdGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:52:01.000661Z"},"content_sha256":"db17c625446a0468326db9732418f63a22a58fe28d24cd8835322d206aae9704","schema_version":"1.0","event_id":"sha256:db17c625446a0468326db9732418f63a22a58fe28d24cd8835322d206aae9704"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:P64YKGDSMOCGAEZIXL3ASWOM2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boosting with List-Decodable Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Addison Prairie, Li-Yang Tan","submitted_at":"2026-07-07T03:34:53Z","abstract_excerpt":"Boosting is a fundamental technique for generically improving the accuracy of learning algorithms (Schapire 1989). Existing boosting algorithms construct a strong learner using $O(\\log(\\frac{1}{\\epsilon})/\\gamma^2)$ calls to a $\\gamma$-advantage weak learner, and this round complexity is known to be optimal for generic boosters that succeed on all concept classes (Freund 1995). We show that this lower bound can be circumvented for concept classes that satisfy a mild closure property.\n  Specifically, we present a new boosting algorithm that, for any class $\\mathcal{F}$ closed under $O(\\log \\fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05791","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.05791/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-08T01:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2rs8jZLdZ1ksTcTQ/15fmBCJzDEBS/1ZteMXDi0ZRpocNHknCtruPtfqD2SpmincbsKjDl5W4u4xb/YaOq+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:52:01.001410Z"},"content_sha256":"cf7f5777b60db7a53d17293ce28bc33e2be3790275d68a6c0cb7d47a7696b792","schema_version":"1.0","event_id":"sha256:cf7f5777b60db7a53d17293ce28bc33e2be3790275d68a6c0cb7d47a7696b792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P64YKGDSMOCGAEZIXL3ASWOM2F/bundle.json","state_url":"https://pith.science/pith/P64YKGDSMOCGAEZIXL3ASWOM2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P64YKGDSMOCGAEZIXL3ASWOM2F/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-07T10:52:01Z","links":{"resolver":"https://pith.science/pith/P64YKGDSMOCGAEZIXL3ASWOM2F","bundle":"https://pith.science/pith/P64YKGDSMOCGAEZIXL3ASWOM2F/bundle.json","state":"https://pith.science/pith/P64YKGDSMOCGAEZIXL3ASWOM2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P64YKGDSMOCGAEZIXL3ASWOM2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:P64YKGDSMOCGAEZIXL3ASWOM2F","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":"20b5c26b09c749a87dee97777eaedd6f7bbe904671bd8cf711131a8b41ea3397","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-07T03:34:53Z","title_canon_sha256":"20345f773a5a70e0ea8c76502aedc8e2ebeb3e17ee0931cb5befff239f7cba08"},"schema_version":"1.0","source":{"id":"2607.05791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05791","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05791v1","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05791","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"P64YKGDSMOCG","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"pith_short_16","alias_value":"P64YKGDSMOCGAEZI","created_at":"2026-07-08T01:18:46Z"},{"alias_kind":"pith_short_8","alias_value":"P64YKGDS","created_at":"2026-07-08T01:18:46Z"}],"graph_snapshots":[{"event_id":"sha256:cf7f5777b60db7a53d17293ce28bc33e2be3790275d68a6c0cb7d47a7696b792","target":"graph","created_at":"2026-07-08T01:18:46Z","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/2607.05791/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Boosting is a fundamental technique for generically improving the accuracy of learning algorithms (Schapire 1989). Existing boosting algorithms construct a strong learner using $O(\\log(\\frac{1}{\\epsilon})/\\gamma^2)$ calls to a $\\gamma$-advantage weak learner, and this round complexity is known to be optimal for generic boosters that succeed on all concept classes (Freund 1995). We show that this lower bound can be circumvented for concept classes that satisfy a mild closure property.\n  Specifically, we present a new boosting algorithm that, for any class $\\mathcal{F}$ closed under $O(\\log \\fra","authors_text":"Addison Prairie, Li-Yang Tan","cross_cats":["cs.CC","cs.DS","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-07T03:34:53Z","title":"Boosting with List-Decodable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05791","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:db17c625446a0468326db9732418f63a22a58fe28d24cd8835322d206aae9704","target":"record","created_at":"2026-07-08T01:18:46Z","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":"20b5c26b09c749a87dee97777eaedd6f7bbe904671bd8cf711131a8b41ea3397","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-07T03:34:53Z","title_canon_sha256":"20345f773a5a70e0ea8c76502aedc8e2ebeb3e17ee0931cb5befff239f7cba08"},"schema_version":"1.0","source":{"id":"2607.05791","kind":"arxiv","version":1}},"canonical_sha256":"7fb98518726384601328baf60959ccd164974675743fb0d19695d4e59128713b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fb98518726384601328baf60959ccd164974675743fb0d19695d4e59128713b","first_computed_at":"2026-07-08T01:18:46.021749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-08T01:18:46.021749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cX8lWXnb96c5VAnbOOI5+kdOQ4upWReOo8fsJmXepFyuTfK3p1Rp6iJMoYQHppCRO0FxMGS0K1xOHHDZLmfxCw==","signature_status":"signed_v1","signed_at":"2026-07-08T01:18:46.022175Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.05791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db17c625446a0468326db9732418f63a22a58fe28d24cd8835322d206aae9704","sha256:cf7f5777b60db7a53d17293ce28bc33e2be3790275d68a6c0cb7d47a7696b792"],"state_sha256":"a587e0a737ba144a123fa8d222ef97586a59b9f3759377a9416348bb83d53978"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LDEJpgT6X5l++YBldobYZg0YxPn+Hng78vfB1wwFKzooIrJh1Jc5SVsS1mtNeQx0o2uLhEQ3WkZ6o3YMePbUBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:52:01.006871Z","bundle_sha256":"a31b686a74d42242ab646aaad9ab4feb8b3d20e3381b977d46e46320c91022b6"}}