{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JVASQUY66IMPI2T7DD44PUQGLX","short_pith_number":"pith:JVASQUY6","canonical_record":{"source":{"id":"1510.05435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T11:44:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cdb1320e92864c340f7dc30614ffc08473b582b5c2a655278cc95659d299487","abstract_canon_sha256":"2aca89e6e2a939f1d69c7c675c4ab53284cfbefe2ffbe2a10227841cfff90926"},"schema_version":"1.0"},"canonical_sha256":"4d4128531ef218f46a7f18f9c7d2065dd2ab7530b2f469cf6f0de99d6e04fd14","source":{"kind":"arxiv","id":"1510.05435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05435","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05435v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05435","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"JVASQUY66IMP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JVASQUY66IMPI2T7","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JVASQUY6","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JVASQUY66IMPI2T7DD44PUQGLX","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T11:44:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cdb1320e92864c340f7dc30614ffc08473b582b5c2a655278cc95659d299487","abstract_canon_sha256":"2aca89e6e2a939f1d69c7c675c4ab53284cfbefe2ffbe2a10227841cfff90926"},"schema_version":"1.0"},"canonical_sha256":"4d4128531ef218f46a7f18f9c7d2065dd2ab7530b2f469cf6f0de99d6e04fd14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:52.319697Z","signature_b64":"F/KorkPVu6xO7qTIRfkv5Hxgtfx8k8+uMT7yH0diMCMR05mpOZRbuY+fmOiOhyC9kQObw6cR/Mp2YaLJl7HEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d4128531ef218f46a7f18f9c7d2065dd2ab7530b2f469cf6f0de99d6e04fd14","last_reissued_at":"2026-05-18T01:29:52.319194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:52.319194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05435","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-18T01:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jd2sYJbIy++CXxvm2/09kHlv1JNyVPLqKLK8bsMQSe0hJVcx7fgWtdPtSXV3T7CETPA5sQeVvv/Nfs8kR39NAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:21:16.483108Z"},"content_sha256":"77e81f2b7f5d54dbcc57d9a775d446ad3a2d5ed4b93b209abfdb26b4f910d3e9","schema_version":"1.0","event_id":"sha256:77e81f2b7f5d54dbcc57d9a775d446ad3a2d5ed4b93b209abfdb26b4f910d3e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JVASQUY66IMPI2T7DD44PUQGLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Scalar Linear Index Codes for Some Symmetric Multiple Unicast Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Mahesh Babu Vaddi, Roop Kumar Bhattaram","submitted_at":"2015-10-19T11:44:24Z","abstract_excerpt":"The capacity of symmetric instance of the multiple unicast index coding problem with neighboring antidotes (side-information) with number of messages equal to the number of receivers was given by Maleki, Cadambe and Jafar. In this paper we consider ten symmetric multiple unicast problems with lesser antidotes than considered by them and explicitly construct scalar linear codes for these problems. These codes are shown to achieve the capacity or equivalently these codes shown to be of optimal length. Also, the constructed codes enable the receivers use small number of transmissions to decode th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05435","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-18T01:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3M3fnvyW2xrLgxwSRQFeBvLd26PI6Z/x/jra427l3Kxn9fZRWzAE98dRt+Tvx4r5pBs6+kKml+WVUq3FYrSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:21:16.483459Z"},"content_sha256":"0dde7a053bf8314b04806bedb11e5aa932cc430cd87187f83c03d7f188855a2e","schema_version":"1.0","event_id":"sha256:0dde7a053bf8314b04806bedb11e5aa932cc430cd87187f83c03d7f188855a2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVASQUY66IMPI2T7DD44PUQGLX/bundle.json","state_url":"https://pith.science/pith/JVASQUY66IMPI2T7DD44PUQGLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVASQUY66IMPI2T7DD44PUQGLX/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-06-04T20:21:16Z","links":{"resolver":"https://pith.science/pith/JVASQUY66IMPI2T7DD44PUQGLX","bundle":"https://pith.science/pith/JVASQUY66IMPI2T7DD44PUQGLX/bundle.json","state":"https://pith.science/pith/JVASQUY66IMPI2T7DD44PUQGLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVASQUY66IMPI2T7DD44PUQGLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JVASQUY66IMPI2T7DD44PUQGLX","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":"2aca89e6e2a939f1d69c7c675c4ab53284cfbefe2ffbe2a10227841cfff90926","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T11:44:24Z","title_canon_sha256":"3cdb1320e92864c340f7dc30614ffc08473b582b5c2a655278cc95659d299487"},"schema_version":"1.0","source":{"id":"1510.05435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05435","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05435v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05435","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"JVASQUY66IMP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JVASQUY66IMPI2T7","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JVASQUY6","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:0dde7a053bf8314b04806bedb11e5aa932cc430cd87187f83c03d7f188855a2e","target":"graph","created_at":"2026-05-18T01:29:52Z","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 capacity of symmetric instance of the multiple unicast index coding problem with neighboring antidotes (side-information) with number of messages equal to the number of receivers was given by Maleki, Cadambe and Jafar. In this paper we consider ten symmetric multiple unicast problems with lesser antidotes than considered by them and explicitly construct scalar linear codes for these problems. These codes are shown to achieve the capacity or equivalently these codes shown to be of optimal length. Also, the constructed codes enable the receivers use small number of transmissions to decode th","authors_text":"B. Sundar Rajan, Mahesh Babu Vaddi, Roop Kumar Bhattaram","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T11:44:24Z","title":"Optimal Scalar Linear Index Codes for Some Symmetric Multiple Unicast Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05435","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:77e81f2b7f5d54dbcc57d9a775d446ad3a2d5ed4b93b209abfdb26b4f910d3e9","target":"record","created_at":"2026-05-18T01:29:52Z","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":"2aca89e6e2a939f1d69c7c675c4ab53284cfbefe2ffbe2a10227841cfff90926","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T11:44:24Z","title_canon_sha256":"3cdb1320e92864c340f7dc30614ffc08473b582b5c2a655278cc95659d299487"},"schema_version":"1.0","source":{"id":"1510.05435","kind":"arxiv","version":1}},"canonical_sha256":"4d4128531ef218f46a7f18f9c7d2065dd2ab7530b2f469cf6f0de99d6e04fd14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d4128531ef218f46a7f18f9c7d2065dd2ab7530b2f469cf6f0de99d6e04fd14","first_computed_at":"2026-05-18T01:29:52.319194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:52.319194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F/KorkPVu6xO7qTIRfkv5Hxgtfx8k8+uMT7yH0diMCMR05mpOZRbuY+fmOiOhyC9kQObw6cR/Mp2YaLJl7HEBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:52.319697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77e81f2b7f5d54dbcc57d9a775d446ad3a2d5ed4b93b209abfdb26b4f910d3e9","sha256:0dde7a053bf8314b04806bedb11e5aa932cc430cd87187f83c03d7f188855a2e"],"state_sha256":"328ac0dd1ddd588ec6c4a7a2447ec79a4d1717d9d30907e857edd9acfad81439"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oA9ViHN6a0j2SDBk7ugJlSZarXG+mZCdtBu+41sw2S+1BuaoRwYHVDwREAYOoDZdhrMODRdkgTwh9esPEj5sBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:21:16.485734Z","bundle_sha256":"6990c5c2efab6c5207a812037dc012d043f6df2d8649bc40af7368a32a5d112b"}}