{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VBVSZ3RECM6HIXW5SBM7H3ECUO","short_pith_number":"pith:VBVSZ3RE","canonical_record":{"source":{"id":"1810.11597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-27T04:48:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"205b51c5a974649d00c46274fdb9041678b80f1595387d6c1c8c5621cb951244","abstract_canon_sha256":"48a3d54a24d50ce0db833e535835037c2a1e01bb712e04373f8e6902781348d2"},"schema_version":"1.0"},"canonical_sha256":"a86b2cee24133c745edd9059f3ec82a3b2936dc02090d2eff70d9b03028510ab","source":{"kind":"arxiv","id":"1810.11597","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11597","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11597v2","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11597","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"VBVSZ3RECM6H","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VBVSZ3RECM6HIXW5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VBVSZ3RE","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VBVSZ3RECM6HIXW5SBM7H3ECUO","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-27T04:48:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"205b51c5a974649d00c46274fdb9041678b80f1595387d6c1c8c5621cb951244","abstract_canon_sha256":"48a3d54a24d50ce0db833e535835037c2a1e01bb712e04373f8e6902781348d2"},"schema_version":"1.0"},"canonical_sha256":"a86b2cee24133c745edd9059f3ec82a3b2936dc02090d2eff70d9b03028510ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:05.125388Z","signature_b64":"JDUPWMTZmvoCIUqEVA2NoeKCiuB5rZaEfnAl0HoQLcnIhjCpsF4QQo969Pf268n+eaOn1F+R2EymSIArHu3gBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a86b2cee24133c745edd9059f3ec82a3b2936dc02090d2eff70d9b03028510ab","last_reissued_at":"2026-05-17T23:56:05.124787Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:05.124787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11597","source_version":2,"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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9VfPkEWnlzJO4hnK+Ic52PbIllyJbiFhnz7Z1zyeFPdhHJKNJE9+/ShP/1SfaowQ0rnaYvX4F6xEYDLiVRqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:11:07.469555Z"},"content_sha256":"d7fd9b81517273c4fa8afc5d5f45c1d4b36016e6f3ddb04b1d21f720e1a4b0e1","schema_version":"1.0","event_id":"sha256:d7fd9b81517273c4fa8afc5d5f45c1d4b36016e6f3ddb04b1d21f720e1a4b0e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VBVSZ3RECM6HIXW5SBM7H3ECUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Groupcast Index Coding Problem: Joint Extensions","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","submitted_at":"2018-10-27T04:48:14Z","abstract_excerpt":"The groupcast index coding problem is the most general version of the classical index coding problem, where any receiver can demand messages that are also demanded by other receivers. Any groupcast index coding problem is described by its \\emph{fitting matrix} which contains unknown entries along with $1$'s and $0$'s. The problem of finding an optimal scalar linear code is equivalent to completing this matrix with known entries such that the rank of the resulting matrix is minimized. Any row basis of such a completion gives an optimal \\emph{scalar linear} code. An index coding problem is said "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11597","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"},"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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGqYAEStyLzagnkg7zPWFLfTpGAxBawgvSuYhpTczGjVmmKZ+hAf/cpqi4MnfvAwADPiipbWJAuOghUPuDgqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:11:07.469903Z"},"content_sha256":"d068cf90d7ee0f9e2f468f8d6a8a4038f687d62d816d4f0e5a4eb31f4f48db26","schema_version":"1.0","event_id":"sha256:d068cf90d7ee0f9e2f468f8d6a8a4038f687d62d816d4f0e5a4eb31f4f48db26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBVSZ3RECM6HIXW5SBM7H3ECUO/bundle.json","state_url":"https://pith.science/pith/VBVSZ3RECM6HIXW5SBM7H3ECUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBVSZ3RECM6HIXW5SBM7H3ECUO/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:11:07Z","links":{"resolver":"https://pith.science/pith/VBVSZ3RECM6HIXW5SBM7H3ECUO","bundle":"https://pith.science/pith/VBVSZ3RECM6HIXW5SBM7H3ECUO/bundle.json","state":"https://pith.science/pith/VBVSZ3RECM6HIXW5SBM7H3ECUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBVSZ3RECM6HIXW5SBM7H3ECUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VBVSZ3RECM6HIXW5SBM7H3ECUO","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":"48a3d54a24d50ce0db833e535835037c2a1e01bb712e04373f8e6902781348d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-27T04:48:14Z","title_canon_sha256":"205b51c5a974649d00c46274fdb9041678b80f1595387d6c1c8c5621cb951244"},"schema_version":"1.0","source":{"id":"1810.11597","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11597","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11597v2","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11597","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"VBVSZ3RECM6H","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VBVSZ3RECM6HIXW5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VBVSZ3RE","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:d068cf90d7ee0f9e2f468f8d6a8a4038f687d62d816d4f0e5a4eb31f4f48db26","target":"graph","created_at":"2026-05-17T23:56:05Z","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 groupcast index coding problem is the most general version of the classical index coding problem, where any receiver can demand messages that are also demanded by other receivers. Any groupcast index coding problem is described by its \\emph{fitting matrix} which contains unknown entries along with $1$'s and $0$'s. The problem of finding an optimal scalar linear code is equivalent to completing this matrix with known entries such that the rank of the resulting matrix is minimized. Any row basis of such a completion gives an optimal \\emph{scalar linear} code. An index coding problem is said ","authors_text":"B. Sundar Rajan, Chinmayananda Arunachala","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-27T04:48:14Z","title":"Groupcast Index Coding Problem: Joint Extensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11597","kind":"arxiv","version":2},"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:d7fd9b81517273c4fa8afc5d5f45c1d4b36016e6f3ddb04b1d21f720e1a4b0e1","target":"record","created_at":"2026-05-17T23:56:05Z","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":"48a3d54a24d50ce0db833e535835037c2a1e01bb712e04373f8e6902781348d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-27T04:48:14Z","title_canon_sha256":"205b51c5a974649d00c46274fdb9041678b80f1595387d6c1c8c5621cb951244"},"schema_version":"1.0","source":{"id":"1810.11597","kind":"arxiv","version":2}},"canonical_sha256":"a86b2cee24133c745edd9059f3ec82a3b2936dc02090d2eff70d9b03028510ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a86b2cee24133c745edd9059f3ec82a3b2936dc02090d2eff70d9b03028510ab","first_computed_at":"2026-05-17T23:56:05.124787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:05.124787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JDUPWMTZmvoCIUqEVA2NoeKCiuB5rZaEfnAl0HoQLcnIhjCpsF4QQo969Pf268n+eaOn1F+R2EymSIArHu3gBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:05.125388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11597","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7fd9b81517273c4fa8afc5d5f45c1d4b36016e6f3ddb04b1d21f720e1a4b0e1","sha256:d068cf90d7ee0f9e2f468f8d6a8a4038f687d62d816d4f0e5a4eb31f4f48db26"],"state_sha256":"759b68399742727f23cbfd24ad29c62a30ec87c3f1543eddc7f70b9f875c4aa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vkLXWiPAARMn+aem+6g8FdBWWS3RucjAPvIMdS0A5IROFNU/4XL+YNqMBE1ZkisYHXqWH0gGXs6DP/hVvPOaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:11:07.471904Z","bundle_sha256":"52526e439fe54e35105101078fc8c97996f93c7f63725df582ecbb9fe35c60aa"}}