{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W5D64QTG32Q6QCVG3437IXLOPS","short_pith_number":"pith:W5D64QTG","canonical_record":{"source":{"id":"1510.08592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-29T08:11:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8baac62dd7e50fb9473ba77d88da71a4a869c134a88de94dd0959c227f0837b4","abstract_canon_sha256":"1f830373da3ac0a58bfc7afbee18a9736076cc118c0bd7f67520d35d0b911079"},"schema_version":"1.0"},"canonical_sha256":"b747ee4266dea1e80aa6df37f45d6e7cbe8d8c52c387e4cc0ac25a8e019085df","source":{"kind":"arxiv","id":"1510.08592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08592","created_at":"2026-05-18T01:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08592v1","created_at":"2026-05-18T01:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08592","created_at":"2026-05-18T01:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"W5D64QTG32Q6","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W5D64QTG32Q6QCVG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W5D64QTG","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W5D64QTG32Q6QCVG3437IXLOPS","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-29T08:11:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8baac62dd7e50fb9473ba77d88da71a4a869c134a88de94dd0959c227f0837b4","abstract_canon_sha256":"1f830373da3ac0a58bfc7afbee18a9736076cc118c0bd7f67520d35d0b911079"},"schema_version":"1.0"},"canonical_sha256":"b747ee4266dea1e80aa6df37f45d6e7cbe8d8c52c387e4cc0ac25a8e019085df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:28.373136Z","signature_b64":"qOx36vZ5UrD1Tuk6tOjZfkMRHEYT1rylX1caxh+SLMrnEK1LjghdCas6ToU7LusXuofPwPYeQiuUn65pMk6iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b747ee4266dea1e80aa6df37f45d6e7cbe8d8c52c387e4cc0ac25a8e019085df","last_reissued_at":"2026-05-18T01:28:28.372481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:28.372481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08592","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyNSfKgsCT7hHIgIqg8+UPGb57AnjBNi9013IWwglk3WiTEdGzPDVeZPlZUkWcp9zVhNc2DsZJ3/AI+qIidODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:45:39.224568Z"},"content_sha256":"55705bad14e7f53d646cb2cafc41c83e589ab09b8adf44904e618dd4e8811fd2","schema_version":"1.0","event_id":"sha256:55705bad14e7f53d646cb2cafc41c83e589ab09b8adf44904e618dd4e8811fd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W5D64QTG32Q6QCVG3437IXLOPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lifting Construction for Scalar Linear Index Codes","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-29T08:11:04Z","abstract_excerpt":"This paper deals with scalar linear index codes for canonical 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) antidotes (side information). Optimal scalar linear index codes for several such instances of this class of problems have been reported in \\cite{MRRarXiv}. These codes can be viewed as special cases of the symmetric unicast index coding problems discussed in \\cite{MCJ}. In this paper a lifting construction is given which constructs a sequence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08592","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyh2v2grgi5WtcWGFk5+53lLXt3t5flkd5Jz19EUBg2Xmh4zL+couzy9f+Z/UiqKR/YATzGntrYH1smjyDmYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:45:39.224942Z"},"content_sha256":"30765724a07030d9131ef01391225e7728892f18a26913e9ef3f4d3ac47d3f4a","schema_version":"1.0","event_id":"sha256:30765724a07030d9131ef01391225e7728892f18a26913e9ef3f4d3ac47d3f4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5D64QTG32Q6QCVG3437IXLOPS/bundle.json","state_url":"https://pith.science/pith/W5D64QTG32Q6QCVG3437IXLOPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5D64QTG32Q6QCVG3437IXLOPS/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-05T16:45:39Z","links":{"resolver":"https://pith.science/pith/W5D64QTG32Q6QCVG3437IXLOPS","bundle":"https://pith.science/pith/W5D64QTG32Q6QCVG3437IXLOPS/bundle.json","state":"https://pith.science/pith/W5D64QTG32Q6QCVG3437IXLOPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5D64QTG32Q6QCVG3437IXLOPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W5D64QTG32Q6QCVG3437IXLOPS","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":"1f830373da3ac0a58bfc7afbee18a9736076cc118c0bd7f67520d35d0b911079","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-29T08:11:04Z","title_canon_sha256":"8baac62dd7e50fb9473ba77d88da71a4a869c134a88de94dd0959c227f0837b4"},"schema_version":"1.0","source":{"id":"1510.08592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08592","created_at":"2026-05-18T01:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08592v1","created_at":"2026-05-18T01:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08592","created_at":"2026-05-18T01:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"W5D64QTG32Q6","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W5D64QTG32Q6QCVG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W5D64QTG","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:30765724a07030d9131ef01391225e7728892f18a26913e9ef3f4d3ac47d3f4a","target":"graph","created_at":"2026-05-18T01:28:28Z","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 scalar linear index codes for canonical 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) antidotes (side information). Optimal scalar linear index codes for several such instances of this class of problems have been reported in \\cite{MRRarXiv}. These codes can be viewed as special cases of the symmetric unicast index coding problems discussed in \\cite{MCJ}. In this paper a lifting construction is given which constructs a sequence ","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-29T08:11:04Z","title":"A Lifting Construction for Scalar Linear Index Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08592","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:55705bad14e7f53d646cb2cafc41c83e589ab09b8adf44904e618dd4e8811fd2","target":"record","created_at":"2026-05-18T01:28:28Z","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":"1f830373da3ac0a58bfc7afbee18a9736076cc118c0bd7f67520d35d0b911079","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-29T08:11:04Z","title_canon_sha256":"8baac62dd7e50fb9473ba77d88da71a4a869c134a88de94dd0959c227f0837b4"},"schema_version":"1.0","source":{"id":"1510.08592","kind":"arxiv","version":1}},"canonical_sha256":"b747ee4266dea1e80aa6df37f45d6e7cbe8d8c52c387e4cc0ac25a8e019085df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b747ee4266dea1e80aa6df37f45d6e7cbe8d8c52c387e4cc0ac25a8e019085df","first_computed_at":"2026-05-18T01:28:28.372481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:28.372481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qOx36vZ5UrD1Tuk6tOjZfkMRHEYT1rylX1caxh+SLMrnEK1LjghdCas6ToU7LusXuofPwPYeQiuUn65pMk6iDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:28.373136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55705bad14e7f53d646cb2cafc41c83e589ab09b8adf44904e618dd4e8811fd2","sha256:30765724a07030d9131ef01391225e7728892f18a26913e9ef3f4d3ac47d3f4a"],"state_sha256":"e22d2107b8c4ccf3849fae37b8963c34c0944e6c01030b07d9b7335cfcb8db35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHIYY4rCslTRpfTxgyBFXLzNqTvxA4HSdKy736WK0kw5BOl/YY3Msq5S11ljXe9IsgqpfXEtzX6Dbc+Rze1UAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:45:39.226938Z","bundle_sha256":"d20818e079e7670f5cdb14a028b51b677ee121d1a661bbfdc1b8ec413415fd69"}}