{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:SVBMVOFYSNVJDBVIE6V5NRO2YO","short_pith_number":"pith:SVBMVOFY","schema_version":"1.0","canonical_sha256":"9542cab8b8936a9186a827abd6c5dac3b756f50f143c762870b4f57d5d61b753","source":{"kind":"arxiv","id":"cs/0701027","version":2},"attestation_state":"computed","paper":{"title":"The source coding game with a cheating switcher","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anant Sahai, Cheng Chang, Hari Palaiyanur","submitted_at":"2007-01-05T05:38:13Z","abstract_excerpt":"Berger's paper `The Source Coding Game', IEEE Trans. Inform. Theory, 1971, considers the problem of finding the rate-distortion function for an adversarial source comprised of multiple known IID sources. The adversary, called the `switcher', was allowed only causal access to the source realizations and the rate-distortion function was obtained through the use of a type covering lemma. In this paper, the rate-distortion function of the adversarial source is described, under the assumption that the switcher has non-causal access to all source realizations. The proof utilizes the type covering le"},"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":"cs/0701027","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-05T05:38:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f9a4fdecfb4609da3a642485c1426a4557c40104c6338c3754abb374caace87","abstract_canon_sha256":"edf7cfd2d6a29fc318ef261b27c82dde490d23e59b556f777836bcada9da8c21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:54.900922Z","signature_b64":"oJ13X5dM/dOws64UfqXHWzveUzHFrTXBy1oZCCkE9HKnPuMm5/2H6v+yYaboSeguUnNsVXnkNZxwWoiD0fB7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9542cab8b8936a9186a827abd6c5dac3b756f50f143c762870b4f57d5d61b753","last_reissued_at":"2026-07-04T15:02:54.900497Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:54.900497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The source coding game with a cheating switcher","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anant Sahai, Cheng Chang, Hari Palaiyanur","submitted_at":"2007-01-05T05:38:13Z","abstract_excerpt":"Berger's paper `The Source Coding Game', IEEE Trans. Inform. Theory, 1971, considers the problem of finding the rate-distortion function for an adversarial source comprised of multiple known IID sources. The adversary, called the `switcher', was allowed only causal access to the source realizations and the rate-distortion function was obtained through the use of a type covering lemma. In this paper, the rate-distortion function of the adversarial source is described, under the assumption that the switcher has non-causal access to all source realizations. The proof utilizes the type covering le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701027","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0701027/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":"cs/0701027","created_at":"2026-07-04T15:02:54.900568+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0701027v2","created_at":"2026-07-04T15:02:54.900568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701027","created_at":"2026-07-04T15:02:54.900568+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVBMVOFYSNVJ","created_at":"2026-07-04T15:02:54.900568+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVBMVOFYSNVJDBVI","created_at":"2026-07-04T15:02:54.900568+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVBMVOFY","created_at":"2026-07-04T15:02:54.900568+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/SVBMVOFYSNVJDBVIE6V5NRO2YO","json":"https://pith.science/pith/SVBMVOFYSNVJDBVIE6V5NRO2YO.json","graph_json":"https://pith.science/api/pith-number/SVBMVOFYSNVJDBVIE6V5NRO2YO/graph.json","events_json":"https://pith.science/api/pith-number/SVBMVOFYSNVJDBVIE6V5NRO2YO/events.json","paper":"https://pith.science/paper/SVBMVOFY"},"agent_actions":{"view_html":"https://pith.science/pith/SVBMVOFYSNVJDBVIE6V5NRO2YO","download_json":"https://pith.science/pith/SVBMVOFYSNVJDBVIE6V5NRO2YO.json","view_paper":"https://pith.science/paper/SVBMVOFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0701027&json=true","fetch_graph":"https://pith.science/api/pith-number/SVBMVOFYSNVJDBVIE6V5NRO2YO/graph.json","fetch_events":"https://pith.science/api/pith-number/SVBMVOFYSNVJDBVIE6V5NRO2YO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVBMVOFYSNVJDBVIE6V5NRO2YO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVBMVOFYSNVJDBVIE6V5NRO2YO/action/storage_attestation","attest_author":"https://pith.science/pith/SVBMVOFYSNVJDBVIE6V5NRO2YO/action/author_attestation","sign_citation":"https://pith.science/pith/SVBMVOFYSNVJDBVIE6V5NRO2YO/action/citation_signature","submit_replication":"https://pith.science/pith/SVBMVOFYSNVJDBVIE6V5NRO2YO/action/replication_record"}},"created_at":"2026-07-04T15:02:54.900568+00:00","updated_at":"2026-07-04T15:02:54.900568+00:00"}