{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QXQUZTUX7EE5CT45XYFTOAYDMV","short_pith_number":"pith:QXQUZTUX","schema_version":"1.0","canonical_sha256":"85e14cce97f909d14f9dbe0b370303656c9214e0712bf24ef375c97fe8002335","source":{"kind":"arxiv","id":"1804.06952","version":3},"attestation_state":"computed","paper":{"title":"Distributed Simulation and Distributed Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.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":"2018-04-19T00:34:15Z","abstract_excerpt":"Independent samples from an unknown probability distribution $\\bf p$ on a domain of size $k$ are distributed across $n$ players, with each player holding one sample. Each player can communicate $\\ell$ bits to a central referee in a simultaneous message passing model of communication to help the referee infer a property of the unknown $\\bf p$. What is the least number of players for inference required in the communication-starved setting of $\\ell<\\log k$? We begin by exploring a general \"simulate-and-infer\" strategy for such inference problems where the center simulates the desired number of sa"},"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":"1804.06952","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-19T00:34:15Z","cross_cats_sorted":["cs.DM","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"e2979c92cfc90b383ac4966fe42d68890c743c540104d12c3b095facbde997d6","abstract_canon_sha256":"6337029ad5a63d09adfe471a986b3cc6102ef15dd65bf908bb45848f155c8718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:20.900363Z","signature_b64":"fWOFuDMfWRlrZ7d1WSB7yJiNMjvOXEUTlhicI93E9AwkmBtXMdGrdzipeHLav9TDh1WTMMuTVIHkWEx1+UFhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85e14cce97f909d14f9dbe0b370303656c9214e0712bf24ef375c97fe8002335","last_reissued_at":"2026-05-17T23:45:20.899880Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:20.899880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Simulation and Distributed Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.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":"2018-04-19T00:34:15Z","abstract_excerpt":"Independent samples from an unknown probability distribution $\\bf p$ on a domain of size $k$ are distributed across $n$ players, with each player holding one sample. Each player can communicate $\\ell$ bits to a central referee in a simultaneous message passing model of communication to help the referee infer a property of the unknown $\\bf p$. What is the least number of players for inference required in the communication-starved setting of $\\ell<\\log k$? We begin by exploring a general \"simulate-and-infer\" strategy for such inference problems where the center simulates the desired number of sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06952","kind":"arxiv","version":3},"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":"1804.06952","created_at":"2026-05-17T23:45:20.899962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06952v3","created_at":"2026-05-17T23:45:20.899962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06952","created_at":"2026-05-17T23:45:20.899962+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXQUZTUX7EE5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXQUZTUX7EE5CT45","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXQUZTUX","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21860","citing_title":"Robust Statistical Estimators with Bounded Empirical Sensitivity","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV","json":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV.json","graph_json":"https://pith.science/api/pith-number/QXQUZTUX7EE5CT45XYFTOAYDMV/graph.json","events_json":"https://pith.science/api/pith-number/QXQUZTUX7EE5CT45XYFTOAYDMV/events.json","paper":"https://pith.science/paper/QXQUZTUX"},"agent_actions":{"view_html":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV","download_json":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV.json","view_paper":"https://pith.science/paper/QXQUZTUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06952&json=true","fetch_graph":"https://pith.science/api/pith-number/QXQUZTUX7EE5CT45XYFTOAYDMV/graph.json","fetch_events":"https://pith.science/api/pith-number/QXQUZTUX7EE5CT45XYFTOAYDMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/action/storage_attestation","attest_author":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/action/author_attestation","sign_citation":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/action/citation_signature","submit_replication":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/action/replication_record"}},"created_at":"2026-05-17T23:45:20.899962+00:00","updated_at":"2026-05-17T23:45:20.899962+00:00"}