{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RW2AKZDAQQGEEKFDLSQNVW2DY5","short_pith_number":"pith:RW2AKZDA","schema_version":"1.0","canonical_sha256":"8db4056460840c4228a35ca0dadb43c76eec4b1df842ebbd14d4457cf42a7359","source":{"kind":"arxiv","id":"1402.3835","version":1},"attestation_state":"computed","paper":{"title":"Testing probability distributions underlying aggregated data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Cl\\'ement Canonne, Ronitt Rubinfeld","submitted_at":"2014-02-16T20:00:00Z","abstract_excerpt":"In this paper, we analyze and study a hybrid model for testing and learning probability distributions. Here, in addition to samples, the testing algorithm is provided with one of two different types of oracles to the unknown distribution $D$ over $[n]$. More precisely, we define both the dual and cumulative dual access models, in which the algorithm $A$ can both sample from $D$ and respectively, for any $i\\in[n]$,\n  - query the probability mass $D(i)$ (query access); or\n  - get the total mass of $\\{1,\\dots,i\\}$, i.e. $\\sum_{j=1}^i D(j)$ (cumulative access)\n  These two models, by generalizing 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":"1402.3835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-16T20:00:00Z","cross_cats_sorted":["cs.DM","math.PR","math.ST","stat.TH"],"title_canon_sha256":"07e9994e78a2999d964ddedb3c1eafdd0f59af909b626ad8019ec601c12fd472","abstract_canon_sha256":"d082ddc2851a82c70ca9f13eccc61fa1424d19afa50d99559de52a77eb62c216"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:55.466448Z","signature_b64":"c9mlZckhMzVDrTNXKgDk5UxUh1bWqeHz+7CwYm6lL9s/i8bWv12zcsG8fwAPQ2lw4aCtiIjfb9e9BGCPFCn3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8db4056460840c4228a35ca0dadb43c76eec4b1df842ebbd14d4457cf42a7359","last_reissued_at":"2026-05-18T02:58:55.465669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:55.465669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing probability distributions underlying aggregated data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Cl\\'ement Canonne, Ronitt Rubinfeld","submitted_at":"2014-02-16T20:00:00Z","abstract_excerpt":"In this paper, we analyze and study a hybrid model for testing and learning probability distributions. Here, in addition to samples, the testing algorithm is provided with one of two different types of oracles to the unknown distribution $D$ over $[n]$. More precisely, we define both the dual and cumulative dual access models, in which the algorithm $A$ can both sample from $D$ and respectively, for any $i\\in[n]$,\n  - query the probability mass $D(i)$ (query access); or\n  - get the total mass of $\\{1,\\dots,i\\}$, i.e. $\\sum_{j=1}^i D(j)$ (cumulative access)\n  These two models, by generalizing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3835","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":""},"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":"1402.3835","created_at":"2026-05-18T02:58:55.465807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3835v1","created_at":"2026-05-18T02:58:55.465807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3835","created_at":"2026-05-18T02:58:55.465807+00:00"},{"alias_kind":"pith_short_12","alias_value":"RW2AKZDAQQGE","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RW2AKZDAQQGEEKFD","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RW2AKZDA","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.25821","citing_title":"On the Complexity of the Succinct State Local Hamiltonian Problem","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RW2AKZDAQQGEEKFDLSQNVW2DY5","json":"https://pith.science/pith/RW2AKZDAQQGEEKFDLSQNVW2DY5.json","graph_json":"https://pith.science/api/pith-number/RW2AKZDAQQGEEKFDLSQNVW2DY5/graph.json","events_json":"https://pith.science/api/pith-number/RW2AKZDAQQGEEKFDLSQNVW2DY5/events.json","paper":"https://pith.science/paper/RW2AKZDA"},"agent_actions":{"view_html":"https://pith.science/pith/RW2AKZDAQQGEEKFDLSQNVW2DY5","download_json":"https://pith.science/pith/RW2AKZDAQQGEEKFDLSQNVW2DY5.json","view_paper":"https://pith.science/paper/RW2AKZDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3835&json=true","fetch_graph":"https://pith.science/api/pith-number/RW2AKZDAQQGEEKFDLSQNVW2DY5/graph.json","fetch_events":"https://pith.science/api/pith-number/RW2AKZDAQQGEEKFDLSQNVW2DY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RW2AKZDAQQGEEKFDLSQNVW2DY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RW2AKZDAQQGEEKFDLSQNVW2DY5/action/storage_attestation","attest_author":"https://pith.science/pith/RW2AKZDAQQGEEKFDLSQNVW2DY5/action/author_attestation","sign_citation":"https://pith.science/pith/RW2AKZDAQQGEEKFDLSQNVW2DY5/action/citation_signature","submit_replication":"https://pith.science/pith/RW2AKZDAQQGEEKFDLSQNVW2DY5/action/replication_record"}},"created_at":"2026-05-18T02:58:55.465807+00:00","updated_at":"2026-05-18T02:58:55.465807+00:00"}