{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IQXGDLXEX3AM323Z6U3FDCOUTV","short_pith_number":"pith:IQXGDLXE","schema_version":"1.0","canonical_sha256":"442e61aee4bec0cdeb79f5365189d49d5ff1ca361db253f1a3c21177abb9e8d3","source":{"kind":"arxiv","id":"2502.08007","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.08007","created_at":"2026-07-05T10:13:13.522716+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08007v1","created_at":"2026-07-05T10:13:13.522716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08007","created_at":"2026-07-05T10:13:13.522716+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQXGDLXEX3AM","created_at":"2026-07-05T10:13:13.522716+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQXGDLXEX3AM323Z","created_at":"2026-07-05T10:13:13.522716+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQXGDLXE","created_at":"2026-07-05T10:13:13.522716+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.05333","citing_title":"Stability and List-Replicability for Agnostic Learners","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV","json":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV.json","graph_json":"https://pith.science/api/pith-number/IQXGDLXEX3AM323Z6U3FDCOUTV/graph.json","events_json":"https://pith.science/api/pith-number/IQXGDLXEX3AM323Z6U3FDCOUTV/events.json","paper":"https://pith.science/paper/IQXGDLXE"},"agent_actions":{"view_html":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV","download_json":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV.json","view_paper":"https://pith.science/paper/IQXGDLXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08007&json=true","fetch_graph":"https://pith.science/api/pith-number/IQXGDLXEX3AM323Z6U3FDCOUTV/graph.json","fetch_events":"https://pith.science/api/pith-number/IQXGDLXEX3AM323Z6U3FDCOUTV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/action/storage_attestation","attest_author":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/action/author_attestation","sign_citation":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/action/citation_signature","submit_replication":"https://pith.science/pith/IQXGDLXEX3AM323Z6U3FDCOUTV/action/replication_record"}},"created_at":"2026-07-05T10:13:13.522716+00:00","updated_at":"2026-07-05T10:13:13.522716+00:00"}