{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5CGXBVHZ3MLIZH4C3M7MWCZRIO","short_pith_number":"pith:5CGXBVHZ","canonical_record":{"source":{"id":"2507.19816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-07-26T06:17:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47e778036769e2b6da5fa598d2e6afbf082eae035f216e0376f1cf14306ed702","abstract_canon_sha256":"719a437c01a1eb50c89f2c4af398a081e669dd25db093be40c6417d8ccd42186"},"schema_version":"1.0"},"canonical_sha256":"e88d70d4f9db168c9f82db3ecb0b31438a3e653e174f7d48307d11849e71f41b","source":{"kind":"arxiv","id":"2507.19816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19816","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19816v1","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19816","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"5CGXBVHZ3MLI","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"pith_short_16","alias_value":"5CGXBVHZ3MLIZH4C","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"pith_short_8","alias_value":"5CGXBVHZ","created_at":"2026-07-05T11:43:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5CGXBVHZ3MLIZH4C3M7MWCZRIO","target":"record","payload":{"canonical_record":{"source":{"id":"2507.19816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-07-26T06:17:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47e778036769e2b6da5fa598d2e6afbf082eae035f216e0376f1cf14306ed702","abstract_canon_sha256":"719a437c01a1eb50c89f2c4af398a081e669dd25db093be40c6417d8ccd42186"},"schema_version":"1.0"},"canonical_sha256":"e88d70d4f9db168c9f82db3ecb0b31438a3e653e174f7d48307d11849e71f41b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:42.585633Z","signature_b64":"mqHNgYpiFPC7pDGH/EIjrkbvm7OkI8A49wPuQI1tEOfbosnHT3L7L00lDUNdD5XaIbFQBl4gN1hPWgTFcEYgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e88d70d4f9db168c9f82db3ecb0b31438a3e653e174f7d48307d11849e71f41b","last_reissued_at":"2026-07-05T11:43:42.585217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:42.585217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.19816","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JaPcLZWccDEjbnYHhwSGumO2sDuE+0QDHyOxX7oM9qnv+jgpbgs9OQaSd4HMrh2AhY7vbnPjDzt2AJDMvOtfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:17:09.919713Z"},"content_sha256":"1360ed9b711cc91440299c293e1a48f1739072d82081ec7213fc4461fa909202","schema_version":"1.0","event_id":"sha256:1360ed9b711cc91440299c293e1a48f1739072d82081ec7213fc4461fa909202"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5CGXBVHZ3MLIZH4C3M7MWCZRIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Computation of Marton's Error Exponent via Constraint Decoupling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Wu, Huihui Wu, Jiachuan Ye, Lingyi Chen, Shitong Wu, Wenyi Zhang","submitted_at":"2025-07-26T06:17:03Z","abstract_excerpt":"The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation methods of the Marton's error exponent remain underdeveloped due to its formulation as a non-convex optimization problem with limited efficient solvers. While a recent grid search algorithm can compute its inverse function, it incurs prohibitive computational costs from two-dimensional brute-force parameter grid searches. This paper proposes a composite maximiza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19816","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/2507.19816/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOTZbTAYXVXwuHrs0o+RlxmxQKkfup8dIK09JuwWMzxL2lrATnVED1QT6yIgpBi5mt+XZ9v7pYNv8qKMqlwRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:17:09.920675Z"},"content_sha256":"dcf6279a8a6b19cf90039e31825c24c192cb2ddb542a1259d5ca904690524792","schema_version":"1.0","event_id":"sha256:dcf6279a8a6b19cf90039e31825c24c192cb2ddb542a1259d5ca904690524792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CGXBVHZ3MLIZH4C3M7MWCZRIO/bundle.json","state_url":"https://pith.science/pith/5CGXBVHZ3MLIZH4C3M7MWCZRIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CGXBVHZ3MLIZH4C3M7MWCZRIO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T23:17:09Z","links":{"resolver":"https://pith.science/pith/5CGXBVHZ3MLIZH4C3M7MWCZRIO","bundle":"https://pith.science/pith/5CGXBVHZ3MLIZH4C3M7MWCZRIO/bundle.json","state":"https://pith.science/pith/5CGXBVHZ3MLIZH4C3M7MWCZRIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CGXBVHZ3MLIZH4C3M7MWCZRIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5CGXBVHZ3MLIZH4C3M7MWCZRIO","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":"719a437c01a1eb50c89f2c4af398a081e669dd25db093be40c6417d8ccd42186","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-07-26T06:17:03Z","title_canon_sha256":"47e778036769e2b6da5fa598d2e6afbf082eae035f216e0376f1cf14306ed702"},"schema_version":"1.0","source":{"id":"2507.19816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19816","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19816v1","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19816","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"5CGXBVHZ3MLI","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"pith_short_16","alias_value":"5CGXBVHZ3MLIZH4C","created_at":"2026-07-05T11:43:42Z"},{"alias_kind":"pith_short_8","alias_value":"5CGXBVHZ","created_at":"2026-07-05T11:43:42Z"}],"graph_snapshots":[{"event_id":"sha256:dcf6279a8a6b19cf90039e31825c24c192cb2ddb542a1259d5ca904690524792","target":"graph","created_at":"2026-07-05T11:43:42Z","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/2507.19816/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation methods of the Marton's error exponent remain underdeveloped due to its formulation as a non-convex optimization problem with limited efficient solvers. While a recent grid search algorithm can compute its inverse function, it incurs prohibitive computational costs from two-dimensional brute-force parameter grid searches. This paper proposes a composite maximiza","authors_text":"Hao Wu, Huihui Wu, Jiachuan Ye, Lingyi Chen, Shitong Wu, Wenyi Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-07-26T06:17:03Z","title":"Efficient Computation of Marton's Error Exponent via Constraint Decoupling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19816","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:1360ed9b711cc91440299c293e1a48f1739072d82081ec7213fc4461fa909202","target":"record","created_at":"2026-07-05T11:43:42Z","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":"719a437c01a1eb50c89f2c4af398a081e669dd25db093be40c6417d8ccd42186","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-07-26T06:17:03Z","title_canon_sha256":"47e778036769e2b6da5fa598d2e6afbf082eae035f216e0376f1cf14306ed702"},"schema_version":"1.0","source":{"id":"2507.19816","kind":"arxiv","version":1}},"canonical_sha256":"e88d70d4f9db168c9f82db3ecb0b31438a3e653e174f7d48307d11849e71f41b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e88d70d4f9db168c9f82db3ecb0b31438a3e653e174f7d48307d11849e71f41b","first_computed_at":"2026-07-05T11:43:42.585217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:42.585217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mqHNgYpiFPC7pDGH/EIjrkbvm7OkI8A49wPuQI1tEOfbosnHT3L7L00lDUNdD5XaIbFQBl4gN1hPWgTFcEYgBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:42.585633Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.19816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1360ed9b711cc91440299c293e1a48f1739072d82081ec7213fc4461fa909202","sha256:dcf6279a8a6b19cf90039e31825c24c192cb2ddb542a1259d5ca904690524792"],"state_sha256":"6d04b05ef9fb151d7bbf00ce6c4ccabde252507d48f9d395c96dd1888f06bd65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ibaLfOnPtIJ3irnFrc4AvlXtzM3kv/8Lm2mQ4KslKL6s0sgvNJrPUPpzDpFs/SPqs/O73oSSjA0nqWFLMmsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:17:09.926368Z","bundle_sha256":"caf120525825147767c0809f236efcea4374c53a0a51c4daa9ca336ad4b4c842"}}