{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PNEKCDDJCC5FHR6C75QLNLLHA2","short_pith_number":"pith:PNEKCDDJ","canonical_record":{"source":{"id":"1502.03989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T13:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"bb27c98c7324d700e1fa9fa11975b4b2db8a161389521e655bb08c6d119eb9e5","abstract_canon_sha256":"166da28978b13b6a35f1b563d97f4e1aed78a95f404e7e7360bac4fca44e4238"},"schema_version":"1.0"},"canonical_sha256":"7b48a10c6910ba53c7c2ff60b6ad67069f1b0fe7e0ee781428d3d8690bfbd91a","source":{"kind":"arxiv","id":"1502.03989","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03989","created_at":"2026-05-18T02:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03989v2","created_at":"2026-05-18T02:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03989","created_at":"2026-05-18T02:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"PNEKCDDJCC5F","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNEKCDDJCC5FHR6C","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNEKCDDJ","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PNEKCDDJCC5FHR6C75QLNLLHA2","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T13:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"bb27c98c7324d700e1fa9fa11975b4b2db8a161389521e655bb08c6d119eb9e5","abstract_canon_sha256":"166da28978b13b6a35f1b563d97f4e1aed78a95f404e7e7360bac4fca44e4238"},"schema_version":"1.0"},"canonical_sha256":"7b48a10c6910ba53c7c2ff60b6ad67069f1b0fe7e0ee781428d3d8690bfbd91a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:15.210730Z","signature_b64":"/E3wWsLdisvip7/PWuWiG2lSxHHd97DMzDBaTcTntBVElDjIJChQWUQR835i0+cYxaSArIKIikNjPOVFAjDFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b48a10c6910ba53c7c2ff60b6ad67069f1b0fe7e0ee781428d3d8690bfbd91a","last_reissued_at":"2026-05-18T02:18:15.210363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:15.210363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03989","source_version":2,"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-18T02:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlXM5+ez1f/z/iTbfCX3p7REvJp/IMGHGpsB32qrF9XkYk2jRN/z+c2X8c/6n2cF1GrRAHvVjpCBLoyeZyzyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:39:51.076115Z"},"content_sha256":"263de537d50b03025251af867e5dc36aacf0ad3045c9210ae44e5f7f44b283d7","schema_version":"1.0","event_id":"sha256:263de537d50b03025251af867e5dc36aacf0ad3045c9210ae44e5f7f44b283d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PNEKCDDJCC5FHR6C75QLNLLHA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Secluded Connectivity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander S. Kulikov, Fedor V. Fomin, Nikolay Karpov, Petr A. Golovach","submitted_at":"2015-02-13T13:53:48Z","abstract_excerpt":"The Secluded Path problem models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of a selected path is its exposure, which is the total weight of vertices in its closed neighborhood. In order to minimize the risk of intercepting the information, we are interested in selecting a secluded path, i.e. a path with a small exposure. Similarly, the Secluded Steiner Tree problem is to find a tree in a graph connecting a given set of terminals such that the exposure of the tree is minimized. The problems were "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03989","kind":"arxiv","version":2},"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-18T02:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cUYjdSTBTiHCNOSEiqVYamAtjf0mt1trbfZB/y75XscdA3XzN+GgNMi889+nRMoCBr7LG7yE47cBeSqniPIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:39:51.076821Z"},"content_sha256":"7e9d0c025836613f055c2f26403a9afe10ef4a54bd7dc1597ae5a5bb6a025895","schema_version":"1.0","event_id":"sha256:7e9d0c025836613f055c2f26403a9afe10ef4a54bd7dc1597ae5a5bb6a025895"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNEKCDDJCC5FHR6C75QLNLLHA2/bundle.json","state_url":"https://pith.science/pith/PNEKCDDJCC5FHR6C75QLNLLHA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNEKCDDJCC5FHR6C75QLNLLHA2/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-05-25T21:39:51Z","links":{"resolver":"https://pith.science/pith/PNEKCDDJCC5FHR6C75QLNLLHA2","bundle":"https://pith.science/pith/PNEKCDDJCC5FHR6C75QLNLLHA2/bundle.json","state":"https://pith.science/pith/PNEKCDDJCC5FHR6C75QLNLLHA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNEKCDDJCC5FHR6C75QLNLLHA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PNEKCDDJCC5FHR6C75QLNLLHA2","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":"166da28978b13b6a35f1b563d97f4e1aed78a95f404e7e7360bac4fca44e4238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T13:53:48Z","title_canon_sha256":"bb27c98c7324d700e1fa9fa11975b4b2db8a161389521e655bb08c6d119eb9e5"},"schema_version":"1.0","source":{"id":"1502.03989","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03989","created_at":"2026-05-18T02:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03989v2","created_at":"2026-05-18T02:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03989","created_at":"2026-05-18T02:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"PNEKCDDJCC5F","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNEKCDDJCC5FHR6C","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNEKCDDJ","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:7e9d0c025836613f055c2f26403a9afe10ef4a54bd7dc1597ae5a5bb6a025895","target":"graph","created_at":"2026-05-18T02:18:15Z","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":"The Secluded Path problem models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of a selected path is its exposure, which is the total weight of vertices in its closed neighborhood. In order to minimize the risk of intercepting the information, we are interested in selecting a secluded path, i.e. a path with a small exposure. Similarly, the Secluded Steiner Tree problem is to find a tree in a graph connecting a given set of terminals such that the exposure of the tree is minimized. The problems were ","authors_text":"Alexander S. Kulikov, Fedor V. Fomin, Nikolay Karpov, Petr A. Golovach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T13:53:48Z","title":"Parameterized Complexity of Secluded Connectivity Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03989","kind":"arxiv","version":2},"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:263de537d50b03025251af867e5dc36aacf0ad3045c9210ae44e5f7f44b283d7","target":"record","created_at":"2026-05-18T02:18:15Z","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":"166da28978b13b6a35f1b563d97f4e1aed78a95f404e7e7360bac4fca44e4238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T13:53:48Z","title_canon_sha256":"bb27c98c7324d700e1fa9fa11975b4b2db8a161389521e655bb08c6d119eb9e5"},"schema_version":"1.0","source":{"id":"1502.03989","kind":"arxiv","version":2}},"canonical_sha256":"7b48a10c6910ba53c7c2ff60b6ad67069f1b0fe7e0ee781428d3d8690bfbd91a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b48a10c6910ba53c7c2ff60b6ad67069f1b0fe7e0ee781428d3d8690bfbd91a","first_computed_at":"2026-05-18T02:18:15.210363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:15.210363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/E3wWsLdisvip7/PWuWiG2lSxHHd97DMzDBaTcTntBVElDjIJChQWUQR835i0+cYxaSArIKIikNjPOVFAjDFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:15.210730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03989","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:263de537d50b03025251af867e5dc36aacf0ad3045c9210ae44e5f7f44b283d7","sha256:7e9d0c025836613f055c2f26403a9afe10ef4a54bd7dc1597ae5a5bb6a025895"],"state_sha256":"cf59bf9746b597f95bf230e9e94fa50eb4e3f03aa4eacac1e6400cedeb8bf96b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tomtwLvsYhXNAyVkWq527VxPPr77p5mCJ1F40j5DSEoc4Qnhz8MZ5CMtnjnDXw07N2u/ah2nZS1+0o2dtN9uCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:39:51.080626Z","bundle_sha256":"28b638e4a4a4fba964826b365c8af2039a8b96ccb0a623c5418d5a0b2f9068be"}}