{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZBWEOJDUZ5UMT66OFRNCOOQZ2O","short_pith_number":"pith:ZBWEOJDU","canonical_record":{"source":{"id":"1706.09024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-27T19:37:02Z","cross_cats_sorted":[],"title_canon_sha256":"97f713bdc420c8b974f63bb316ec655f2da059bc9f9d6df91c3b8662a9760eb2","abstract_canon_sha256":"909f4b2aab9ea43f909649db5207bc9ab3f519f80e8fc9d7ab1530a623467d80"},"schema_version":"1.0"},"canonical_sha256":"c86c472474cf68c9fbce2c5a273a19d3941c5a96c9a9cd88101fff34a106abbb","source":{"kind":"arxiv","id":"1706.09024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09024","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09024v1","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09024","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZBWEOJDUZ5UM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZBWEOJDUZ5UMT66O","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZBWEOJDU","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZBWEOJDUZ5UMT66OFRNCOOQZ2O","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-27T19:37:02Z","cross_cats_sorted":[],"title_canon_sha256":"97f713bdc420c8b974f63bb316ec655f2da059bc9f9d6df91c3b8662a9760eb2","abstract_canon_sha256":"909f4b2aab9ea43f909649db5207bc9ab3f519f80e8fc9d7ab1530a623467d80"},"schema_version":"1.0"},"canonical_sha256":"c86c472474cf68c9fbce2c5a273a19d3941c5a96c9a9cd88101fff34a106abbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:20.102657Z","signature_b64":"bFUrbibJM6/2sLk/J8cpMUQ0VD0chHlGxrUdsh/wR1Y1/WkjkgseLfjev5sQzFDpvuaPnFzWGW5vAm6LT5DaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c86c472474cf68c9fbce2c5a273a19d3941c5a96c9a9cd88101fff34a106abbb","last_reissued_at":"2026-05-18T00:41:20.102026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:20.102026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09024","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-18T00:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzsq+MLcugfmGSND19veZStKFsD7Z2r71q+cpLgzBVNb5izdrwqJOq4cPjhUjtjmnS9InY9KvSm+yoI6ChrPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:51:50.565723Z"},"content_sha256":"b4f43827c42ebe44037bcdcd765d075f5a0eaf0fbc2cd609b155181e899b5d69","schema_version":"1.0","event_id":"sha256:b4f43827c42ebe44037bcdcd765d075f5a0eaf0fbc2cd609b155181e899b5d69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZBWEOJDUZ5UMT66OFRNCOOQZ2O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cache-enabled Wireless Networks with Opportunistic Interference Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"S. Hu, Y. He","submitted_at":"2017-06-27T19:37:02Z","abstract_excerpt":"Both caching and interference alignment (IA) are promising techniques for future wireless networks. Nevertheless, most of existing works on cache-enabled IA wireless networks assume that the channel is invariant, which is unrealistic considering the time-varying nature of practical wireless environments. In this paper, we consider realistic time-varying channels. Specifically, the channel is formulated as a finite-state Markov channel (FSMC). The complexity of the system is very high when we consider realistic FSMC models. Therefore, we propose a novel big data reinforcement learning approach "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09024","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-18T00:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1bWIBTvLkBNXLbc3puWh7VI99rvwUUzSIKCzVPvqS3pdjN7bGbGnRG+DgEVVSLTl/RDGc16QuamvLrrcKAE/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:51:50.566412Z"},"content_sha256":"fe0f03cd1a0bfe99fe23cbfb0ceccb1fdea41a5fa2888df91adc5769cc62e0eb","schema_version":"1.0","event_id":"sha256:fe0f03cd1a0bfe99fe23cbfb0ceccb1fdea41a5fa2888df91adc5769cc62e0eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBWEOJDUZ5UMT66OFRNCOOQZ2O/bundle.json","state_url":"https://pith.science/pith/ZBWEOJDUZ5UMT66OFRNCOOQZ2O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBWEOJDUZ5UMT66OFRNCOOQZ2O/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-29T16:51:50Z","links":{"resolver":"https://pith.science/pith/ZBWEOJDUZ5UMT66OFRNCOOQZ2O","bundle":"https://pith.science/pith/ZBWEOJDUZ5UMT66OFRNCOOQZ2O/bundle.json","state":"https://pith.science/pith/ZBWEOJDUZ5UMT66OFRNCOOQZ2O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBWEOJDUZ5UMT66OFRNCOOQZ2O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZBWEOJDUZ5UMT66OFRNCOOQZ2O","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":"909f4b2aab9ea43f909649db5207bc9ab3f519f80e8fc9d7ab1530a623467d80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-27T19:37:02Z","title_canon_sha256":"97f713bdc420c8b974f63bb316ec655f2da059bc9f9d6df91c3b8662a9760eb2"},"schema_version":"1.0","source":{"id":"1706.09024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09024","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09024v1","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09024","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZBWEOJDUZ5UM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZBWEOJDUZ5UMT66O","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZBWEOJDU","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:fe0f03cd1a0bfe99fe23cbfb0ceccb1fdea41a5fa2888df91adc5769cc62e0eb","target":"graph","created_at":"2026-05-18T00:41: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":"Both caching and interference alignment (IA) are promising techniques for future wireless networks. Nevertheless, most of existing works on cache-enabled IA wireless networks assume that the channel is invariant, which is unrealistic considering the time-varying nature of practical wireless environments. In this paper, we consider realistic time-varying channels. Specifically, the channel is formulated as a finite-state Markov channel (FSMC). The complexity of the system is very high when we consider realistic FSMC models. Therefore, we propose a novel big data reinforcement learning approach ","authors_text":"S. Hu, Y. He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-27T19:37:02Z","title":"Cache-enabled Wireless Networks with Opportunistic Interference Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09024","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:b4f43827c42ebe44037bcdcd765d075f5a0eaf0fbc2cd609b155181e899b5d69","target":"record","created_at":"2026-05-18T00:41: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":"909f4b2aab9ea43f909649db5207bc9ab3f519f80e8fc9d7ab1530a623467d80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-27T19:37:02Z","title_canon_sha256":"97f713bdc420c8b974f63bb316ec655f2da059bc9f9d6df91c3b8662a9760eb2"},"schema_version":"1.0","source":{"id":"1706.09024","kind":"arxiv","version":1}},"canonical_sha256":"c86c472474cf68c9fbce2c5a273a19d3941c5a96c9a9cd88101fff34a106abbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c86c472474cf68c9fbce2c5a273a19d3941c5a96c9a9cd88101fff34a106abbb","first_computed_at":"2026-05-18T00:41:20.102026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:20.102026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bFUrbibJM6/2sLk/J8cpMUQ0VD0chHlGxrUdsh/wR1Y1/WkjkgseLfjev5sQzFDpvuaPnFzWGW5vAm6LT5DaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:20.102657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4f43827c42ebe44037bcdcd765d075f5a0eaf0fbc2cd609b155181e899b5d69","sha256:fe0f03cd1a0bfe99fe23cbfb0ceccb1fdea41a5fa2888df91adc5769cc62e0eb"],"state_sha256":"4ece15ed26b29aa8747ac99a1c4101d6cc4fd4d645fcb6c14882d7aab3187915"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFmZuinL91WFyh8s+QQ3JkHwBUJiKSrf+JHV5aFKLudULT3tEChkcpdt1zG3CioqilIjC0IAX0l269oa2nZlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:51:50.569082Z","bundle_sha256":"b2f49d08f8cf42cebdba7fdcbac1f8e99f449d46e20e72c5296ddaa9e419c7eb"}}