{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V4UGB27ECOIGWXQPIJRHGLXN7N","short_pith_number":"pith:V4UGB27E","canonical_record":{"source":{"id":"1511.00542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-02T15:20:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2b872d1a915a6d38d34d27b5a935c55025103f9bc830d1af64f39a527d8b3c96","abstract_canon_sha256":"aa51c8691b93f98710617ba7618acf74a6421f67c8b8a18c2b89dfdd5f360a0d"},"schema_version":"1.0"},"canonical_sha256":"af2860ebe413906b5e0f4262732eedfb46bcec14106bf555b0cf26bba2ad73f1","source":{"kind":"arxiv","id":"1511.00542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00542","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00542v1","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00542","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"V4UGB27ECOIG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V4UGB27ECOIGWXQP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V4UGB27E","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V4UGB27ECOIGWXQPIJRHGLXN7N","target":"record","payload":{"canonical_record":{"source":{"id":"1511.00542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-02T15:20:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2b872d1a915a6d38d34d27b5a935c55025103f9bc830d1af64f39a527d8b3c96","abstract_canon_sha256":"aa51c8691b93f98710617ba7618acf74a6421f67c8b8a18c2b89dfdd5f360a0d"},"schema_version":"1.0"},"canonical_sha256":"af2860ebe413906b5e0f4262732eedfb46bcec14106bf555b0cf26bba2ad73f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:24.730844Z","signature_b64":"QuCIdaKnhmkQ8sXHpQQUQBzCmzkgObOT4tqZoKQ8bXuAm9Fldn+DTuhpHeDQYLE6cDXBQq9oFOvv5q8xMyS7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af2860ebe413906b5e0f4262732eedfb46bcec14106bf555b0cf26bba2ad73f1","last_reissued_at":"2026-05-18T01:26:24.730431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:24.730431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.00542","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:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYpJhoQIj2L0JrUeqjaf561xrfCCPBFV+xq95+hv51P0Zo/e1XxuU/1yI+TUcNys8walerT03GTu2NiGW26bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:19:45.701146Z"},"content_sha256":"0f8c781f485e7f70855e41168d8417ca4aff8ad83feb15b19d8a17cecebb32e4","schema_version":"1.0","event_id":"sha256:0f8c781f485e7f70855e41168d8417ca4aff8ad83feb15b19d8a17cecebb32e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V4UGB27ECOIGWXQPIJRHGLXN7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Vector Linear Index Codes for Some Symmetric Side Information 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","submitted_at":"2015-11-02T15:20:11Z","abstract_excerpt":"This paper deals with vector linear index codes for multiple unicast index coding problems where there is a source with K messages and there are K receivers each wanting a unique message and having symmetric (with respect to the receiver index) two-sided antidotes (side information). Optimal scalar linear index codes for several such instances of this class of problems for one-sided antidotes(not necessarily adjacent) have already been reported. These codes can be viewed as special cases of the symmetric unicast index coding problems discussed by Maleki, Cadambe and Jafar with one sided adjace"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00542","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:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L14OPnBbqKVi1bGo2hW+DcXQrH6xZli1Bn06iLhjr6IwnR3SRlSritGwtExIXsGge0ghCX7pOxGg0JV1yQPCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:19:45.701514Z"},"content_sha256":"c7bfa02fd4d79e9f1ef35041c6f02d121d7cc3c3d1a9ed984b750a653135c3eb","schema_version":"1.0","event_id":"sha256:c7bfa02fd4d79e9f1ef35041c6f02d121d7cc3c3d1a9ed984b750a653135c3eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4UGB27ECOIGWXQPIJRHGLXN7N/bundle.json","state_url":"https://pith.science/pith/V4UGB27ECOIGWXQPIJRHGLXN7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4UGB27ECOIGWXQPIJRHGLXN7N/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-04T17:19:45Z","links":{"resolver":"https://pith.science/pith/V4UGB27ECOIGWXQPIJRHGLXN7N","bundle":"https://pith.science/pith/V4UGB27ECOIGWXQPIJRHGLXN7N/bundle.json","state":"https://pith.science/pith/V4UGB27ECOIGWXQPIJRHGLXN7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4UGB27ECOIGWXQPIJRHGLXN7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V4UGB27ECOIGWXQPIJRHGLXN7N","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":"aa51c8691b93f98710617ba7618acf74a6421f67c8b8a18c2b89dfdd5f360a0d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-02T15:20:11Z","title_canon_sha256":"2b872d1a915a6d38d34d27b5a935c55025103f9bc830d1af64f39a527d8b3c96"},"schema_version":"1.0","source":{"id":"1511.00542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00542","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00542v1","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00542","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"V4UGB27ECOIG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V4UGB27ECOIGWXQP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V4UGB27E","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:c7bfa02fd4d79e9f1ef35041c6f02d121d7cc3c3d1a9ed984b750a653135c3eb","target":"graph","created_at":"2026-05-18T01:26:24Z","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":"This paper deals with vector linear index codes for multiple unicast index coding problems where there is a source with K messages and there are K receivers each wanting a unique message and having symmetric (with respect to the receiver index) two-sided antidotes (side information). Optimal scalar linear index codes for several such instances of this class of problems for one-sided antidotes(not necessarily adjacent) have already been reported. These codes can be viewed as special cases of the symmetric unicast index coding problems discussed by Maleki, Cadambe and Jafar with one sided adjace","authors_text":"B. Sundar Rajan, Mahesh Babu Vaddi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-02T15:20:11Z","title":"Optimal Vector Linear Index Codes for Some Symmetric Side Information Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00542","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:0f8c781f485e7f70855e41168d8417ca4aff8ad83feb15b19d8a17cecebb32e4","target":"record","created_at":"2026-05-18T01:26:24Z","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":"aa51c8691b93f98710617ba7618acf74a6421f67c8b8a18c2b89dfdd5f360a0d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-02T15:20:11Z","title_canon_sha256":"2b872d1a915a6d38d34d27b5a935c55025103f9bc830d1af64f39a527d8b3c96"},"schema_version":"1.0","source":{"id":"1511.00542","kind":"arxiv","version":1}},"canonical_sha256":"af2860ebe413906b5e0f4262732eedfb46bcec14106bf555b0cf26bba2ad73f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af2860ebe413906b5e0f4262732eedfb46bcec14106bf555b0cf26bba2ad73f1","first_computed_at":"2026-05-18T01:26:24.730431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:24.730431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QuCIdaKnhmkQ8sXHpQQUQBzCmzkgObOT4tqZoKQ8bXuAm9Fldn+DTuhpHeDQYLE6cDXBQq9oFOvv5q8xMyS7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:24.730844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.00542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f8c781f485e7f70855e41168d8417ca4aff8ad83feb15b19d8a17cecebb32e4","sha256:c7bfa02fd4d79e9f1ef35041c6f02d121d7cc3c3d1a9ed984b750a653135c3eb"],"state_sha256":"a9082b55efe65abd9ccdca6c41a3c9181a1027338575ae03b90586a7c58417b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtYOLakRmEILrOPZzM5gPtJMqp8KEzISOnriWthFudAAhLehEgbCjie6AF/TR7AJMSoVWW3ONIBA4ojqnQcABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:19:45.703511Z","bundle_sha256":"84cacb06fa3729f079ecb88db9d02a9fce06ad78a3fd058fb94cbf88061d1bac"}}