{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KUJNLOSTMQLLWCMOAHNQQNE2PJ","short_pith_number":"pith:KUJNLOST","canonical_record":{"source":{"id":"1805.11275","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T07:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"d90c7bb9b0d407bf5d7ad25e397b3ed5adf1c79162b43eedfb29c919b976d2fa","abstract_canon_sha256":"db263c0b6ce4ad609ae0623e0659120bbc2fcd8978725aa9c3fa9db9582eaad0"},"schema_version":"1.0"},"canonical_sha256":"5512d5ba536416bb098e01db08349a7a6ec81047ce48d720ff8aabbf7de1f12c","source":{"kind":"arxiv","id":"1805.11275","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11275","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11275v8","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11275","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"KUJNLOSTMQLL","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"pith_short_16","alias_value":"KUJNLOSTMQLLWCMO","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"pith_short_8","alias_value":"KUJNLOST","created_at":"2026-07-05T06:58:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KUJNLOSTMQLLWCMOAHNQQNE2PJ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11275","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T07:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"d90c7bb9b0d407bf5d7ad25e397b3ed5adf1c79162b43eedfb29c919b976d2fa","abstract_canon_sha256":"db263c0b6ce4ad609ae0623e0659120bbc2fcd8978725aa9c3fa9db9582eaad0"},"schema_version":"1.0"},"canonical_sha256":"5512d5ba536416bb098e01db08349a7a6ec81047ce48d720ff8aabbf7de1f12c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:34.262960Z","signature_b64":"NEOobbSV1LPu8ShLVmWdY3766JEq6PFvvfEH544LhZ6w43GG3gybqmnEFYFM9XAaO1YoIKvfoHrJQxUeN482Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5512d5ba536416bb098e01db08349a7a6ec81047ce48d720ff8aabbf7de1f12c","last_reissued_at":"2026-07-05T06:58:34.262520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:34.262520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11275","source_version":8,"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-05T06:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pr9U5Iu5YpmxFRwTptW9jbZSNhxrZzdxJuzZdLw/YmbIJa8BSVWf3nM08bCn9uI+3XT42Yg2wbIQcQ8iv8MMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T03:58:24.193673Z"},"content_sha256":"ad26b27225e675b757c129fc723d934512616431d6785a289b36f395f09b3588","schema_version":"1.0","event_id":"sha256:ad26b27225e675b757c129fc723d934512616431d6785a289b36f395f09b3588"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KUJNLOSTMQLLWCMOAHNQQNE2PJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More applications of the d-neighbor equivalence: acyclicity and connectivity constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Mamadou Moustapha Kant\\'e","submitted_at":"2018-05-29T07:16:15Z","abstract_excerpt":"In this paper, we design a framework to obtain efficient algorithms for several problems with a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Node Weighted Steiner Tree, Maximum Induced Tree, Longest Induced Path, and Feedback Vertex Set. We design a meta-algorithm that solves all these problems and whose running time is upper bounded by $2^{O(k)}\\cdot n^{O(1)}$, $2^{O(k \\log(k))}\\cdot n^{O(1)}$, $2^{O(k^2)}\\cdot n^{O(1)}$ and $n^{O(k)}$ where $k$ is respectively the clique-width, $\\mathbf{Q}$-rank-width, rank-width and maximum induced matching width of a giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11275","kind":"arxiv","version":8},"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/1805.11275/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-05T06:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XiW1CXCt5DpTWjeqykpwIqKfgknO3DwyQZrYIa3K0zn4gkOsqllPx83slknLboTtNpafoQ7bmXDpY02VqXW1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T03:58:24.194043Z"},"content_sha256":"e994aabbc6fb90632c17f554050e2b5c72161fdef9a75b03305762559fb6ad10","schema_version":"1.0","event_id":"sha256:e994aabbc6fb90632c17f554050e2b5c72161fdef9a75b03305762559fb6ad10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/bundle.json","state_url":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/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-24T03:58:24Z","links":{"resolver":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ","bundle":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/bundle.json","state":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KUJNLOSTMQLLWCMOAHNQQNE2PJ","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":"db263c0b6ce4ad609ae0623e0659120bbc2fcd8978725aa9c3fa9db9582eaad0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T07:16:15Z","title_canon_sha256":"d90c7bb9b0d407bf5d7ad25e397b3ed5adf1c79162b43eedfb29c919b976d2fa"},"schema_version":"1.0","source":{"id":"1805.11275","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11275","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11275v8","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11275","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"KUJNLOSTMQLL","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"pith_short_16","alias_value":"KUJNLOSTMQLLWCMO","created_at":"2026-07-05T06:58:34Z"},{"alias_kind":"pith_short_8","alias_value":"KUJNLOST","created_at":"2026-07-05T06:58:34Z"}],"graph_snapshots":[{"event_id":"sha256:e994aabbc6fb90632c17f554050e2b5c72161fdef9a75b03305762559fb6ad10","target":"graph","created_at":"2026-07-05T06:58:34Z","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/1805.11275/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we design a framework to obtain efficient algorithms for several problems with a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Node Weighted Steiner Tree, Maximum Induced Tree, Longest Induced Path, and Feedback Vertex Set. We design a meta-algorithm that solves all these problems and whose running time is upper bounded by $2^{O(k)}\\cdot n^{O(1)}$, $2^{O(k \\log(k))}\\cdot n^{O(1)}$, $2^{O(k^2)}\\cdot n^{O(1)}$ and $n^{O(k)}$ where $k$ is respectively the clique-width, $\\mathbf{Q}$-rank-width, rank-width and maximum induced matching width of a giv","authors_text":"Benjamin Bergougnoux, Mamadou Moustapha Kant\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T07:16:15Z","title":"More applications of the d-neighbor equivalence: acyclicity and connectivity constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11275","kind":"arxiv","version":8},"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:ad26b27225e675b757c129fc723d934512616431d6785a289b36f395f09b3588","target":"record","created_at":"2026-07-05T06:58:34Z","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":"db263c0b6ce4ad609ae0623e0659120bbc2fcd8978725aa9c3fa9db9582eaad0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T07:16:15Z","title_canon_sha256":"d90c7bb9b0d407bf5d7ad25e397b3ed5adf1c79162b43eedfb29c919b976d2fa"},"schema_version":"1.0","source":{"id":"1805.11275","kind":"arxiv","version":8}},"canonical_sha256":"5512d5ba536416bb098e01db08349a7a6ec81047ce48d720ff8aabbf7de1f12c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5512d5ba536416bb098e01db08349a7a6ec81047ce48d720ff8aabbf7de1f12c","first_computed_at":"2026-07-05T06:58:34.262520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:58:34.262520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NEOobbSV1LPu8ShLVmWdY3766JEq6PFvvfEH544LhZ6w43GG3gybqmnEFYFM9XAaO1YoIKvfoHrJQxUeN482Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:58:34.262960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11275","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad26b27225e675b757c129fc723d934512616431d6785a289b36f395f09b3588","sha256:e994aabbc6fb90632c17f554050e2b5c72161fdef9a75b03305762559fb6ad10"],"state_sha256":"f5e143dd22bac61795064b94ba4a732a762762e957f7936b9544ab05952ba2a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBX3Vp3S1vI46CbopwLQIJaAI/ATDWeZLjuBoeSEk7wJitWtpuADCkrhnwWvPcpF7nmqf8xpBfMwCKXPqSNBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-24T03:58:24.197033Z","bundle_sha256":"c77465c2ba7ecc056e9294805772266d14d1babfa8a4044c7cde171d98a72dc5"}}