{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X73VMESQ2EBCPNPRXJR4UV56N5","short_pith_number":"pith:X73VMESQ","schema_version":"1.0","canonical_sha256":"bff7561250d10227b5f1ba63ca57be6f7dcfa673d3c30eaab3800c3bafe74742","source":{"kind":"arxiv","id":"1905.08302","version":2},"attestation_state":"computed","paper":{"title":"Inference under Information Constraints II: Communication Constraints and Shared Randomness","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Cl\\'ement L. Canonne, Himanshu Tyagi, Jayadev Acharya","submitted_at":"2019-05-20T19:18:47Z","abstract_excerpt":"A central server needs to perform statistical inference based on samples that are distributed over multiple users who can each send a message of limited length to the center. We study problems of distribution learning and identity testing in this distributed inference setting and examine the role of shared randomness as a resource. We propose a general-purpose simulate-and-infer strategy that uses only private-coin communication protocols and is sample-optimal for distribution learning. This general strategy turns out to be sample-optimal even for distribution testing among private-coin protoc"},"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":"1905.08302","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-05-20T19:18:47Z","cross_cats_sorted":["cs.DM","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"5c2a9a035e35e46886fa1b73ddd62fcb1bf5e387192c17efde945b648a834f99","abstract_canon_sha256":"70d358d59d2cbae6ff449c4394f010647e59433b8f4fe6b3d3fbdd249c3f63cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:24.321430Z","signature_b64":"PeKmKRfOpTNe8gaO1e4dFaiawXZQkNnkh7/WfvQttuGLS2MINIatPYQOL/eufglqBBB4BYz0EbczY2VimmoyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff7561250d10227b5f1ba63ca57be6f7dcfa673d3c30eaab3800c3bafe74742","last_reissued_at":"2026-07-05T01:39:24.320973Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:24.320973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inference under Information Constraints II: Communication Constraints and Shared Randomness","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Cl\\'ement L. Canonne, Himanshu Tyagi, Jayadev Acharya","submitted_at":"2019-05-20T19:18:47Z","abstract_excerpt":"A central server needs to perform statistical inference based on samples that are distributed over multiple users who can each send a message of limited length to the center. We study problems of distribution learning and identity testing in this distributed inference setting and examine the role of shared randomness as a resource. We propose a general-purpose simulate-and-infer strategy that uses only private-coin communication protocols and is sample-optimal for distribution learning. This general strategy turns out to be sample-optimal even for distribution testing among private-coin protoc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08302","kind":"arxiv","version":2},"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/1905.08302/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":"1905.08302","created_at":"2026-07-05T01:39:24.321052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08302v2","created_at":"2026-07-05T01:39:24.321052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08302","created_at":"2026-07-05T01:39:24.321052+00:00"},{"alias_kind":"pith_short_12","alias_value":"X73VMESQ2EBC","created_at":"2026-07-05T01:39:24.321052+00:00"},{"alias_kind":"pith_short_16","alias_value":"X73VMESQ2EBCPNPR","created_at":"2026-07-05T01:39:24.321052+00:00"},{"alias_kind":"pith_short_8","alias_value":"X73VMESQ","created_at":"2026-07-05T01:39:24.321052+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22001","citing_title":"Pauli Measurements Are Near-Optimal for Single-Qubit Tomography","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X73VMESQ2EBCPNPRXJR4UV56N5","json":"https://pith.science/pith/X73VMESQ2EBCPNPRXJR4UV56N5.json","graph_json":"https://pith.science/api/pith-number/X73VMESQ2EBCPNPRXJR4UV56N5/graph.json","events_json":"https://pith.science/api/pith-number/X73VMESQ2EBCPNPRXJR4UV56N5/events.json","paper":"https://pith.science/paper/X73VMESQ"},"agent_actions":{"view_html":"https://pith.science/pith/X73VMESQ2EBCPNPRXJR4UV56N5","download_json":"https://pith.science/pith/X73VMESQ2EBCPNPRXJR4UV56N5.json","view_paper":"https://pith.science/paper/X73VMESQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08302&json=true","fetch_graph":"https://pith.science/api/pith-number/X73VMESQ2EBCPNPRXJR4UV56N5/graph.json","fetch_events":"https://pith.science/api/pith-number/X73VMESQ2EBCPNPRXJR4UV56N5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X73VMESQ2EBCPNPRXJR4UV56N5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X73VMESQ2EBCPNPRXJR4UV56N5/action/storage_attestation","attest_author":"https://pith.science/pith/X73VMESQ2EBCPNPRXJR4UV56N5/action/author_attestation","sign_citation":"https://pith.science/pith/X73VMESQ2EBCPNPRXJR4UV56N5/action/citation_signature","submit_replication":"https://pith.science/pith/X73VMESQ2EBCPNPRXJR4UV56N5/action/replication_record"}},"created_at":"2026-07-05T01:39:24.321052+00:00","updated_at":"2026-07-05T01:39:24.321052+00:00"}