{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RB55W256XY7ON52XWHMAQXMWBD","short_pith_number":"pith:RB55W256","canonical_record":{"source":{"id":"1102.2413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-11T19:01:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"118e9c7f192941467db0cb59ca2eb3d33263a96c18d685fca33e1dbdc163f292","abstract_canon_sha256":"cece088062e756467365d0afdab2ffb78884a168c82349019c7c8639ca3d2fd5"},"schema_version":"1.0"},"canonical_sha256":"887bdb6bbebe3ee6f757b1d8085d9608dd3a8230749cbfc4101745831d9a374d","source":{"kind":"arxiv","id":"1102.2413","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2413","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2413v2","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2413","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"RB55W256XY7O","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RB55W256XY7ON52X","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RB55W256","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RB55W256XY7ON52XWHMAQXMWBD","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-11T19:01:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"118e9c7f192941467db0cb59ca2eb3d33263a96c18d685fca33e1dbdc163f292","abstract_canon_sha256":"cece088062e756467365d0afdab2ffb78884a168c82349019c7c8639ca3d2fd5"},"schema_version":"1.0"},"canonical_sha256":"887bdb6bbebe3ee6f757b1d8085d9608dd3a8230749cbfc4101745831d9a374d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:09.244542Z","signature_b64":"/eBgcmBHeW83uhm/QQPYAacgqOe3hDJbOck/D5HS6v41Arr5inhrxr/7ZbXcilg/8dAlLLNzn3jk6oqrjc/rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"887bdb6bbebe3ee6f757b1d8085d9608dd3a8230749cbfc4101745831d9a374d","last_reissued_at":"2026-05-18T03:37:09.243850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:09.243850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2413","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-18T03:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QY18E1DOsHhL9/GVL2jPuwh5nhwgwWvxW6ot/LIdmFGjZhWCLWnOwDcGIF8FllMoxW/d/Sj24kv6x0sNGuuSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:30:21.208608Z"},"content_sha256":"687453bc6e114396e7b567bec2b3b59c4501622b949b6fbfb876437f0ca8240e","schema_version":"1.0","event_id":"sha256:687453bc6e114396e7b567bec2b3b59c4501622b949b6fbfb876437f0ca8240e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RB55W256XY7ON52XWHMAQXMWBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal prefix codes for pairs of geometrically-distributed random variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alfredo Viola, Fr\\'ed\\'erique Bassino, Gadiel Seroussi, Julien Cl\\'ement","submitted_at":"2011-02-11T19:01:58Z","abstract_excerpt":"Optimal prefix codes are studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter $q$, $0{<}q{<}1$. By encoding pairs of symbols, it is possible to reduce the redundancy penalty of symbol-by-symbol encoding, while preserving the simplicity of the encoding and decoding procedures typical of Golomb codes and their variants. It is shown that optimal codes for these so-called two-dimensional geometric distributions are \\emph{singular}, in the sense that a prefix code that is optimal for one value of the parameter $q$ cannot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2413","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-18T03:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pt1P8PS6d9tbS/lDUZXzBO8RrqIM0Xz00wQeDwAS/DQm1fA4vevKj1H2wWWZWQV9d1Kp33ZjhQfVmujJ7m/cAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:30:21.208944Z"},"content_sha256":"9244414f895671e3d5346c53b66b1de2c4f765ab5cecd332492caa3edf596b17","schema_version":"1.0","event_id":"sha256:9244414f895671e3d5346c53b66b1de2c4f765ab5cecd332492caa3edf596b17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RB55W256XY7ON52XWHMAQXMWBD/bundle.json","state_url":"https://pith.science/pith/RB55W256XY7ON52XWHMAQXMWBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RB55W256XY7ON52XWHMAQXMWBD/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-08T23:30:21Z","links":{"resolver":"https://pith.science/pith/RB55W256XY7ON52XWHMAQXMWBD","bundle":"https://pith.science/pith/RB55W256XY7ON52XWHMAQXMWBD/bundle.json","state":"https://pith.science/pith/RB55W256XY7ON52XWHMAQXMWBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RB55W256XY7ON52XWHMAQXMWBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RB55W256XY7ON52XWHMAQXMWBD","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":"cece088062e756467365d0afdab2ffb78884a168c82349019c7c8639ca3d2fd5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-11T19:01:58Z","title_canon_sha256":"118e9c7f192941467db0cb59ca2eb3d33263a96c18d685fca33e1dbdc163f292"},"schema_version":"1.0","source":{"id":"1102.2413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2413","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2413v2","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2413","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"RB55W256XY7O","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RB55W256XY7ON52X","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RB55W256","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:9244414f895671e3d5346c53b66b1de2c4f765ab5cecd332492caa3edf596b17","target":"graph","created_at":"2026-05-18T03:37:09Z","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":"Optimal prefix codes are studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter $q$, $0{<}q{<}1$. By encoding pairs of symbols, it is possible to reduce the redundancy penalty of symbol-by-symbol encoding, while preserving the simplicity of the encoding and decoding procedures typical of Golomb codes and their variants. It is shown that optimal codes for these so-called two-dimensional geometric distributions are \\emph{singular}, in the sense that a prefix code that is optimal for one value of the parameter $q$ cannot","authors_text":"Alfredo Viola, Fr\\'ed\\'erique Bassino, Gadiel Seroussi, Julien Cl\\'ement","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-11T19:01:58Z","title":"Optimal prefix codes for pairs of geometrically-distributed random variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2413","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:687453bc6e114396e7b567bec2b3b59c4501622b949b6fbfb876437f0ca8240e","target":"record","created_at":"2026-05-18T03:37:09Z","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":"cece088062e756467365d0afdab2ffb78884a168c82349019c7c8639ca3d2fd5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-11T19:01:58Z","title_canon_sha256":"118e9c7f192941467db0cb59ca2eb3d33263a96c18d685fca33e1dbdc163f292"},"schema_version":"1.0","source":{"id":"1102.2413","kind":"arxiv","version":2}},"canonical_sha256":"887bdb6bbebe3ee6f757b1d8085d9608dd3a8230749cbfc4101745831d9a374d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"887bdb6bbebe3ee6f757b1d8085d9608dd3a8230749cbfc4101745831d9a374d","first_computed_at":"2026-05-18T03:37:09.243850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:09.243850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/eBgcmBHeW83uhm/QQPYAacgqOe3hDJbOck/D5HS6v41Arr5inhrxr/7ZbXcilg/8dAlLLNzn3jk6oqrjc/rDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:09.244542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:687453bc6e114396e7b567bec2b3b59c4501622b949b6fbfb876437f0ca8240e","sha256:9244414f895671e3d5346c53b66b1de2c4f765ab5cecd332492caa3edf596b17"],"state_sha256":"09d21ac114fabe421ba33e83330d262a51adfc4558e5d7af6b16938cc93117ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLDGVs3d/L5G7Q0BLk+AUTjvutLXOGrijIRaSUBt88pF3hfL/4rcPojvLG/O1w4EPWsez7BsVN1DCvl+28QFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:30:21.210793Z","bundle_sha256":"e9da15144b28835c98921a2fe2658dd0b00d62e3de8985127ee2e922543f2715"}}