{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OVMZ56NZ6Q4OZESBX743GPKQDO","short_pith_number":"pith:OVMZ56NZ","schema_version":"1.0","canonical_sha256":"75599ef9b9f438ec9241bff9b33d501ba890e9836d66bcca92410ac55d5b97fa","source":{"kind":"arxiv","id":"1902.08556","version":1},"attestation_state":"computed","paper":{"title":"Parallel-Amplitude Architecture and Subset Ranking for Fast Distribution Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"David S. Millar, Keisuke Kojima, Kieran Parsons, Tobias Fehenberger, Toshiaki Koike-Akino","submitted_at":"2019-02-22T16:44:31Z","abstract_excerpt":"A distribution matcher (DM) maps a binary input sequence into a block of nonuniformly distributed symbols. To facilitate the implementation of shaped signaling, fast DM solutions with high throughput and low serialism are required. We propose a novel DM architecture with parallel amplitudes (PADM) for which m component DMs, each with a different binary output alphabet, are operated in parallel in order to generate a shaped sequence with m amplitudes. With negligible rate loss compared to a single nonbinary DM, PA-DM has a parallelization factor that grows linearly with m, and the component DMs"},"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":"1902.08556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-22T16:44:31Z","cross_cats_sorted":[],"title_canon_sha256":"b2122589a09788b8e34f2926b95dcb10d408d31819066604120bec8585d48366","abstract_canon_sha256":"166acd8c2e6373c8f6821ae1c5cef12029966c21089b479552b19629a256ac72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:56.842895Z","signature_b64":"tdOveI8hWgxjTBAsyuo5m+tbyeKDGy/6PshIrcO1410oLXbQjHeSuhSDvMRBlFTS1HHi2vfGC6D2rX8vU355Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75599ef9b9f438ec9241bff9b33d501ba890e9836d66bcca92410ac55d5b97fa","last_reissued_at":"2026-05-17T23:52:56.842308Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:56.842308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel-Amplitude Architecture and Subset Ranking for Fast Distribution Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"David S. Millar, Keisuke Kojima, Kieran Parsons, Tobias Fehenberger, Toshiaki Koike-Akino","submitted_at":"2019-02-22T16:44:31Z","abstract_excerpt":"A distribution matcher (DM) maps a binary input sequence into a block of nonuniformly distributed symbols. To facilitate the implementation of shaped signaling, fast DM solutions with high throughput and low serialism are required. We propose a novel DM architecture with parallel amplitudes (PADM) for which m component DMs, each with a different binary output alphabet, are operated in parallel in order to generate a shaped sequence with m amplitudes. With negligible rate loss compared to a single nonbinary DM, PA-DM has a parallelization factor that grows linearly with m, and the component DMs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08556","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":"1902.08556","created_at":"2026-05-17T23:52:56.842430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08556v1","created_at":"2026-05-17T23:52:56.842430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08556","created_at":"2026-05-17T23:52:56.842430+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVMZ56NZ6Q4O","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVMZ56NZ6Q4OZESB","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVMZ56NZ","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.02846","citing_title":"Analysis and Optimisation of Distribution Matching for the Nonlinear Fibre Channel","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OVMZ56NZ6Q4OZESBX743GPKQDO","json":"https://pith.science/pith/OVMZ56NZ6Q4OZESBX743GPKQDO.json","graph_json":"https://pith.science/api/pith-number/OVMZ56NZ6Q4OZESBX743GPKQDO/graph.json","events_json":"https://pith.science/api/pith-number/OVMZ56NZ6Q4OZESBX743GPKQDO/events.json","paper":"https://pith.science/paper/OVMZ56NZ"},"agent_actions":{"view_html":"https://pith.science/pith/OVMZ56NZ6Q4OZESBX743GPKQDO","download_json":"https://pith.science/pith/OVMZ56NZ6Q4OZESBX743GPKQDO.json","view_paper":"https://pith.science/paper/OVMZ56NZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08556&json=true","fetch_graph":"https://pith.science/api/pith-number/OVMZ56NZ6Q4OZESBX743GPKQDO/graph.json","fetch_events":"https://pith.science/api/pith-number/OVMZ56NZ6Q4OZESBX743GPKQDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVMZ56NZ6Q4OZESBX743GPKQDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVMZ56NZ6Q4OZESBX743GPKQDO/action/storage_attestation","attest_author":"https://pith.science/pith/OVMZ56NZ6Q4OZESBX743GPKQDO/action/author_attestation","sign_citation":"https://pith.science/pith/OVMZ56NZ6Q4OZESBX743GPKQDO/action/citation_signature","submit_replication":"https://pith.science/pith/OVMZ56NZ6Q4OZESBX743GPKQDO/action/replication_record"}},"created_at":"2026-05-17T23:52:56.842430+00:00","updated_at":"2026-05-17T23:52:56.842430+00:00"}