{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:O6QEIVIP25NLQTAPMQW6YYQB3U","short_pith_number":"pith:O6QEIVIP","schema_version":"1.0","canonical_sha256":"77a044550fd75ab84c0f642dec6201dd087a3e4130bbb87503cfd33b90d69266","source":{"kind":"arxiv","id":"1902.02890","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.02890","created_at":"2026-05-17T23:44:33.868500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02890v2","created_at":"2026-05-17T23:44:33.868500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02890","created_at":"2026-05-17T23:44:33.868500+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6QEIVIP25NL","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6QEIVIP25NLQTAP","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6QEIVIP","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U","json":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U.json","graph_json":"https://pith.science/api/pith-number/O6QEIVIP25NLQTAPMQW6YYQB3U/graph.json","events_json":"https://pith.science/api/pith-number/O6QEIVIP25NLQTAPMQW6YYQB3U/events.json","paper":"https://pith.science/paper/O6QEIVIP"},"agent_actions":{"view_html":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U","download_json":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U.json","view_paper":"https://pith.science/paper/O6QEIVIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02890&json=true","fetch_graph":"https://pith.science/api/pith-number/O6QEIVIP25NLQTAPMQW6YYQB3U/graph.json","fetch_events":"https://pith.science/api/pith-number/O6QEIVIP25NLQTAPMQW6YYQB3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/action/storage_attestation","attest_author":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/action/author_attestation","sign_citation":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/action/citation_signature","submit_replication":"https://pith.science/pith/O6QEIVIP25NLQTAPMQW6YYQB3U/action/replication_record"}},"created_at":"2026-05-17T23:44:33.868500+00:00","updated_at":"2026-05-17T23:44:33.868500+00:00"}