{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:O6QEIVIP25NLQTAPMQW6YYQB3U","short_pith_number":"pith:O6QEIVIP","canonical_record":{"source":{"id":"1902.02890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-07T23:58:09Z","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"3074efa32abca7c5e72b174daad83194aaea25f17b3e7b1463778fbac64c689f","abstract_canon_sha256":"0d5d31afdf34fbeb38870f18f0ce4bf1ad7520a146c4af0c2120d3b124f4571e"},"schema_version":"1.0"},"canonical_sha256":"77a044550fd75ab84c0f642dec6201dd087a3e4130bbb87503cfd33b90d69266","source":{"kind":"arxiv","id":"1902.02890","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02890","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02890v2","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02890","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"O6QEIVIP25NL","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O6QEIVIP25NLQTAP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O6QEIVIP","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:O6QEIVIP25NLQTAPMQW6YYQB3U","target":"record","payload":{"canonical_record":{"source":{"id":"1902.02890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-07T23:58:09Z","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"3074efa32abca7c5e72b174daad83194aaea25f17b3e7b1463778fbac64c689f","abstract_canon_sha256":"0d5d31afdf34fbeb38870f18f0ce4bf1ad7520a146c4af0c2120d3b124f4571e"},"schema_version":"1.0"},"canonical_sha256":"77a044550fd75ab84c0f642dec6201dd087a3e4130bbb87503cfd33b90d69266","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:33.869130Z","signature_b64":"HR37FjYMm7+2SLLRCHevYowV8QWxM4ueR9MWVW/ojUWnAXCurwroZ0cnJ3SZbDpQSU3hs6RZHlvH4fNS00GFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77a044550fd75ab84c0f642dec6201dd087a3e4130bbb87503cfd33b90d69266","last_reissued_at":"2026-05-17T23:44:33.868364Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:33.868364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.02890","source_version":2,"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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OO0aYMTKOxVjUAbzgsonADH1esaZxoBmt02jWpoLkwYRAj+z3+sqkggxwNl0jVqERzeupunO14OUPrVD5lMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:10:17.415974Z"},"content_sha256":"7ebdbe3e3d3ecd03169b93c11893ddae4f7ce4b538bb5678078c07e5460ff758","schema_version":"1.0","event_id":"sha256:7ebdbe3e3d3ecd03169b93c11893ddae4f7ce4b538bb5678078c07e5460ff758"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:O6QEIVIP25NLQTAPMQW6YYQB3U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Learning Distributions under Communication Constraints via Fisher Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Ayfer Ozgur, Leighton Pate Barnes, Yanjun Han","submitted_at":"2019-02-07T23:58:09Z","abstract_excerpt":"We consider the problem of learning high-dimensional, nonparametric and structured (e.g. Gaussian) distributions in distributed networks, where each node in the network observes an independent sample from the underlying distribution and can use $k$ bits to communicate its sample to a central processor. We consider three different models for communication. Under the independent model, each node communicates its sample to a central processor by independently encoding it into $k$ bits. Under the more general sequential or blackboard communication models, nodes can share information interactively "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02890","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":""},"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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lF1Hs4r41XqfYWk3PEFKZ3bzrqhSgLUo0z0EI9QKugtiLxDvE7FLGkZvwoAmsK6VXQG2ecgBYdBj6FaDRPsdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:10:17.416432Z"},"content_sha256":"d931f48ac26e566abe3285dcf08fa28775947e3952f7fe249af3bac7595ef555","schema_version":"1.0","event_id":"sha256:d931f48ac26e566abe3285dcf08fa28775947e3952f7fe249af3bac7595ef555"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/bundle.json","state_url":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/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-28T04:10:17Z","links":{"resolver":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U","bundle":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/bundle.json","state":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:O6QEIVIP25NLQTAPMQW6YYQB3U","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":"0d5d31afdf34fbeb38870f18f0ce4bf1ad7520a146c4af0c2120d3b124f4571e","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-07T23:58:09Z","title_canon_sha256":"3074efa32abca7c5e72b174daad83194aaea25f17b3e7b1463778fbac64c689f"},"schema_version":"1.0","source":{"id":"1902.02890","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02890","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02890v2","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02890","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"O6QEIVIP25NL","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O6QEIVIP25NLQTAP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O6QEIVIP","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:d931f48ac26e566abe3285dcf08fa28775947e3952f7fe249af3bac7595ef555","target":"graph","created_at":"2026-05-17T23:44:33Z","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":"We consider the problem of learning high-dimensional, nonparametric and structured (e.g. Gaussian) distributions in distributed networks, where each node in the network observes an independent sample from the underlying distribution and can use $k$ bits to communicate its sample to a central processor. We consider three different models for communication. Under the independent model, each node communicates its sample to a central processor by independently encoding it into $k$ bits. Under the more general sequential or blackboard communication models, nodes can share information interactively ","authors_text":"Ayfer Ozgur, Leighton Pate Barnes, Yanjun Han","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-07T23:58:09Z","title":"Lower Bounds for Learning Distributions under Communication Constraints via Fisher Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02890","kind":"arxiv","version":2},"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:7ebdbe3e3d3ecd03169b93c11893ddae4f7ce4b538bb5678078c07e5460ff758","target":"record","created_at":"2026-05-17T23:44:33Z","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":"0d5d31afdf34fbeb38870f18f0ce4bf1ad7520a146c4af0c2120d3b124f4571e","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-07T23:58:09Z","title_canon_sha256":"3074efa32abca7c5e72b174daad83194aaea25f17b3e7b1463778fbac64c689f"},"schema_version":"1.0","source":{"id":"1902.02890","kind":"arxiv","version":2}},"canonical_sha256":"77a044550fd75ab84c0f642dec6201dd087a3e4130bbb87503cfd33b90d69266","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77a044550fd75ab84c0f642dec6201dd087a3e4130bbb87503cfd33b90d69266","first_computed_at":"2026-05-17T23:44:33.868364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:33.868364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HR37FjYMm7+2SLLRCHevYowV8QWxM4ueR9MWVW/ojUWnAXCurwroZ0cnJ3SZbDpQSU3hs6RZHlvH4fNS00GFAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:33.869130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02890","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ebdbe3e3d3ecd03169b93c11893ddae4f7ce4b538bb5678078c07e5460ff758","sha256:d931f48ac26e566abe3285dcf08fa28775947e3952f7fe249af3bac7595ef555"],"state_sha256":"6fb36883e9e2eae7db93d88aebf08e33fe314f32d4f3af135a69303fb2fd086d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YNxf5/WkGt0QiXtXtO/EPFELlfqwLyxYYe5SwtVqej2qXbZEbqMvr9SHZACW67rCOSmZn1NN7wF6aan9uZYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:10:17.418770Z","bundle_sha256":"8739a34c6deeb452802075b3d66febd2b2a59e0592e69445b0208d83f4fe47a7"}}