{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HPTUU7APBNBCCZZ2HFLNKMCUDO","short_pith_number":"pith:HPTUU7AP","schema_version":"1.0","canonical_sha256":"3be74a7c0f0b4221673a3956d530541bbcfcf85d03dc86268ea812353a3e832a","source":{"kind":"arxiv","id":"2507.23180","version":2},"attestation_state":"computed","paper":{"title":"The Construction of Near-optimal Universal Coding of Integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Wei Yan, Yunghsiang S. Han","submitted_at":"2025-07-31T01:21:06Z","abstract_excerpt":"The Universal Coding of Integers~(UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. A UCI is a class of prefix codes for which the ratio of the average codeword length to $\\max\\{1,H(P)\\}$ is within a constant expansion factor \\textcolor{red}{$C_{\\mathcal{C}}$} for any decreasing probability distribution $P$, where $H(P)$ is the entropy of $P$. For any UCI code $\\mathcal{C}$, \\emph{the minimum expansion factor} \\textcolor{red}{$C_{\\mathcal{C}}^{*}$} is defined to represent the infimum of the set of extension factors "},"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":"2507.23180","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-07-31T01:21:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"730198a0f37b0e88d5dae5fe18b95f08ece3201db8863658345de36a6a9261c0","abstract_canon_sha256":"ec0d52df8421bd5b8b3d3c0bf2a216c58fc64da872d6d2071b8e36201a77f88e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:17.790839Z","signature_b64":"YrqOHMJJ/9Y5n/8B8k3LYJ9IyRG00ZYJN0i3alwkvasRdCQBKq0i8MswOlxybYlhocRUln2m3/rUSmOSerFDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3be74a7c0f0b4221673a3956d530541bbcfcf85d03dc86268ea812353a3e832a","last_reissued_at":"2026-05-17T23:39:17.790104Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:17.790104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Construction of Near-optimal Universal Coding of Integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Wei Yan, Yunghsiang S. Han","submitted_at":"2025-07-31T01:21:06Z","abstract_excerpt":"The Universal Coding of Integers~(UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. A UCI is a class of prefix codes for which the ratio of the average codeword length to $\\max\\{1,H(P)\\}$ is within a constant expansion factor \\textcolor{red}{$C_{\\mathcal{C}}$} for any decreasing probability distribution $P$, where $H(P)$ is the entropy of $P$. For any UCI code $\\mathcal{C}$, \\emph{the minimum expansion factor} \\textcolor{red}{$C_{\\mathcal{C}}^{*}$} is defined to represent the infimum of the set of extension factors "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.23180","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.23180","created_at":"2026-05-17T23:39:17.790214+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.23180v2","created_at":"2026-05-17T23:39:17.790214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.23180","created_at":"2026-05-17T23:39:17.790214+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPTUU7APBNBC","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPTUU7APBNBCCZZ2","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPTUU7AP","created_at":"2026-05-18T12:33:37.589309+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/HPTUU7APBNBCCZZ2HFLNKMCUDO","json":"https://pith.science/pith/HPTUU7APBNBCCZZ2HFLNKMCUDO.json","graph_json":"https://pith.science/api/pith-number/HPTUU7APBNBCCZZ2HFLNKMCUDO/graph.json","events_json":"https://pith.science/api/pith-number/HPTUU7APBNBCCZZ2HFLNKMCUDO/events.json","paper":"https://pith.science/paper/HPTUU7AP"},"agent_actions":{"view_html":"https://pith.science/pith/HPTUU7APBNBCCZZ2HFLNKMCUDO","download_json":"https://pith.science/pith/HPTUU7APBNBCCZZ2HFLNKMCUDO.json","view_paper":"https://pith.science/paper/HPTUU7AP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.23180&json=true","fetch_graph":"https://pith.science/api/pith-number/HPTUU7APBNBCCZZ2HFLNKMCUDO/graph.json","fetch_events":"https://pith.science/api/pith-number/HPTUU7APBNBCCZZ2HFLNKMCUDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPTUU7APBNBCCZZ2HFLNKMCUDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPTUU7APBNBCCZZ2HFLNKMCUDO/action/storage_attestation","attest_author":"https://pith.science/pith/HPTUU7APBNBCCZZ2HFLNKMCUDO/action/author_attestation","sign_citation":"https://pith.science/pith/HPTUU7APBNBCCZZ2HFLNKMCUDO/action/citation_signature","submit_replication":"https://pith.science/pith/HPTUU7APBNBCCZZ2HFLNKMCUDO/action/replication_record"}},"created_at":"2026-05-17T23:39:17.790214+00:00","updated_at":"2026-05-17T23:39:17.790214+00:00"}