{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QKFQGVRUKPCICQ5AF3FHUXTRTA","short_pith_number":"pith:QKFQGVRU","schema_version":"1.0","canonical_sha256":"828b03563453c48143a02eca7a5e7198313cd4111321a18b1f7f203d8d6b9017","source":{"kind":"arxiv","id":"2405.00545","version":1},"attestation_state":"computed","paper":{"title":"A Double Maximization Approach for Optimizing the LM Rate of Mismatched Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Hao Wu, Huihui Wu, Lingyi Chen, Shitong Wu, Wenyi Zhang, Xinwei Li","submitted_at":"2024-05-01T14:31:43Z","abstract_excerpt":"An approach is established for maximizing the Lower bound on the Mismatch capacity (hereafter abbreviated as LM rate), a key performance bound in mismatched decoding, by optimizing the channel input probability distribution. Under a fixed channel input probability distribution, the computation of the corresponding LM rate is a convex optimization problem. When optimizing the channel input probability distribution, however, the corresponding optimization problem adopts a max-min formulation, which is generally non-convex and is intractable with standard approaches. To solve this problem, a nove"},"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":"2405.00545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-01T14:31:43Z","cross_cats_sorted":["cs.NA","math.IT","math.NA"],"title_canon_sha256":"d5dcf7d80cf3a3c80436c53522d3df46cf02424ce2cc9a02de5b2f71cb3032c1","abstract_canon_sha256":"1b39534d24c0eea536eee4c7d03d0d1473915fd5953245dcdeca7f415701161a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:14.546325Z","signature_b64":"Uoh+kDrsJplusVVun56fCZ5EbqsZMchzc72AJFpOoAm917onYyeIMYxOOLWZiKiV4pAZ52RMlHaNLI6UlKjKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"828b03563453c48143a02eca7a5e7198313cd4111321a18b1f7f203d8d6b9017","last_reissued_at":"2026-07-05T08:14:14.545920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:14.545920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Double Maximization Approach for Optimizing the LM Rate of Mismatched Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Hao Wu, Huihui Wu, Lingyi Chen, Shitong Wu, Wenyi Zhang, Xinwei Li","submitted_at":"2024-05-01T14:31:43Z","abstract_excerpt":"An approach is established for maximizing the Lower bound on the Mismatch capacity (hereafter abbreviated as LM rate), a key performance bound in mismatched decoding, by optimizing the channel input probability distribution. Under a fixed channel input probability distribution, the computation of the corresponding LM rate is a convex optimization problem. When optimizing the channel input probability distribution, however, the corresponding optimization problem adopts a max-min formulation, which is generally non-convex and is intractable with standard approaches. To solve this problem, a nove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00545","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.00545/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.00545","created_at":"2026-07-05T08:14:14.545974+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.00545v1","created_at":"2026-07-05T08:14:14.545974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00545","created_at":"2026-07-05T08:14:14.545974+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKFQGVRUKPCI","created_at":"2026-07-05T08:14:14.545974+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKFQGVRUKPCICQ5A","created_at":"2026-07-05T08:14:14.545974+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKFQGVRU","created_at":"2026-07-05T08:14:14.545974+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/QKFQGVRUKPCICQ5AF3FHUXTRTA","json":"https://pith.science/pith/QKFQGVRUKPCICQ5AF3FHUXTRTA.json","graph_json":"https://pith.science/api/pith-number/QKFQGVRUKPCICQ5AF3FHUXTRTA/graph.json","events_json":"https://pith.science/api/pith-number/QKFQGVRUKPCICQ5AF3FHUXTRTA/events.json","paper":"https://pith.science/paper/QKFQGVRU"},"agent_actions":{"view_html":"https://pith.science/pith/QKFQGVRUKPCICQ5AF3FHUXTRTA","download_json":"https://pith.science/pith/QKFQGVRUKPCICQ5AF3FHUXTRTA.json","view_paper":"https://pith.science/paper/QKFQGVRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.00545&json=true","fetch_graph":"https://pith.science/api/pith-number/QKFQGVRUKPCICQ5AF3FHUXTRTA/graph.json","fetch_events":"https://pith.science/api/pith-number/QKFQGVRUKPCICQ5AF3FHUXTRTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKFQGVRUKPCICQ5AF3FHUXTRTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKFQGVRUKPCICQ5AF3FHUXTRTA/action/storage_attestation","attest_author":"https://pith.science/pith/QKFQGVRUKPCICQ5AF3FHUXTRTA/action/author_attestation","sign_citation":"https://pith.science/pith/QKFQGVRUKPCICQ5AF3FHUXTRTA/action/citation_signature","submit_replication":"https://pith.science/pith/QKFQGVRUKPCICQ5AF3FHUXTRTA/action/replication_record"}},"created_at":"2026-07-05T08:14:14.545974+00:00","updated_at":"2026-07-05T08:14:14.545974+00:00"}