{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N3EB45YAI2O3MYGAJALOLJHWII","short_pith_number":"pith:N3EB45YA","schema_version":"1.0","canonical_sha256":"6ec81e7700469db660c04816e5a4f64229dd671d82f8728067cebc8a1b498ab8","source":{"kind":"arxiv","id":"1402.3898","version":1},"attestation_state":"computed","paper":{"title":"Graph Theory versus Minimum Rank for Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Michael Langberg","submitted_at":"2014-02-17T05:46:43Z","abstract_excerpt":"We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far. Further, we establish a rather strong negative result: all known graph theoretic bounds are within a logarithmic factor from the chromatic number. This is in striking contrast to minrank since prior work has shown that it can outperform the chromatic number by a polynomial factor in some cases. The conclusion is that all known graph theoretic bounds are not much stronger than the chromatic number."},"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":"1402.3898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-17T05:46:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4a0ae9c8b3ce763b5b6b4e4ef9b799ca802be6249627b098cb9c1ed205630f2a","abstract_canon_sha256":"8dca11be31f0ed6077c52763315f87bfe1b509b86e73f02f5c0cf2cd578f705a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:55.260179Z","signature_b64":"tXOwfccoJ/r8iK5JgW9dc7mFMFHIecR7GzwVqTyQnXKw6PqED68rELHorfDsS3Y1NcGBcqMLMGsQlXyL6ZvjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec81e7700469db660c04816e5a4f64229dd671d82f8728067cebc8a1b498ab8","last_reissued_at":"2026-05-18T02:58:55.259642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:55.259642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Theory versus Minimum Rank for Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Michael Langberg","submitted_at":"2014-02-17T05:46:43Z","abstract_excerpt":"We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far. Further, we establish a rather strong negative result: all known graph theoretic bounds are within a logarithmic factor from the chromatic number. This is in striking contrast to minrank since prior work has shown that it can outperform the chromatic number by a polynomial factor in some cases. The conclusion is that all known graph theoretic bounds are not much stronger than the chromatic number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3898","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":"1402.3898","created_at":"2026-05-18T02:58:55.259725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3898v1","created_at":"2026-05-18T02:58:55.259725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3898","created_at":"2026-05-18T02:58:55.259725+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3EB45YAI2O3","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3EB45YAI2O3MYGA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3EB45YA","created_at":"2026-05-18T12:28:41.024544+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/N3EB45YAI2O3MYGAJALOLJHWII","json":"https://pith.science/pith/N3EB45YAI2O3MYGAJALOLJHWII.json","graph_json":"https://pith.science/api/pith-number/N3EB45YAI2O3MYGAJALOLJHWII/graph.json","events_json":"https://pith.science/api/pith-number/N3EB45YAI2O3MYGAJALOLJHWII/events.json","paper":"https://pith.science/paper/N3EB45YA"},"agent_actions":{"view_html":"https://pith.science/pith/N3EB45YAI2O3MYGAJALOLJHWII","download_json":"https://pith.science/pith/N3EB45YAI2O3MYGAJALOLJHWII.json","view_paper":"https://pith.science/paper/N3EB45YA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3898&json=true","fetch_graph":"https://pith.science/api/pith-number/N3EB45YAI2O3MYGAJALOLJHWII/graph.json","fetch_events":"https://pith.science/api/pith-number/N3EB45YAI2O3MYGAJALOLJHWII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3EB45YAI2O3MYGAJALOLJHWII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3EB45YAI2O3MYGAJALOLJHWII/action/storage_attestation","attest_author":"https://pith.science/pith/N3EB45YAI2O3MYGAJALOLJHWII/action/author_attestation","sign_citation":"https://pith.science/pith/N3EB45YAI2O3MYGAJALOLJHWII/action/citation_signature","submit_replication":"https://pith.science/pith/N3EB45YAI2O3MYGAJALOLJHWII/action/replication_record"}},"created_at":"2026-05-18T02:58:55.259725+00:00","updated_at":"2026-05-18T02:58:55.259725+00:00"}