{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:E7UXQPCBYMUHPLLB3W7J7LA4AV","short_pith_number":"pith:E7UXQPCB","schema_version":"1.0","canonical_sha256":"27e9783c41c32877ad61ddbe9fac1c05779c296a3dd58c615f4e233ce73caf65","source":{"kind":"arxiv","id":"1801.04439","version":1},"attestation_state":"computed","paper":{"title":"Variable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hideki Yagi, Te Sun Han","submitted_at":"2018-01-13T13:46:20Z","abstract_excerpt":"In the problem of variable-length $\\delta$-channel resolvability, the channel output is approximated by encoding a variable-length uniform random number under the constraint that the variational distance between the target and approximated distributions should be within a given constant $\\delta$ asymptotically. In this paper, we assume that the given channel input is a mixed source whose components may be general sources. To analyze the minimum achievable length rate of the uniform random number, called the $\\delta$-resolvability, we introduce a variant problem of the variable-length $\\delta$-"},"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":"1801.04439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T13:46:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c35383797891d84629cef224a22d57a688026acad07f9a23f97830dfb8484053","abstract_canon_sha256":"2b077b856bf30c5c264524f57f9ad0d41abcfec5f52d0d6348dd027243e7c2ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:06.475208Z","signature_b64":"ny83Ynw4/kMeEQJIAK2zCQoQq1zxm10GSERlp+lSGuqCqqavVS9kNrUMDJfHHZh8KX07JxfDMZd4m5g4Ds1KBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27e9783c41c32877ad61ddbe9fac1c05779c296a3dd58c615f4e233ce73caf65","last_reissued_at":"2026-05-18T00:26:06.474704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:06.474704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hideki Yagi, Te Sun Han","submitted_at":"2018-01-13T13:46:20Z","abstract_excerpt":"In the problem of variable-length $\\delta$-channel resolvability, the channel output is approximated by encoding a variable-length uniform random number under the constraint that the variational distance between the target and approximated distributions should be within a given constant $\\delta$ asymptotically. In this paper, we assume that the given channel input is a mixed source whose components may be general sources. To analyze the minimum achievable length rate of the uniform random number, called the $\\delta$-resolvability, we introduce a variant problem of the variable-length $\\delta$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04439","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":""},"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":"1801.04439","created_at":"2026-05-18T00:26:06.474787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04439v1","created_at":"2026-05-18T00:26:06.474787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04439","created_at":"2026-05-18T00:26:06.474787+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7UXQPCBYMUH","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7UXQPCBYMUHPLLB","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7UXQPCB","created_at":"2026-05-18T12:32:22.470017+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/E7UXQPCBYMUHPLLB3W7J7LA4AV","json":"https://pith.science/pith/E7UXQPCBYMUHPLLB3W7J7LA4AV.json","graph_json":"https://pith.science/api/pith-number/E7UXQPCBYMUHPLLB3W7J7LA4AV/graph.json","events_json":"https://pith.science/api/pith-number/E7UXQPCBYMUHPLLB3W7J7LA4AV/events.json","paper":"https://pith.science/paper/E7UXQPCB"},"agent_actions":{"view_html":"https://pith.science/pith/E7UXQPCBYMUHPLLB3W7J7LA4AV","download_json":"https://pith.science/pith/E7UXQPCBYMUHPLLB3W7J7LA4AV.json","view_paper":"https://pith.science/paper/E7UXQPCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04439&json=true","fetch_graph":"https://pith.science/api/pith-number/E7UXQPCBYMUHPLLB3W7J7LA4AV/graph.json","fetch_events":"https://pith.science/api/pith-number/E7UXQPCBYMUHPLLB3W7J7LA4AV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7UXQPCBYMUHPLLB3W7J7LA4AV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7UXQPCBYMUHPLLB3W7J7LA4AV/action/storage_attestation","attest_author":"https://pith.science/pith/E7UXQPCBYMUHPLLB3W7J7LA4AV/action/author_attestation","sign_citation":"https://pith.science/pith/E7UXQPCBYMUHPLLB3W7J7LA4AV/action/citation_signature","submit_replication":"https://pith.science/pith/E7UXQPCBYMUHPLLB3W7J7LA4AV/action/replication_record"}},"created_at":"2026-05-18T00:26:06.474787+00:00","updated_at":"2026-05-18T00:26:06.474787+00:00"}