{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:EMW36DPV4H5X24E2OTMDURCBNB","short_pith_number":"pith:EMW36DPV","canonical_record":{"source":{"id":"2304.02240","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-05T06:05:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c4d447f469812faeed0fe04badbd8ff71fbf6fc64dfce7c56945cec1043e52e5","abstract_canon_sha256":"b7600f08409fcb67a4764fa8aabede0c22e8ae488579ead3a0e98284d8d844ea"},"schema_version":"1.0"},"canonical_sha256":"232dbf0df5e1fb7d709a74d83a44416849d1bfc6e5cf171399f472fa3aa19015","source":{"kind":"arxiv","id":"2304.02240","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.02240","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"2304.02240v1","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02240","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"EMW36DPV4H5X","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"EMW36DPV4H5X24E2","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"EMW36DPV","created_at":"2026-07-05T05:58:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:EMW36DPV4H5X24E2OTMDURCBNB","target":"record","payload":{"canonical_record":{"source":{"id":"2304.02240","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-05T06:05:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c4d447f469812faeed0fe04badbd8ff71fbf6fc64dfce7c56945cec1043e52e5","abstract_canon_sha256":"b7600f08409fcb67a4764fa8aabede0c22e8ae488579ead3a0e98284d8d844ea"},"schema_version":"1.0"},"canonical_sha256":"232dbf0df5e1fb7d709a74d83a44416849d1bfc6e5cf171399f472fa3aa19015","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:23.572780Z","signature_b64":"TDxCUsbZP4XWMc3uDQRN5bOwEo02TjSAUOMHJkv/w80amfy5tpgQ9rxStgp4/UPLKDt6JZqwwKiJ0aesi82HBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"232dbf0df5e1fb7d709a74d83a44416849d1bfc6e5cf171399f472fa3aa19015","last_reissued_at":"2026-07-05T05:58:23.572353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:23.572353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.02240","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-05T05:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fp9hTPJ8zgzhqQ6MbZy8OsJRBnj7550hHz+XxBRBtalk3C9bUAf1WTO0+c4FJojdGzQciJM5Q8biD/F3Yli3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:13:03.080376Z"},"content_sha256":"4d8c8378677a9c517989b5b9853e30d478c03e62336d91c9f166a8406d6ab530","schema_version":"1.0","event_id":"sha256:4d8c8378677a9c517989b5b9853e30d478c03e62336d91c9f166a8406d6ab530"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:EMW36DPV4H5X24E2OTMDURCBNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List and Certificate Complexities in Replicable Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LG","authors_text":"A. Pavan, Jason Vander Woude, N. V. Vinodchandran, Peter Dixon","submitted_at":"2023-04-05T06:05:27Z","abstract_excerpt":"We investigate replicable learning algorithms. Ideally, we would like to design algorithms that output the same canonical model over multiple runs, even when different runs observe a different set of samples from the unknown data distribution. In general, such a strong notion of replicability is not achievable. Thus we consider two feasible notions of replicability called list replicability and certificate replicability. Intuitively, these notions capture the degree of (non) replicability. We design algorithms for certain learning problems that are optimal in list and certificate complexity. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.02240","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/2304.02240/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-05T05:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NjIU9ibozl65EHRRaegRnyjleoXbiwE+pvcofw8ox/E+hlgMBR1T8UiZOeA5jCaHf9vU5pcOF6bZzH7JwegBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:13:03.080900Z"},"content_sha256":"e2dee2f0d791011924352ce4491fc88f2b5a3b00006ed187107a04d8d04e2cbd","schema_version":"1.0","event_id":"sha256:e2dee2f0d791011924352ce4491fc88f2b5a3b00006ed187107a04d8d04e2cbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMW36DPV4H5X24E2OTMDURCBNB/bundle.json","state_url":"https://pith.science/pith/EMW36DPV4H5X24E2OTMDURCBNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMW36DPV4H5X24E2OTMDURCBNB/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-11T21:13:03Z","links":{"resolver":"https://pith.science/pith/EMW36DPV4H5X24E2OTMDURCBNB","bundle":"https://pith.science/pith/EMW36DPV4H5X24E2OTMDURCBNB/bundle.json","state":"https://pith.science/pith/EMW36DPV4H5X24E2OTMDURCBNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMW36DPV4H5X24E2OTMDURCBNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EMW36DPV4H5X24E2OTMDURCBNB","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":"b7600f08409fcb67a4764fa8aabede0c22e8ae488579ead3a0e98284d8d844ea","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-05T06:05:27Z","title_canon_sha256":"c4d447f469812faeed0fe04badbd8ff71fbf6fc64dfce7c56945cec1043e52e5"},"schema_version":"1.0","source":{"id":"2304.02240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.02240","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"2304.02240v1","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02240","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"EMW36DPV4H5X","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"EMW36DPV4H5X24E2","created_at":"2026-07-05T05:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"EMW36DPV","created_at":"2026-07-05T05:58:23Z"}],"graph_snapshots":[{"event_id":"sha256:e2dee2f0d791011924352ce4491fc88f2b5a3b00006ed187107a04d8d04e2cbd","target":"graph","created_at":"2026-07-05T05:58:23Z","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/2304.02240/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate replicable learning algorithms. Ideally, we would like to design algorithms that output the same canonical model over multiple runs, even when different runs observe a different set of samples from the unknown data distribution. In general, such a strong notion of replicability is not achievable. Thus we consider two feasible notions of replicability called list replicability and certificate replicability. Intuitively, these notions capture the degree of (non) replicability. We design algorithms for certain learning problems that are optimal in list and certificate complexity. W","authors_text":"A. Pavan, Jason Vander Woude, N. V. Vinodchandran, Peter Dixon","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-05T06:05:27Z","title":"List and Certificate Complexities in Replicable Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.02240","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:4d8c8378677a9c517989b5b9853e30d478c03e62336d91c9f166a8406d6ab530","target":"record","created_at":"2026-07-05T05:58:23Z","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":"b7600f08409fcb67a4764fa8aabede0c22e8ae488579ead3a0e98284d8d844ea","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-05T06:05:27Z","title_canon_sha256":"c4d447f469812faeed0fe04badbd8ff71fbf6fc64dfce7c56945cec1043e52e5"},"schema_version":"1.0","source":{"id":"2304.02240","kind":"arxiv","version":1}},"canonical_sha256":"232dbf0df5e1fb7d709a74d83a44416849d1bfc6e5cf171399f472fa3aa19015","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"232dbf0df5e1fb7d709a74d83a44416849d1bfc6e5cf171399f472fa3aa19015","first_computed_at":"2026-07-05T05:58:23.572353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:58:23.572353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TDxCUsbZP4XWMc3uDQRN5bOwEo02TjSAUOMHJkv/w80amfy5tpgQ9rxStgp4/UPLKDt6JZqwwKiJ0aesi82HBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:58:23.572780Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.02240","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d8c8378677a9c517989b5b9853e30d478c03e62336d91c9f166a8406d6ab530","sha256:e2dee2f0d791011924352ce4491fc88f2b5a3b00006ed187107a04d8d04e2cbd"],"state_sha256":"858ee10f3350f1fe5a41cba87a1e294cfa9c5c0257674f3579a29fa32c66ac95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4RRhkaolFiup2jv+dCbkzdl0YYoHX5s+ABJ/i1EDt2OodWvlH9sSK5rfa/eUewGuB+T/Yz7A12ljyH8c638DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T21:13:03.086544Z","bundle_sha256":"2a55fb6c3a7e9983ff6d50736074b30a0a4ab5f25874e5650a281b9a0ab9d270"}}