{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WDKIWI4ZPS6L6HSWGW4I52F6XS","short_pith_number":"pith:WDKIWI4Z","schema_version":"1.0","canonical_sha256":"b0d48b23997cbcbf1e5635b88ee8bebc952d364a86f08411bf603bada20eb186","source":{"kind":"arxiv","id":"1403.5882","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Analysis of Power Assignments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, Maurits de Graaf","submitted_at":"2014-03-24T08:50:59Z","abstract_excerpt":"A fundamental problem for wireless ad hoc networks is the assignment of suitable transmission powers to the wireless devices such that the resulting communication graph is connected. The goal is to minimize the total transmit power in order to maximize the life-time of the network. Our aim is a probabilistic analysis of this power assignment problem. We prove complete convergence for arbitrary combinations of the dimension d and the distance-power gradient p. Furthermore, we prove that the expected approximation ratio of the simple spanning tree heuristic is strictly less than its worst-case r"},"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":"1403.5882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-24T08:50:59Z","cross_cats_sorted":[],"title_canon_sha256":"31f463147492fb9471e3bdf94538e2d767d6828faf992ca4e856ffedfce938d7","abstract_canon_sha256":"60b53d13a1880bbef09e06cb0402b38698868c91a3b9647d7b03cfe9e4e5b6c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:47.521730Z","signature_b64":"Xigdbzn3toV4nXb3Di8cN5hE7fAXSAOKC+BGn35mAMekpP2E7ti3IW9AiEMXNUH9YAVlGiia9Ady4FtcWPOLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0d48b23997cbcbf1e5635b88ee8bebc952d364a86f08411bf603bada20eb186","last_reissued_at":"2026-05-18T02:55:47.521188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:47.521188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Analysis of Power Assignments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, Maurits de Graaf","submitted_at":"2014-03-24T08:50:59Z","abstract_excerpt":"A fundamental problem for wireless ad hoc networks is the assignment of suitable transmission powers to the wireless devices such that the resulting communication graph is connected. The goal is to minimize the total transmit power in order to maximize the life-time of the network. Our aim is a probabilistic analysis of this power assignment problem. We prove complete convergence for arbitrary combinations of the dimension d and the distance-power gradient p. Furthermore, we prove that the expected approximation ratio of the simple spanning tree heuristic is strictly less than its worst-case r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5882","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":"1403.5882","created_at":"2026-05-18T02:55:47.521270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5882v1","created_at":"2026-05-18T02:55:47.521270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5882","created_at":"2026-05-18T02:55:47.521270+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDKIWI4ZPS6L","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDKIWI4ZPS6L6HSW","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDKIWI4Z","created_at":"2026-05-18T12:28:54.890064+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/WDKIWI4ZPS6L6HSWGW4I52F6XS","json":"https://pith.science/pith/WDKIWI4ZPS6L6HSWGW4I52F6XS.json","graph_json":"https://pith.science/api/pith-number/WDKIWI4ZPS6L6HSWGW4I52F6XS/graph.json","events_json":"https://pith.science/api/pith-number/WDKIWI4ZPS6L6HSWGW4I52F6XS/events.json","paper":"https://pith.science/paper/WDKIWI4Z"},"agent_actions":{"view_html":"https://pith.science/pith/WDKIWI4ZPS6L6HSWGW4I52F6XS","download_json":"https://pith.science/pith/WDKIWI4ZPS6L6HSWGW4I52F6XS.json","view_paper":"https://pith.science/paper/WDKIWI4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5882&json=true","fetch_graph":"https://pith.science/api/pith-number/WDKIWI4ZPS6L6HSWGW4I52F6XS/graph.json","fetch_events":"https://pith.science/api/pith-number/WDKIWI4ZPS6L6HSWGW4I52F6XS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDKIWI4ZPS6L6HSWGW4I52F6XS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDKIWI4ZPS6L6HSWGW4I52F6XS/action/storage_attestation","attest_author":"https://pith.science/pith/WDKIWI4ZPS6L6HSWGW4I52F6XS/action/author_attestation","sign_citation":"https://pith.science/pith/WDKIWI4ZPS6L6HSWGW4I52F6XS/action/citation_signature","submit_replication":"https://pith.science/pith/WDKIWI4ZPS6L6HSWGW4I52F6XS/action/replication_record"}},"created_at":"2026-05-18T02:55:47.521270+00:00","updated_at":"2026-05-18T02:55:47.521270+00:00"}