{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PWHTWSTF5432TYPPY6MI5DT76G","short_pith_number":"pith:PWHTWSTF","schema_version":"1.0","canonical_sha256":"7d8f3b4a65ef37a9e1efc7988e8e7ff196b7e3b348ec1f0c15c178b522889066","source":{"kind":"arxiv","id":"1609.08878","version":1},"attestation_state":"computed","paper":{"title":"Graph-Theoretic Approaches to Two-Sender Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chandra Thapa, Lawrence Ong, Sarah J. Johnson","submitted_at":"2016-09-28T12:13:31Z","abstract_excerpt":"Consider a communication scenario over a noiseless channel where a sender is required to broadcast messages to multiple receivers, each having side information about some messages. In this scenario, the sender can leverage the receivers' side information during the encoding of messages in order to reduce the required transmissions. This type of encoding is called index coding. In this paper, we study index coding with two cooperative senders, each with some subset of messages, and multiple receivers, each requesting one unique message. The index coding in this setup is called two-sender unicas"},"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":"1609.08878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T12:13:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4627fcf350ce7db8399d0260f809be1b4ff78df236eee71d6ce03eaacaa9c432","abstract_canon_sha256":"d4306105745f3689d301f1caeb4fc2a3dd4d7068605db62cee880fa5ac198c04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:39.361439Z","signature_b64":"VlJMzvroHTim/w3M3C+5XP3TSbkC8XyN/q+AsZEkY66WNPDiUy7H66vXX/I9WIqdsFzMs6tPcoPMTdgJ/glEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d8f3b4a65ef37a9e1efc7988e8e7ff196b7e3b348ec1f0c15c178b522889066","last_reissued_at":"2026-05-18T00:42:39.360872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:39.360872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Theoretic Approaches to Two-Sender Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chandra Thapa, Lawrence Ong, Sarah J. Johnson","submitted_at":"2016-09-28T12:13:31Z","abstract_excerpt":"Consider a communication scenario over a noiseless channel where a sender is required to broadcast messages to multiple receivers, each having side information about some messages. In this scenario, the sender can leverage the receivers' side information during the encoding of messages in order to reduce the required transmissions. This type of encoding is called index coding. In this paper, we study index coding with two cooperative senders, each with some subset of messages, and multiple receivers, each requesting one unique message. The index coding in this setup is called two-sender unicas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08878","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":"1609.08878","created_at":"2026-05-18T00:42:39.360957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08878v1","created_at":"2026-05-18T00:42:39.360957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08878","created_at":"2026-05-18T00:42:39.360957+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWHTWSTF5432","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWHTWSTF5432TYPP","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWHTWSTF","created_at":"2026-05-18T12:30:39.010887+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/PWHTWSTF5432TYPPY6MI5DT76G","json":"https://pith.science/pith/PWHTWSTF5432TYPPY6MI5DT76G.json","graph_json":"https://pith.science/api/pith-number/PWHTWSTF5432TYPPY6MI5DT76G/graph.json","events_json":"https://pith.science/api/pith-number/PWHTWSTF5432TYPPY6MI5DT76G/events.json","paper":"https://pith.science/paper/PWHTWSTF"},"agent_actions":{"view_html":"https://pith.science/pith/PWHTWSTF5432TYPPY6MI5DT76G","download_json":"https://pith.science/pith/PWHTWSTF5432TYPPY6MI5DT76G.json","view_paper":"https://pith.science/paper/PWHTWSTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08878&json=true","fetch_graph":"https://pith.science/api/pith-number/PWHTWSTF5432TYPPY6MI5DT76G/graph.json","fetch_events":"https://pith.science/api/pith-number/PWHTWSTF5432TYPPY6MI5DT76G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWHTWSTF5432TYPPY6MI5DT76G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWHTWSTF5432TYPPY6MI5DT76G/action/storage_attestation","attest_author":"https://pith.science/pith/PWHTWSTF5432TYPPY6MI5DT76G/action/author_attestation","sign_citation":"https://pith.science/pith/PWHTWSTF5432TYPPY6MI5DT76G/action/citation_signature","submit_replication":"https://pith.science/pith/PWHTWSTF5432TYPPY6MI5DT76G/action/replication_record"}},"created_at":"2026-05-18T00:42:39.360957+00:00","updated_at":"2026-05-18T00:42:39.360957+00:00"}