{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JGAKLL7EKS6THUKYT6RDGTXG7T","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":"380e444169e8bb776cae0265f727ddca1f2d7bf727bfa2d5a8339dcfed00777b","cross_cats_sorted":["cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-06-02T21:02:13Z","title_canon_sha256":"6bfcf9f47c6786a9c5f0352d99b2bcb5070de5323429a1db85820768ff3a1bf0"},"schema_version":"1.0","source":{"id":"2506.02257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02257","created_at":"2026-07-05T11:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02257v1","created_at":"2026-07-05T11:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02257","created_at":"2026-07-05T11:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"JGAKLL7EKS6T","created_at":"2026-07-05T11:14:35Z"},{"alias_kind":"pith_short_16","alias_value":"JGAKLL7EKS6THUKY","created_at":"2026-07-05T11:14:35Z"},{"alias_kind":"pith_short_8","alias_value":"JGAKLL7E","created_at":"2026-07-05T11:14:35Z"}],"graph_snapshots":[{"event_id":"sha256:12d3a1b83baaa66faf480301754820b7d5e8f4efcb2060f6cd0d4afdcd30fe0d","target":"graph","created_at":"2026-07-05T11:14:35Z","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/2506.02257/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we consider ranking problems among a finite set of candidates: for instance, selecting the top-$k$ items among a larger list of candidates or obtaining the full ranking of all items in the set. These problems are often unstable, in the sense that estimating a ranking from noisy data can exhibit high sensitivity to small perturbations. Concretely, if we use data to provide a score for each item (say, by aggregating preference data over a sample of users), then for two items with similar scores, small fluctuations in the data can alter the relative ranking of those items. Many exis","authors_text":"Jake A. Soloff, Rebecca Willett, Rina Foygel Barber, Ruiting Liang","cross_cats":["cs.LG","math.ST","stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-06-02T21:02:13Z","title":"Assumption-free stability for ranking problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02257","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:ea056bdc1e8179db48350f90170e135f0e34827fd8ad12260abd81e44afb87d5","target":"record","created_at":"2026-07-05T11:14:35Z","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":"380e444169e8bb776cae0265f727ddca1f2d7bf727bfa2d5a8339dcfed00777b","cross_cats_sorted":["cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-06-02T21:02:13Z","title_canon_sha256":"6bfcf9f47c6786a9c5f0352d99b2bcb5070de5323429a1db85820768ff3a1bf0"},"schema_version":"1.0","source":{"id":"2506.02257","kind":"arxiv","version":1}},"canonical_sha256":"4980a5afe454bd33d1589fa2334ee6fcd1f14ee7884f7f139498ec7a071e4c2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4980a5afe454bd33d1589fa2334ee6fcd1f14ee7884f7f139498ec7a071e4c2e","first_computed_at":"2026-07-05T11:14:35.433136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:35.433136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZoFbSfM+zyLqaY1dtMy+DRpKgN8LyrYXv5XNOxMzTjmmmlB4zFSep/AKeGcRypHvzR4k3FXFmryRagV9s3ImDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:35.433622Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.02257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea056bdc1e8179db48350f90170e135f0e34827fd8ad12260abd81e44afb87d5","sha256:12d3a1b83baaa66faf480301754820b7d5e8f4efcb2060f6cd0d4afdcd30fe0d"],"state_sha256":"bd86947b4f61bfcc3d21c83ced354d783bb2b2fd10a7c8929e13e5b155ca1237"}