{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3C6PLAIP3RKZSPCLTZWWUF44N3","short_pith_number":"pith:3C6PLAIP","canonical_record":{"source":{"id":"1108.1977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-09T16:43:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e17db78f47cecf38f94ab5d40d993fb7908a0703afaab72adc0bb252f0a24da6","abstract_canon_sha256":"a5b55e007db9ba487ecaf89e1cd11e2656a9720a452fea818e5f6bd696554274"},"schema_version":"1.0"},"canonical_sha256":"d8bcf5810fdc55993c4b9e6d6a179c6ee86acdd17f77b490405fdb41fe5d0667","source":{"kind":"arxiv","id":"1108.1977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1977","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1977v1","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1977","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"pith_short_12","alias_value":"3C6PLAIP3RKZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3C6PLAIP3RKZSPCL","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3C6PLAIP","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3C6PLAIP3RKZSPCLTZWWUF44N3","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-09T16:43:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e17db78f47cecf38f94ab5d40d993fb7908a0703afaab72adc0bb252f0a24da6","abstract_canon_sha256":"a5b55e007db9ba487ecaf89e1cd11e2656a9720a452fea818e5f6bd696554274"},"schema_version":"1.0"},"canonical_sha256":"d8bcf5810fdc55993c4b9e6d6a179c6ee86acdd17f77b490405fdb41fe5d0667","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:50.781428Z","signature_b64":"tTJuDx238usTXba2SrahioVeFdC7jo9phdm6FEMPu88KxY+vZj7VZA0FqHT8bPpA6yy9pHpwWWIcBFYI3tSZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8bcf5810fdc55993c4b9e6d6a179c6ee86acdd17f77b490405fdb41fe5d0667","last_reissued_at":"2026-05-18T04:15:50.780966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:50.780966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1977","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-18T04:15:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wk9fCV+3RYuE+8aiMs5JJPeZXhO0bkeHDR044JmGKDxwdF3ztLt9RQBi5JpjN9r1NnrvaijtpuQgRN8NZdu5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:32:33.288412Z"},"content_sha256":"12d050cbeb307e925f93115da0d27deb101bb4ae3748d4f34c37bd804a0d78d6","schema_version":"1.0","event_id":"sha256:12d050cbeb307e925f93115da0d27deb101bb4ae3748d4f34c37bd804a0d78d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3C6PLAIP3RKZSPCLTZWWUF44N3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Index Coding for Wireless Broadcast Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Saber Tehrani, Michael J. Neely, Zhen Zhang","submitted_at":"2011-08-09T16:43:11Z","abstract_excerpt":"We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certain packets. This presents a problem of broadcasting in the presence of side information, and is a generalization of the well known (and unsolved) index coding problem of information theory. Rather than achieving the full capacity region, we develop a code-constrained capacity region, which restricts attention to a pre-specified set of coding actions. We develop a dynamic max-weight algorithm that allows for random packet arrivals"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1977","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-18T04:15:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F2xrcb1k94vZ+N0FLxAsi/QtiPOuq+XRI/8By3DR0yWeMo6+t5wB0cV9+EqebggQ6wFzGnVgr4ByA+KfabxqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:32:33.288764Z"},"content_sha256":"19b6f9788462bff1fec59cb4ff195d955c3a3715f888ba4f5e7e1203643b8532","schema_version":"1.0","event_id":"sha256:19b6f9788462bff1fec59cb4ff195d955c3a3715f888ba4f5e7e1203643b8532"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3C6PLAIP3RKZSPCLTZWWUF44N3/bundle.json","state_url":"https://pith.science/pith/3C6PLAIP3RKZSPCLTZWWUF44N3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3C6PLAIP3RKZSPCLTZWWUF44N3/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-30T07:32:33Z","links":{"resolver":"https://pith.science/pith/3C6PLAIP3RKZSPCLTZWWUF44N3","bundle":"https://pith.science/pith/3C6PLAIP3RKZSPCLTZWWUF44N3/bundle.json","state":"https://pith.science/pith/3C6PLAIP3RKZSPCLTZWWUF44N3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3C6PLAIP3RKZSPCLTZWWUF44N3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3C6PLAIP3RKZSPCLTZWWUF44N3","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":"a5b55e007db9ba487ecaf89e1cd11e2656a9720a452fea818e5f6bd696554274","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-09T16:43:11Z","title_canon_sha256":"e17db78f47cecf38f94ab5d40d993fb7908a0703afaab72adc0bb252f0a24da6"},"schema_version":"1.0","source":{"id":"1108.1977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1977","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1977v1","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1977","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"pith_short_12","alias_value":"3C6PLAIP3RKZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3C6PLAIP3RKZSPCL","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3C6PLAIP","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:19b6f9788462bff1fec59cb4ff195d955c3a3715f888ba4f5e7e1203643b8532","target":"graph","created_at":"2026-05-18T04:15:50Z","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 consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certain packets. This presents a problem of broadcasting in the presence of side information, and is a generalization of the well known (and unsolved) index coding problem of information theory. Rather than achieving the full capacity region, we develop a code-constrained capacity region, which restricts attention to a pre-specified set of coding actions. We develop a dynamic max-weight algorithm that allows for random packet arrivals","authors_text":"Arash Saber Tehrani, Michael J. Neely, Zhen Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-09T16:43:11Z","title":"Dynamic Index Coding for Wireless Broadcast Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1977","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:12d050cbeb307e925f93115da0d27deb101bb4ae3748d4f34c37bd804a0d78d6","target":"record","created_at":"2026-05-18T04:15:50Z","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":"a5b55e007db9ba487ecaf89e1cd11e2656a9720a452fea818e5f6bd696554274","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-09T16:43:11Z","title_canon_sha256":"e17db78f47cecf38f94ab5d40d993fb7908a0703afaab72adc0bb252f0a24da6"},"schema_version":"1.0","source":{"id":"1108.1977","kind":"arxiv","version":1}},"canonical_sha256":"d8bcf5810fdc55993c4b9e6d6a179c6ee86acdd17f77b490405fdb41fe5d0667","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8bcf5810fdc55993c4b9e6d6a179c6ee86acdd17f77b490405fdb41fe5d0667","first_computed_at":"2026-05-18T04:15:50.780966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:50.780966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tTJuDx238usTXba2SrahioVeFdC7jo9phdm6FEMPu88KxY+vZj7VZA0FqHT8bPpA6yy9pHpwWWIcBFYI3tSZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:50.781428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12d050cbeb307e925f93115da0d27deb101bb4ae3748d4f34c37bd804a0d78d6","sha256:19b6f9788462bff1fec59cb4ff195d955c3a3715f888ba4f5e7e1203643b8532"],"state_sha256":"9e40d4f3e06fba737f5a6497bb799950f00b0e5d8c9326dee6edfc0be607a992"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrfgxOs13tWBWI/FkJG9/6/N0Kgr2+8gwmSqe06ZSiNoW8SPjGCwUBAWmQ6HN1lbm7YBYR9cCxNhww0AlBTkAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:32:33.291095Z","bundle_sha256":"5917baace5c556e41fde998acd44783996e3f885a7ff9e792f6e3c5548d7a037"}}