{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NREYECP4YCWT6OR3EM5CUNDETE","short_pith_number":"pith:NREYECP4","schema_version":"1.0","canonical_sha256":"6c498209fcc0ad3f3a3b233a2a3464991f85b9f1484c1d200918e2a4fe8881a9","source":{"kind":"arxiv","id":"1301.3230","version":3},"attestation_state":"computed","paper":{"title":"A Framework for Quality of Service with a Multiple Access Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Easwar Vivek Mangipudi, Venkatesh Ramaiyan","submitted_at":"2013-01-15T06:05:42Z","abstract_excerpt":"We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless channel. For an infrastructure mode of traffic with a centralized scheduler, we are interested in the long time average throughput achievable for the real time traffic. In [1], the authors have stud- ied the feasible throughput vectors by identifying the necessary and sufficient conditions using work load characterization. In our work, we provide a character"},"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":"1301.3230","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-01-15T06:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"09a84abc925f561c334d872d39eb9740d9ba458a245107d75387330cf2812f4e","abstract_canon_sha256":"be4762ad188d4a4a644d444db3eb78bc72198c8b218cfab6b90b1f60ca823c13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:22.560722Z","signature_b64":"Fixl8nb5sW/ttpiDt8aezSmKq3Eyw4euSflVsDESCRWBCW6mc+2IN+xlreHNAHBLea8P+eIjgWCgFAU/jvJFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c498209fcc0ad3f3a3b233a2a3464991f85b9f1484c1d200918e2a4fe8881a9","last_reissued_at":"2026-05-18T03:04:22.560307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:22.560307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Quality of Service with a Multiple Access Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Easwar Vivek Mangipudi, Venkatesh Ramaiyan","submitted_at":"2013-01-15T06:05:42Z","abstract_excerpt":"We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless channel. For an infrastructure mode of traffic with a centralized scheduler, we are interested in the long time average throughput achievable for the real time traffic. In [1], the authors have stud- ied the feasible throughput vectors by identifying the necessary and sufficient conditions using work load characterization. In our work, we provide a character"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3230","kind":"arxiv","version":3},"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":"1301.3230","created_at":"2026-05-18T03:04:22.560386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3230v3","created_at":"2026-05-18T03:04:22.560386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3230","created_at":"2026-05-18T03:04:22.560386+00:00"},{"alias_kind":"pith_short_12","alias_value":"NREYECP4YCWT","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NREYECP4YCWT6OR3","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NREYECP4","created_at":"2026-05-18T12:27:52.871228+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/NREYECP4YCWT6OR3EM5CUNDETE","json":"https://pith.science/pith/NREYECP4YCWT6OR3EM5CUNDETE.json","graph_json":"https://pith.science/api/pith-number/NREYECP4YCWT6OR3EM5CUNDETE/graph.json","events_json":"https://pith.science/api/pith-number/NREYECP4YCWT6OR3EM5CUNDETE/events.json","paper":"https://pith.science/paper/NREYECP4"},"agent_actions":{"view_html":"https://pith.science/pith/NREYECP4YCWT6OR3EM5CUNDETE","download_json":"https://pith.science/pith/NREYECP4YCWT6OR3EM5CUNDETE.json","view_paper":"https://pith.science/paper/NREYECP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3230&json=true","fetch_graph":"https://pith.science/api/pith-number/NREYECP4YCWT6OR3EM5CUNDETE/graph.json","fetch_events":"https://pith.science/api/pith-number/NREYECP4YCWT6OR3EM5CUNDETE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NREYECP4YCWT6OR3EM5CUNDETE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NREYECP4YCWT6OR3EM5CUNDETE/action/storage_attestation","attest_author":"https://pith.science/pith/NREYECP4YCWT6OR3EM5CUNDETE/action/author_attestation","sign_citation":"https://pith.science/pith/NREYECP4YCWT6OR3EM5CUNDETE/action/citation_signature","submit_replication":"https://pith.science/pith/NREYECP4YCWT6OR3EM5CUNDETE/action/replication_record"}},"created_at":"2026-05-18T03:04:22.560386+00:00","updated_at":"2026-05-18T03:04:22.560386+00:00"}