{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:4YUONJMV2HMBL4QEXF6HNW6OYG","short_pith_number":"pith:4YUONJMV","canonical_record":{"source":{"id":"2210.04013","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-08T12:54:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43cdabd91971826ba489816794cd7a6d11842bb2e62b671ab95c1c80100cada3","abstract_canon_sha256":"2e6103cb4e039ef2dc72047e7f3ea1f1683d49e4914b9641278ed3e401af6e46"},"schema_version":"1.0"},"canonical_sha256":"e628e6a595d1d815f204b97c76dbcec1be314f2e8caa683cbe91d6ac2b400a36","source":{"kind":"arxiv","id":"2210.04013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.04013","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"2210.04013v1","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04013","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"4YUONJMV2HMB","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_16","alias_value":"4YUONJMV2HMBL4QE","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_8","alias_value":"4YUONJMV","created_at":"2026-07-05T05:04:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:4YUONJMV2HMBL4QEXF6HNW6OYG","target":"record","payload":{"canonical_record":{"source":{"id":"2210.04013","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-08T12:54:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43cdabd91971826ba489816794cd7a6d11842bb2e62b671ab95c1c80100cada3","abstract_canon_sha256":"2e6103cb4e039ef2dc72047e7f3ea1f1683d49e4914b9641278ed3e401af6e46"},"schema_version":"1.0"},"canonical_sha256":"e628e6a595d1d815f204b97c76dbcec1be314f2e8caa683cbe91d6ac2b400a36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:34.966542Z","signature_b64":"HyQ6dPv7czAKfVpACWidp4k+34njiaNPAcEYfkdA+b+oT1cEBt6NptF9QKt7fUj+s/OG0DMnbZEKQlL3mDm+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e628e6a595d1d815f204b97c76dbcec1be314f2e8caa683cbe91d6ac2b400a36","last_reissued_at":"2026-07-05T05:04:34.966134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:34.966134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.04013","source_version":1,"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-07-05T05:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IukOi2K4L/QVDMzhHh4lTtFrX1ZYTKIbHaNYH3EPA3rQ+lwwR2cj3WOskBICO71MFjX3y3iV4XOpYE1usIoPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:55:31.469601Z"},"content_sha256":"ed0e4cf0fbbf87fe4238d87d664ea9860dbf5f33a42241ae3bf3e41a2ea9d39e","schema_version":"1.0","event_id":"sha256:ed0e4cf0fbbf87fe4238d87d664ea9860dbf5f33a42241ae3bf3e41a2ea9d39e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:4YUONJMV2HMBL4QEXF6HNW6OYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Optimal Querying: Huffman Coding and Beyond","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jichen Sun, Shengkang Chen, Shuyuan Zhang","submitted_at":"2022-10-08T12:54:00Z","abstract_excerpt":"Huffman coding is well known to be useful in certain decision problems involving minimizing the average number of (freely chosen) queries to determine an unknown random variable. However, in problems where the queries are more constrained, the original Huffman coding no longer works. In this paper, we proposed a general model to describe such problems and two code schemes: one is Huffman-based, and the other called GBSC (Greedy Binary Separation Coding). We proved the optimality of GBSC by induction on a binary decision tree, telling us that GBSC is at least as good as Shannon coding. We then "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04013","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.04013/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X9KK1fcH56If0G1rvy5xQQtGmmqvc54D2pos2XY597pyRcTNM9EuCPGtSH2rNZT9ZmCn6uP8Z9ai8+yBs9zeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:55:31.470114Z"},"content_sha256":"e0ddd93566d80e1e64152804e81d4e6f2897208573ccb10fe9f0b7d0f1de80e7","schema_version":"1.0","event_id":"sha256:e0ddd93566d80e1e64152804e81d4e6f2897208573ccb10fe9f0b7d0f1de80e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YUONJMV2HMBL4QEXF6HNW6OYG/bundle.json","state_url":"https://pith.science/pith/4YUONJMV2HMBL4QEXF6HNW6OYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YUONJMV2HMBL4QEXF6HNW6OYG/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-08-03T22:55:31Z","links":{"resolver":"https://pith.science/pith/4YUONJMV2HMBL4QEXF6HNW6OYG","bundle":"https://pith.science/pith/4YUONJMV2HMBL4QEXF6HNW6OYG/bundle.json","state":"https://pith.science/pith/4YUONJMV2HMBL4QEXF6HNW6OYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YUONJMV2HMBL4QEXF6HNW6OYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:4YUONJMV2HMBL4QEXF6HNW6OYG","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":"2e6103cb4e039ef2dc72047e7f3ea1f1683d49e4914b9641278ed3e401af6e46","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-08T12:54:00Z","title_canon_sha256":"43cdabd91971826ba489816794cd7a6d11842bb2e62b671ab95c1c80100cada3"},"schema_version":"1.0","source":{"id":"2210.04013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.04013","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"2210.04013v1","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04013","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"4YUONJMV2HMB","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_16","alias_value":"4YUONJMV2HMBL4QE","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_8","alias_value":"4YUONJMV","created_at":"2026-07-05T05:04:34Z"}],"graph_snapshots":[{"event_id":"sha256:e0ddd93566d80e1e64152804e81d4e6f2897208573ccb10fe9f0b7d0f1de80e7","target":"graph","created_at":"2026-07-05T05:04:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.04013/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Huffman coding is well known to be useful in certain decision problems involving minimizing the average number of (freely chosen) queries to determine an unknown random variable. However, in problems where the queries are more constrained, the original Huffman coding no longer works. In this paper, we proposed a general model to describe such problems and two code schemes: one is Huffman-based, and the other called GBSC (Greedy Binary Separation Coding). We proved the optimality of GBSC by induction on a binary decision tree, telling us that GBSC is at least as good as Shannon coding. We then ","authors_text":"Jichen Sun, Shengkang Chen, Shuyuan Zhang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-08T12:54:00Z","title":"Constrained Optimal Querying: Huffman Coding and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04013","kind":"arxiv","version":1},"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:ed0e4cf0fbbf87fe4238d87d664ea9860dbf5f33a42241ae3bf3e41a2ea9d39e","target":"record","created_at":"2026-07-05T05:04:34Z","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":"2e6103cb4e039ef2dc72047e7f3ea1f1683d49e4914b9641278ed3e401af6e46","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-08T12:54:00Z","title_canon_sha256":"43cdabd91971826ba489816794cd7a6d11842bb2e62b671ab95c1c80100cada3"},"schema_version":"1.0","source":{"id":"2210.04013","kind":"arxiv","version":1}},"canonical_sha256":"e628e6a595d1d815f204b97c76dbcec1be314f2e8caa683cbe91d6ac2b400a36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e628e6a595d1d815f204b97c76dbcec1be314f2e8caa683cbe91d6ac2b400a36","first_computed_at":"2026-07-05T05:04:34.966134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:34.966134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HyQ6dPv7czAKfVpACWidp4k+34njiaNPAcEYfkdA+b+oT1cEBt6NptF9QKt7fUj+s/OG0DMnbZEKQlL3mDm+CA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:34.966542Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.04013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed0e4cf0fbbf87fe4238d87d664ea9860dbf5f33a42241ae3bf3e41a2ea9d39e","sha256:e0ddd93566d80e1e64152804e81d4e6f2897208573ccb10fe9f0b7d0f1de80e7"],"state_sha256":"7df58f2e8c19cbeaed6a0d4527608337903b6fe027b3a03a8fb9dae5f4701881"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f20u9erUyJ4D9aVQfXfHr7HiUFhMt9ogmJjQO/63ASHLvGFxloEdX6CuMpwPyAx443gK0Go5dKNq+ffZ6pK6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:55:31.474969Z","bundle_sha256":"487f8e384158a9375fa56acb1b68843cb771a7ecd71223fb66d3bb1970840b85"}}