{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5ZYI7C5XMPXSMJJ2WSHCN6H55G","short_pith_number":"pith:5ZYI7C5X","canonical_record":{"source":{"id":"1704.00687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T17:07:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f6f27716b4426d24e32d86936c0cdd2391cd308f9a6725d09967035e9290362","abstract_canon_sha256":"40b58649356f1d2fa71aaf5da97391141ab40cfaf97c410397f3aac408a61377"},"schema_version":"1.0"},"canonical_sha256":"ee708f8bb763ef26253ab48e26f8fde993466b86ce25efa6266bb4907e59309d","source":{"kind":"arxiv","id":"1704.00687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00687","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00687v1","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00687","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"5ZYI7C5XMPXS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5ZYI7C5XMPXSMJJ2","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5ZYI7C5X","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5ZYI7C5XMPXSMJJ2WSHCN6H55G","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T17:07:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f6f27716b4426d24e32d86936c0cdd2391cd308f9a6725d09967035e9290362","abstract_canon_sha256":"40b58649356f1d2fa71aaf5da97391141ab40cfaf97c410397f3aac408a61377"},"schema_version":"1.0"},"canonical_sha256":"ee708f8bb763ef26253ab48e26f8fde993466b86ce25efa6266bb4907e59309d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:21.606283Z","signature_b64":"ICiBzkkRC/qpUa6kNY2rTW0ORJ48DkeDmyrxj1uJ0QbUzoxSqK3IZzdZB7h8Vbz0shzB4N2hY3eO+n3MczZWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee708f8bb763ef26253ab48e26f8fde993466b86ce25efa6266bb4907e59309d","last_reissued_at":"2026-05-18T00:47:21.605630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:21.605630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00687","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-18T00:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8P1XuWiBqW+v2HWrL7Q+Wn26by15NHkPKUX++VZ6jbtUxyf4bWxegj49A3hMzEM65NuZlPYDxvy0sZ9TGbsGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:45:09.533829Z"},"content_sha256":"69a68ddfee24d602fc3d1295bfff46dbc8e28ae46c3882955eabf1aa060c21fa","schema_version":"1.0","event_id":"sha256:69a68ddfee24d602fc3d1295bfff46dbc8e28ae46c3882955eabf1aa060c21fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5ZYI7C5XMPXSMJJ2WSHCN6H55G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Index Coding: Rank-Invariant Extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashok Choudhary, Prasad Krishnan, Vamsi Krishna Gummadi","submitted_at":"2017-04-03T17:07:02Z","abstract_excerpt":"An index coding (IC) problem consisting of a server and multiple receivers with different side-information and demand sets can be equivalently represented using a fitting matrix. A scalar linear index code to a given IC problem is a matrix representing the transmitted linear combinations of the message symbols. The length of an index code is then the number of transmissions (or equivalently, the number of rows in the index code). An IC problem ${\\cal I}_{ext}$ is called an extension of another IC problem ${\\cal I}$ if the fitting matrix of ${\\cal I}$ is a submatrix of the fitting matrix of ${\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00687","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-18T00:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iL+zEqiBnIv/cFxUIaqTt6MrKKL9kixLI9FfYJqwIYMhu90nukDBWP16Lmyu1npqR6kpdBkcpOBE3BUwgsELCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:45:09.534179Z"},"content_sha256":"330202ba249b1011b07d01a0feca07404c0df19578692986599fbed13486d0c9","schema_version":"1.0","event_id":"sha256:330202ba249b1011b07d01a0feca07404c0df19578692986599fbed13486d0c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZYI7C5XMPXSMJJ2WSHCN6H55G/bundle.json","state_url":"https://pith.science/pith/5ZYI7C5XMPXSMJJ2WSHCN6H55G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZYI7C5XMPXSMJJ2WSHCN6H55G/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-23T15:45:09Z","links":{"resolver":"https://pith.science/pith/5ZYI7C5XMPXSMJJ2WSHCN6H55G","bundle":"https://pith.science/pith/5ZYI7C5XMPXSMJJ2WSHCN6H55G/bundle.json","state":"https://pith.science/pith/5ZYI7C5XMPXSMJJ2WSHCN6H55G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZYI7C5XMPXSMJJ2WSHCN6H55G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5ZYI7C5XMPXSMJJ2WSHCN6H55G","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":"40b58649356f1d2fa71aaf5da97391141ab40cfaf97c410397f3aac408a61377","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T17:07:02Z","title_canon_sha256":"7f6f27716b4426d24e32d86936c0cdd2391cd308f9a6725d09967035e9290362"},"schema_version":"1.0","source":{"id":"1704.00687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00687","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00687v1","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00687","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"5ZYI7C5XMPXS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5ZYI7C5XMPXSMJJ2","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5ZYI7C5X","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:330202ba249b1011b07d01a0feca07404c0df19578692986599fbed13486d0c9","target":"graph","created_at":"2026-05-18T00:47:21Z","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":"An index coding (IC) problem consisting of a server and multiple receivers with different side-information and demand sets can be equivalently represented using a fitting matrix. A scalar linear index code to a given IC problem is a matrix representing the transmitted linear combinations of the message symbols. The length of an index code is then the number of transmissions (or equivalently, the number of rows in the index code). An IC problem ${\\cal I}_{ext}$ is called an extension of another IC problem ${\\cal I}$ if the fitting matrix of ${\\cal I}$ is a submatrix of the fitting matrix of ${\\","authors_text":"Ashok Choudhary, Prasad Krishnan, Vamsi Krishna Gummadi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T17:07:02Z","title":"Index Coding: Rank-Invariant Extensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00687","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:69a68ddfee24d602fc3d1295bfff46dbc8e28ae46c3882955eabf1aa060c21fa","target":"record","created_at":"2026-05-18T00:47:21Z","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":"40b58649356f1d2fa71aaf5da97391141ab40cfaf97c410397f3aac408a61377","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T17:07:02Z","title_canon_sha256":"7f6f27716b4426d24e32d86936c0cdd2391cd308f9a6725d09967035e9290362"},"schema_version":"1.0","source":{"id":"1704.00687","kind":"arxiv","version":1}},"canonical_sha256":"ee708f8bb763ef26253ab48e26f8fde993466b86ce25efa6266bb4907e59309d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee708f8bb763ef26253ab48e26f8fde993466b86ce25efa6266bb4907e59309d","first_computed_at":"2026-05-18T00:47:21.605630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:21.605630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ICiBzkkRC/qpUa6kNY2rTW0ORJ48DkeDmyrxj1uJ0QbUzoxSqK3IZzdZB7h8Vbz0shzB4N2hY3eO+n3MczZWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:21.606283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69a68ddfee24d602fc3d1295bfff46dbc8e28ae46c3882955eabf1aa060c21fa","sha256:330202ba249b1011b07d01a0feca07404c0df19578692986599fbed13486d0c9"],"state_sha256":"02226293c64e92539a7e8c6d3e4e07d821647b986ec7fe1914422467c436d983"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HO+jXC46eAY9S6Ws1YOJuE4VFcmoPqETmVYJpGsqpfPc2kL8FvL4oav6h7GJY9kh5223Y+x4HI0IQDTAJ75rBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:45:09.536135Z","bundle_sha256":"615da4d33fef8c1d27b4c9f40897334d7f771a1280b1eb59a0053431a4c01b40"}}