{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:S2RDGBXP7A2NCTLGXP57KGMGKW","short_pith_number":"pith:S2RDGBXP","canonical_record":{"source":{"id":"2410.18915","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T17:05:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b2b88dca19008bfcf54628df2115189839acf3e637c5ca6980d41220d93fbdcb","abstract_canon_sha256":"4dc3a6b1f33b20cd3d88eeb7d788e0ee30747c2d76d1834448472b781162ee5d"},"schema_version":"1.0"},"canonical_sha256":"96a23306eff834d14d66bbfbf51986558a148ed77c53349ab18d4b295f67ab7d","source":{"kind":"arxiv","id":"2410.18915","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.18915","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2410.18915v4","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18915","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"S2RDGBXP7A2N","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"S2RDGBXP7A2NCTLG","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"S2RDGBXP","created_at":"2026-05-21T01:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:S2RDGBXP7A2NCTLGXP57KGMGKW","target":"record","payload":{"canonical_record":{"source":{"id":"2410.18915","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T17:05:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b2b88dca19008bfcf54628df2115189839acf3e637c5ca6980d41220d93fbdcb","abstract_canon_sha256":"4dc3a6b1f33b20cd3d88eeb7d788e0ee30747c2d76d1834448472b781162ee5d"},"schema_version":"1.0"},"canonical_sha256":"96a23306eff834d14d66bbfbf51986558a148ed77c53349ab18d4b295f67ab7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:03.556159Z","signature_b64":"UFdga5gLVZG0ttXrtEW14XmRVDZyG32SHBSff/t80+JiLu873m1GzN29oWTSezMisBBWg2+ejfXFnAIKCiXZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96a23306eff834d14d66bbfbf51986558a148ed77c53349ab18d4b295f67ab7d","last_reissued_at":"2026-05-21T01:05:03.555232Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:03.555232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.18915","source_version":4,"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-05-21T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBLHjXIG63xvAjPN14j6n1aNmbXKrss0wHgW3c59EHWEcV+GtZ4ufj66m8WkdP1ff0OSQc4uSkulYehUKHV8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:08:01.861365Z"},"content_sha256":"8e43ac8c934decb533d7249f30f6f18d3ac28027c3e81edbca4404275dc32e21","schema_version":"1.0","event_id":"sha256:8e43ac8c934decb533d7249f30f6f18d3ac28027c3e81edbca4404275dc32e21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:S2RDGBXP7A2NCTLGXP57KGMGKW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing Support Size More Efficiently Than Learning Histograms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Nathaniel Harms, Renato Ferreira Pinto Jr.","submitted_at":"2024-10-24T17:05:34Z","abstract_excerpt":"Consider two problems about an unknown probability distribution $p$:\n  1. How many samples from $p$ are required to test if $p$ is supported on $n$ elements or not? Specifically, given samples from $p$, determine whether it is supported on at most $n$ elements, or it is \"$\\epsilon$-far\" (in total variation distance) from being supported on $n$ elements.\n  2. Given $m$ samples from $p$, what is the largest lower bound on its support size that we can produce?\n  The best known upper bound for problem (1) uses a general algorithm for learning the histogram of the distribution $p$, which requires $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18915","kind":"arxiv","version":4},"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.18915/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-05-21T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpvLesfHvnaN8K8E0a+Vw+K/IzytgVgxgJRU3kfmrHswqRIvoW3iEXJpEM0y2FBzRmcDwOslw+jWgqLySEWyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:08:01.861744Z"},"content_sha256":"17f3839c387492421281441aad79073aa034d75960e1802d7685d4e995db3f86","schema_version":"1.0","event_id":"sha256:17f3839c387492421281441aad79073aa034d75960e1802d7685d4e995db3f86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2RDGBXP7A2NCTLGXP57KGMGKW/bundle.json","state_url":"https://pith.science/pith/S2RDGBXP7A2NCTLGXP57KGMGKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2RDGBXP7A2NCTLGXP57KGMGKW/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-06-09T00:08:01Z","links":{"resolver":"https://pith.science/pith/S2RDGBXP7A2NCTLGXP57KGMGKW","bundle":"https://pith.science/pith/S2RDGBXP7A2NCTLGXP57KGMGKW/bundle.json","state":"https://pith.science/pith/S2RDGBXP7A2NCTLGXP57KGMGKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2RDGBXP7A2NCTLGXP57KGMGKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:S2RDGBXP7A2NCTLGXP57KGMGKW","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":"4dc3a6b1f33b20cd3d88eeb7d788e0ee30747c2d76d1834448472b781162ee5d","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T17:05:34Z","title_canon_sha256":"b2b88dca19008bfcf54628df2115189839acf3e637c5ca6980d41220d93fbdcb"},"schema_version":"1.0","source":{"id":"2410.18915","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.18915","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2410.18915v4","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18915","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"S2RDGBXP7A2N","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"S2RDGBXP7A2NCTLG","created_at":"2026-05-21T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"S2RDGBXP","created_at":"2026-05-21T01:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:17f3839c387492421281441aad79073aa034d75960e1802d7685d4e995db3f86","target":"graph","created_at":"2026-05-21T01:05:03Z","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.18915/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider two problems about an unknown probability distribution $p$:\n  1. How many samples from $p$ are required to test if $p$ is supported on $n$ elements or not? Specifically, given samples from $p$, determine whether it is supported on at most $n$ elements, or it is \"$\\epsilon$-far\" (in total variation distance) from being supported on $n$ elements.\n  2. Given $m$ samples from $p$, what is the largest lower bound on its support size that we can produce?\n  The best known upper bound for problem (1) uses a general algorithm for learning the histogram of the distribution $p$, which requires $","authors_text":"Nathaniel Harms, Renato Ferreira Pinto Jr.","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T17:05:34Z","title":"Testing Support Size More Efficiently Than Learning Histograms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18915","kind":"arxiv","version":4},"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:8e43ac8c934decb533d7249f30f6f18d3ac28027c3e81edbca4404275dc32e21","target":"record","created_at":"2026-05-21T01:05:03Z","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":"4dc3a6b1f33b20cd3d88eeb7d788e0ee30747c2d76d1834448472b781162ee5d","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T17:05:34Z","title_canon_sha256":"b2b88dca19008bfcf54628df2115189839acf3e637c5ca6980d41220d93fbdcb"},"schema_version":"1.0","source":{"id":"2410.18915","kind":"arxiv","version":4}},"canonical_sha256":"96a23306eff834d14d66bbfbf51986558a148ed77c53349ab18d4b295f67ab7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96a23306eff834d14d66bbfbf51986558a148ed77c53349ab18d4b295f67ab7d","first_computed_at":"2026-05-21T01:05:03.555232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:03.555232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UFdga5gLVZG0ttXrtEW14XmRVDZyG32SHBSff/t80+JiLu873m1GzN29oWTSezMisBBWg2+ejfXFnAIKCiXZBA==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:03.556159Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.18915","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e43ac8c934decb533d7249f30f6f18d3ac28027c3e81edbca4404275dc32e21","sha256:17f3839c387492421281441aad79073aa034d75960e1802d7685d4e995db3f86"],"state_sha256":"9f720dc282042c0c8b0f7a5d3b301b15ed4d73bc5473920154de41a1ab55692c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/vga+2BUuBKZ6ZjIyfQaOcRt17KmJN+Dty7F98ujM/8YlpCKYT5D09UnPmnkil7nEl5kbH5EiYlaWUbHr0oAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:08:01.864067Z","bundle_sha256":"177577835767bea61d0cc5dc8f7a0c756231005c5a17a80ff5e842ad0edbd40e"}}