{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OB7BVHHVRBVTJ25IL5HDXZ5344","short_pith_number":"pith:OB7BVHHV","schema_version":"1.0","canonical_sha256":"707e1a9cf5886b34eba85f4e3be7bbe729ac809d69f5e3947309da266a90adeb","source":{"kind":"arxiv","id":"1207.6630","version":1},"attestation_state":"computed","paper":{"title":"A Network Calculus Approach for the Analysis of Multi-Hop Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Almut Burchard, Hussein Al-Zubaidy, Jorg Liebeherr","submitted_at":"2012-07-27T19:57:41Z","abstract_excerpt":"A fundamental problem in the delay and backlog analysis across multi-hop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do not lend themselves easily to a description of the available service rate on a wireless link, the performance analysis of wireless networks has resorted to higher-layer abstractions, e.g., using Markov chain models. In this work, we propose a network calculus that can incorporate common statistical models of fading channels and obtain statistic"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1207.6630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-27T19:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"2456714a970c5eaacfcac168cb97497654f16e0cf267f041f61c520f5dafca35","abstract_canon_sha256":"d094fa5d39ded2a67a1a3be5a9f9f33e042bcce6cde0168f9d5e2137cdc8110a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:58.931430Z","signature_b64":"PVKV9/bcFeGZodllM9lMlMvflzQISstEDsriimSbsW1KmAIlVM7U1Ph3lxvDQIwG/H1fQi3gkkqpb8c6Ow1CCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"707e1a9cf5886b34eba85f4e3be7bbe729ac809d69f5e3947309da266a90adeb","last_reissued_at":"2026-05-18T03:49:58.930897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:58.930897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Network Calculus Approach for the Analysis of Multi-Hop Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Almut Burchard, Hussein Al-Zubaidy, Jorg Liebeherr","submitted_at":"2012-07-27T19:57:41Z","abstract_excerpt":"A fundamental problem in the delay and backlog analysis across multi-hop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do not lend themselves easily to a description of the available service rate on a wireless link, the performance analysis of wireless networks has resorted to higher-layer abstractions, e.g., using Markov chain models. In this work, we propose a network calculus that can incorporate common statistical models of fading channels and obtain statistic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6630","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.6630","created_at":"2026-05-18T03:49:58.930974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6630v1","created_at":"2026-05-18T03:49:58.930974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6630","created_at":"2026-05-18T03:49:58.930974+00:00"},{"alias_kind":"pith_short_12","alias_value":"OB7BVHHVRBVT","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OB7BVHHVRBVTJ25I","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OB7BVHHV","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OB7BVHHVRBVTJ25IL5HDXZ5344","json":"https://pith.science/pith/OB7BVHHVRBVTJ25IL5HDXZ5344.json","graph_json":"https://pith.science/api/pith-number/OB7BVHHVRBVTJ25IL5HDXZ5344/graph.json","events_json":"https://pith.science/api/pith-number/OB7BVHHVRBVTJ25IL5HDXZ5344/events.json","paper":"https://pith.science/paper/OB7BVHHV"},"agent_actions":{"view_html":"https://pith.science/pith/OB7BVHHVRBVTJ25IL5HDXZ5344","download_json":"https://pith.science/pith/OB7BVHHVRBVTJ25IL5HDXZ5344.json","view_paper":"https://pith.science/paper/OB7BVHHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6630&json=true","fetch_graph":"https://pith.science/api/pith-number/OB7BVHHVRBVTJ25IL5HDXZ5344/graph.json","fetch_events":"https://pith.science/api/pith-number/OB7BVHHVRBVTJ25IL5HDXZ5344/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OB7BVHHVRBVTJ25IL5HDXZ5344/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OB7BVHHVRBVTJ25IL5HDXZ5344/action/storage_attestation","attest_author":"https://pith.science/pith/OB7BVHHVRBVTJ25IL5HDXZ5344/action/author_attestation","sign_citation":"https://pith.science/pith/OB7BVHHVRBVTJ25IL5HDXZ5344/action/citation_signature","submit_replication":"https://pith.science/pith/OB7BVHHVRBVTJ25IL5HDXZ5344/action/replication_record"}},"created_at":"2026-05-18T03:49:58.930974+00:00","updated_at":"2026-05-18T03:49:58.930974+00:00"}