{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RB77AL3FWAQQOHHX5UQZCKFDF4","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":"6cf934116e5f46f154c0ede058a4ed97ac459f0aec8cbc1440689f3d2827f2e8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T06:13:10Z","title_canon_sha256":"daa3d7ed44a2e6b74058a66b157fe61bebb3a8955184602149be8c47ac9afe8a"},"schema_version":"1.0","source":{"id":"1701.06273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06273","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06273v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06273","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"RB77AL3FWAQQ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RB77AL3FWAQQOHHX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RB77AL3F","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:5988b71af3c938dbbcc4c48ff6749c46b85f4ea530d5a37209c31c324ca8c062","target":"graph","created_at":"2026-05-18T00:52:18Z","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":"The index coding problem is a problem of efficient broadcasting with side-information. We look at the uniprior index coding problem, in which the receivers have disjoint side-information symbols and arbitrary demand sets. Previous work has addressed single uniprior index coding, in which each receiver has a single unique side-information symbol. Modeling the uniprior index coding problem as a \\textit{supergraph}, we focus on a class of uniprior problems defined on \\textit{generalized cycle} supergraphs. For such problems, we prove upper and lower bounds on the optimal broadcast rate. Using a c","authors_text":"Prasad Krishnan, Vijaya Kumar Mareedu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T06:13:10Z","title":"Uniprior Index Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06273","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:5fcb3a1c35b7e01631f2f17c52ee499791af2b08910ede51fac33e3bf4bd2f05","target":"record","created_at":"2026-05-18T00:52:18Z","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":"6cf934116e5f46f154c0ede058a4ed97ac459f0aec8cbc1440689f3d2827f2e8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T06:13:10Z","title_canon_sha256":"daa3d7ed44a2e6b74058a66b157fe61bebb3a8955184602149be8c47ac9afe8a"},"schema_version":"1.0","source":{"id":"1701.06273","kind":"arxiv","version":1}},"canonical_sha256":"887ff02f65b021071cf7ed219128a32f23017d1d978301eba1dddba7da047cf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"887ff02f65b021071cf7ed219128a32f23017d1d978301eba1dddba7da047cf1","first_computed_at":"2026-05-18T00:52:18.791361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:18.791361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a6wgiapFL5RTE9lkiBDX01xhVGMUzfEhLIchmgTw2ebuadhquyvGsf1k9+gs8O97scxFBOhHJWehaVBdREqUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:18.791792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fcb3a1c35b7e01631f2f17c52ee499791af2b08910ede51fac33e3bf4bd2f05","sha256:5988b71af3c938dbbcc4c48ff6749c46b85f4ea530d5a37209c31c324ca8c062"],"state_sha256":"e0f77726dc36ffddf9681394670db9dea1de871fe4ee378f16eacd071a56cd8f"}