{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LYBFYYMONXCXUYRKO6364HZ4KD","short_pith_number":"pith:LYBFYYMO","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"},"canonical_sha256":"5e025c618e6dc57a622a77b7ee1f3c50d9b86ab9ff6af02339368ece6a9bdbf3","source":{"kind":"arxiv","id":"1604.04325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04325","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04325v1","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04325","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"LYBFYYMONXCX","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LYBFYYMONXCXUYRK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LYBFYYMO","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LYBFYYMONXCXUYRKO6364HZ4KD","target":"record","payload":{"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"},"canonical_sha256":"5e025c618e6dc57a622a77b7ee1f3c50d9b86ab9ff6af02339368ece6a9bdbf3","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"},"source_kind":"arxiv","source_id":"1604.04325","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-18T01:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxgx3rBZonUkDqZ/1zqCS7boFBSeAoJxgCN3wqNX5EPfruSV+PuqmHe6uKktAZzzBvYBeeUbQZdHQnxzNA8CBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:26:54.385738Z"},"content_sha256":"d0672f4001d1a7c22bbedfbf1557bf9a008c869c41aa2b9534fa50b9de69ea5b","schema_version":"1.0","event_id":"sha256:d0672f4001d1a7c22bbedfbf1557bf9a008c869c41aa2b9534fa50b9de69ea5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LYBFYYMONXCXUYRKO6364HZ4KD","target":"graph","payload":{"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"},"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-18T01:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"km7lMC4DCK7PyWxqw6dEJ4qpabzbBQPFTjMQkC9+RtPr79j+1L73I3yKncBPdWINszDI9Wn3SzSCSXcZmsAgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:26:54.386130Z"},"content_sha256":"11039aee11f622593645cf419350027b4ecd4fb683c68b5ba3ed57af737125d3","schema_version":"1.0","event_id":"sha256:11039aee11f622593645cf419350027b4ecd4fb683c68b5ba3ed57af737125d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD/bundle.json","state_url":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYBFYYMONXCXUYRKO6364HZ4KD/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-02T13:26:54Z","links":{"resolver":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD","bundle":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD/bundle.json","state":"https://pith.science/pith/LYBFYYMONXCXUYRKO6364HZ4KD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYBFYYMONXCXUYRKO6364HZ4KD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LYBFYYMONXCXUYRKO6364HZ4KD","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":"dcaeba7354d84c3102d07a87c83c6686752f5419fc7f6fa3b0c19e04d4135066","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-15T01:01:26Z","title_canon_sha256":"f4888466b4003bfbf6f399d6b09bfb667b1c6781e99c468df17bae7081d127c7"},"schema_version":"1.0","source":{"id":"1604.04325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04325","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04325v1","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04325","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"LYBFYYMONXCX","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LYBFYYMONXCXUYRK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LYBFYYMO","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:11039aee11f622593645cf419350027b4ecd4fb683c68b5ba3ed57af737125d3","target":"graph","created_at":"2026-05-18T01:17:04Z","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":"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","authors_text":"Bamdev Mishra, Yuanming Shi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-15T01:01:26Z","title":"A Sparse and Low-Rank Optimization Framework for Index Coding via Riemannian Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04325","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:d0672f4001d1a7c22bbedfbf1557bf9a008c869c41aa2b9534fa50b9de69ea5b","target":"record","created_at":"2026-05-18T01:17:04Z","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":"dcaeba7354d84c3102d07a87c83c6686752f5419fc7f6fa3b0c19e04d4135066","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-15T01:01:26Z","title_canon_sha256":"f4888466b4003bfbf6f399d6b09bfb667b1c6781e99c468df17bae7081d127c7"},"schema_version":"1.0","source":{"id":"1604.04325","kind":"arxiv","version":1}},"canonical_sha256":"5e025c618e6dc57a622a77b7ee1f3c50d9b86ab9ff6af02339368ece6a9bdbf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e025c618e6dc57a622a77b7ee1f3c50d9b86ab9ff6af02339368ece6a9bdbf3","first_computed_at":"2026-05-18T01:17:04.511588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:04.511588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9At/CDUGkUhMoHRDIUdXFyP4RIe0BIGQTbs/qcveLSCYb74R4SRA9I+gSrlS8aogSnNjm9DlPLCPonA0GWc9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:04.512213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0672f4001d1a7c22bbedfbf1557bf9a008c869c41aa2b9534fa50b9de69ea5b","sha256:11039aee11f622593645cf419350027b4ecd4fb683c68b5ba3ed57af737125d3"],"state_sha256":"0157d211287cef30bd2207f70411e0d8be7fab3b9579304b9d328acc749762df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XCj21b1H7ucmfd5h0F6jm46Ok6QeCEnuUOKMYasbHC5owMFAe5JGE5uMFQ3m/M2kuacy+C+bzRGRKfWdFmRyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:26:54.388225Z","bundle_sha256":"93d9de84e176532fd3836df88af75f40303e7c142eaccc9e4509e3388f03febb"}}