{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P7KCA6MCYU2WRTXYLRGNRRKBSK","short_pith_number":"pith:P7KCA6MC","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"},"canonical_sha256":"7fd4207982c53568cef85c4cd8c54192af50985deea1f3ec569de1d65438e41b","source":{"kind":"arxiv","id":"1707.04875","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04875","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04875v2","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04875","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"P7KCA6MCYU2W","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P7KCA6MCYU2WRTXY","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P7KCA6MC","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P7KCA6MCYU2WRTXYLRGNRRKBSK","target":"record","payload":{"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"},"canonical_sha256":"7fd4207982c53568cef85c4cd8c54192af50985deea1f3ec569de1d65438e41b","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"},"source_kind":"arxiv","source_id":"1707.04875","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-18T00:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JnL/MMjZKidxSTfRm0Ne7m9HSFP4Aw9oeU62Od4iZDCZ7n0rk/Tt8NArxHuxcvvL1fr4gy9zWQncM+bP54/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:16:28.894468Z"},"content_sha256":"2fbe59a3713986d8d79fe246a1d41c09ccd3ef36b4691d861e6505a34f7317e4","schema_version":"1.0","event_id":"sha256:2fbe59a3713986d8d79fe246a1d41c09ccd3ef36b4691d861e6505a34f7317e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P7KCA6MCYU2WRTXYLRGNRRKBSK","target":"graph","payload":{"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"},"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-18T00:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ub7t4IVicedL13/fNR1HK8qTPstzUPQqAopvzYfMhvd4LaF7zHwqSjaLi37u1m+L73klNkg8HAXpF8SZLUCxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:16:28.894824Z"},"content_sha256":"8f37fbc068d879d5bca02b71ec3682bd02697987dbbc362258a2fa073032f480","schema_version":"1.0","event_id":"sha256:8f37fbc068d879d5bca02b71ec3682bd02697987dbbc362258a2fa073032f480"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/bundle.json","state_url":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/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-06-20T23:16:28Z","links":{"resolver":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK","bundle":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/bundle.json","state":"https://pith.science/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7KCA6MCYU2WRTXYLRGNRRKBSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P7KCA6MCYU2WRTXYLRGNRRKBSK","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":"a6751cfdae3b531c5abbf53b58ab2709037f5b9d7a518d6b85e1e9ead1a8c8ff","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T12:51:42Z","title_canon_sha256":"5e54a577f14234eaa9db943387cd20d077370de87f3eaffa74f42ce994bf723f"},"schema_version":"1.0","source":{"id":"1707.04875","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04875","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04875v2","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04875","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"P7KCA6MCYU2W","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P7KCA6MCYU2WRTXY","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P7KCA6MC","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:8f37fbc068d879d5bca02b71ec3682bd02697987dbbc362258a2fa073032f480","target":"graph","created_at":"2026-05-18T00:09:42Z","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 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","authors_text":"Alexandr Andoni, Daniel Hsu, Dan Rubenstein, Javad Ghaderi, Omri Weinstein","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T12:51:42Z","title":"Coding sets with asymmetric information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04875","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:2fbe59a3713986d8d79fe246a1d41c09ccd3ef36b4691d861e6505a34f7317e4","target":"record","created_at":"2026-05-18T00:09:42Z","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":"a6751cfdae3b531c5abbf53b58ab2709037f5b9d7a518d6b85e1e9ead1a8c8ff","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T12:51:42Z","title_canon_sha256":"5e54a577f14234eaa9db943387cd20d077370de87f3eaffa74f42ce994bf723f"},"schema_version":"1.0","source":{"id":"1707.04875","kind":"arxiv","version":2}},"canonical_sha256":"7fd4207982c53568cef85c4cd8c54192af50985deea1f3ec569de1d65438e41b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fd4207982c53568cef85c4cd8c54192af50985deea1f3ec569de1d65438e41b","first_computed_at":"2026-05-18T00:09:42.195412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:42.195412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LRqNLe9uZhqOJVS5LLamsW/ZQBcUhdLRYDJNu/OjUK4iaDIe5dR/kCLAND0h8DlISlTmXNIR6PLQLuMFP5CWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:42.196226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04875","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fbe59a3713986d8d79fe246a1d41c09ccd3ef36b4691d861e6505a34f7317e4","sha256:8f37fbc068d879d5bca02b71ec3682bd02697987dbbc362258a2fa073032f480"],"state_sha256":"4a7bbbbe5008add1f123372e63371c6e2a44e96a4551499acbed09970008112d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+8nZ9T/72fPpiFBV2QEY/BSQEHXS4/6e7Dpeuj0yKvCMuufSicRciqWRmkE4hZrvAfZrYlkTNzo7iWhjuaVgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:16:28.896859Z","bundle_sha256":"cb1a4083bdf79e00d0d87eeee38c75d663870f1278e058b7fd053fc2e1ca4fa4"}}