{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HKMTPIX4J3YQJP2QAA3P5KX4XR","short_pith_number":"pith:HKMTPIX4","schema_version":"1.0","canonical_sha256":"3a9937a2fc4ef104bf500036feaafcbc57351f7e96be2828057c5ee945d46230","source":{"kind":"arxiv","id":"1107.4893","version":1},"attestation_state":"computed","paper":{"title":"Approximating minimum-power edge-multicovers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nachshon Cohen, Zeev Nutov","submitted_at":"2011-07-25T11:07:16Z","abstract_excerpt":"Given a graph with edge costs, the {\\em power} of a node is themaximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider the following fundamental problem in wireless network design. Given a graph $G=(V,E)$ with edge costs and degree bounds $\\{r(v):v \\in V\\}$, the {\\sf Minimum-Power Edge-Multi-Cover} ({\\sf MPEMC}) problem is to find a minimum-power subgraph $J$ of $G$ such that the degree of every node $v$ in $J$ is at least $r(v)$. We give two approximation algorithms for {\\sf MPEMC}, wit"},"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":"1107.4893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-25T11:07:16Z","cross_cats_sorted":[],"title_canon_sha256":"9da7a775eb79735db5f5e7753e5f6982e28a3892916e5c1ce77138f68c2cbf6c","abstract_canon_sha256":"f0c448534b33f6075714083225f0929ff6f2b066b29a87c2bf5a892712ede098"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:54.338284Z","signature_b64":"wX4S9WOQQUArNHCSYbkunXV86l2BdBEeHKMYy1yqH6BLfLYKOO0595n+huRwn6ZTzgWfDZQvxxgwSSvQOQm9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a9937a2fc4ef104bf500036feaafcbc57351f7e96be2828057c5ee945d46230","last_reissued_at":"2026-05-18T04:16:54.337618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:54.337618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating minimum-power edge-multicovers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nachshon Cohen, Zeev Nutov","submitted_at":"2011-07-25T11:07:16Z","abstract_excerpt":"Given a graph with edge costs, the {\\em power} of a node is themaximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider the following fundamental problem in wireless network design. Given a graph $G=(V,E)$ with edge costs and degree bounds $\\{r(v):v \\in V\\}$, the {\\sf Minimum-Power Edge-Multi-Cover} ({\\sf MPEMC}) problem is to find a minimum-power subgraph $J$ of $G$ such that the degree of every node $v$ in $J$ is at least $r(v)$. We give two approximation algorithms for {\\sf MPEMC}, wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4893","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":"1107.4893","created_at":"2026-05-18T04:16:54.337718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4893v1","created_at":"2026-05-18T04:16:54.337718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4893","created_at":"2026-05-18T04:16:54.337718+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKMTPIX4J3YQ","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKMTPIX4J3YQJP2Q","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKMTPIX4","created_at":"2026-05-18T12:26:30.835961+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/HKMTPIX4J3YQJP2QAA3P5KX4XR","json":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR.json","graph_json":"https://pith.science/api/pith-number/HKMTPIX4J3YQJP2QAA3P5KX4XR/graph.json","events_json":"https://pith.science/api/pith-number/HKMTPIX4J3YQJP2QAA3P5KX4XR/events.json","paper":"https://pith.science/paper/HKMTPIX4"},"agent_actions":{"view_html":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR","download_json":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR.json","view_paper":"https://pith.science/paper/HKMTPIX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4893&json=true","fetch_graph":"https://pith.science/api/pith-number/HKMTPIX4J3YQJP2QAA3P5KX4XR/graph.json","fetch_events":"https://pith.science/api/pith-number/HKMTPIX4J3YQJP2QAA3P5KX4XR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/action/storage_attestation","attest_author":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/action/author_attestation","sign_citation":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/action/citation_signature","submit_replication":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/action/replication_record"}},"created_at":"2026-05-18T04:16:54.337718+00:00","updated_at":"2026-05-18T04:16:54.337718+00:00"}