{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QKFQGVRUKPCICQ5AF3FHUXTRTA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1b39534d24c0eea536eee4c7d03d0d1473915fd5953245dcdeca7f415701161a","cross_cats_sorted":["cs.NA","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-01T14:31:43Z","title_canon_sha256":"d5dcf7d80cf3a3c80436c53522d3df46cf02424ce2cc9a02de5b2f71cb3032c1"},"schema_version":"1.0","source":{"id":"2405.00545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.00545","created_at":"2026-07-05T08:14:14Z"},{"alias_kind":"arxiv_version","alias_value":"2405.00545v1","created_at":"2026-07-05T08:14:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00545","created_at":"2026-07-05T08:14:14Z"},{"alias_kind":"pith_short_12","alias_value":"QKFQGVRUKPCI","created_at":"2026-07-05T08:14:14Z"},{"alias_kind":"pith_short_16","alias_value":"QKFQGVRUKPCICQ5A","created_at":"2026-07-05T08:14:14Z"},{"alias_kind":"pith_short_8","alias_value":"QKFQGVRU","created_at":"2026-07-05T08:14:14Z"}],"graph_snapshots":[{"event_id":"sha256:2d6a0dd7adeb1fad10ee03099b98f2c07771f4d51942410af118a8cd89895149","target":"graph","created_at":"2026-07-05T08:14:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.00545/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hao Wu, Huihui Wu, Lingyi Chen, Shitong Wu, Wenyi Zhang, Xinwei Li","cross_cats":["cs.NA","math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-01T14:31:43Z","title":"A Double Maximization Approach for Optimizing the LM Rate of Mismatched Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00545","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:43ec5d85d92e2de27462b1e3c6103a96344879961df2308a5523a302223baed1","target":"record","created_at":"2026-07-05T08:14:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1b39534d24c0eea536eee4c7d03d0d1473915fd5953245dcdeca7f415701161a","cross_cats_sorted":["cs.NA","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-01T14:31:43Z","title_canon_sha256":"d5dcf7d80cf3a3c80436c53522d3df46cf02424ce2cc9a02de5b2f71cb3032c1"},"schema_version":"1.0","source":{"id":"2405.00545","kind":"arxiv","version":1}},"canonical_sha256":"828b03563453c48143a02eca7a5e7198313cd4111321a18b1f7f203d8d6b9017","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"828b03563453c48143a02eca7a5e7198313cd4111321a18b1f7f203d8d6b9017","first_computed_at":"2026-07-05T08:14:14.545920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:14:14.545920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uoh+kDrsJplusVVun56fCZ5EbqsZMchzc72AJFpOoAm917onYyeIMYxOOLWZiKiV4pAZ52RMlHaNLI6UlKjKAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:14:14.546325Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.00545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43ec5d85d92e2de27462b1e3c6103a96344879961df2308a5523a302223baed1","sha256:2d6a0dd7adeb1fad10ee03099b98f2c07771f4d51942410af118a8cd89895149"],"state_sha256":"c93c77dd582d6cbf69f43cfddd76b8b268773ca4d5b3453ed317989753f9c792"}