{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HV7FDZNPVVNLGEKNML5SVHA6FH","short_pith_number":"pith:HV7FDZNP","canonical_record":{"source":{"id":"1608.08413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-30T12:06:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7f64b9400cab0c83c17cf95378124c43a584febda468e9d1149712acae62b3b7","abstract_canon_sha256":"a54fb8a077ea564cd876640120ae09560f01effafad954dfa691dbaa6ff0618a"},"schema_version":"1.0"},"canonical_sha256":"3d7e51e5afad5ab3114d62fb2a9c1e29d23715a560d6cff70c0de30e5f0cb2cb","source":{"kind":"arxiv","id":"1608.08413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08413","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08413v1","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08413","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"HV7FDZNPVVNL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HV7FDZNPVVNLGEKN","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HV7FDZNP","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HV7FDZNPVVNLGEKNML5SVHA6FH","target":"record","payload":{"canonical_record":{"source":{"id":"1608.08413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-30T12:06:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7f64b9400cab0c83c17cf95378124c43a584febda468e9d1149712acae62b3b7","abstract_canon_sha256":"a54fb8a077ea564cd876640120ae09560f01effafad954dfa691dbaa6ff0618a"},"schema_version":"1.0"},"canonical_sha256":"3d7e51e5afad5ab3114d62fb2a9c1e29d23715a560d6cff70c0de30e5f0cb2cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:18.201704Z","signature_b64":"h70fQI3FxA3Jvnfs6bB8sxxGM5Th5TqBIB5SSpL+KZbhZBmndA6Ydgmwep4jJ3HLrXkOmpRey3aheunAmSAeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d7e51e5afad5ab3114d62fb2a9c1e29d23715a560d6cff70c0de30e5f0cb2cb","last_reissued_at":"2026-05-18T01:07:18.201207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:18.201207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.08413","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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EfF66Gwrs2dJySFM/XolyGDI+nmaKqFv/dQYKaWR/Vz/QDfJ6ykKcunFgX8+XEsnOTIi4pjxM/LilPZdG0mSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:00:25.302268Z"},"content_sha256":"a265005ac979ea16a1e71bf6e8e9df8bc8a789705782c1888e32bd93bf233740","schema_version":"1.0","event_id":"sha256:a265005ac979ea16a1e71bf6e8e9df8bc8a789705782c1888e32bd93bf233740"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HV7FDZNPVVNLGEKNML5SVHA6FH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically optimal pilot allocation over Markovian fading channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Apostolos Destounis, Georgios S. Paschos, Maialen Larranaga, Mohamad Assaad","submitted_at":"2016-08-30T12:06:08Z","abstract_excerpt":"We investigate a pilot allocation problem in wireless networks over Markovian fading channels. In wireless systems, the Channel State Information (CSI) is collected at the Base Station (BS), in particular, this paper considers a pilot-aided channel estimation method (TDD mode). Typically, there are less available pilots than users, hence at each slot the scheduler needs to decide an allocation of pilots to users with the goal of maximizing the long-term average throughput. There is an inherent tradeoff in how the limited pilots are used: assign a pilot to a user with up-to-date CSI and good ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08413","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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ker23afqmiXuUbjVx55cG/IdJnEXHzULrvZhlmqr+qYiRveYwnc3eUeVsmWgp+X2UhE7EinVt/tmAIQv1H93Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:00:25.303020Z"},"content_sha256":"b57ef9c1164e842c3a2127c1e0dbcc0473aab7570bb072ab6832c0a438e107e8","schema_version":"1.0","event_id":"sha256:b57ef9c1164e842c3a2127c1e0dbcc0473aab7570bb072ab6832c0a438e107e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HV7FDZNPVVNLGEKNML5SVHA6FH/bundle.json","state_url":"https://pith.science/pith/HV7FDZNPVVNLGEKNML5SVHA6FH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HV7FDZNPVVNLGEKNML5SVHA6FH/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-05T23:00:25Z","links":{"resolver":"https://pith.science/pith/HV7FDZNPVVNLGEKNML5SVHA6FH","bundle":"https://pith.science/pith/HV7FDZNPVVNLGEKNML5SVHA6FH/bundle.json","state":"https://pith.science/pith/HV7FDZNPVVNLGEKNML5SVHA6FH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HV7FDZNPVVNLGEKNML5SVHA6FH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HV7FDZNPVVNLGEKNML5SVHA6FH","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":"a54fb8a077ea564cd876640120ae09560f01effafad954dfa691dbaa6ff0618a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-30T12:06:08Z","title_canon_sha256":"7f64b9400cab0c83c17cf95378124c43a584febda468e9d1149712acae62b3b7"},"schema_version":"1.0","source":{"id":"1608.08413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08413","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08413v1","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08413","created_at":"2026-05-18T01:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"HV7FDZNPVVNL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HV7FDZNPVVNLGEKN","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HV7FDZNP","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:b57ef9c1164e842c3a2127c1e0dbcc0473aab7570bb072ab6832c0a438e107e8","target":"graph","created_at":"2026-05-18T01:07:18Z","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":"We investigate a pilot allocation problem in wireless networks over Markovian fading channels. In wireless systems, the Channel State Information (CSI) is collected at the Base Station (BS), in particular, this paper considers a pilot-aided channel estimation method (TDD mode). Typically, there are less available pilots than users, hence at each slot the scheduler needs to decide an allocation of pilots to users with the goal of maximizing the long-term average throughput. There is an inherent tradeoff in how the limited pilots are used: assign a pilot to a user with up-to-date CSI and good ch","authors_text":"Apostolos Destounis, Georgios S. Paschos, Maialen Larranaga, Mohamad Assaad","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-30T12:06:08Z","title":"Asymptotically optimal pilot allocation over Markovian fading channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08413","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:a265005ac979ea16a1e71bf6e8e9df8bc8a789705782c1888e32bd93bf233740","target":"record","created_at":"2026-05-18T01:07:18Z","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":"a54fb8a077ea564cd876640120ae09560f01effafad954dfa691dbaa6ff0618a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-30T12:06:08Z","title_canon_sha256":"7f64b9400cab0c83c17cf95378124c43a584febda468e9d1149712acae62b3b7"},"schema_version":"1.0","source":{"id":"1608.08413","kind":"arxiv","version":1}},"canonical_sha256":"3d7e51e5afad5ab3114d62fb2a9c1e29d23715a560d6cff70c0de30e5f0cb2cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d7e51e5afad5ab3114d62fb2a9c1e29d23715a560d6cff70c0de30e5f0cb2cb","first_computed_at":"2026-05-18T01:07:18.201207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:18.201207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h70fQI3FxA3Jvnfs6bB8sxxGM5Th5TqBIB5SSpL+KZbhZBmndA6Ydgmwep4jJ3HLrXkOmpRey3aheunAmSAeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:18.201704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a265005ac979ea16a1e71bf6e8e9df8bc8a789705782c1888e32bd93bf233740","sha256:b57ef9c1164e842c3a2127c1e0dbcc0473aab7570bb072ab6832c0a438e107e8"],"state_sha256":"ee8b5920a9038168bcc667fbbf583a97291b0752ef0027c4c2f0970ec4692375"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TsTwBUhZHqYpeYxiC2VLf1dqmwvpAf063HKpIXW2dDU0+Acaj++uki9X5tPVPRZclKuemQwUFe4lBuPY0eZZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:00:25.307770Z","bundle_sha256":"a1cf2564915cc4eeac23f495be0933f91e7f3d37cb782a5d5b4895d2c8cb34d9"}}