{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QATTIY5DG4T6AUOFMCZMJQWJVW","short_pith_number":"pith:QATTIY5D","schema_version":"1.0","canonical_sha256":"80273463a33727e051c560b2c4c2c9adbeaa8e316596b9f944093f18efb17d78","source":{"kind":"arxiv","id":"1809.08116","version":2},"attestation_state":"computed","paper":{"title":"On the Optimal Broadcast Rate of the Two-Sender Unicast Index Coding Problem with Fully-Participated Interactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Chinmayananda Arunachala, Vaneet Aggarwal","submitted_at":"2018-09-21T13:46:54Z","abstract_excerpt":"The problem of two-sender unicast index coding consists of two senders and a set of receivers. Each receiver demands a unique message and possesses some of the messages demanded by other receivers as its side-information. Every demanded message is present with at least one of the senders. Senders avail the knowledge of the side-information at the receivers to reduce the number of broadcast transmissions. Solution to this problem consists of finding the optimal number of coded transmissions from the two senders. One important class of the two-sender problem consists of the messages at the sende"},"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":"1809.08116","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-21T13:46:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3f717497cc2179bf5717cc66fa87c302a48c8c7855e838fbcc6d3c5b21474d27","abstract_canon_sha256":"3cf1590819a4f21deadd67f728fb3df7e8a5045727134d3b2a5a3c8a8940a079"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:07.111517Z","signature_b64":"hQcAdDOkaJ7Zu+W3pbVfZHb6HInqg2qVFd2/v01or43P0j4lzvpiRKmB2Yeamy5x6Q6bCCP5m+p27810eyI2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80273463a33727e051c560b2c4c2c9adbeaa8e316596b9f944093f18efb17d78","last_reissued_at":"2026-05-17T23:54:07.111124Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:07.111124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimal Broadcast Rate of the Two-Sender Unicast Index Coding Problem with Fully-Participated Interactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Chinmayananda Arunachala, Vaneet Aggarwal","submitted_at":"2018-09-21T13:46:54Z","abstract_excerpt":"The problem of two-sender unicast index coding consists of two senders and a set of receivers. Each receiver demands a unique message and possesses some of the messages demanded by other receivers as its side-information. Every demanded message is present with at least one of the senders. Senders avail the knowledge of the side-information at the receivers to reduce the number of broadcast transmissions. Solution to this problem consists of finding the optimal number of coded transmissions from the two senders. One important class of the two-sender problem consists of the messages at the sende"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08116","kind":"arxiv","version":2},"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":"1809.08116","created_at":"2026-05-17T23:54:07.111182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08116v2","created_at":"2026-05-17T23:54:07.111182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08116","created_at":"2026-05-17T23:54:07.111182+00:00"},{"alias_kind":"pith_short_12","alias_value":"QATTIY5DG4T6","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QATTIY5DG4T6AUOF","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QATTIY5D","created_at":"2026-05-18T12:32:46.962924+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/QATTIY5DG4T6AUOFMCZMJQWJVW","json":"https://pith.science/pith/QATTIY5DG4T6AUOFMCZMJQWJVW.json","graph_json":"https://pith.science/api/pith-number/QATTIY5DG4T6AUOFMCZMJQWJVW/graph.json","events_json":"https://pith.science/api/pith-number/QATTIY5DG4T6AUOFMCZMJQWJVW/events.json","paper":"https://pith.science/paper/QATTIY5D"},"agent_actions":{"view_html":"https://pith.science/pith/QATTIY5DG4T6AUOFMCZMJQWJVW","download_json":"https://pith.science/pith/QATTIY5DG4T6AUOFMCZMJQWJVW.json","view_paper":"https://pith.science/paper/QATTIY5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08116&json=true","fetch_graph":"https://pith.science/api/pith-number/QATTIY5DG4T6AUOFMCZMJQWJVW/graph.json","fetch_events":"https://pith.science/api/pith-number/QATTIY5DG4T6AUOFMCZMJQWJVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QATTIY5DG4T6AUOFMCZMJQWJVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QATTIY5DG4T6AUOFMCZMJQWJVW/action/storage_attestation","attest_author":"https://pith.science/pith/QATTIY5DG4T6AUOFMCZMJQWJVW/action/author_attestation","sign_citation":"https://pith.science/pith/QATTIY5DG4T6AUOFMCZMJQWJVW/action/citation_signature","submit_replication":"https://pith.science/pith/QATTIY5DG4T6AUOFMCZMJQWJVW/action/replication_record"}},"created_at":"2026-05-17T23:54:07.111182+00:00","updated_at":"2026-05-17T23:54:07.111182+00:00"}