{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IQXGDLXEX3AM323Z6U3FDCOUTV","short_pith_number":"pith:IQXGDLXE","canonical_record":{"source":{"id":"2502.08007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-11T23:06:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"814fdbe941646a2174a0fb72e88974c10dc20d310aa68812ab7ca312a65f4224","abstract_canon_sha256":"b99ff4ca901d31e923436de13661487ddeb5a6519a1db35be283662f8e7e93de"},"schema_version":"1.0"},"canonical_sha256":"442e61aee4bec0cdeb79f5365189d49d5ff1ca361db253f1a3c21177abb9e8d3","source":{"kind":"arxiv","id":"2502.08007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08007","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08007v1","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08007","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"IQXGDLXEX3AM","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"IQXGDLXEX3AM323Z","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"IQXGDLXE","created_at":"2026-07-05T10:13:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IQXGDLXEX3AM323Z6U3FDCOUTV","target":"record","payload":{"canonical_record":{"source":{"id":"2502.08007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-11T23:06:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"814fdbe941646a2174a0fb72e88974c10dc20d310aa68812ab7ca312a65f4224","abstract_canon_sha256":"b99ff4ca901d31e923436de13661487ddeb5a6519a1db35be283662f8e7e93de"},"schema_version":"1.0"},"canonical_sha256":"442e61aee4bec0cdeb79f5365189d49d5ff1ca361db253f1a3c21177abb9e8d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:13.523101Z","signature_b64":"/1z1V7W1Du0UDu2mNNYgYkMReWd6xpXjKI3cThqXlVhmfOdreRvz6GdQ8qBMmqQzfWr6DJCsG9GNl3MAQjhjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"442e61aee4bec0cdeb79f5365189d49d5ff1ca361db253f1a3c21177abb9e8d3","last_reissued_at":"2026-07-05T10:13:13.522664Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:13.522664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.08007","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-05T10:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpIxz9AA5E2LdzOOQX6dLm69vrFSXILGo/eby4kwuD+SprcjM5ay+Sh0NwW1Xyp+Gdz1zWnSIMnd2QnhIpaTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:39:43.480032Z"},"content_sha256":"61549ad722e5d753da13227eaa2116bfa0ec0958b3cf0bacf88ac3cc48e82635","schema_version":"1.0","event_id":"sha256:61549ad722e5d753da13227eaa2116bfa0ec0958b3cf0bacf88ac3cc48e82635"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IQXGDLXEX3AM323Z6U3FDCOUTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Role of Randomness in Stability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Max Hopkins, Shay Moran","submitted_at":"2025-02-11T23:06:43Z","abstract_excerpt":"Stability is a central property in learning and statistics promising the output of an algorithm $A$ does not change substantially when applied to similar datasets $S$ and $S'$. It is an elementary fact that any sufficiently stable algorithm (e.g.\\ one returning the same result with high probability, satisfying privacy guarantees, etc.) must be randomized. This raises a natural question: can we quantify how much randomness is needed for algorithmic stability?\n  We study the randomness complexity of two influential notions of stability in learning: replicability, which promises $A$ usually outpu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08007","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/2502.08007/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-05T10:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HaRyFWJ6hhNLKfkBJ5761MFgCEdw49tlWuUZgEaXSj8Fryld8S6+aMMlENSyz8fMOfQ+S+858Q4X1iPZvU53Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:39:43.482725Z"},"content_sha256":"fa9ae58a6e4b15c376926b303005b03dd59740c1c155392a44b282aa6b4690ec","schema_version":"1.0","event_id":"sha256:fa9ae58a6e4b15c376926b303005b03dd59740c1c155392a44b282aa6b4690ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/bundle.json","state_url":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/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-11T00:39:43Z","links":{"resolver":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV","bundle":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/bundle.json","state":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IQXGDLXEX3AM323Z6U3FDCOUTV","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":"b99ff4ca901d31e923436de13661487ddeb5a6519a1db35be283662f8e7e93de","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-11T23:06:43Z","title_canon_sha256":"814fdbe941646a2174a0fb72e88974c10dc20d310aa68812ab7ca312a65f4224"},"schema_version":"1.0","source":{"id":"2502.08007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08007","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08007v1","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08007","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"IQXGDLXEX3AM","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"IQXGDLXEX3AM323Z","created_at":"2026-07-05T10:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"IQXGDLXE","created_at":"2026-07-05T10:13:13Z"}],"graph_snapshots":[{"event_id":"sha256:fa9ae58a6e4b15c376926b303005b03dd59740c1c155392a44b282aa6b4690ec","target":"graph","created_at":"2026-07-05T10:13:13Z","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/2502.08007/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stability is a central property in learning and statistics promising the output of an algorithm $A$ does not change substantially when applied to similar datasets $S$ and $S'$. It is an elementary fact that any sufficiently stable algorithm (e.g.\\ one returning the same result with high probability, satisfying privacy guarantees, etc.) must be randomized. This raises a natural question: can we quantify how much randomness is needed for algorithmic stability?\n  We study the randomness complexity of two influential notions of stability in learning: replicability, which promises $A$ usually outpu","authors_text":"Max Hopkins, Shay Moran","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-11T23:06:43Z","title":"The Role of Randomness in Stability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08007","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:61549ad722e5d753da13227eaa2116bfa0ec0958b3cf0bacf88ac3cc48e82635","target":"record","created_at":"2026-07-05T10:13:13Z","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":"b99ff4ca901d31e923436de13661487ddeb5a6519a1db35be283662f8e7e93de","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-11T23:06:43Z","title_canon_sha256":"814fdbe941646a2174a0fb72e88974c10dc20d310aa68812ab7ca312a65f4224"},"schema_version":"1.0","source":{"id":"2502.08007","kind":"arxiv","version":1}},"canonical_sha256":"442e61aee4bec0cdeb79f5365189d49d5ff1ca361db253f1a3c21177abb9e8d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"442e61aee4bec0cdeb79f5365189d49d5ff1ca361db253f1a3c21177abb9e8d3","first_computed_at":"2026-07-05T10:13:13.522664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:13:13.522664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/1z1V7W1Du0UDu2mNNYgYkMReWd6xpXjKI3cThqXlVhmfOdreRvz6GdQ8qBMmqQzfWr6DJCsG9GNl3MAQjhjDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:13:13.523101Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.08007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61549ad722e5d753da13227eaa2116bfa0ec0958b3cf0bacf88ac3cc48e82635","sha256:fa9ae58a6e4b15c376926b303005b03dd59740c1c155392a44b282aa6b4690ec"],"state_sha256":"51e04c2de0ccda57bb4484bfb6a9b2a684b2d5084e3760a738e06159d7a6d40f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFtk9Nk6c5/6suzgQ5XMMMnqvxLRpKvjvUQxPqTRJVTJuFW0gv+OjQBuinBkcwBV+y/HZNSC2rOIjq2rxpBzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T00:39:43.543275Z","bundle_sha256":"9060348f0cf9a1b821265bdcb9f643d1e2acd3ccda6f9d488652206702890ec0"}}