{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LYBFYYMONXCXUYRKO6364HZ4KD","short_pith_number":"pith:LYBFYYMO","schema_version":"1.0","canonical_sha256":"5e025c618e6dc57a622a77b7ee1f3c50d9b86ab9ff6af02339368ece6a9bdbf3","source":{"kind":"arxiv","id":"1604.04325","version":1},"attestation_state":"computed","paper":{"title":"A Sparse and Low-Rank Optimization Framework for Index Coding via Riemannian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bamdev Mishra, Yuanming Shi","submitted_at":"2016-04-15T01:01:26Z","abstract_excerpt":"Side information provides a pivotal role for message delivery in many communication scenarios to accommodate increasingly large data sets, e.g., caching networks. Although index coding provides a fundamental modeling framework to exploit the benefits of side information, the index coding problem itself still remains open and only a few instances have been solved. In this paper, we propose a novel sparse and low- rank optimization modeling framework for the index coding problem to characterize the tradeoff between the amount of side information and the achievable data rate. Specifically, sparsi"},"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":"1604.04325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-15T01:01:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4888466b4003bfbf6f399d6b09bfb667b1c6781e99c468df17bae7081d127c7","abstract_canon_sha256":"dcaeba7354d84c3102d07a87c83c6686752f5419fc7f6fa3b0c19e04d4135066"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:04.512213Z","signature_b64":"9At/CDUGkUhMoHRDIUdXFyP4RIe0BIGQTbs/qcveLSCYb74R4SRA9I+gSrlS8aogSnNjm9DlPLCPonA0GWc9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e025c618e6dc57a622a77b7ee1f3c50d9b86ab9ff6af02339368ece6a9bdbf3","last_reissued_at":"2026-05-18T01:17:04.511588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:04.511588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sparse and Low-Rank Optimization Framework for Index Coding via Riemannian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bamdev Mishra, Yuanming Shi","submitted_at":"2016-04-15T01:01:26Z","abstract_excerpt":"Side information provides a pivotal role for message delivery in many communication scenarios to accommodate increasingly large data sets, e.g., caching networks. Although index coding provides a fundamental modeling framework to exploit the benefits of side information, the index coding problem itself still remains open and only a few instances have been solved. In this paper, we propose a novel sparse and low- rank optimization modeling framework for the index coding problem to characterize the tradeoff between the amount of side information and the achievable data rate. Specifically, sparsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04325","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":"1604.04325","created_at":"2026-05-18T01:17:04.511682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04325v1","created_at":"2026-05-18T01:17:04.511682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04325","created_at":"2026-05-18T01:17:04.511682+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYBFYYMONXCX","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYBFYYMONXCXUYRK","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYBFYYMO","created_at":"2026-05-18T12:30:29.479603+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/LYBFYYMONXCXUYRKO6364HZ4KD","json":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD.json","graph_json":"https://pith.science/api/pith-number/LYBFYYMONXCXUYRKO6364HZ4KD/graph.json","events_json":"https://pith.science/api/pith-number/LYBFYYMONXCXUYRKO6364HZ4KD/events.json","paper":"https://pith.science/paper/LYBFYYMO"},"agent_actions":{"view_html":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD","download_json":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD.json","view_paper":"https://pith.science/paper/LYBFYYMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04325&json=true","fetch_graph":"https://pith.science/api/pith-number/LYBFYYMONXCXUYRKO6364HZ4KD/graph.json","fetch_events":"https://pith.science/api/pith-number/LYBFYYMONXCXUYRKO6364HZ4KD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD/action/storage_attestation","attest_author":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD/action/author_attestation","sign_citation":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD/action/citation_signature","submit_replication":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD/action/replication_record"}},"created_at":"2026-05-18T01:17:04.511682+00:00","updated_at":"2026-05-18T01:17:04.511682+00:00"}