{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:B66UHJIE3ZNGUHSMGUK23BXDBE","short_pith_number":"pith:B66UHJIE","schema_version":"1.0","canonical_sha256":"0fbd43a504de5a6a1e4c3515ad86e3090974cb148bad8abb366a7fc9a5e91af6","source":{"kind":"arxiv","id":"1110.4746","version":5},"attestation_state":"computed","paper":{"title":"QoS Aware and Survivable Network Design for Planned Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhijit Bhattacharya, Anurag Kumar","submitted_at":"2011-10-21T10:28:15Z","abstract_excerpt":"We study the problem of wireless sensor network design by deploying a minimum number of additional relay nodes (to minimize network cost) at a subset of given potential relay locations, in order to convey the data from already existing sensor nodes (hereafter called source nodes) to a Base Station, while meeting a certain specified hop count bound (the hop count bound is chosen to ensure a pre-determined probability of the data being delivered to the BS within a given maximum delay). We study two variations of the problem.\n  First we sudy the problem of guaranteed QoS connected network design,"},"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":"1110.4746","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-10-21T10:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"c8ca70ac9724d97161b6e339c2e696d5e290163b74918f0a97a19cb587b2732f","abstract_canon_sha256":"5be802c352ba5897319a24c80a6d7143b69a50179dc9b55bbb786cfa8c7e3ed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:41.939675Z","signature_b64":"UcDk7kz+CcMC8Uj5Ps7HzUwb137xOoVuCoIyItHJOEzu6aunD7/RcPHWJzE5KObz8JdBTYD95SYe9cVa3jwdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fbd43a504de5a6a1e4c3515ad86e3090974cb148bad8abb366a7fc9a5e91af6","last_reissued_at":"2026-05-18T02:53:41.938835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:41.938835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QoS Aware and Survivable Network Design for Planned Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhijit Bhattacharya, Anurag Kumar","submitted_at":"2011-10-21T10:28:15Z","abstract_excerpt":"We study the problem of wireless sensor network design by deploying a minimum number of additional relay nodes (to minimize network cost) at a subset of given potential relay locations, in order to convey the data from already existing sensor nodes (hereafter called source nodes) to a Base Station, while meeting a certain specified hop count bound (the hop count bound is chosen to ensure a pre-determined probability of the data being delivered to the BS within a given maximum delay). We study two variations of the problem.\n  First we sudy the problem of guaranteed QoS connected network design,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4746","kind":"arxiv","version":5},"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":"1110.4746","created_at":"2026-05-18T02:53:41.938980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.4746v5","created_at":"2026-05-18T02:53:41.938980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4746","created_at":"2026-05-18T02:53:41.938980+00:00"},{"alias_kind":"pith_short_12","alias_value":"B66UHJIE3ZNG","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B66UHJIE3ZNGUHSM","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B66UHJIE","created_at":"2026-05-18T12:26:24.575870+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/B66UHJIE3ZNGUHSMGUK23BXDBE","json":"https://pith.science/pith/B66UHJIE3ZNGUHSMGUK23BXDBE.json","graph_json":"https://pith.science/api/pith-number/B66UHJIE3ZNGUHSMGUK23BXDBE/graph.json","events_json":"https://pith.science/api/pith-number/B66UHJIE3ZNGUHSMGUK23BXDBE/events.json","paper":"https://pith.science/paper/B66UHJIE"},"agent_actions":{"view_html":"https://pith.science/pith/B66UHJIE3ZNGUHSMGUK23BXDBE","download_json":"https://pith.science/pith/B66UHJIE3ZNGUHSMGUK23BXDBE.json","view_paper":"https://pith.science/paper/B66UHJIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.4746&json=true","fetch_graph":"https://pith.science/api/pith-number/B66UHJIE3ZNGUHSMGUK23BXDBE/graph.json","fetch_events":"https://pith.science/api/pith-number/B66UHJIE3ZNGUHSMGUK23BXDBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B66UHJIE3ZNGUHSMGUK23BXDBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B66UHJIE3ZNGUHSMGUK23BXDBE/action/storage_attestation","attest_author":"https://pith.science/pith/B66UHJIE3ZNGUHSMGUK23BXDBE/action/author_attestation","sign_citation":"https://pith.science/pith/B66UHJIE3ZNGUHSMGUK23BXDBE/action/citation_signature","submit_replication":"https://pith.science/pith/B66UHJIE3ZNGUHSMGUK23BXDBE/action/replication_record"}},"created_at":"2026-05-18T02:53:41.938980+00:00","updated_at":"2026-05-18T02:53:41.938980+00:00"}