{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I7NB422DWC2QCA7FGXI6QHKSO7","short_pith_number":"pith:I7NB422D","canonical_record":{"source":{"id":"1812.01247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T06:52:17Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"f852ceb3b98b372a526cc8467ae9bac3ab873b06801ebd355101d739eb0a64ed","abstract_canon_sha256":"811cfbe63f9f267c0b591fbe673ce306a74f48be9bda8b7c745106dc48f49c1d"},"schema_version":"1.0"},"canonical_sha256":"47da1e6b43b0b50103e535d1e81d5277f0e8297fb14cb0147465a69af7b515d1","source":{"kind":"arxiv","id":"1812.01247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01247","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01247v1","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01247","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"I7NB422DWC2Q","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7NB422DWC2QCA7F","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7NB422D","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I7NB422DWC2QCA7FGXI6QHKSO7","target":"record","payload":{"canonical_record":{"source":{"id":"1812.01247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T06:52:17Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"f852ceb3b98b372a526cc8467ae9bac3ab873b06801ebd355101d739eb0a64ed","abstract_canon_sha256":"811cfbe63f9f267c0b591fbe673ce306a74f48be9bda8b7c745106dc48f49c1d"},"schema_version":"1.0"},"canonical_sha256":"47da1e6b43b0b50103e535d1e81d5277f0e8297fb14cb0147465a69af7b515d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:13.000043Z","signature_b64":"lNEGBdYICLj2xdbdNxKnfBDRHL2W8FNYgWhWxaqu6K1G/8D03HaOFf5lxh9A/WD4mKJQPtcOkT/iyZrQ1QuyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47da1e6b43b0b50103e535d1e81d5277f0e8297fb14cb0147465a69af7b515d1","last_reissued_at":"2026-05-17T23:59:12.999425Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:12.999425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.01247","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-17T23:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkllShPXwwPejj0xyixedXWYWgZXE6dsPNgM6amSoAu5Bn3ggOnUemEQ1EVWsjwe+RMYwX/8Gpv0qhAbaFSuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:51:02.795659Z"},"content_sha256":"d4547e5d48a1829205723630141d207c14d82ced0d7456ea33b2e57852c0aa67","schema_version":"1.0","event_id":"sha256:d4547e5d48a1829205723630141d207c14d82ced0d7456ea33b2e57852c0aa67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I7NB422DWC2QCA7FGXI6QHKSO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Two-Step Learning and Interpolation Method for Location-Based Channel Database","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Ruichen Deng, Sheng Zhou, Shuguang Cui, Zhisheng Niu, Zhiyuan Jiang","submitted_at":"2018-12-04T06:52:17Z","abstract_excerpt":"Timely and accurate knowledge of channel state information (CSI) is necessary to support scheduling operations at both physical and network layers. In order to support pilot-free channel estimation in cell sleeping scenarios, we propose to adopt a channel database that stores the CSI as a function of geographic locations. Such a channel database is generated from historical user records, which usually can not cover all the locations in the cell. Therefore, we develop a two-step interpolation method to infer the channels at the uncovered locations. The method firstly applies the K-nearest-neigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01247","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-17T23:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkkcA2fho2g0aEMqF6lyfWAeehUHsMi9rL7K8VcRER1CXEiHsWhbHZLezJrLhofiIPQHgXtTwHSeVRZJrulsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:51:02.796370Z"},"content_sha256":"f43a7d86da3992747ed70bf595aedb4a2be29232c5bfaef1be3bb0069499648c","schema_version":"1.0","event_id":"sha256:f43a7d86da3992747ed70bf595aedb4a2be29232c5bfaef1be3bb0069499648c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7NB422DWC2QCA7FGXI6QHKSO7/bundle.json","state_url":"https://pith.science/pith/I7NB422DWC2QCA7FGXI6QHKSO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7NB422DWC2QCA7FGXI6QHKSO7/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-28T18:51:02Z","links":{"resolver":"https://pith.science/pith/I7NB422DWC2QCA7FGXI6QHKSO7","bundle":"https://pith.science/pith/I7NB422DWC2QCA7FGXI6QHKSO7/bundle.json","state":"https://pith.science/pith/I7NB422DWC2QCA7FGXI6QHKSO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7NB422DWC2QCA7FGXI6QHKSO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I7NB422DWC2QCA7FGXI6QHKSO7","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":"811cfbe63f9f267c0b591fbe673ce306a74f48be9bda8b7c745106dc48f49c1d","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T06:52:17Z","title_canon_sha256":"f852ceb3b98b372a526cc8467ae9bac3ab873b06801ebd355101d739eb0a64ed"},"schema_version":"1.0","source":{"id":"1812.01247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01247","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01247v1","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01247","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"I7NB422DWC2Q","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7NB422DWC2QCA7F","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7NB422D","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:f43a7d86da3992747ed70bf595aedb4a2be29232c5bfaef1be3bb0069499648c","target":"graph","created_at":"2026-05-17T23:59:12Z","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":"Timely and accurate knowledge of channel state information (CSI) is necessary to support scheduling operations at both physical and network layers. In order to support pilot-free channel estimation in cell sleeping scenarios, we propose to adopt a channel database that stores the CSI as a function of geographic locations. Such a channel database is generated from historical user records, which usually can not cover all the locations in the cell. Therefore, we develop a two-step interpolation method to infer the channels at the uncovered locations. The method firstly applies the K-nearest-neigh","authors_text":"Ruichen Deng, Sheng Zhou, Shuguang Cui, Zhisheng Niu, Zhiyuan Jiang","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T06:52:17Z","title":"A Two-Step Learning and Interpolation Method for Location-Based Channel Database"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01247","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:d4547e5d48a1829205723630141d207c14d82ced0d7456ea33b2e57852c0aa67","target":"record","created_at":"2026-05-17T23:59:12Z","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":"811cfbe63f9f267c0b591fbe673ce306a74f48be9bda8b7c745106dc48f49c1d","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T06:52:17Z","title_canon_sha256":"f852ceb3b98b372a526cc8467ae9bac3ab873b06801ebd355101d739eb0a64ed"},"schema_version":"1.0","source":{"id":"1812.01247","kind":"arxiv","version":1}},"canonical_sha256":"47da1e6b43b0b50103e535d1e81d5277f0e8297fb14cb0147465a69af7b515d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47da1e6b43b0b50103e535d1e81d5277f0e8297fb14cb0147465a69af7b515d1","first_computed_at":"2026-05-17T23:59:12.999425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:12.999425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lNEGBdYICLj2xdbdNxKnfBDRHL2W8FNYgWhWxaqu6K1G/8D03HaOFf5lxh9A/WD4mKJQPtcOkT/iyZrQ1QuyDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:13.000043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4547e5d48a1829205723630141d207c14d82ced0d7456ea33b2e57852c0aa67","sha256:f43a7d86da3992747ed70bf595aedb4a2be29232c5bfaef1be3bb0069499648c"],"state_sha256":"7668d1697fcc0553a0b9f1d3714ce110fc0833065b42224da5ee5d6c4f4f09bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frhZXqGDVdq6qOD38UFcK4D0c93oezfj/uD1hdwTmiaou/9vpGM8HQjCpKCTd/JumjLimaTi4OoZN4AOUwJyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:51:02.800094Z","bundle_sha256":"a31816158d79e596cdfe31af80ea4ca921d022fecfed5100f7f279c5fa6fc1b4"}}