{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LSQQRGOSY42W75O2RIO6MF6TXK","short_pith_number":"pith:LSQQRGOS","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"},"canonical_sha256":"5ca10899d2c7356ff5da8a1de617d3ba9cb71c2dc84c36adf3b59e25f42ef0ab","source":{"kind":"arxiv","id":"1611.01655","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01655","created_at":"2026-05-18T00:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01655v3","created_at":"2026-05-18T00:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01655","created_at":"2026-05-18T00:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"LSQQRGOSY42W","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSQQRGOSY42W75O2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSQQRGOS","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LSQQRGOSY42W75O2RIO6MF6TXK","target":"record","payload":{"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"},"canonical_sha256":"5ca10899d2c7356ff5da8a1de617d3ba9cb71c2dc84c36adf3b59e25f42ef0ab","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"},"source_kind":"arxiv","source_id":"1611.01655","source_version":3,"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:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kyILnwLpOZDcw5qV6kSdmy+gvcKrEW77rtZ+7G2a3JTzA7tAHKAQ9wAZE7yHoXbdHG6V4vW1ilaEUvVHJDV6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:57:04.840275Z"},"content_sha256":"f78e29172c7ad0081fe45606cea76de1ae80b18c4634785d69bfe356883ac0a8","schema_version":"1.0","event_id":"sha256:f78e29172c7ad0081fe45606cea76de1ae80b18c4634785d69bfe356883ac0a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LSQQRGOSY42W75O2RIO6MF6TXK","target":"graph","payload":{"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"},"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:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZcZ3wI1Hz/OSagV9uwe4aORUFAQk0IofRB9k6vmwAJru5ny4PFLWDghJ9u+e2l5o4eh1JZHgSw/Un5qe5q12Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:57:04.840970Z"},"content_sha256":"be52965b287392e4762e905e4db6eaf087c99aa3b087d31269d2771743680a2f","schema_version":"1.0","event_id":"sha256:be52965b287392e4762e905e4db6eaf087c99aa3b087d31269d2771743680a2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK/bundle.json","state_url":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSQQRGOSY42W75O2RIO6MF6TXK/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-05-30T07:57:04Z","links":{"resolver":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK","bundle":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK/bundle.json","state":"https://pith.science/pith/LSQQRGOSY42W75O2RIO6MF6TXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSQQRGOSY42W75O2RIO6MF6TXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LSQQRGOSY42W75O2RIO6MF6TXK","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":"f5c10bd85b7084ef18b09b018876e15748c5f0841312ae3ed3615e8dd9c4ac6b","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-05T13:55:25Z","title_canon_sha256":"fa855a212919b1f8ac132a01b135b2ad43645f645dcd51ace75713d473f4ce3f"},"schema_version":"1.0","source":{"id":"1611.01655","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01655","created_at":"2026-05-18T00:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01655v3","created_at":"2026-05-18T00:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01655","created_at":"2026-05-18T00:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"LSQQRGOSY42W","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSQQRGOSY42W75O2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSQQRGOS","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:be52965b287392e4762e905e4db6eaf087c99aa3b087d31269d2771743680a2f","target":"graph","created_at":"2026-05-18T00:45:47Z","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":"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 ","authors_text":"Ariel Gabizon, Shay Moran, Yuval Dagan, Yuval Filmus","cross_cats":["cs.DS","cs.IT","cs.LG","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-05T13:55:25Z","title":"Twenty (simple) questions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01655","kind":"arxiv","version":3},"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:f78e29172c7ad0081fe45606cea76de1ae80b18c4634785d69bfe356883ac0a8","target":"record","created_at":"2026-05-18T00:45:47Z","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":"f5c10bd85b7084ef18b09b018876e15748c5f0841312ae3ed3615e8dd9c4ac6b","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-05T13:55:25Z","title_canon_sha256":"fa855a212919b1f8ac132a01b135b2ad43645f645dcd51ace75713d473f4ce3f"},"schema_version":"1.0","source":{"id":"1611.01655","kind":"arxiv","version":3}},"canonical_sha256":"5ca10899d2c7356ff5da8a1de617d3ba9cb71c2dc84c36adf3b59e25f42ef0ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ca10899d2c7356ff5da8a1de617d3ba9cb71c2dc84c36adf3b59e25f42ef0ab","first_computed_at":"2026-05-18T00:45:47.589604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:47.589604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PLGDsYiIGM6DpSRgnBw+YdGWuB6pnM9yrHigbnjBzHLJgpb8ZP1XESCtjjJseJC6wcBWDbEOmEYPngLa1iuaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:47.590270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01655","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f78e29172c7ad0081fe45606cea76de1ae80b18c4634785d69bfe356883ac0a8","sha256:be52965b287392e4762e905e4db6eaf087c99aa3b087d31269d2771743680a2f"],"state_sha256":"b5b2c9e2f42ff9aab105affb1e7da857757df448d96ba28dc28a4d29526db760"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hs0WBzGtV6pBSnULZu7gUjCrg5zGCYMNRXcO8QrC9Nf4Vg9Dx06NAalsrrjEz56pLh8hxurJX9p6W0tLDw33AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:57:04.843562Z","bundle_sha256":"7c6d20ba7a6146c1857f93eb1dee6914d557d280e5564084206c25666e3ca0a7"}}