{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2QVAI4SDG2PAPFZKRFYUHD6WGZ","short_pith_number":"pith:2QVAI4SD","schema_version":"1.0","canonical_sha256":"d42a047243369e07972a8971438fd6365f0dd9bdbcefb93cac2c23728965cf15","source":{"kind":"arxiv","id":"1408.1222","version":4},"attestation_state":"computed","paper":{"title":"An Approximate Inner Bound to the QoS Aware Throughput Region of a Tree Network under IEEE 802.15.4 CSMA/CA and Application to Wireless Sensor Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhijit Bhattacharya, Anurag Kumar","submitted_at":"2014-08-06T09:31:42Z","abstract_excerpt":"We consider a tree network spanning a set of source nodes that generate measurement packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count. We assume that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive sufficient conditions for the tree network to approximately satisfy certain given QoS targets such as end-to-end delivery probability "},"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":"1408.1222","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-06T09:31:42Z","cross_cats_sorted":[],"title_canon_sha256":"683652f832da18314e9c959747a3bbe7032db51fd8a25612a43e775a5c3a5dda","abstract_canon_sha256":"888847a949e70b8aa18318a80438de60c1dc228fecb7d78e47a68cb9fe21516a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:55.994157Z","signature_b64":"ry1NuS7VD6vAPuTh15PO4lCMObSj0iOZXAsQWMLyG24WijZqGxe1tjwkVIJT58huFZfmjUYtPy5tmh4PnOQZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42a047243369e07972a8971438fd6365f0dd9bdbcefb93cac2c23728965cf15","last_reissued_at":"2026-05-18T02:25:55.993784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:55.993784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Approximate Inner Bound to the QoS Aware Throughput Region of a Tree Network under IEEE 802.15.4 CSMA/CA and Application to Wireless Sensor Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhijit Bhattacharya, Anurag Kumar","submitted_at":"2014-08-06T09:31:42Z","abstract_excerpt":"We consider a tree network spanning a set of source nodes that generate measurement packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count. We assume that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive sufficient conditions for the tree network to approximately satisfy certain given QoS targets such as end-to-end delivery probability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1222","kind":"arxiv","version":4},"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":"1408.1222","created_at":"2026-05-18T02:25:55.993839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1222v4","created_at":"2026-05-18T02:25:55.993839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1222","created_at":"2026-05-18T02:25:55.993839+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QVAI4SDG2PA","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QVAI4SDG2PAPFZK","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QVAI4SD","created_at":"2026-05-18T12:28:11.866339+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/2QVAI4SDG2PAPFZKRFYUHD6WGZ","json":"https://pith.science/pith/2QVAI4SDG2PAPFZKRFYUHD6WGZ.json","graph_json":"https://pith.science/api/pith-number/2QVAI4SDG2PAPFZKRFYUHD6WGZ/graph.json","events_json":"https://pith.science/api/pith-number/2QVAI4SDG2PAPFZKRFYUHD6WGZ/events.json","paper":"https://pith.science/paper/2QVAI4SD"},"agent_actions":{"view_html":"https://pith.science/pith/2QVAI4SDG2PAPFZKRFYUHD6WGZ","download_json":"https://pith.science/pith/2QVAI4SDG2PAPFZKRFYUHD6WGZ.json","view_paper":"https://pith.science/paper/2QVAI4SD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1222&json=true","fetch_graph":"https://pith.science/api/pith-number/2QVAI4SDG2PAPFZKRFYUHD6WGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2QVAI4SDG2PAPFZKRFYUHD6WGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QVAI4SDG2PAPFZKRFYUHD6WGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QVAI4SDG2PAPFZKRFYUHD6WGZ/action/storage_attestation","attest_author":"https://pith.science/pith/2QVAI4SDG2PAPFZKRFYUHD6WGZ/action/author_attestation","sign_citation":"https://pith.science/pith/2QVAI4SDG2PAPFZKRFYUHD6WGZ/action/citation_signature","submit_replication":"https://pith.science/pith/2QVAI4SDG2PAPFZKRFYUHD6WGZ/action/replication_record"}},"created_at":"2026-05-18T02:25:55.993839+00:00","updated_at":"2026-05-18T02:25:55.993839+00:00"}