{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OOQ37P2DLVXSY325GMYKHUHB7P","short_pith_number":"pith:OOQ37P2D","canonical_record":{"source":{"id":"1706.03177","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-10T03:45:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"80fcabc77b967764a4202273a5fc4f2f6d104e496cc4518a50689513c6ec2a0a","abstract_canon_sha256":"53942e6b512825d2300b8d4479abde1c07cab726c575599963a1c03c862e1790"},"schema_version":"1.0"},"canonical_sha256":"73a1bfbf435d6f2c6f5d3330a3d0e1fbe26b40b1740fd70a4b868f1cd499350a","source":{"kind":"arxiv","id":"1706.03177","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03177","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03177v3","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03177","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"OOQ37P2DLVXS","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"pith_short_16","alias_value":"OOQ37P2DLVXSY325","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"pith_short_8","alias_value":"OOQ37P2D","created_at":"2026-07-05T04:07:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OOQ37P2DLVXSY325GMYKHUHB7P","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03177","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-10T03:45:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"80fcabc77b967764a4202273a5fc4f2f6d104e496cc4518a50689513c6ec2a0a","abstract_canon_sha256":"53942e6b512825d2300b8d4479abde1c07cab726c575599963a1c03c862e1790"},"schema_version":"1.0"},"canonical_sha256":"73a1bfbf435d6f2c6f5d3330a3d0e1fbe26b40b1740fd70a4b868f1cd499350a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:07:20.083236Z","signature_b64":"3BzzDmz/9o+t2u0mlA7OHm0mQVHinyT5205g8grbfQbFL0se96o9Ho+6dokHWLlOmmCN5OkjvIncovjAUDAnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73a1bfbf435d6f2c6f5d3330a3d0e1fbe26b40b1740fd70a4b868f1cd499350a","last_reissued_at":"2026-07-05T04:07:20.082829Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:07:20.082829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03177","source_version":3,"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-07-05T04:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NYGJjNYrghY2NnWWlxk0sq/FIcdmE86Joh3sHbfs7OvqoohcVg+9EOOwHxHZMZyoe0ko1ZHEPIb5VJgvwYJgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:01:18.915777Z"},"content_sha256":"a4e0b7255995f1eae0b70bb005c61d2a01cbdce8bddcf2c3c0fb99e1f881a581","schema_version":"1.0","event_id":"sha256:a4e0b7255995f1eae0b70bb005c61d2a01cbdce8bddcf2c3c0fb99e1f881a581"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OOQ37P2DLVXSY325GMYKHUHB7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Matthias Bentert, Pavel V. Smirnov, Ren\\'e van Bevern, Rolf Niedermeier","submitted_at":"2017-06-10T03:45:43Z","abstract_excerpt":"We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless communication network: Given an edge-weighted $n$-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph. On the negative side, we show that $o(\\log n)$-approximating the difference $d$ between the optimal solution cost and a natural lower bound is NP-hard and that, under the Exponential Time Hypothesis, there are no exact algorithms running in $2^{o(n)}$ time or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03177","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1706.03177/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNAYXAq50DzkCmB1DXtKrPe2wWkwFUYG8Trf0wBADYP+UItXKUBMMoPJjox6MuQTlzLyvcFCamiHXt5V2CgjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:01:18.916152Z"},"content_sha256":"21b9358be54cd9638e8f6bcf6758f896312627fe64bb14f4154d343f4625424f","schema_version":"1.0","event_id":"sha256:21b9358be54cd9638e8f6bcf6758f896312627fe64bb14f4154d343f4625424f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOQ37P2DLVXSY325GMYKHUHB7P/bundle.json","state_url":"https://pith.science/pith/OOQ37P2DLVXSY325GMYKHUHB7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOQ37P2DLVXSY325GMYKHUHB7P/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-07T10:01:18Z","links":{"resolver":"https://pith.science/pith/OOQ37P2DLVXSY325GMYKHUHB7P","bundle":"https://pith.science/pith/OOQ37P2DLVXSY325GMYKHUHB7P/bundle.json","state":"https://pith.science/pith/OOQ37P2DLVXSY325GMYKHUHB7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOQ37P2DLVXSY325GMYKHUHB7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OOQ37P2DLVXSY325GMYKHUHB7P","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":"53942e6b512825d2300b8d4479abde1c07cab726c575599963a1c03c862e1790","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-10T03:45:43Z","title_canon_sha256":"80fcabc77b967764a4202273a5fc4f2f6d104e496cc4518a50689513c6ec2a0a"},"schema_version":"1.0","source":{"id":"1706.03177","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03177","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03177v3","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03177","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"OOQ37P2DLVXS","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"pith_short_16","alias_value":"OOQ37P2DLVXSY325","created_at":"2026-07-05T04:07:20Z"},{"alias_kind":"pith_short_8","alias_value":"OOQ37P2D","created_at":"2026-07-05T04:07:20Z"}],"graph_snapshots":[{"event_id":"sha256:21b9358be54cd9638e8f6bcf6758f896312627fe64bb14f4154d343f4625424f","target":"graph","created_at":"2026-07-05T04:07:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1706.03177/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless communication network: Given an edge-weighted $n$-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph. On the negative side, we show that $o(\\log n)$-approximating the difference $d$ between the optimal solution cost and a natural lower bound is NP-hard and that, under the Exponential Time Hypothesis, there are no exact algorithms running in $2^{o(n)}$ time or","authors_text":"Andr\\'e Nichterlein, Matthias Bentert, Pavel V. Smirnov, Ren\\'e van Bevern, Rolf Niedermeier","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-10T03:45:43Z","title":"Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03177","kind":"arxiv","version":3},"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:a4e0b7255995f1eae0b70bb005c61d2a01cbdce8bddcf2c3c0fb99e1f881a581","target":"record","created_at":"2026-07-05T04:07:20Z","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":"53942e6b512825d2300b8d4479abde1c07cab726c575599963a1c03c862e1790","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-10T03:45:43Z","title_canon_sha256":"80fcabc77b967764a4202273a5fc4f2f6d104e496cc4518a50689513c6ec2a0a"},"schema_version":"1.0","source":{"id":"1706.03177","kind":"arxiv","version":3}},"canonical_sha256":"73a1bfbf435d6f2c6f5d3330a3d0e1fbe26b40b1740fd70a4b868f1cd499350a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73a1bfbf435d6f2c6f5d3330a3d0e1fbe26b40b1740fd70a4b868f1cd499350a","first_computed_at":"2026-07-05T04:07:20.082829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:07:20.082829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3BzzDmz/9o+t2u0mlA7OHm0mQVHinyT5205g8grbfQbFL0se96o9Ho+6dokHWLlOmmCN5OkjvIncovjAUDAnCg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:07:20.083236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03177","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4e0b7255995f1eae0b70bb005c61d2a01cbdce8bddcf2c3c0fb99e1f881a581","sha256:21b9358be54cd9638e8f6bcf6758f896312627fe64bb14f4154d343f4625424f"],"state_sha256":"d56318a4ff7c0c4283873831e8e0bec26d15708d11ad6b87a9126082564b6bfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5nb0wrnI67ewTzpKS8yIHI2sCiX3HYH6k3Pp466X3JqooUPjSBVw2SQGxvbGm66L7mSqC71IZ/og1i4fOUpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:01:18.918230Z","bundle_sha256":"04e0d2f55670c137983dab4941d9747051b78a9040e791b9d0dd04cf4368f65f"}}