{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QXQUZTUX7EE5CT45XYFTOAYDMV","short_pith_number":"pith:QXQUZTUX","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"},"canonical_sha256":"85e14cce97f909d14f9dbe0b370303656c9214e0712bf24ef375c97fe8002335","source":{"kind":"arxiv","id":"1804.06952","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06952","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06952v3","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06952","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"QXQUZTUX7EE5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QXQUZTUX7EE5CT45","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QXQUZTUX","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QXQUZTUX7EE5CT45XYFTOAYDMV","target":"record","payload":{"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"},"canonical_sha256":"85e14cce97f909d14f9dbe0b370303656c9214e0712bf24ef375c97fe8002335","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"},"source_kind":"arxiv","source_id":"1804.06952","source_version":3,"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-17T23:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UHP7tsV4F6x7puhEbrileWY76KSgo9HlUqroo8Yc7tEIpoqdtViNUmx5F7cojir06+36jRENicEybpJlzlbuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T22:23:12.590433Z"},"content_sha256":"4aa4ebc1d3dc633a267d489138fc11bf5f3087bf417b034a304e3057b9be312f","schema_version":"1.0","event_id":"sha256:4aa4ebc1d3dc633a267d489138fc11bf5f3087bf417b034a304e3057b9be312f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QXQUZTUX7EE5CT45XYFTOAYDMV","target":"graph","payload":{"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"},"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-17T23:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUSJTkW2BXniloN6/HkYra8XkrBB9gaThTHslZe8WL+UzZUlLzzaepr+cV8yhswrAwbyEplRgPNf3Yqu+SltBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T22:23:12.590810Z"},"content_sha256":"f24c2472956668ada5bffbe2df859d1ae27c18ab02087bfaeea2797b10430341","schema_version":"1.0","event_id":"sha256:f24c2472956668ada5bffbe2df859d1ae27c18ab02087bfaeea2797b10430341"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/bundle.json","state_url":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/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-05-22T22:23:12Z","links":{"resolver":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV","bundle":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/bundle.json","state":"https://pith.science/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXQUZTUX7EE5CT45XYFTOAYDMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QXQUZTUX7EE5CT45XYFTOAYDMV","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":"6337029ad5a63d09adfe471a986b3cc6102ef15dd65bf908bb45848f155c8718","cross_cats_sorted":["cs.DM","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-19T00:34:15Z","title_canon_sha256":"e2979c92cfc90b383ac4966fe42d68890c743c540104d12c3b095facbde997d6"},"schema_version":"1.0","source":{"id":"1804.06952","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06952","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06952v3","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06952","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"QXQUZTUX7EE5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QXQUZTUX7EE5CT45","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QXQUZTUX","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:f24c2472956668ada5bffbe2df859d1ae27c18ab02087bfaeea2797b10430341","target":"graph","created_at":"2026-05-17T23:45:20Z","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"},"paper":{"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","authors_text":"Cl\\'ement L. Canonne, Himanshu Tyagi, Jayadev Acharya","cross_cats":["cs.DM","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-19T00:34:15Z","title":"Distributed Simulation and Distributed Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06952","kind":"arxiv","version":3},"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:4aa4ebc1d3dc633a267d489138fc11bf5f3087bf417b034a304e3057b9be312f","target":"record","created_at":"2026-05-17T23:45:20Z","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":"6337029ad5a63d09adfe471a986b3cc6102ef15dd65bf908bb45848f155c8718","cross_cats_sorted":["cs.DM","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-19T00:34:15Z","title_canon_sha256":"e2979c92cfc90b383ac4966fe42d68890c743c540104d12c3b095facbde997d6"},"schema_version":"1.0","source":{"id":"1804.06952","kind":"arxiv","version":3}},"canonical_sha256":"85e14cce97f909d14f9dbe0b370303656c9214e0712bf24ef375c97fe8002335","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85e14cce97f909d14f9dbe0b370303656c9214e0712bf24ef375c97fe8002335","first_computed_at":"2026-05-17T23:45:20.899880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:20.899880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fWOFuDMfWRlrZ7d1WSB7yJiNMjvOXEUTlhicI93E9AwkmBtXMdGrdzipeHLav9TDh1WTMMuTVIHkWEx1+UFhBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:20.900363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06952","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4aa4ebc1d3dc633a267d489138fc11bf5f3087bf417b034a304e3057b9be312f","sha256:f24c2472956668ada5bffbe2df859d1ae27c18ab02087bfaeea2797b10430341"],"state_sha256":"412f2e1afaccb3b8341d8595fa2c2b16c24676e18049b1b8516509dd249bc0ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9bNrHq29J2hFUW3HrBitA/MklWf7CSdSIiQ1h64vbmq1d2uwehrYZpA20n4pZPP+UIC3VP2D9br08a8YhYXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T22:23:12.593475Z","bundle_sha256":"9af21c814fcac93f40fbd666fcb001e23492bacada63c1a12fe11f6710e63738"}}