{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QW5JILIY6VQFQ2WXY3UKUGJCXB","short_pith_number":"pith:QW5JILIY","canonical_record":{"source":{"id":"2410.10892","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-10-12T02:55:17Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"15491345245df9e3924223ae4d7799e68c9d3f84a0a1d12601bc4d9660829e9c","abstract_canon_sha256":"5a8bb9bccb65fbc1002997c200e020e9776f4184f3ec2865a87b04be6ab2d514"},"schema_version":"1.0"},"canonical_sha256":"85ba942d18f560586ad7c6e8aa1922b86f797905a3be5545ff2661033da4759f","source":{"kind":"arxiv","id":"2410.10892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10892","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10892v1","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10892","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"pith_short_12","alias_value":"QW5JILIY6VQF","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"pith_short_16","alias_value":"QW5JILIY6VQFQ2WX","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"pith_short_8","alias_value":"QW5JILIY","created_at":"2026-07-05T09:20:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QW5JILIY6VQFQ2WXY3UKUGJCXB","target":"record","payload":{"canonical_record":{"source":{"id":"2410.10892","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-10-12T02:55:17Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"15491345245df9e3924223ae4d7799e68c9d3f84a0a1d12601bc4d9660829e9c","abstract_canon_sha256":"5a8bb9bccb65fbc1002997c200e020e9776f4184f3ec2865a87b04be6ab2d514"},"schema_version":"1.0"},"canonical_sha256":"85ba942d18f560586ad7c6e8aa1922b86f797905a3be5545ff2661033da4759f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:26.542537Z","signature_b64":"C7+EaUatwOurrCWCxAhHHAnIlTdEvv8qbHGUSqE8+aJ9KkN0FBNAgdNvSPVnDrNxNuWTkP7hXSzqCM+QyLUrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85ba942d18f560586ad7c6e8aa1922b86f797905a3be5545ff2661033da4759f","last_reissued_at":"2026-07-05T09:20:26.542130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:26.542130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.10892","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-05T09:20:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOFE+gLsObZ/iqNX5itnzV2LrVsotCuo9HVW1udGabzO4kVxtL07bEpZpEy2ZLExHiNizfjAtvN9fo+PUweHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:02:42.730956Z"},"content_sha256":"3e6e3cf33e67b4b3268387599cdbff93f349e2d095a254c04bb6c4a0bccc7732","schema_version":"1.0","event_id":"sha256:3e6e3cf33e67b4b3268387599cdbff93f349e2d095a254c04bb6c4a0bccc7732"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QW5JILIY6VQFQ2WXY3UKUGJCXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Replicable Uniformity Testing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Christopher Ye, Sihan Liu","submitted_at":"2024-10-12T02:55:17Z","abstract_excerpt":"Uniformity testing is arguably one of the most fundamental distribution testing problems. Given sample access to an unknown distribution $\\mathbf{p}$ on $[n]$, one must decide if $\\mathbf{p}$ is uniform or $\\varepsilon$-far from uniform (in total variation distance). A long line of work established that uniformity testing has sample complexity $\\Theta(\\sqrt{n}\\varepsilon^{-2})$. However, when the input distribution is neither uniform nor far from uniform, known algorithms may have highly non-replicable behavior. Consequently, if these algorithms are applied in scientific studies, they may lead"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10892","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/2410.10892/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-05T09:20:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ewsfkSB3LLntAKuLc/aLGb1JnjLgILQmYf59gogkHTbSAQZX47ZPS4nCL2xT0u+u322Ll2wQZ02CkEjtYpakBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:02:42.731468Z"},"content_sha256":"52abdb50292126dafe17a0fcc19a8861a21f4f5c2aaf1b9cf8aa1a90c43dd3d2","schema_version":"1.0","event_id":"sha256:52abdb50292126dafe17a0fcc19a8861a21f4f5c2aaf1b9cf8aa1a90c43dd3d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QW5JILIY6VQFQ2WXY3UKUGJCXB/bundle.json","state_url":"https://pith.science/pith/QW5JILIY6VQFQ2WXY3UKUGJCXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QW5JILIY6VQFQ2WXY3UKUGJCXB/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-03T19:02:42Z","links":{"resolver":"https://pith.science/pith/QW5JILIY6VQFQ2WXY3UKUGJCXB","bundle":"https://pith.science/pith/QW5JILIY6VQFQ2WXY3UKUGJCXB/bundle.json","state":"https://pith.science/pith/QW5JILIY6VQFQ2WXY3UKUGJCXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QW5JILIY6VQFQ2WXY3UKUGJCXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QW5JILIY6VQFQ2WXY3UKUGJCXB","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":"5a8bb9bccb65fbc1002997c200e020e9776f4184f3ec2865a87b04be6ab2d514","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-10-12T02:55:17Z","title_canon_sha256":"15491345245df9e3924223ae4d7799e68c9d3f84a0a1d12601bc4d9660829e9c"},"schema_version":"1.0","source":{"id":"2410.10892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10892","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10892v1","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10892","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"pith_short_12","alias_value":"QW5JILIY6VQF","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"pith_short_16","alias_value":"QW5JILIY6VQFQ2WX","created_at":"2026-07-05T09:20:26Z"},{"alias_kind":"pith_short_8","alias_value":"QW5JILIY","created_at":"2026-07-05T09:20:26Z"}],"graph_snapshots":[{"event_id":"sha256:52abdb50292126dafe17a0fcc19a8861a21f4f5c2aaf1b9cf8aa1a90c43dd3d2","target":"graph","created_at":"2026-07-05T09:20:26Z","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/2410.10892/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Uniformity testing is arguably one of the most fundamental distribution testing problems. Given sample access to an unknown distribution $\\mathbf{p}$ on $[n]$, one must decide if $\\mathbf{p}$ is uniform or $\\varepsilon$-far from uniform (in total variation distance). A long line of work established that uniformity testing has sample complexity $\\Theta(\\sqrt{n}\\varepsilon^{-2})$. However, when the input distribution is neither uniform nor far from uniform, known algorithms may have highly non-replicable behavior. Consequently, if these algorithms are applied in scientific studies, they may lead","authors_text":"Christopher Ye, Sihan Liu","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-10-12T02:55:17Z","title":"Replicable Uniformity Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10892","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:3e6e3cf33e67b4b3268387599cdbff93f349e2d095a254c04bb6c4a0bccc7732","target":"record","created_at":"2026-07-05T09:20:26Z","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":"5a8bb9bccb65fbc1002997c200e020e9776f4184f3ec2865a87b04be6ab2d514","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-10-12T02:55:17Z","title_canon_sha256":"15491345245df9e3924223ae4d7799e68c9d3f84a0a1d12601bc4d9660829e9c"},"schema_version":"1.0","source":{"id":"2410.10892","kind":"arxiv","version":1}},"canonical_sha256":"85ba942d18f560586ad7c6e8aa1922b86f797905a3be5545ff2661033da4759f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85ba942d18f560586ad7c6e8aa1922b86f797905a3be5545ff2661033da4759f","first_computed_at":"2026-07-05T09:20:26.542130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:20:26.542130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C7+EaUatwOurrCWCxAhHHAnIlTdEvv8qbHGUSqE8+aJ9KkN0FBNAgdNvSPVnDrNxNuWTkP7hXSzqCM+QyLUrDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:20:26.542537Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.10892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e6e3cf33e67b4b3268387599cdbff93f349e2d095a254c04bb6c4a0bccc7732","sha256:52abdb50292126dafe17a0fcc19a8861a21f4f5c2aaf1b9cf8aa1a90c43dd3d2"],"state_sha256":"acc8a0a7ead4b3ad3511dea10926c961d5fb561fb92796157b458594f90c5d9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zh8HwyrDLMEI/BATVpCnW6hnrXDc0LylYfV7n3Ix/8L6cH/SgSR+vxiKYVON75QECtCC95OEcMhCogPKaM2qDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:02:42.736639Z","bundle_sha256":"9dd406aa64bde8b818964506b4e125dfc419b5889251bc653a67fb43bf38191f"}}