{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OOIQ6DYFTVX5ODIOND2MSTKQ7U","short_pith_number":"pith:OOIQ6DYF","schema_version":"1.0","canonical_sha256":"73910f0f059d6fd70d0e68f4c94d50fd1bafac7c804552f160513de1ec26595e","source":{"kind":"arxiv","id":"2304.01374","version":1},"attestation_state":"computed","paper":{"title":"Distribution Testing Under the Parity Trace","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Nathaniel Harms, Renato Ferreira Pinto Jr.","submitted_at":"2023-04-03T20:58:29Z","abstract_excerpt":"Distribution testing is a fundamental statistical task with many applications, but we are interested in a variety of problems where systematic mislabelings of the sample prevent us from applying the existing theory. To apply distribution testing to these problems, we introduce distribution testing under the parity trace, where the algorithm receives an ordered sample $S$ that reveals only the least significant bit of each element. This abstraction reveals connections between the following three problems of interest, allowing new upper and lower bounds:\n  1. In distribution testing with a confu"},"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":"2304.01374","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-03T20:58:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"30a9c6f7c467c1db6e933a05aabd8ebbd3faccfaaaf99f0bf021cfc9caffaa11","abstract_canon_sha256":"10f87e455f98b7c11acfd7072f9f359f2aa9ff2dae7a16c905a217590ca9ad46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:57:39.509772Z","signature_b64":"uyObu5eHstDxr8SYFsa1dHrnGMjAY3xZL8Rlo7HAqxhF1aj9HfG0pdggNCfTTn4/cMtKhIdwZLHDaisfbZFaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73910f0f059d6fd70d0e68f4c94d50fd1bafac7c804552f160513de1ec26595e","last_reissued_at":"2026-07-05T05:57:39.509341Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:57:39.509341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distribution Testing Under the Parity Trace","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Nathaniel Harms, Renato Ferreira Pinto Jr.","submitted_at":"2023-04-03T20:58:29Z","abstract_excerpt":"Distribution testing is a fundamental statistical task with many applications, but we are interested in a variety of problems where systematic mislabelings of the sample prevent us from applying the existing theory. To apply distribution testing to these problems, we introduce distribution testing under the parity trace, where the algorithm receives an ordered sample $S$ that reveals only the least significant bit of each element. This abstraction reveals connections between the following three problems of interest, allowing new upper and lower bounds:\n  1. In distribution testing with a confu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01374","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/2304.01374/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":"2304.01374","created_at":"2026-07-05T05:57:39.509399+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.01374v1","created_at":"2026-07-05T05:57:39.509399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01374","created_at":"2026-07-05T05:57:39.509399+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOIQ6DYFTVX5","created_at":"2026-07-05T05:57:39.509399+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOIQ6DYFTVX5ODIO","created_at":"2026-07-05T05:57:39.509399+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOIQ6DYF","created_at":"2026-07-05T05:57:39.509399+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23509","citing_title":"Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2410.18915","citing_title":"Testing Support Size More Efficiently Than Learning Histograms","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OOIQ6DYFTVX5ODIOND2MSTKQ7U","json":"https://pith.science/pith/OOIQ6DYFTVX5ODIOND2MSTKQ7U.json","graph_json":"https://pith.science/api/pith-number/OOIQ6DYFTVX5ODIOND2MSTKQ7U/graph.json","events_json":"https://pith.science/api/pith-number/OOIQ6DYFTVX5ODIOND2MSTKQ7U/events.json","paper":"https://pith.science/paper/OOIQ6DYF"},"agent_actions":{"view_html":"https://pith.science/pith/OOIQ6DYFTVX5ODIOND2MSTKQ7U","download_json":"https://pith.science/pith/OOIQ6DYFTVX5ODIOND2MSTKQ7U.json","view_paper":"https://pith.science/paper/OOIQ6DYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.01374&json=true","fetch_graph":"https://pith.science/api/pith-number/OOIQ6DYFTVX5ODIOND2MSTKQ7U/graph.json","fetch_events":"https://pith.science/api/pith-number/OOIQ6DYFTVX5ODIOND2MSTKQ7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOIQ6DYFTVX5ODIOND2MSTKQ7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOIQ6DYFTVX5ODIOND2MSTKQ7U/action/storage_attestation","attest_author":"https://pith.science/pith/OOIQ6DYFTVX5ODIOND2MSTKQ7U/action/author_attestation","sign_citation":"https://pith.science/pith/OOIQ6DYFTVX5ODIOND2MSTKQ7U/action/citation_signature","submit_replication":"https://pith.science/pith/OOIQ6DYFTVX5ODIOND2MSTKQ7U/action/replication_record"}},"created_at":"2026-07-05T05:57:39.509399+00:00","updated_at":"2026-07-05T05:57:39.509399+00:00"}