{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BYT4P7T5U5MYY3FYQKG6KWZLSS","short_pith_number":"pith:BYT4P7T5","canonical_record":{"source":{"id":"1801.05294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T15:25:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7df522192af8be295b31426da71337faeb83b21c8d0cf342f60ed38afc54374b","abstract_canon_sha256":"007bb6e822608c65d9553f9a88c74e615187b6e19a8b686a2f95bb10071f3b89"},"schema_version":"1.0"},"canonical_sha256":"0e27c7fe7da7598c6cb8828de55b2b949b6a0b684b0ff606be2853eab3178b8a","source":{"kind":"arxiv","id":"1801.05294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05294","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05294v1","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05294","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"BYT4P7T5U5MY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BYT4P7T5U5MYY3FY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BYT4P7T5","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BYT4P7T5U5MYY3FYQKG6KWZLSS","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T15:25:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7df522192af8be295b31426da71337faeb83b21c8d0cf342f60ed38afc54374b","abstract_canon_sha256":"007bb6e822608c65d9553f9a88c74e615187b6e19a8b686a2f95bb10071f3b89"},"schema_version":"1.0"},"canonical_sha256":"0e27c7fe7da7598c6cb8828de55b2b949b6a0b684b0ff606be2853eab3178b8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:47.311543Z","signature_b64":"StPBowwaQndszIKgzAXHi//AEb3nLCjPRaW44cvHclF0Q2wU1+v7BlKfw/tXh3PiiYstFuhC1635OaQCLL37CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e27c7fe7da7598c6cb8828de55b2b949b6a0b684b0ff606be2853eab3178b8a","last_reissued_at":"2026-05-18T00:25:47.310951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:47.310951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05294","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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"govgn0A5oBACVNxWpqS/3aCsDlku7JkmvkBHwPWKoF2BT1nsRT4f9H/vqq/JTL2Z6hFd2+FWJRywW5oJWNj/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:10:22.273178Z"},"content_sha256":"f44db6eb85afa642222635d9f013a16e6c68038e622ec920bdbcf44a6e9ce700","schema_version":"1.0","event_id":"sha256:f44db6eb85afa642222635d9f013a16e6c68038e622ec920bdbcf44a6e9ce700"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BYT4P7T5U5MYY3FYQKG6KWZLSS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, Mohsen Heidari, S. Sandeep Pradhan","submitted_at":"2018-01-16T15:25:36Z","abstract_excerpt":"In this paper, we investigate the necessity of finite blocklength codes in distributed transmission of independent message sets over channels with feedback. Previously, it was shown that finite effective length codes are necessary in distributed transmission and compression of sources. We provide two examples of three user interference channels with feedback where codes with asymptotically large effective lengths are sub-optimal. As a result, we conclude that coded transmission using finite effective length codes is necessary to achieve optimality. We argue that the sub-optimal performance of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05294","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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GH61te9Bzcm3EGOc+1Pu6v8WXVCdV0nELdmZ71uHPLOh4SQCrtDEM+FZ4swhQw2CYfuNN6y5CpswvuP5IUT+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:10:22.273892Z"},"content_sha256":"526a623a9573de5e0e602d21e4d68670b21b02fd3a0f81848e609b1ac90ebada","schema_version":"1.0","event_id":"sha256:526a623a9573de5e0e602d21e4d68670b21b02fd3a0f81848e609b1ac90ebada"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYT4P7T5U5MYY3FYQKG6KWZLSS/bundle.json","state_url":"https://pith.science/pith/BYT4P7T5U5MYY3FYQKG6KWZLSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYT4P7T5U5MYY3FYQKG6KWZLSS/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-06-07T19:10:22Z","links":{"resolver":"https://pith.science/pith/BYT4P7T5U5MYY3FYQKG6KWZLSS","bundle":"https://pith.science/pith/BYT4P7T5U5MYY3FYQKG6KWZLSS/bundle.json","state":"https://pith.science/pith/BYT4P7T5U5MYY3FYQKG6KWZLSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYT4P7T5U5MYY3FYQKG6KWZLSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BYT4P7T5U5MYY3FYQKG6KWZLSS","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":"007bb6e822608c65d9553f9a88c74e615187b6e19a8b686a2f95bb10071f3b89","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T15:25:36Z","title_canon_sha256":"7df522192af8be295b31426da71337faeb83b21c8d0cf342f60ed38afc54374b"},"schema_version":"1.0","source":{"id":"1801.05294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05294","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05294v1","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05294","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"BYT4P7T5U5MY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BYT4P7T5U5MYY3FY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BYT4P7T5","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:526a623a9573de5e0e602d21e4d68670b21b02fd3a0f81848e609b1ac90ebada","target":"graph","created_at":"2026-05-18T00:25:47Z","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":"In this paper, we investigate the necessity of finite blocklength codes in distributed transmission of independent message sets over channels with feedback. Previously, it was shown that finite effective length codes are necessary in distributed transmission and compression of sources. We provide two examples of three user interference channels with feedback where codes with asymptotically large effective lengths are sub-optimal. As a result, we conclude that coded transmission using finite effective length codes is necessary to achieve optimality. We argue that the sub-optimal performance of ","authors_text":"Farhad Shirani, Mohsen Heidari, S. Sandeep Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T15:25:36Z","title":"Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05294","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:f44db6eb85afa642222635d9f013a16e6c68038e622ec920bdbcf44a6e9ce700","target":"record","created_at":"2026-05-18T00:25:47Z","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":"007bb6e822608c65d9553f9a88c74e615187b6e19a8b686a2f95bb10071f3b89","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-16T15:25:36Z","title_canon_sha256":"7df522192af8be295b31426da71337faeb83b21c8d0cf342f60ed38afc54374b"},"schema_version":"1.0","source":{"id":"1801.05294","kind":"arxiv","version":1}},"canonical_sha256":"0e27c7fe7da7598c6cb8828de55b2b949b6a0b684b0ff606be2853eab3178b8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e27c7fe7da7598c6cb8828de55b2b949b6a0b684b0ff606be2853eab3178b8a","first_computed_at":"2026-05-18T00:25:47.310951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:47.310951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"StPBowwaQndszIKgzAXHi//AEb3nLCjPRaW44cvHclF0Q2wU1+v7BlKfw/tXh3PiiYstFuhC1635OaQCLL37CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:47.311543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f44db6eb85afa642222635d9f013a16e6c68038e622ec920bdbcf44a6e9ce700","sha256:526a623a9573de5e0e602d21e4d68670b21b02fd3a0f81848e609b1ac90ebada"],"state_sha256":"338f81f862c9fbb36ba267957949845180290bc752c2303d25846bf53f91eb6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpBohDXcA3zzdKILXEwS0cOdbSucZkahb4G3b8bLBf3up+iNH0/hnS0T18i/UkY1dKiyyaqCs0EaaERh84jHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T19:10:22.278078Z","bundle_sha256":"d4222b557dc305c36f19ad582188c44ea096a593a050acdce6766126fd673232"}}