{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:J6RWBHCJCDUEKUNCRM45VLRL2E","short_pith_number":"pith:J6RWBHCJ","schema_version":"1.0","canonical_sha256":"4fa3609c4910e84551a28b39daae2bd10f76200ec679fce66377f513991529f5","source":{"kind":"arxiv","id":"1304.0183","version":1},"attestation_state":"computed","paper":{"title":"On the data processing theorem in the semi-deterministic setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2013-03-31T10:34:26Z","abstract_excerpt":"Data processing lower bounds on the expected distortion are derived in the finite-alphabet semi-deterministic setting, where the source produces a deterministic, individual sequence, but the channel model is probabilistic, and the decoder is subjected to various kinds of limitations, e.g., decoders implementable by finite-state machines, with or without counters, and with or without a restriction of common reconstruction with high probability. Some of our bounds are given in terms of the Lempel-Ziv complexity of the source sequence or the reproduction sequence. We also demonstrate how some ana"},"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":"1304.0183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-31T10:34:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f3ba63da57314d365ae3f3f325048aa50579e99fbfb80137973b765dc43a5129","abstract_canon_sha256":"61e3ed0f7f17c0ea8753b21ded84ce4358c65268a2f76b9f70dc1d8330ed560a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.457802Z","signature_b64":"d0laYICx82LhgdlBreH7xCUFikb0e86tohT4IKmM4d8Ij2PCQdn9eBEA/cDAxh5uikI/rTZXyGm0q0FHW1QpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fa3609c4910e84551a28b39daae2bd10f76200ec679fce66377f513991529f5","last_reissued_at":"2026-05-18T00:58:17.457079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.457079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the data processing theorem in the semi-deterministic setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2013-03-31T10:34:26Z","abstract_excerpt":"Data processing lower bounds on the expected distortion are derived in the finite-alphabet semi-deterministic setting, where the source produces a deterministic, individual sequence, but the channel model is probabilistic, and the decoder is subjected to various kinds of limitations, e.g., decoders implementable by finite-state machines, with or without counters, and with or without a restriction of common reconstruction with high probability. Some of our bounds are given in terms of the Lempel-Ziv complexity of the source sequence or the reproduction sequence. We also demonstrate how some ana"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0183","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":"1304.0183","created_at":"2026-05-18T00:58:17.457200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0183v1","created_at":"2026-05-18T00:58:17.457200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0183","created_at":"2026-05-18T00:58:17.457200+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6RWBHCJCDUE","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6RWBHCJCDUEKUNC","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6RWBHCJ","created_at":"2026-05-18T12:27:49.015174+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/J6RWBHCJCDUEKUNCRM45VLRL2E","json":"https://pith.science/pith/J6RWBHCJCDUEKUNCRM45VLRL2E.json","graph_json":"https://pith.science/api/pith-number/J6RWBHCJCDUEKUNCRM45VLRL2E/graph.json","events_json":"https://pith.science/api/pith-number/J6RWBHCJCDUEKUNCRM45VLRL2E/events.json","paper":"https://pith.science/paper/J6RWBHCJ"},"agent_actions":{"view_html":"https://pith.science/pith/J6RWBHCJCDUEKUNCRM45VLRL2E","download_json":"https://pith.science/pith/J6RWBHCJCDUEKUNCRM45VLRL2E.json","view_paper":"https://pith.science/paper/J6RWBHCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0183&json=true","fetch_graph":"https://pith.science/api/pith-number/J6RWBHCJCDUEKUNCRM45VLRL2E/graph.json","fetch_events":"https://pith.science/api/pith-number/J6RWBHCJCDUEKUNCRM45VLRL2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6RWBHCJCDUEKUNCRM45VLRL2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6RWBHCJCDUEKUNCRM45VLRL2E/action/storage_attestation","attest_author":"https://pith.science/pith/J6RWBHCJCDUEKUNCRM45VLRL2E/action/author_attestation","sign_citation":"https://pith.science/pith/J6RWBHCJCDUEKUNCRM45VLRL2E/action/citation_signature","submit_replication":"https://pith.science/pith/J6RWBHCJCDUEKUNCRM45VLRL2E/action/replication_record"}},"created_at":"2026-05-18T00:58:17.457200+00:00","updated_at":"2026-05-18T00:58:17.457200+00:00"}