{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TCS6WXP75YJL7RMY2XA74MM6L2","short_pith_number":"pith:TCS6WXP7","canonical_record":{"source":{"id":"1608.07800","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-28T11:27:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"109b133d10953a576d63b899fea3a445803fa130db54abaee7e0f81869dd944b","abstract_canon_sha256":"d96c45b0c909029104c86dbadd2f445c5afd20a6495ac9fe92cf94431a8fc910"},"schema_version":"1.0"},"canonical_sha256":"98a5eb5dffee12bfc598d5c1fe319e5ebf020d76c1e55b17787045adabab8183","source":{"kind":"arxiv","id":"1608.07800","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07800","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07800v2","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07800","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"TCS6WXP75YJL","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TCS6WXP75YJL7RMY","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TCS6WXP7","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TCS6WXP75YJL7RMY2XA74MM6L2","target":"record","payload":{"canonical_record":{"source":{"id":"1608.07800","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-28T11:27:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"109b133d10953a576d63b899fea3a445803fa130db54abaee7e0f81869dd944b","abstract_canon_sha256":"d96c45b0c909029104c86dbadd2f445c5afd20a6495ac9fe92cf94431a8fc910"},"schema_version":"1.0"},"canonical_sha256":"98a5eb5dffee12bfc598d5c1fe319e5ebf020d76c1e55b17787045adabab8183","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:20.249298Z","signature_b64":"RyTKn2RJ+8/Akcx9afULTql39YI8xiw6c/c+5nCO/uo+HcuTLLI0f2siYMbSoq0n6Z1lQqjW+Lw1fM2+slY/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98a5eb5dffee12bfc598d5c1fe319e5ebf020d76c1e55b17787045adabab8183","last_reissued_at":"2026-05-18T01:06:20.248619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:20.248619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.07800","source_version":2,"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7jFmOg80X4vDP1KnCZmvm3Us67XX1hDjHtwy1DvwOZ9LfsSVEs9yNBOZ9WqzrV7yxJaBho+DFO8sSblMktM3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:59:46.948532Z"},"content_sha256":"56f53299ebc229b9444bf912d83b8aa1a1fe654caf349a1c48e3cc72fc5a7d69","schema_version":"1.0","event_id":"sha256:56f53299ebc229b9444bf912d83b8aa1a1fe654caf349a1c48e3cc72fc5a7d69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TCS6WXP75YJL7RMY2XA74MM6L2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Rank Matrix Completion for Mobile Edge Caching in Fog-RAN via Riemannian Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kai Yang, Yuanming Shi, Zhi Ding","submitted_at":"2016-08-28T11:27:19Z","abstract_excerpt":"The upcoming big data era is likely to demand tremendous computation and storage resources for communications. By pushing computation and storage to network edges, fog radio access networks (Fog-RAN) can effectively increase network throughput and reduce transmission latency. Furthermore, we can exploit the benefits of cache enabled architecture in Fog-RAN to deliver contents with low latency. Radio access units (RAUs) need content delivery from fog servers through wireline links whereas multiple mobile devices acquire contents from RAUs wirelessly. This work proposes a unified low-rank matrix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07800","kind":"arxiv","version":2},"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44I3eU2MAZxxMV6VXDAZJsYYx5IyD/hIBJOcFo3raokIQ05Q+74sI/7xbKC63LIaeDObiJ/gX0JXDuyRH5uBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:59:46.949164Z"},"content_sha256":"0655a9e13d0dcd7130eff162df020cd8d87f38928a8ed778d6f328fc7bf2a137","schema_version":"1.0","event_id":"sha256:0655a9e13d0dcd7130eff162df020cd8d87f38928a8ed778d6f328fc7bf2a137"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCS6WXP75YJL7RMY2XA74MM6L2/bundle.json","state_url":"https://pith.science/pith/TCS6WXP75YJL7RMY2XA74MM6L2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCS6WXP75YJL7RMY2XA74MM6L2/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-05-25T20:59:46Z","links":{"resolver":"https://pith.science/pith/TCS6WXP75YJL7RMY2XA74MM6L2","bundle":"https://pith.science/pith/TCS6WXP75YJL7RMY2XA74MM6L2/bundle.json","state":"https://pith.science/pith/TCS6WXP75YJL7RMY2XA74MM6L2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCS6WXP75YJL7RMY2XA74MM6L2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TCS6WXP75YJL7RMY2XA74MM6L2","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":"d96c45b0c909029104c86dbadd2f445c5afd20a6495ac9fe92cf94431a8fc910","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-28T11:27:19Z","title_canon_sha256":"109b133d10953a576d63b899fea3a445803fa130db54abaee7e0f81869dd944b"},"schema_version":"1.0","source":{"id":"1608.07800","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07800","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07800v2","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07800","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"TCS6WXP75YJL","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TCS6WXP75YJL7RMY","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TCS6WXP7","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:0655a9e13d0dcd7130eff162df020cd8d87f38928a8ed778d6f328fc7bf2a137","target":"graph","created_at":"2026-05-18T01:06:20Z","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":"The upcoming big data era is likely to demand tremendous computation and storage resources for communications. By pushing computation and storage to network edges, fog radio access networks (Fog-RAN) can effectively increase network throughput and reduce transmission latency. Furthermore, we can exploit the benefits of cache enabled architecture in Fog-RAN to deliver contents with low latency. Radio access units (RAUs) need content delivery from fog servers through wireline links whereas multiple mobile devices acquire contents from RAUs wirelessly. This work proposes a unified low-rank matrix","authors_text":"Kai Yang, Yuanming Shi, Zhi Ding","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-28T11:27:19Z","title":"Low-Rank Matrix Completion for Mobile Edge Caching in Fog-RAN via Riemannian Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07800","kind":"arxiv","version":2},"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:56f53299ebc229b9444bf912d83b8aa1a1fe654caf349a1c48e3cc72fc5a7d69","target":"record","created_at":"2026-05-18T01:06:20Z","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":"d96c45b0c909029104c86dbadd2f445c5afd20a6495ac9fe92cf94431a8fc910","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2016-08-28T11:27:19Z","title_canon_sha256":"109b133d10953a576d63b899fea3a445803fa130db54abaee7e0f81869dd944b"},"schema_version":"1.0","source":{"id":"1608.07800","kind":"arxiv","version":2}},"canonical_sha256":"98a5eb5dffee12bfc598d5c1fe319e5ebf020d76c1e55b17787045adabab8183","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98a5eb5dffee12bfc598d5c1fe319e5ebf020d76c1e55b17787045adabab8183","first_computed_at":"2026-05-18T01:06:20.248619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:20.248619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RyTKn2RJ+8/Akcx9afULTql39YI8xiw6c/c+5nCO/uo+HcuTLLI0f2siYMbSoq0n6Z1lQqjW+Lw1fM2+slY/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:20.249298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07800","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56f53299ebc229b9444bf912d83b8aa1a1fe654caf349a1c48e3cc72fc5a7d69","sha256:0655a9e13d0dcd7130eff162df020cd8d87f38928a8ed778d6f328fc7bf2a137"],"state_sha256":"7dde5cf74c3226868c1c8c2bce18454a5350b6233423fc1fed3f1af79de57b3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffi0LWZmBzXL6MFHtJ822KhlPL2EyJLr7NmpulLUQ4OJQCU4M7MZuGB+P70waX9itLqB9KZRO5725+Luue9rDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:59:46.952284Z","bundle_sha256":"28738a498c81c71c77bd9bd34051bb670e4de9e0508ef532891d6fb0706e4a5f"}}