{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LSQQRGOSY42W75O2RIO6MF6TXK","short_pith_number":"pith:LSQQRGOS","schema_version":"1.0","canonical_sha256":"5ca10899d2c7356ff5da8a1de617d3ba9cb71c2dc84c36adf3b59e25f42ef0ab","source":{"kind":"arxiv","id":"1611.01655","version":3},"attestation_state":"computed","paper":{"title":"Twenty (simple) questions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.CO","math.IT"],"primary_cat":"cs.DM","authors_text":"Ariel Gabizon, Shay Moran, Yuval Dagan, Yuval Filmus","submitted_at":"2016-11-05T13:55:25Z","abstract_excerpt":"A basic combinatorial interpretation of Shannon's entropy function is via the \"20 questions\" game. This cooperative game is played by two players, Alice and Bob: Alice picks a distribution $\\pi$ over the numbers $\\{1,\\ldots,n\\}$, and announces it to Bob. She then chooses a number $x$ according to $\\pi$, and Bob attempts to identify $x$ using as few Yes/No queries as possible, on average.\n  An optimal strategy for the \"20 questions\" game is given by a Huffman code for $\\pi$: Bob's questions reveal the codeword for $x$ bit by bit. This strategy finds $x$ using fewer than $H(\\pi)+1$ questions on "},"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":"1611.01655","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-05T13:55:25Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.CO","math.IT"],"title_canon_sha256":"fa855a212919b1f8ac132a01b135b2ad43645f645dcd51ace75713d473f4ce3f","abstract_canon_sha256":"f5c10bd85b7084ef18b09b018876e15748c5f0841312ae3ed3615e8dd9c4ac6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:47.590270Z","signature_b64":"PLGDsYiIGM6DpSRgnBw+YdGWuB6pnM9yrHigbnjBzHLJgpb8ZP1XESCtjjJseJC6wcBWDbEOmEYPngLa1iuaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ca10899d2c7356ff5da8a1de617d3ba9cb71c2dc84c36adf3b59e25f42ef0ab","last_reissued_at":"2026-05-18T00:45:47.589604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:47.589604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Twenty (simple) questions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.CO","math.IT"],"primary_cat":"cs.DM","authors_text":"Ariel Gabizon, Shay Moran, Yuval Dagan, Yuval Filmus","submitted_at":"2016-11-05T13:55:25Z","abstract_excerpt":"A basic combinatorial interpretation of Shannon's entropy function is via the \"20 questions\" game. This cooperative game is played by two players, Alice and Bob: Alice picks a distribution $\\pi$ over the numbers $\\{1,\\ldots,n\\}$, and announces it to Bob. She then chooses a number $x$ according to $\\pi$, and Bob attempts to identify $x$ using as few Yes/No queries as possible, on average.\n  An optimal strategy for the \"20 questions\" game is given by a Huffman code for $\\pi$: Bob's questions reveal the codeword for $x$ bit by bit. This strategy finds $x$ using fewer than $H(\\pi)+1$ questions on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01655","kind":"arxiv","version":3},"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":"1611.01655","created_at":"2026-05-18T00:45:47.589702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01655v3","created_at":"2026-05-18T00:45:47.589702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01655","created_at":"2026-05-18T00:45:47.589702+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSQQRGOSY42W","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSQQRGOSY42W75O2","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSQQRGOS","created_at":"2026-05-18T12:30:29.479603+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/LSQQRGOSY42W75O2RIO6MF6TXK","json":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK.json","graph_json":"https://pith.science/api/pith-number/LSQQRGOSY42W75O2RIO6MF6TXK/graph.json","events_json":"https://pith.science/api/pith-number/LSQQRGOSY42W75O2RIO6MF6TXK/events.json","paper":"https://pith.science/paper/LSQQRGOS"},"agent_actions":{"view_html":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK","download_json":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK.json","view_paper":"https://pith.science/paper/LSQQRGOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01655&json=true","fetch_graph":"https://pith.science/api/pith-number/LSQQRGOSY42W75O2RIO6MF6TXK/graph.json","fetch_events":"https://pith.science/api/pith-number/LSQQRGOSY42W75O2RIO6MF6TXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK/action/storage_attestation","attest_author":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK/action/author_attestation","sign_citation":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK/action/citation_signature","submit_replication":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK/action/replication_record"}},"created_at":"2026-05-18T00:45:47.589702+00:00","updated_at":"2026-05-18T00:45:47.589702+00:00"}