{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4JQNCCVYPXM5T4RHHXRINKYDCK","short_pith_number":"pith:4JQNCCVY","canonical_record":{"source":{"id":"2005.14620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-29T15:25:49Z","cross_cats_sorted":[],"title_canon_sha256":"6aac81db1d0dbe8633cc7830c20a3ddc7b026582886227429e4f72a8c20a152f","abstract_canon_sha256":"1d95c8ac67f817f22bb99ebfe79ddb5b88e0eaf96816e90f0c259f3ce57d71c2"},"schema_version":"1.0"},"canonical_sha256":"e260d10ab87dd9d9f2273de286ab0312915b794f832dc7eb5bb2667a2c676d2b","source":{"kind":"arxiv","id":"2005.14620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.14620","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"2005.14620v1","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.14620","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"4JQNCCVYPXM5","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"4JQNCCVYPXM5T4RH","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"4JQNCCVY","created_at":"2026-07-05T01:06:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4JQNCCVYPXM5T4RHHXRINKYDCK","target":"record","payload":{"canonical_record":{"source":{"id":"2005.14620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-29T15:25:49Z","cross_cats_sorted":[],"title_canon_sha256":"6aac81db1d0dbe8633cc7830c20a3ddc7b026582886227429e4f72a8c20a152f","abstract_canon_sha256":"1d95c8ac67f817f22bb99ebfe79ddb5b88e0eaf96816e90f0c259f3ce57d71c2"},"schema_version":"1.0"},"canonical_sha256":"e260d10ab87dd9d9f2273de286ab0312915b794f832dc7eb5bb2667a2c676d2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:38.528042Z","signature_b64":"Lyya7HNiVqUgr69sXoLy4acIoOTc4moAKPTp0cbNuifOb+B+ATGvvFk/hjxgfvfJuvrJmdz7pgRVOK072IwdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e260d10ab87dd9d9f2273de286ab0312915b794f832dc7eb5bb2667a2c676d2b","last_reissued_at":"2026-07-05T01:06:38.527697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:38.527697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.14620","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-07-05T01:06:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjbQWkWNbQrtkoi24XaBR9sLkDfmoPu7/ml+JAcmYvO9KWzO0+rPusfdm5/mGfrpw8H9a1q7f/nFU1vTck7oCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:44:26.843370Z"},"content_sha256":"ed2d88471d33506a83cf003b6c921278c8aeb9bf0a5fa50bb3a9cc819b7af35a","schema_version":"1.0","event_id":"sha256:ed2d88471d33506a83cf003b6c921278c8aeb9bf0a5fa50bb3a9cc819b7af35a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4JQNCCVYPXM5T4RHHXRINKYDCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Min-Power Asymmetric Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Christian Hofer, Matthias Bentert, Roman Haag, Tomohiro Koana","submitted_at":"2020-05-29T15:25:49Z","abstract_excerpt":"We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric Connectivity (MinPAC) that has applications in wireless sensor networks. Given a directed arc-weighted graph, MinPAC asks for a strongly connected spanning subgraph minimizing the summed vertex costs. Here, the cost of each vertex is the weight of its heaviest outgoing arc in the chosen subgraph. We present linear-time algorithms for the cases where the number of strongly connected components in a so-called obligatory subgraph or the feedback edge number in the underlying undirected graph is constant. Compleme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.14620","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.14620/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-05T01:06:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLyIvWfoaYhJKuXezYXbEP/darVPBjpFqo8JvOGqyjkz4fSfWCokcDrP6FgF5m257iJUH6SsMITlAj7cYVErBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:44:26.843746Z"},"content_sha256":"232f457d4a73ec1a9a022d33a07a1825d053231dcdf40fe161484dfeb13a10ea","schema_version":"1.0","event_id":"sha256:232f457d4a73ec1a9a022d33a07a1825d053231dcdf40fe161484dfeb13a10ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JQNCCVYPXM5T4RHHXRINKYDCK/bundle.json","state_url":"https://pith.science/pith/4JQNCCVYPXM5T4RHHXRINKYDCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JQNCCVYPXM5T4RHHXRINKYDCK/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-07T08:44:26Z","links":{"resolver":"https://pith.science/pith/4JQNCCVYPXM5T4RHHXRINKYDCK","bundle":"https://pith.science/pith/4JQNCCVYPXM5T4RHHXRINKYDCK/bundle.json","state":"https://pith.science/pith/4JQNCCVYPXM5T4RHHXRINKYDCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JQNCCVYPXM5T4RHHXRINKYDCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4JQNCCVYPXM5T4RHHXRINKYDCK","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":"1d95c8ac67f817f22bb99ebfe79ddb5b88e0eaf96816e90f0c259f3ce57d71c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-29T15:25:49Z","title_canon_sha256":"6aac81db1d0dbe8633cc7830c20a3ddc7b026582886227429e4f72a8c20a152f"},"schema_version":"1.0","source":{"id":"2005.14620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.14620","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"2005.14620v1","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.14620","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"4JQNCCVYPXM5","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"4JQNCCVYPXM5T4RH","created_at":"2026-07-05T01:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"4JQNCCVY","created_at":"2026-07-05T01:06:38Z"}],"graph_snapshots":[{"event_id":"sha256:232f457d4a73ec1a9a022d33a07a1825d053231dcdf40fe161484dfeb13a10ea","target":"graph","created_at":"2026-07-05T01:06:38Z","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/2005.14620/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric Connectivity (MinPAC) that has applications in wireless sensor networks. Given a directed arc-weighted graph, MinPAC asks for a strongly connected spanning subgraph minimizing the summed vertex costs. Here, the cost of each vertex is the weight of its heaviest outgoing arc in the chosen subgraph. We present linear-time algorithms for the cases where the number of strongly connected components in a so-called obligatory subgraph or the feedback edge number in the underlying undirected graph is constant. Compleme","authors_text":"Andr\\'e Nichterlein, Christian Hofer, Matthias Bentert, Roman Haag, Tomohiro Koana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-29T15:25:49Z","title":"Parameterized Complexity of Min-Power Asymmetric Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.14620","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:ed2d88471d33506a83cf003b6c921278c8aeb9bf0a5fa50bb3a9cc819b7af35a","target":"record","created_at":"2026-07-05T01:06:38Z","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":"1d95c8ac67f817f22bb99ebfe79ddb5b88e0eaf96816e90f0c259f3ce57d71c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-29T15:25:49Z","title_canon_sha256":"6aac81db1d0dbe8633cc7830c20a3ddc7b026582886227429e4f72a8c20a152f"},"schema_version":"1.0","source":{"id":"2005.14620","kind":"arxiv","version":1}},"canonical_sha256":"e260d10ab87dd9d9f2273de286ab0312915b794f832dc7eb5bb2667a2c676d2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e260d10ab87dd9d9f2273de286ab0312915b794f832dc7eb5bb2667a2c676d2b","first_computed_at":"2026-07-05T01:06:38.527697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:06:38.527697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lyya7HNiVqUgr69sXoLy4acIoOTc4moAKPTp0cbNuifOb+B+ATGvvFk/hjxgfvfJuvrJmdz7pgRVOK072IwdAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:06:38.528042Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.14620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed2d88471d33506a83cf003b6c921278c8aeb9bf0a5fa50bb3a9cc819b7af35a","sha256:232f457d4a73ec1a9a022d33a07a1825d053231dcdf40fe161484dfeb13a10ea"],"state_sha256":"c354dc15c4c051df4b3bc1889d15f1989b00e75c160b526404ecfe866182e17e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TGXNFvxbpbSxOeDTcEyfA12l+KyetxkanQV6WeYG92jY6kSE0msS/WS+U2cxM8rL97ibm+kUvL/MzBvrQYiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:44:26.845989Z","bundle_sha256":"acacccb69587f25dc0f10d62184ad1cd1c5cc1f3be441a90d7c6039d048e2fe0"}}