{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RKN2BPXK7TLC4OBYUKQFDFVMRZ","short_pith_number":"pith:RKN2BPXK","schema_version":"1.0","canonical_sha256":"8a9ba0beeafcd62e3838a2a05196ac8e791b6669195fd5cc7e85abca7fb76df5","source":{"kind":"arxiv","id":"1303.7000","version":1},"attestation_state":"computed","paper":{"title":"Index Coding Capacity: How far can one go with only Shannon Inequalities?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2013-03-27T22:53:13Z","abstract_excerpt":"An interference alignment perspective is used to identify the simplest instances (minimum possible number of edges in the alignment graph, no more than 2 interfering messages at any destination) of index coding problems where non-Shannon information inequalities are necessary for capacity characterization. In particular, this includes the first known example of a multiple unicast (one destination per message) index coding problem where non-Shannon information inequalities are shown to be necessary. The simplest multiple unicast example has 7 edges in the alignment graph and 11 messages. The si"},"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":"1303.7000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-27T22:53:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2fda69b25908de506a17e4a0109aba69d99eb7ddb5a8f8f12c9a62b5be75c320","abstract_canon_sha256":"bfac420d9c9e68b8b091ebe16131af3a5e7f7a836082aa3775f1540d164ab24d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:38.894671Z","signature_b64":"W8JP5j56IjdeAuJm5ILZQLd2lprrdE8tdKW2yg/JSXR7UxaO9jpVPp+fFgVzYD/V1jvGkhYRecxf4wV5e6znDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a9ba0beeafcd62e3838a2a05196ac8e791b6669195fd5cc7e85abca7fb76df5","last_reissued_at":"2026-05-18T03:29:38.893823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:38.893823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Index Coding Capacity: How far can one go with only Shannon Inequalities?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2013-03-27T22:53:13Z","abstract_excerpt":"An interference alignment perspective is used to identify the simplest instances (minimum possible number of edges in the alignment graph, no more than 2 interfering messages at any destination) of index coding problems where non-Shannon information inequalities are necessary for capacity characterization. In particular, this includes the first known example of a multiple unicast (one destination per message) index coding problem where non-Shannon information inequalities are shown to be necessary. The simplest multiple unicast example has 7 edges in the alignment graph and 11 messages. The si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7000","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.7000","created_at":"2026-05-18T03:29:38.893952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.7000v1","created_at":"2026-05-18T03:29:38.893952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7000","created_at":"2026-05-18T03:29:38.893952+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKN2BPXK7TLC","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKN2BPXK7TLC4OBY","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKN2BPXK","created_at":"2026-05-18T12:27:57.521954+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/RKN2BPXK7TLC4OBYUKQFDFVMRZ","json":"https://pith.science/pith/RKN2BPXK7TLC4OBYUKQFDFVMRZ.json","graph_json":"https://pith.science/api/pith-number/RKN2BPXK7TLC4OBYUKQFDFVMRZ/graph.json","events_json":"https://pith.science/api/pith-number/RKN2BPXK7TLC4OBYUKQFDFVMRZ/events.json","paper":"https://pith.science/paper/RKN2BPXK"},"agent_actions":{"view_html":"https://pith.science/pith/RKN2BPXK7TLC4OBYUKQFDFVMRZ","download_json":"https://pith.science/pith/RKN2BPXK7TLC4OBYUKQFDFVMRZ.json","view_paper":"https://pith.science/paper/RKN2BPXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.7000&json=true","fetch_graph":"https://pith.science/api/pith-number/RKN2BPXK7TLC4OBYUKQFDFVMRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RKN2BPXK7TLC4OBYUKQFDFVMRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKN2BPXK7TLC4OBYUKQFDFVMRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKN2BPXK7TLC4OBYUKQFDFVMRZ/action/storage_attestation","attest_author":"https://pith.science/pith/RKN2BPXK7TLC4OBYUKQFDFVMRZ/action/author_attestation","sign_citation":"https://pith.science/pith/RKN2BPXK7TLC4OBYUKQFDFVMRZ/action/citation_signature","submit_replication":"https://pith.science/pith/RKN2BPXK7TLC4OBYUKQFDFVMRZ/action/replication_record"}},"created_at":"2026-05-18T03:29:38.893952+00:00","updated_at":"2026-05-18T03:29:38.893952+00:00"}