{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HQDFX3244MNYRL4HTSV5BOWKVO","short_pith_number":"pith:HQDFX324","schema_version":"1.0","canonical_sha256":"3c065bef5ce31b88af879cabd0bacaabb411e55e6c32fcb3b202cd69c5bdf88d","source":{"kind":"arxiv","id":"2303.12921","version":2},"attestation_state":"computed","paper":{"title":"Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.LG","authors_text":"Jessica Sorrell, Marco Gaboardi, Mark Bun, Max Hopkins, Rex Lei, Russell Impagliazzo, Satchit Sivakumar, Toniann Pitassi","submitted_at":"2023-03-22T21:35:50Z","abstract_excerpt":"The notion of replicable algorithms was introduced in Impagliazzo et al. [STOC '22] to describe randomized algorithms that are stable under the resampling of their inputs. More precisely, a replicable algorithm gives the same output with high probability when its randomness is fixed and it is run on a new i.i.d. sample drawn from the same distribution. Using replicable algorithms for data analysis can facilitate the verification of published results by ensuring that the results of an analysis will be the same with high probability, even when that analysis is performed on a new data set.\n  In t"},"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":"2303.12921","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-22T21:35:50Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"ed1323799db9f181bd2207047cf170237021d397f8d170d12e9667e2daddbbf2","abstract_canon_sha256":"36d0500b707ff2ec5f7f7f0f53c1896d7e14b610e23981a4a156880a70d3f119"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:54:37.632600Z","signature_b64":"ieZNySqosM8+6Q8f65AQQc/gLK2jHYRvSpytPg8nFfRteXOcEbcmVlLm4u/Rwk6RyFvZqA1qQgsgfZdGIzdPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c065bef5ce31b88af879cabd0bacaabb411e55e6c32fcb3b202cd69c5bdf88d","last_reissued_at":"2026-07-05T05:54:37.632223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:54:37.632223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.LG","authors_text":"Jessica Sorrell, Marco Gaboardi, Mark Bun, Max Hopkins, Rex Lei, Russell Impagliazzo, Satchit Sivakumar, Toniann Pitassi","submitted_at":"2023-03-22T21:35:50Z","abstract_excerpt":"The notion of replicable algorithms was introduced in Impagliazzo et al. [STOC '22] to describe randomized algorithms that are stable under the resampling of their inputs. More precisely, a replicable algorithm gives the same output with high probability when its randomness is fixed and it is run on a new i.i.d. sample drawn from the same distribution. Using replicable algorithms for data analysis can facilitate the verification of published results by ensuring that the results of an analysis will be the same with high probability, even when that analysis is performed on a new data set.\n  In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.12921","kind":"arxiv","version":2},"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/2303.12921/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":"2303.12921","created_at":"2026-07-05T05:54:37.632283+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.12921v2","created_at":"2026-07-05T05:54:37.632283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.12921","created_at":"2026-07-05T05:54:37.632283+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQDFX3244MNY","created_at":"2026-07-05T05:54:37.632283+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQDFX3244MNYRL4H","created_at":"2026-07-05T05:54:37.632283+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQDFX324","created_at":"2026-07-05T05:54:37.632283+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08007","citing_title":"The Role of Randomness in Stability","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HQDFX3244MNYRL4HTSV5BOWKVO","json":"https://pith.science/pith/HQDFX3244MNYRL4HTSV5BOWKVO.json","graph_json":"https://pith.science/api/pith-number/HQDFX3244MNYRL4HTSV5BOWKVO/graph.json","events_json":"https://pith.science/api/pith-number/HQDFX3244MNYRL4HTSV5BOWKVO/events.json","paper":"https://pith.science/paper/HQDFX324"},"agent_actions":{"view_html":"https://pith.science/pith/HQDFX3244MNYRL4HTSV5BOWKVO","download_json":"https://pith.science/pith/HQDFX3244MNYRL4HTSV5BOWKVO.json","view_paper":"https://pith.science/paper/HQDFX324","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.12921&json=true","fetch_graph":"https://pith.science/api/pith-number/HQDFX3244MNYRL4HTSV5BOWKVO/graph.json","fetch_events":"https://pith.science/api/pith-number/HQDFX3244MNYRL4HTSV5BOWKVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQDFX3244MNYRL4HTSV5BOWKVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQDFX3244MNYRL4HTSV5BOWKVO/action/storage_attestation","attest_author":"https://pith.science/pith/HQDFX3244MNYRL4HTSV5BOWKVO/action/author_attestation","sign_citation":"https://pith.science/pith/HQDFX3244MNYRL4HTSV5BOWKVO/action/citation_signature","submit_replication":"https://pith.science/pith/HQDFX3244MNYRL4HTSV5BOWKVO/action/replication_record"}},"created_at":"2026-07-05T05:54:37.632283+00:00","updated_at":"2026-07-05T05:54:37.632283+00:00"}