{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XW3TNCKL4UIJZNVLWVY3TRLGSY","short_pith_number":"pith:XW3TNCKL","schema_version":"1.0","canonical_sha256":"bdb736894be5109cb6abb571b9c566963eaf7cf38f15d1c8e93bab8ec9664f11","source":{"kind":"arxiv","id":"1107.1958","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.1958","created_at":"2026-05-18T02:21:42.976822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1958v1","created_at":"2026-05-18T02:21:42.976822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1958","created_at":"2026-05-18T02:21:42.976822+00:00"},{"alias_kind":"pith_short_12","alias_value":"XW3TNCKL4UIJ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XW3TNCKL4UIJZNVL","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XW3TNCKL","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY","json":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY.json","graph_json":"https://pith.science/api/pith-number/XW3TNCKL4UIJZNVLWVY3TRLGSY/graph.json","events_json":"https://pith.science/api/pith-number/XW3TNCKL4UIJZNVLWVY3TRLGSY/events.json","paper":"https://pith.science/paper/XW3TNCKL"},"agent_actions":{"view_html":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY","download_json":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY.json","view_paper":"https://pith.science/paper/XW3TNCKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1958&json=true","fetch_graph":"https://pith.science/api/pith-number/XW3TNCKL4UIJZNVLWVY3TRLGSY/graph.json","fetch_events":"https://pith.science/api/pith-number/XW3TNCKL4UIJZNVLWVY3TRLGSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/action/storage_attestation","attest_author":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/action/author_attestation","sign_citation":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/action/citation_signature","submit_replication":"https://pith.science/pith/XW3TNCKL4UIJZNVLWVY3TRLGSY/action/replication_record"}},"created_at":"2026-05-18T02:21:42.976822+00:00","updated_at":"2026-05-18T02:21:42.976822+00:00"}