{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P7KCA6MCYU2WRTXYLRGNRRKBSK","short_pith_number":"pith:P7KCA6MC","schema_version":"1.0","canonical_sha256":"7fd4207982c53568cef85c4cd8c54192af50985deea1f3ec569de1d65438e41b","source":{"kind":"arxiv","id":"1707.04875","version":2},"attestation_state":"computed","paper":{"title":"Coding sets with asymmetric information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Daniel Hsu, Dan Rubenstein, Javad Ghaderi, Omri Weinstein","submitted_at":"2017-07-16T12:51:42Z","abstract_excerpt":"We study the following one-way asymmetric transmission problem, also a variant of model-based compressed sensing: a resource-limited encoder has to report a small set $S$ from a universe of $N$ items to a more powerful decoder (server). The distinguishing feature is asymmetric information: the subset $S$ is comprised of i.i.d. samples from a prior distribution $\\mu$, and $\\mu$ is only known to the decoder. The goal for the encoder is to encode $S$ obliviously, while achieving the information-theoretic bound of $|S| \\cdot H(\\mu)$, i.e., the Shannon entropy bound.\n  We first show that any such c"},"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":"1707.04875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T12:51:42Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"5e54a577f14234eaa9db943387cd20d077370de87f3eaffa74f42ce994bf723f","abstract_canon_sha256":"a6751cfdae3b531c5abbf53b58ab2709037f5b9d7a518d6b85e1e9ead1a8c8ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.196226Z","signature_b64":"LRqNLe9uZhqOJVS5LLamsW/ZQBcUhdLRYDJNu/OjUK4iaDIe5dR/kCLAND0h8DlISlTmXNIR6PLQLuMFP5CWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fd4207982c53568cef85c4cd8c54192af50985deea1f3ec569de1d65438e41b","last_reissued_at":"2026-05-18T00:09:42.195412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.195412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding sets with asymmetric information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Daniel Hsu, Dan Rubenstein, Javad Ghaderi, Omri Weinstein","submitted_at":"2017-07-16T12:51:42Z","abstract_excerpt":"We study the following one-way asymmetric transmission problem, also a variant of model-based compressed sensing: a resource-limited encoder has to report a small set $S$ from a universe of $N$ items to a more powerful decoder (server). The distinguishing feature is asymmetric information: the subset $S$ is comprised of i.i.d. samples from a prior distribution $\\mu$, and $\\mu$ is only known to the decoder. The goal for the encoder is to encode $S$ obliviously, while achieving the information-theoretic bound of $|S| \\cdot H(\\mu)$, i.e., the Shannon entropy bound.\n  We first show that any such c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04875","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":"1707.04875","created_at":"2026-05-18T00:09:42.195554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04875v2","created_at":"2026-05-18T00:09:42.195554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04875","created_at":"2026-05-18T00:09:42.195554+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7KCA6MCYU2W","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7KCA6MCYU2WRTXY","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7KCA6MC","created_at":"2026-05-18T12:31:37.085036+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/P7KCA6MCYU2WRTXYLRGNRRKBSK","json":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK.json","graph_json":"https://pith.science/api/pith-number/P7KCA6MCYU2WRTXYLRGNRRKBSK/graph.json","events_json":"https://pith.science/api/pith-number/P7KCA6MCYU2WRTXYLRGNRRKBSK/events.json","paper":"https://pith.science/paper/P7KCA6MC"},"agent_actions":{"view_html":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK","download_json":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK.json","view_paper":"https://pith.science/paper/P7KCA6MC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04875&json=true","fetch_graph":"https://pith.science/api/pith-number/P7KCA6MCYU2WRTXYLRGNRRKBSK/graph.json","fetch_events":"https://pith.science/api/pith-number/P7KCA6MCYU2WRTXYLRGNRRKBSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/action/storage_attestation","attest_author":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/action/author_attestation","sign_citation":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/action/citation_signature","submit_replication":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/action/replication_record"}},"created_at":"2026-05-18T00:09:42.195554+00:00","updated_at":"2026-05-18T00:09:42.195554+00:00"}