{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F6EPZHOMYW3TMYVMHUDGADCSDD","short_pith_number":"pith:F6EPZHOM","canonical_record":{"source":{"id":"1704.07693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-25T13:42:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"114cdb59e7f06c0f2b1e2d022e5ba31b164db2062d2beb5e9f6970f843e4a249","abstract_canon_sha256":"e1da1deb45d88e362ccb822dff42e7d7a01909aa441651d7255e92369b944154"},"schema_version":"1.0"},"canonical_sha256":"2f88fc9dccc5b73662ac3d06600c5218e95df1eb68ddfccb90c820c95d0eb4be","source":{"kind":"arxiv","id":"1704.07693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07693","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07693v1","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07693","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"F6EPZHOMYW3T","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F6EPZHOMYW3TMYVM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F6EPZHOM","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F6EPZHOMYW3TMYVMHUDGADCSDD","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-25T13:42:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"114cdb59e7f06c0f2b1e2d022e5ba31b164db2062d2beb5e9f6970f843e4a249","abstract_canon_sha256":"e1da1deb45d88e362ccb822dff42e7d7a01909aa441651d7255e92369b944154"},"schema_version":"1.0"},"canonical_sha256":"2f88fc9dccc5b73662ac3d06600c5218e95df1eb68ddfccb90c820c95d0eb4be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:37.215005Z","signature_b64":"PBaJjn2H6Xc0FcZ21S/bVKns0VQ9M/XTlxM+990KWyU4iyuKENRYAC9Tt4uBN20mgGpBDPSeDKDsayRSbBd1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f88fc9dccc5b73662ac3d06600c5218e95df1eb68ddfccb90c820c95d0eb4be","last_reissued_at":"2026-05-18T00:45:37.213672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:37.213672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07693","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-05-18T00:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S99Cy/75jsB/KJfV2Oz4fYs2VI0vvF1RIC0qYSFpgQf07DcgT9YS8wAtoytkFGtj2jVtoC6BzVlUJowrb1mBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:43.962906Z"},"content_sha256":"9b3cfb486b6f2c1cdfd8566d23f56cb334744f700a7e513a885f4e879b1b167f","schema_version":"1.0","event_id":"sha256:9b3cfb486b6f2c1cdfd8566d23f56cb334744f700a7e513a885f4e879b1b167f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F6EPZHOMYW3TMYVMHUDGADCSDD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding for Arbitrarily Varying Remote Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran","submitted_at":"2017-04-25T13:42:01Z","abstract_excerpt":"We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another output is received as side information at the decoder. The adversary is assumed to know the source data non-causally, and can employ randomized jamming strategies arbitrarily correlated to the source data. The decoder reconstructs the source data from the encoded message and the side information. We prove upper and lower bounds on the adversarial rate disto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07693","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"},"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-05-18T00:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GI6Dg3f4C841oNR3YlpC0AOz31Vuu6r4IhprwU+vUu1DnUu44nF/KWNT16s7adSw235CCrHON+FeZHrW5jkkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:43.963574Z"},"content_sha256":"a8f2e7999394cb7546627ba501ba85b9dd72f184704d5a8175a6375f77bfc48f","schema_version":"1.0","event_id":"sha256:a8f2e7999394cb7546627ba501ba85b9dd72f184704d5a8175a6375f77bfc48f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6EPZHOMYW3TMYVMHUDGADCSDD/bundle.json","state_url":"https://pith.science/pith/F6EPZHOMYW3TMYVMHUDGADCSDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6EPZHOMYW3TMYVMHUDGADCSDD/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-05-27T03:17:43Z","links":{"resolver":"https://pith.science/pith/F6EPZHOMYW3TMYVMHUDGADCSDD","bundle":"https://pith.science/pith/F6EPZHOMYW3TMYVMHUDGADCSDD/bundle.json","state":"https://pith.science/pith/F6EPZHOMYW3TMYVMHUDGADCSDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6EPZHOMYW3TMYVMHUDGADCSDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F6EPZHOMYW3TMYVMHUDGADCSDD","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":"e1da1deb45d88e362ccb822dff42e7d7a01909aa441651d7255e92369b944154","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-25T13:42:01Z","title_canon_sha256":"114cdb59e7f06c0f2b1e2d022e5ba31b164db2062d2beb5e9f6970f843e4a249"},"schema_version":"1.0","source":{"id":"1704.07693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07693","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07693v1","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07693","created_at":"2026-05-18T00:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"F6EPZHOMYW3T","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F6EPZHOMYW3TMYVM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F6EPZHOM","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:a8f2e7999394cb7546627ba501ba85b9dd72f184704d5a8175a6375f77bfc48f","target":"graph","created_at":"2026-05-18T00:45:37Z","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"},"paper":{"abstract_excerpt":"We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another output is received as side information at the decoder. The adversary is assumed to know the source data non-causally, and can employ randomized jamming strategies arbitrarily correlated to the source data. The decoder reconstructs the source data from the encoded message and the side information. We prove upper and lower bounds on the adversarial rate disto","authors_text":"Amitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-25T13:42:01Z","title":"Coding for Arbitrarily Varying Remote Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07693","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:9b3cfb486b6f2c1cdfd8566d23f56cb334744f700a7e513a885f4e879b1b167f","target":"record","created_at":"2026-05-18T00:45:37Z","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":"e1da1deb45d88e362ccb822dff42e7d7a01909aa441651d7255e92369b944154","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-25T13:42:01Z","title_canon_sha256":"114cdb59e7f06c0f2b1e2d022e5ba31b164db2062d2beb5e9f6970f843e4a249"},"schema_version":"1.0","source":{"id":"1704.07693","kind":"arxiv","version":1}},"canonical_sha256":"2f88fc9dccc5b73662ac3d06600c5218e95df1eb68ddfccb90c820c95d0eb4be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f88fc9dccc5b73662ac3d06600c5218e95df1eb68ddfccb90c820c95d0eb4be","first_computed_at":"2026-05-18T00:45:37.213672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:37.213672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PBaJjn2H6Xc0FcZ21S/bVKns0VQ9M/XTlxM+990KWyU4iyuKENRYAC9Tt4uBN20mgGpBDPSeDKDsayRSbBd1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:37.215005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b3cfb486b6f2c1cdfd8566d23f56cb334744f700a7e513a885f4e879b1b167f","sha256:a8f2e7999394cb7546627ba501ba85b9dd72f184704d5a8175a6375f77bfc48f"],"state_sha256":"9d1c760a964ecc67aff1891205fc042bab4a1a1bf36f0dac0ffc42f849502e6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tKV9zLsLNgiimBlR9BpQzhI7wBQVi/3P/RSxFarjtYqCDeVFiCB9BbJOw0ES+BzSFtE52bsWgjFb62e0tW9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:17:43.967077Z","bundle_sha256":"eed9413eccd5483fc7d404e769edf0ce70be206a057a4712ec8934b16d30ef17"}}