{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3QZKXKUTNXEJEPK6QVFFTGVG6L","short_pith_number":"pith:3QZKXKUT","schema_version":"1.0","canonical_sha256":"dc32abaa936dc8923d5e854a599aa6f2e1f7eedcb321884cb26e5ce18e4c6184","source":{"kind":"arxiv","id":"1310.3085","version":2},"attestation_state":"computed","paper":{"title":"Source-Channel Matching for Sources with Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Christos Kourtellaris, Photios A. Stavrou","submitted_at":"2013-10-11T11:26:01Z","abstract_excerpt":"In this paper we analyze the probabilistic matching of sources with memory to channels with memory so that symbol-by-symbol code with memory without anticipation are optimal, with respect to an average distortion and excess distortion probability. We show achievability of such a symbolby- symbol code with memory without anticipation, and we show matching for the Binary Symmetric Markov source (BSMS(p)) over a first-order symmetric channel with a cost constraint."},"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":"1310.3085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-11T11:26:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"42962a88c96788bae2c38f488e11801e070f58e886a4076a0e05e3d25942d8bd","abstract_canon_sha256":"f6fb21ecddde3fe71ad5e6c79ff13709aeca92728deac70e89db2a773dee40f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:38.766980Z","signature_b64":"Bcz/P7lb8eJxYZC8lOFm5K3BYdhbE2OWuw6CujA1ue7aWRDZ38LnkN4+mzNGNVwU6G/TKQLUjE8Q/DgPjBEzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc32abaa936dc8923d5e854a599aa6f2e1f7eedcb321884cb26e5ce18e4c6184","last_reissued_at":"2026-05-18T02:55:38.766269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:38.766269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Source-Channel Matching for Sources with Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Christos Kourtellaris, Photios A. Stavrou","submitted_at":"2013-10-11T11:26:01Z","abstract_excerpt":"In this paper we analyze the probabilistic matching of sources with memory to channels with memory so that symbol-by-symbol code with memory without anticipation are optimal, with respect to an average distortion and excess distortion probability. We show achievability of such a symbolby- symbol code with memory without anticipation, and we show matching for the Binary Symmetric Markov source (BSMS(p)) over a first-order symmetric channel with a cost constraint."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3085","kind":"arxiv","version":2},"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":"1310.3085","created_at":"2026-05-18T02:55:38.766380+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3085v2","created_at":"2026-05-18T02:55:38.766380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3085","created_at":"2026-05-18T02:55:38.766380+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QZKXKUTNXEJ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QZKXKUTNXEJEPK6","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QZKXKUT","created_at":"2026-05-18T12:27:32.513160+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/3QZKXKUTNXEJEPK6QVFFTGVG6L","json":"https://pith.science/pith/3QZKXKUTNXEJEPK6QVFFTGVG6L.json","graph_json":"https://pith.science/api/pith-number/3QZKXKUTNXEJEPK6QVFFTGVG6L/graph.json","events_json":"https://pith.science/api/pith-number/3QZKXKUTNXEJEPK6QVFFTGVG6L/events.json","paper":"https://pith.science/paper/3QZKXKUT"},"agent_actions":{"view_html":"https://pith.science/pith/3QZKXKUTNXEJEPK6QVFFTGVG6L","download_json":"https://pith.science/pith/3QZKXKUTNXEJEPK6QVFFTGVG6L.json","view_paper":"https://pith.science/paper/3QZKXKUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3085&json=true","fetch_graph":"https://pith.science/api/pith-number/3QZKXKUTNXEJEPK6QVFFTGVG6L/graph.json","fetch_events":"https://pith.science/api/pith-number/3QZKXKUTNXEJEPK6QVFFTGVG6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QZKXKUTNXEJEPK6QVFFTGVG6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QZKXKUTNXEJEPK6QVFFTGVG6L/action/storage_attestation","attest_author":"https://pith.science/pith/3QZKXKUTNXEJEPK6QVFFTGVG6L/action/author_attestation","sign_citation":"https://pith.science/pith/3QZKXKUTNXEJEPK6QVFFTGVG6L/action/citation_signature","submit_replication":"https://pith.science/pith/3QZKXKUTNXEJEPK6QVFFTGVG6L/action/replication_record"}},"created_at":"2026-05-18T02:55:38.766380+00:00","updated_at":"2026-05-18T02:55:38.766380+00:00"}