{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6Z46S2C4SPW4TUIG5577N6OJA3","short_pith_number":"pith:6Z46S2C4","canonical_record":{"source":{"id":"1407.4593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-17T08:11:57Z","cross_cats_sorted":[],"title_canon_sha256":"5ef8a8d03721dedee14682ae4e6594d0cf8aaebe9c6f952880e04b1637382620","abstract_canon_sha256":"520f3f11a9761446252b46bc846fa71a5262b9adc57cffbfd0d47b6c78441dd1"},"schema_version":"1.0"},"canonical_sha256":"f679e9685c93edc9d106ef7ff6f9c906e1ba412fb0e760e91b064c3d3288f136","source":{"kind":"arxiv","id":"1407.4593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4593","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4593v1","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4593","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"6Z46S2C4SPW4","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6Z46S2C4SPW4TUIG","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6Z46S2C4","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6Z46S2C4SPW4TUIG5577N6OJA3","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-17T08:11:57Z","cross_cats_sorted":[],"title_canon_sha256":"5ef8a8d03721dedee14682ae4e6594d0cf8aaebe9c6f952880e04b1637382620","abstract_canon_sha256":"520f3f11a9761446252b46bc846fa71a5262b9adc57cffbfd0d47b6c78441dd1"},"schema_version":"1.0"},"canonical_sha256":"f679e9685c93edc9d106ef7ff6f9c906e1ba412fb0e760e91b064c3d3288f136","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:23.681372Z","signature_b64":"bsgA6VjMGwdz/kC8V1lYRArnYU8l7+RfN8QZMwwNmDk0/GmawG/6Zs/8NHFKFYfEo1mgkUhxHnS9Oh8VVX77Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f679e9685c93edc9d106ef7ff6f9c906e1ba412fb0e760e91b064c3d3288f136","last_reissued_at":"2026-05-18T02:47:23.680982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:23.680982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4593","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-18T02:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ck9vnANj5h6f+zJ00A2slrEk8j9NPcFFCMeyK9MEcBxp+X1m0UB06RzIkKJJjpIduixMD2NwOKAx1yJDQQOPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:20:37.194358Z"},"content_sha256":"d7b40146d25009f64d43c8636979549b43af115c54405ff2697869b578db8e12","schema_version":"1.0","event_id":"sha256:d7b40146d25009f64d43c8636979549b43af115c54405ff2697869b578db8e12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6Z46S2C4SPW4TUIG5577N6OJA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Vassilis Giakoumakis","submitted_at":"2014-07-17T08:11:57Z","abstract_excerpt":"Let $G$ be a finite undirected graph. A vertex {\\em dominates} itself and all its neighbors in $G$. A vertex set $D$ is an {\\em efficient dominating set} (\\emph{e.d.}\\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The \\emph{Efficient Domination} (ED) problem, which asks for the existence of an e.d.\\ in $G$, is known to be \\NP-complete even for very restricted graph classes such as for claw-free graphs, for chordal graphs and for $2P_3$-free graphs (and thus, for $P_7$-free graphs). We call a graph $F$ a {\\em linear forest} if $F$ is cycle- and claw-free, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4593","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-18T02:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QWAgQ+YUY/gWejJ3KhUk9t8uQmVyQ6yUBiKJ365qeIbcsZJQhf0zh6fJBkadz5rnxT7bpkC2vhQVqurvOeGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:20:37.195089Z"},"content_sha256":"3591ea11636aa5d4659345f98891849fbc8e60f0ce1ffb17defb09487ad8e915","schema_version":"1.0","event_id":"sha256:3591ea11636aa5d4659345f98891849fbc8e60f0ce1ffb17defb09487ad8e915"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3/bundle.json","state_url":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Z46S2C4SPW4TUIG5577N6OJA3/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-31T08:20:37Z","links":{"resolver":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3","bundle":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3/bundle.json","state":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Z46S2C4SPW4TUIG5577N6OJA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6Z46S2C4SPW4TUIG5577N6OJA3","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":"520f3f11a9761446252b46bc846fa71a5262b9adc57cffbfd0d47b6c78441dd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-17T08:11:57Z","title_canon_sha256":"5ef8a8d03721dedee14682ae4e6594d0cf8aaebe9c6f952880e04b1637382620"},"schema_version":"1.0","source":{"id":"1407.4593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4593","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4593v1","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4593","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"6Z46S2C4SPW4","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6Z46S2C4SPW4TUIG","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6Z46S2C4","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:3591ea11636aa5d4659345f98891849fbc8e60f0ce1ffb17defb09487ad8e915","target":"graph","created_at":"2026-05-18T02:47:23Z","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":"Let $G$ be a finite undirected graph. A vertex {\\em dominates} itself and all its neighbors in $G$. A vertex set $D$ is an {\\em efficient dominating set} (\\emph{e.d.}\\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The \\emph{Efficient Domination} (ED) problem, which asks for the existence of an e.d.\\ in $G$, is known to be \\NP-complete even for very restricted graph classes such as for claw-free graphs, for chordal graphs and for $2P_3$-free graphs (and thus, for $P_7$-free graphs). We call a graph $F$ a {\\em linear forest} if $F$ is cycle- and claw-free, i","authors_text":"Andreas Brandstadt, Vassilis Giakoumakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-17T08:11:57Z","title":"Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4593","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:d7b40146d25009f64d43c8636979549b43af115c54405ff2697869b578db8e12","target":"record","created_at":"2026-05-18T02:47:23Z","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":"520f3f11a9761446252b46bc846fa71a5262b9adc57cffbfd0d47b6c78441dd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-17T08:11:57Z","title_canon_sha256":"5ef8a8d03721dedee14682ae4e6594d0cf8aaebe9c6f952880e04b1637382620"},"schema_version":"1.0","source":{"id":"1407.4593","kind":"arxiv","version":1}},"canonical_sha256":"f679e9685c93edc9d106ef7ff6f9c906e1ba412fb0e760e91b064c3d3288f136","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f679e9685c93edc9d106ef7ff6f9c906e1ba412fb0e760e91b064c3d3288f136","first_computed_at":"2026-05-18T02:47:23.680982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:23.680982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsgA6VjMGwdz/kC8V1lYRArnYU8l7+RfN8QZMwwNmDk0/GmawG/6Zs/8NHFKFYfEo1mgkUhxHnS9Oh8VVX77Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:23.681372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7b40146d25009f64d43c8636979549b43af115c54405ff2697869b578db8e12","sha256:3591ea11636aa5d4659345f98891849fbc8e60f0ce1ffb17defb09487ad8e915"],"state_sha256":"9b32ce7d2209e0bfe66dab7ad783369eb3b2cd81636017a6d9d713962a4b91a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vydSvuhPEFIi1zmMqRgaZU0u2YX7ElB9ctmxMreLSiRaAa9YeEy/Wby5q9+we6yQ84dJqzx9NU79BLAy6q7PBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:20:37.198994Z","bundle_sha256":"6f9b703962fa8021c181d7874cdd95f0bd78cf0858c42bb179de92285c9f2407"}}