{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XW3TNCKL4UIJZNVLWVY3TRLGSY","short_pith_number":"pith:XW3TNCKL","canonical_record":{"source":{"id":"1107.1958","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2011-07-11T08:20:46Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"57329beb73bf413f7541c515799978afb688814fd6a789e8660c16a1339ba962","abstract_canon_sha256":"19dcfc99cb4dc8800a62392f3211ff9c13aba7c0ceea731f39d359f8cee86251"},"schema_version":"1.0"},"canonical_sha256":"bdb736894be5109cb6abb571b9c566963eaf7cf38f15d1c8e93bab8ec9664f11","source":{"kind":"arxiv","id":"1107.1958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1958","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1958v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1958","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"XW3TNCKL4UIJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XW3TNCKL4UIJZNVL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XW3TNCKL","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XW3TNCKL4UIJZNVLWVY3TRLGSY","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1958","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2011-07-11T08:20:46Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"57329beb73bf413f7541c515799978afb688814fd6a789e8660c16a1339ba962","abstract_canon_sha256":"19dcfc99cb4dc8800a62392f3211ff9c13aba7c0ceea731f39d359f8cee86251"},"schema_version":"1.0"},"canonical_sha256":"bdb736894be5109cb6abb571b9c566963eaf7cf38f15d1c8e93bab8ec9664f11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.977299Z","signature_b64":"ceN4ABXKdsiFgIh1HPY9ZSc1ypwruMV9MiNm7e4iYvyampg/F/nApEtoT/exSTEX7ubtGwne9nByPZ2QYw+8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdb736894be5109cb6abb571b9c566963eaf7cf38f15d1c8e93bab8ec9664f11","last_reissued_at":"2026-05-18T02:21:42.976741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.976741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1958","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-18T02:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4lFb80bn48oq5xPTJPPqhBJC1fQVsJyo0dHtYSmgicAPDuM25cF+nyvtyAtM7ZDYRdjfrCY78mW/tQQ1NkDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:39:57.665343Z"},"content_sha256":"98b5b900562388b02ced6ec0831cde18f407136e99149164c8618aaa4f137466","schema_version":"1.0","event_id":"sha256:98b5b900562388b02ced6ec0831cde18f407136e99149164c8618aaa4f137466"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XW3TNCKL4UIJZNVLWVY3TRLGSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Index Coding via Semidefinite Programming","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Eden Chlamtac, Ishay Haviv","submitted_at":"2011-07-11T08:20:46Z","abstract_excerpt":"In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is known to be equal to a graph parameter called minrank (Bar-Yossef et al., FOCS, 2006).\n  We show a polynomial time algorithm that, given an n vertex graph G with minrank k, finds a linear index code for G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1958","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-18T02:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RH4juqnrM1H17RaX/OB+TcUVraJ5A6xTyqgJvuZX2T57Yvk+yzH+75AHNFs7o6FeNzRFdsmjYl//6djm/T/kAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:39:57.665929Z"},"content_sha256":"b82029ae07bcced3f6ae971baff07fae195e92907395e37f48bf9020312ee7c8","schema_version":"1.0","event_id":"sha256:b82029ae07bcced3f6ae971baff07fae195e92907395e37f48bf9020312ee7c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/bundle.json","state_url":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/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-10T23:39:57Z","links":{"resolver":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY","bundle":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/bundle.json","state":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XW3TNCKL4UIJZNVLWVY3TRLGSY","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":"19dcfc99cb4dc8800a62392f3211ff9c13aba7c0ceea731f39d359f8cee86251","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2011-07-11T08:20:46Z","title_canon_sha256":"57329beb73bf413f7541c515799978afb688814fd6a789e8660c16a1339ba962"},"schema_version":"1.0","source":{"id":"1107.1958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1958","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1958v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1958","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"XW3TNCKL4UIJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XW3TNCKL4UIJZNVL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XW3TNCKL","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:b82029ae07bcced3f6ae971baff07fae195e92907395e37f48bf9020312ee7c8","target":"graph","created_at":"2026-05-18T02:21:42Z","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":"In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is known to be equal to a graph parameter called minrank (Bar-Yossef et al., FOCS, 2006).\n  We show a polynomial time algorithm that, given an n vertex graph G with minrank k, finds a linear index code for G","authors_text":"Eden Chlamtac, Ishay Haviv","cross_cats":["cs.DM","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2011-07-11T08:20:46Z","title":"Linear Index Coding via Semidefinite Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1958","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:98b5b900562388b02ced6ec0831cde18f407136e99149164c8618aaa4f137466","target":"record","created_at":"2026-05-18T02:21:42Z","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":"19dcfc99cb4dc8800a62392f3211ff9c13aba7c0ceea731f39d359f8cee86251","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2011-07-11T08:20:46Z","title_canon_sha256":"57329beb73bf413f7541c515799978afb688814fd6a789e8660c16a1339ba962"},"schema_version":"1.0","source":{"id":"1107.1958","kind":"arxiv","version":1}},"canonical_sha256":"bdb736894be5109cb6abb571b9c566963eaf7cf38f15d1c8e93bab8ec9664f11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdb736894be5109cb6abb571b9c566963eaf7cf38f15d1c8e93bab8ec9664f11","first_computed_at":"2026-05-18T02:21:42.976741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:42.976741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ceN4ABXKdsiFgIh1HPY9ZSc1ypwruMV9MiNm7e4iYvyampg/F/nApEtoT/exSTEX7ubtGwne9nByPZ2QYw+8Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:42.977299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98b5b900562388b02ced6ec0831cde18f407136e99149164c8618aaa4f137466","sha256:b82029ae07bcced3f6ae971baff07fae195e92907395e37f48bf9020312ee7c8"],"state_sha256":"77ee9f3e52e0ae1ba317346aa4c2ab8c960e9987abed4857210f73b42e04f110"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RIYCRbbQLHrtOaWrregQzE+artsFZ+IePPNsSdjYkE+sA/77ocWJ2/Zu1x2YDqhNiDQplw9+zBBQn6q3GCbkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:39:57.669208Z","bundle_sha256":"35d11af62effd2b08f754873e038094ea589d16a445903a29987e9f103ba06fc"}}