{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR","short_pith_number":"pith:WNT5I6MZ","schema_version":"1.0","canonical_sha256":"b367d479999b706879bec7f36643ec2c4f2e17a355329c80801cf168e2e3078a","source":{"kind":"arxiv","id":"1811.02177","version":1},"attestation_state":"computed","paper":{"title":"The entropy of lies: playing twenty questions with a liar","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Kane, Shay Moran, Yuval Dagan, Yuval Filmus","submitted_at":"2018-11-06T06:05:14Z","abstract_excerpt":"`Twenty questions' is a guessing game played by two players: Bob thinks of an integer between $1$ and $n$, and Alice's goal is to recover it using a minimal number of Yes/No questions. Shannon's entropy has a natural interpretation in this context. It characterizes the average number of questions used by an optimal strategy in the distributional variant of the game: let $\\mu$ be a distribution over $[n]$, then the average number of questions used by an optimal strategy that recovers $x\\sim \\mu$ is between $H(\\mu)$ and $H(\\mu)+1$. We consider an extension of this game where at most $k$ question"},"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":"1811.02177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T06:05:14Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"73273e73fb166c62cb24926af18104bdedbe37a2ea2040dea6f1d7b5acaf32f5","abstract_canon_sha256":"82a86fd91633180e9d2b80cf364f1ef67d6cb3bcf7e68b9caed2daf72ed7aa46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.884469Z","signature_b64":"KR0ni4IrAmMhEUxhEyLC6sO31NVTQi4S/SL6XT34zJA8fC4VAmAvN6Dp6BqVZrLKwpkE8dwGnOfEJ90iCepbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b367d479999b706879bec7f36643ec2c4f2e17a355329c80801cf168e2e3078a","last_reissued_at":"2026-05-18T00:01:24.884128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.884128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The entropy of lies: playing twenty questions with a liar","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Kane, Shay Moran, Yuval Dagan, Yuval Filmus","submitted_at":"2018-11-06T06:05:14Z","abstract_excerpt":"`Twenty questions' is a guessing game played by two players: Bob thinks of an integer between $1$ and $n$, and Alice's goal is to recover it using a minimal number of Yes/No questions. Shannon's entropy has a natural interpretation in this context. It characterizes the average number of questions used by an optimal strategy in the distributional variant of the game: let $\\mu$ be a distribution over $[n]$, then the average number of questions used by an optimal strategy that recovers $x\\sim \\mu$ is between $H(\\mu)$ and $H(\\mu)+1$. We consider an extension of this game where at most $k$ question"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02177","kind":"arxiv","version":1},"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":"1811.02177","created_at":"2026-05-18T00:01:24.884179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02177v1","created_at":"2026-05-18T00:01:24.884179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02177","created_at":"2026-05-18T00:01:24.884179+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNT5I6MZTNYG","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNT5I6MZTNYGQ6N6","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNT5I6MZ","created_at":"2026-05-18T12:33:01.666342+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/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR","json":"https://pith.science/pith/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR.json","graph_json":"https://pith.science/api/pith-number/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR/graph.json","events_json":"https://pith.science/api/pith-number/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR/events.json","paper":"https://pith.science/paper/WNT5I6MZ"},"agent_actions":{"view_html":"https://pith.science/pith/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR","download_json":"https://pith.science/pith/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR.json","view_paper":"https://pith.science/paper/WNT5I6MZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02177&json=true","fetch_graph":"https://pith.science/api/pith-number/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR/graph.json","fetch_events":"https://pith.science/api/pith-number/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR/action/storage_attestation","attest_author":"https://pith.science/pith/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR/action/author_attestation","sign_citation":"https://pith.science/pith/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR/action/citation_signature","submit_replication":"https://pith.science/pith/WNT5I6MZTNYGQ6N6Y7ZWMQ7MFR/action/replication_record"}},"created_at":"2026-05-18T00:01:24.884179+00:00","updated_at":"2026-05-18T00:01:24.884179+00:00"}