{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HKMTPIX4J3YQJP2QAA3P5KX4XR","short_pith_number":"pith:HKMTPIX4","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"},"canonical_sha256":"3a9937a2fc4ef104bf500036feaafcbc57351f7e96be2828057c5ee945d46230","source":{"kind":"arxiv","id":"1107.4893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4893","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4893v1","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4893","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"HKMTPIX4J3YQ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HKMTPIX4J3YQJP2Q","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HKMTPIX4","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HKMTPIX4J3YQJP2QAA3P5KX4XR","target":"record","payload":{"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"},"canonical_sha256":"3a9937a2fc4ef104bf500036feaafcbc57351f7e96be2828057c5ee945d46230","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"},"source_kind":"arxiv","source_id":"1107.4893","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPLGs6c5xVp/8lqaxfBdtVv00xcjKYb/uTCMy9UjS35yWdDZVV/hRSGa/Fyk9tHiVs+h8sRuzC6B6CflStsXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:19:39.170377Z"},"content_sha256":"5dc7f1e3095f2fab58397623e5791325b830915777037b49929eb1df6641dd0e","schema_version":"1.0","event_id":"sha256:5dc7f1e3095f2fab58397623e5791325b830915777037b49929eb1df6641dd0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HKMTPIX4J3YQJP2QAA3P5KX4XR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgnYPtBHICi3+s8ZOa2ObiO4LGrZ/ykPabl+CpNB7xLTjrhxjNfC1yjGhVMDKlb/tRknZVCm01KlXewZsyuPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:19:39.170728Z"},"content_sha256":"cfda82fdbf6c4847608c1ec7e31aaccca92128155a7451269e2dba52e00bef71","schema_version":"1.0","event_id":"sha256:cfda82fdbf6c4847608c1ec7e31aaccca92128155a7451269e2dba52e00bef71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/bundle.json","state_url":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T15:19:39Z","links":{"resolver":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR","bundle":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/bundle.json","state":"https://pith.science/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKMTPIX4J3YQJP2QAA3P5KX4XR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HKMTPIX4J3YQJP2QAA3P5KX4XR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f0c448534b33f6075714083225f0929ff6f2b066b29a87c2bf5a892712ede098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-25T11:07:16Z","title_canon_sha256":"9da7a775eb79735db5f5e7753e5f6982e28a3892916e5c1ce77138f68c2cbf6c"},"schema_version":"1.0","source":{"id":"1107.4893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4893","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4893v1","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4893","created_at":"2026-05-18T04:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"HKMTPIX4J3YQ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HKMTPIX4J3YQJP2Q","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HKMTPIX4","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:cfda82fdbf6c4847608c1ec7e31aaccca92128155a7451269e2dba52e00bef71","target":"graph","created_at":"2026-05-18T04:16:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Nachshon Cohen, Zeev Nutov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-25T11:07:16Z","title":"Approximating minimum-power edge-multicovers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4893","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5dc7f1e3095f2fab58397623e5791325b830915777037b49929eb1df6641dd0e","target":"record","created_at":"2026-05-18T04:16:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f0c448534b33f6075714083225f0929ff6f2b066b29a87c2bf5a892712ede098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-25T11:07:16Z","title_canon_sha256":"9da7a775eb79735db5f5e7753e5f6982e28a3892916e5c1ce77138f68c2cbf6c"},"schema_version":"1.0","source":{"id":"1107.4893","kind":"arxiv","version":1}},"canonical_sha256":"3a9937a2fc4ef104bf500036feaafcbc57351f7e96be2828057c5ee945d46230","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a9937a2fc4ef104bf500036feaafcbc57351f7e96be2828057c5ee945d46230","first_computed_at":"2026-05-18T04:16:54.337618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:54.337618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wX4S9WOQQUArNHCSYbkunXV86l2BdBEeHKMYy1yqH6BLfLYKOO0595n+huRwn6ZTzgWfDZQvxxgwSSvQOQm9BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:54.338284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dc7f1e3095f2fab58397623e5791325b830915777037b49929eb1df6641dd0e","sha256:cfda82fdbf6c4847608c1ec7e31aaccca92128155a7451269e2dba52e00bef71"],"state_sha256":"127c3fb08464f591ec2319e0ae905291aa6d68a9b0dd23720996e0415bebb40f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+09xoBxyVIa65egCth3QxVf4cci/9EXY+EQnf2AMETeY3y/fDWsV9J+OvE3rwvDZDr1514qkYX1iFWcnqVGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T15:19:39.172730Z","bundle_sha256":"bf018b21136981936fd4071311af76c9ef1a08068fd4f8b5081c0a9a06319028"}}