{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JD27UCW6C2F45QSOTRVU7BLRIS","short_pith_number":"pith:JD27UCW6","schema_version":"1.0","canonical_sha256":"48f5fa0ade168bcec24e9c6b4f857144a0e6632e86ccbb11a5ee827010085368","source":{"kind":"arxiv","id":"1002.0097","version":5},"attestation_state":"computed","paper":{"title":"On the Construction of Prefix-Free and Fix-Free Codes with Specified Codeword Compositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Kakhbod, Morteza Zadimoghaddam","submitted_at":"2010-01-30T23:31:07Z","abstract_excerpt":"We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a special class of codes called distinct codes. We consider the construction of optimal fix-free codes which minimizes the average codeword cost for general letter costs with uniform distribution of the codewords and present an approximation algorithm to find a near optimal fix-free code with a given constant cost."},"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":"1002.0097","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-30T23:31:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"110802956646136b3ce60f26fc520bbb4c0b0c6242b0cac280ccb4611b2c5780","abstract_canon_sha256":"ebd646528ac525f4465f54c3f5053e4bceaee9128b33b5c3d52d514d52620713"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:50.655530Z","signature_b64":"BXZ37US5Rvx8h4Vr3/vaYKeC/Z8RsYVppLTS2j9U2y6XuTzw61w6+iI0x1WKfS1U7uHa6gOqRzQHTU0YqdnFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48f5fa0ade168bcec24e9c6b4f857144a0e6632e86ccbb11a5ee827010085368","last_reissued_at":"2026-05-18T04:02:50.654641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:50.654641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Construction of Prefix-Free and Fix-Free Codes with Specified Codeword Compositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Kakhbod, Morteza Zadimoghaddam","submitted_at":"2010-01-30T23:31:07Z","abstract_excerpt":"We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a special class of codes called distinct codes. We consider the construction of optimal fix-free codes which minimizes the average codeword cost for general letter costs with uniform distribution of the codewords and present an approximation algorithm to find a near optimal fix-free code with a given constant cost."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0097","kind":"arxiv","version":5},"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":"1002.0097","created_at":"2026-05-18T04:02:50.654763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.0097v5","created_at":"2026-05-18T04:02:50.654763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0097","created_at":"2026-05-18T04:02:50.654763+00:00"},{"alias_kind":"pith_short_12","alias_value":"JD27UCW6C2F4","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JD27UCW6C2F45QSO","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JD27UCW6","created_at":"2026-05-18T12:26:09.077623+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/JD27UCW6C2F45QSOTRVU7BLRIS","json":"https://pith.science/pith/JD27UCW6C2F45QSOTRVU7BLRIS.json","graph_json":"https://pith.science/api/pith-number/JD27UCW6C2F45QSOTRVU7BLRIS/graph.json","events_json":"https://pith.science/api/pith-number/JD27UCW6C2F45QSOTRVU7BLRIS/events.json","paper":"https://pith.science/paper/JD27UCW6"},"agent_actions":{"view_html":"https://pith.science/pith/JD27UCW6C2F45QSOTRVU7BLRIS","download_json":"https://pith.science/pith/JD27UCW6C2F45QSOTRVU7BLRIS.json","view_paper":"https://pith.science/paper/JD27UCW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.0097&json=true","fetch_graph":"https://pith.science/api/pith-number/JD27UCW6C2F45QSOTRVU7BLRIS/graph.json","fetch_events":"https://pith.science/api/pith-number/JD27UCW6C2F45QSOTRVU7BLRIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JD27UCW6C2F45QSOTRVU7BLRIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JD27UCW6C2F45QSOTRVU7BLRIS/action/storage_attestation","attest_author":"https://pith.science/pith/JD27UCW6C2F45QSOTRVU7BLRIS/action/author_attestation","sign_citation":"https://pith.science/pith/JD27UCW6C2F45QSOTRVU7BLRIS/action/citation_signature","submit_replication":"https://pith.science/pith/JD27UCW6C2F45QSOTRVU7BLRIS/action/replication_record"}},"created_at":"2026-05-18T04:02:50.654763+00:00","updated_at":"2026-05-18T04:02:50.654763+00:00"}