{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L3YABJIWQ53NQIETUNJ7RWS2BQ","short_pith_number":"pith:L3YABJIW","canonical_record":{"source":{"id":"1808.06839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T10:52:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f2b27bb775b1b62e946c0004e566c5879634cdec1cab5c3703456cebe3f9a147","abstract_canon_sha256":"124b57755d4ee562a95da39e6404daf90b393a7baa5964a690980860fd103423"},"schema_version":"1.0"},"canonical_sha256":"5ef000a5168776d82093a353f8da5a0c0f8d4f47965942614f7d9d7fc67d6654","source":{"kind":"arxiv","id":"1808.06839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06839","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06839v1","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06839","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"pith_short_12","alias_value":"L3YABJIWQ53N","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L3YABJIWQ53NQIET","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L3YABJIW","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L3YABJIWQ53NQIETUNJ7RWS2BQ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T10:52:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f2b27bb775b1b62e946c0004e566c5879634cdec1cab5c3703456cebe3f9a147","abstract_canon_sha256":"124b57755d4ee562a95da39e6404daf90b393a7baa5964a690980860fd103423"},"schema_version":"1.0"},"canonical_sha256":"5ef000a5168776d82093a353f8da5a0c0f8d4f47965942614f7d9d7fc67d6654","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:38.907905Z","signature_b64":"+poD/c08ZqZ0om4bopSmoqs7g8cq7UlAeNARAm94tTvxzcolVJdWqTT3+LclFgWSiqoGuTzUaANtTo41eNp3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ef000a5168776d82093a353f8da5a0c0f8d4f47965942614f7d9d7fc67d6654","last_reissued_at":"2026-05-18T00:07:38.907197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:38.907197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06839","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:07:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VTdrKD4SI2xSYBLnAOQXJX6L8/BljF6UJJJWBK40bXgea1LbWaDgBC1OpPrKT6orbvCCO+c8BYstmmcy9Z02Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:13.287473Z"},"content_sha256":"2af0a4df2be3c6533d49d096b78537e50c16cce211e3f90e6195d943c213c00b","schema_version":"1.0","event_id":"sha256:2af0a4df2be3c6533d49d096b78537e50c16cce211e3f90e6195d943c213c00b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L3YABJIWQ53NQIETUNJ7RWS2BQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimum Transmission Rate in Fading Channels with Markovian Sources and QoS Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fahad Qasmi, Hirley Alves, Matti Latva-aho, Mohammad Shehab","submitted_at":"2018-08-21T10:52:45Z","abstract_excerpt":"This paper evaluates the performance of reliability and latency in machine type communication networks, which composed of single transmitter and receiver in the presence of Rayleigh fading channel. The source's traffic arrivals are modeled as Markovian processes namely Discrete-Time Markov process, Fluid Markov process, and Markov Modulated Poisson process, and delay/buffer overflow constraints are imposed. Our approach is based on the reliability and latency outage probability, where transmitter not knowing the channel condition, therefore the transmitter would be transmitting information ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06839","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:07:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzNnmhjkbqUrORy2aLtUJD3ssInTBHahRu2d14+neju5ZA666hEUu2+ZZtMv2Kvkh6MDx1wEhuakXA8pCFFQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:13.288204Z"},"content_sha256":"669b2fceffafedc9219cd81d6965785de425ab8f3dd1f585d5ee028a6e2ce340","schema_version":"1.0","event_id":"sha256:669b2fceffafedc9219cd81d6965785de425ab8f3dd1f585d5ee028a6e2ce340"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3YABJIWQ53NQIETUNJ7RWS2BQ/bundle.json","state_url":"https://pith.science/pith/L3YABJIWQ53NQIETUNJ7RWS2BQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3YABJIWQ53NQIETUNJ7RWS2BQ/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-11T22:08:13Z","links":{"resolver":"https://pith.science/pith/L3YABJIWQ53NQIETUNJ7RWS2BQ","bundle":"https://pith.science/pith/L3YABJIWQ53NQIETUNJ7RWS2BQ/bundle.json","state":"https://pith.science/pith/L3YABJIWQ53NQIETUNJ7RWS2BQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3YABJIWQ53NQIETUNJ7RWS2BQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L3YABJIWQ53NQIETUNJ7RWS2BQ","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":"124b57755d4ee562a95da39e6404daf90b393a7baa5964a690980860fd103423","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T10:52:45Z","title_canon_sha256":"f2b27bb775b1b62e946c0004e566c5879634cdec1cab5c3703456cebe3f9a147"},"schema_version":"1.0","source":{"id":"1808.06839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06839","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06839v1","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06839","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"pith_short_12","alias_value":"L3YABJIWQ53N","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L3YABJIWQ53NQIET","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L3YABJIW","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:669b2fceffafedc9219cd81d6965785de425ab8f3dd1f585d5ee028a6e2ce340","target":"graph","created_at":"2026-05-18T00:07:38Z","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":"This paper evaluates the performance of reliability and latency in machine type communication networks, which composed of single transmitter and receiver in the presence of Rayleigh fading channel. The source's traffic arrivals are modeled as Markovian processes namely Discrete-Time Markov process, Fluid Markov process, and Markov Modulated Poisson process, and delay/buffer overflow constraints are imposed. Our approach is based on the reliability and latency outage probability, where transmitter not knowing the channel condition, therefore the transmitter would be transmitting information ove","authors_text":"Fahad Qasmi, Hirley Alves, Matti Latva-aho, Mohammad Shehab","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T10:52:45Z","title":"Optimum Transmission Rate in Fading Channels with Markovian Sources and QoS Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06839","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:2af0a4df2be3c6533d49d096b78537e50c16cce211e3f90e6195d943c213c00b","target":"record","created_at":"2026-05-18T00:07:38Z","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":"124b57755d4ee562a95da39e6404daf90b393a7baa5964a690980860fd103423","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T10:52:45Z","title_canon_sha256":"f2b27bb775b1b62e946c0004e566c5879634cdec1cab5c3703456cebe3f9a147"},"schema_version":"1.0","source":{"id":"1808.06839","kind":"arxiv","version":1}},"canonical_sha256":"5ef000a5168776d82093a353f8da5a0c0f8d4f47965942614f7d9d7fc67d6654","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ef000a5168776d82093a353f8da5a0c0f8d4f47965942614f7d9d7fc67d6654","first_computed_at":"2026-05-18T00:07:38.907197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:38.907197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+poD/c08ZqZ0om4bopSmoqs7g8cq7UlAeNARAm94tTvxzcolVJdWqTT3+LclFgWSiqoGuTzUaANtTo41eNp3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:38.907905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2af0a4df2be3c6533d49d096b78537e50c16cce211e3f90e6195d943c213c00b","sha256:669b2fceffafedc9219cd81d6965785de425ab8f3dd1f585d5ee028a6e2ce340"],"state_sha256":"363c87031bf5211013d72407dd19323567e17a0c6893db3d8e86f95c40dece4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5ShmnTFo2fwPZEH8ADT1aPvrNrQuwigFElQlwrlcRg/NM9ZNQpxq+5ez8rNO9lsAGaVlM+UNxK3jpzt2vICDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:08:13.292181Z","bundle_sha256":"fc6f3cc1bfd202a85b15992052843f881d165573f4d8191c7998b0d379e9b7fb"}}