{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MLAW7WKPBWOODBDJVZYPBPDHMQ","short_pith_number":"pith:MLAW7WKP","canonical_record":{"source":{"id":"1701.03414","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-12T17:18:10Z","cross_cats_sorted":[],"title_canon_sha256":"1e08a36257d4edc13c1f48e30874e66b7605c0a3798340cad5068ea3cde0ecde","abstract_canon_sha256":"65a199f83c55838092c2ff78430894dd917e0a948d13c3547da66a7004abb009"},"schema_version":"1.0"},"canonical_sha256":"62c16fd94f0d9ce18469ae70f0bc6764247e8740e1d39e5e2625d77d505888d1","source":{"kind":"arxiv","id":"1701.03414","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03414","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03414v4","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03414","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"MLAW7WKPBWOO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MLAW7WKPBWOODBDJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MLAW7WKP","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MLAW7WKPBWOODBDJVZYPBPDHMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03414","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-12T17:18:10Z","cross_cats_sorted":[],"title_canon_sha256":"1e08a36257d4edc13c1f48e30874e66b7605c0a3798340cad5068ea3cde0ecde","abstract_canon_sha256":"65a199f83c55838092c2ff78430894dd917e0a948d13c3547da66a7004abb009"},"schema_version":"1.0"},"canonical_sha256":"62c16fd94f0d9ce18469ae70f0bc6764247e8740e1d39e5e2625d77d505888d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:31.823754Z","signature_b64":"4ZQ0PSrM4fVBIcoaM8ufkGtgTomC/esGZKUrS+AzLdiow/NATkYEos8/E6oru4wBl+hIkkFQjT6r9etlcxM+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62c16fd94f0d9ce18469ae70f0bc6764247e8740e1d39e5e2625d77d505888d1","last_reissued_at":"2026-05-17T23:47:31.823287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:31.823287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03414","source_version":4,"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-17T23:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTvmXqHCoL5p1Ebq8+qZpdpSyniDIrWgyE/sCZFKYoLQaao8T1eRVzAcF0Jo6KpsgQ9KPZpE5kE20f7w0MMuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:35:18.213429Z"},"content_sha256":"6db3d0b8e85ce00528e367639f73599df742ce9526094f36e299f0900b7a4d82","schema_version":"1.0","event_id":"sha256:6db3d0b8e85ce00528e367639f73599df742ce9526094f36e299f0900b7a4d82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MLAW7WKPBWOODBDJVZYPBPDHMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Efficient Domination for Some Classes of $H$-Free Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","submitted_at":"2017-01-12T17:18:10Z","abstract_excerpt":"A vertex set $D$ in a finite undirected graph $G$ is an efficient dominating set (e.d.s. for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s.\\ in $G$, is known to be \\NP-complete even for very restricted graph classes such as for $2P_3$-free chordal graphs while it is solvable in polynomial time for $P_6$-free chordal graphs (and even for $P_6$-free graphs). A standard reduction from the \\NP-complete Exact Cover problem shows that ED is \\NP-complete for a very special subclass of cho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03414","kind":"arxiv","version":4},"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-17T23:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NDKRvVdFX5uiSZ14jiVWzCASiU8NROU1PvR9q9dE9J61Uwq60cG9Ear+x27NJoYKpD9mjUbrxSyAMDZZy1yBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:35:18.214140Z"},"content_sha256":"e0e58bf06617be9c43f464883509fe3a609aeb7bd040bab3f7e65c73be171af5","schema_version":"1.0","event_id":"sha256:e0e58bf06617be9c43f464883509fe3a609aeb7bd040bab3f7e65c73be171af5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLAW7WKPBWOODBDJVZYPBPDHMQ/bundle.json","state_url":"https://pith.science/pith/MLAW7WKPBWOODBDJVZYPBPDHMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLAW7WKPBWOODBDJVZYPBPDHMQ/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-06-05T01:35:18Z","links":{"resolver":"https://pith.science/pith/MLAW7WKPBWOODBDJVZYPBPDHMQ","bundle":"https://pith.science/pith/MLAW7WKPBWOODBDJVZYPBPDHMQ/bundle.json","state":"https://pith.science/pith/MLAW7WKPBWOODBDJVZYPBPDHMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLAW7WKPBWOODBDJVZYPBPDHMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MLAW7WKPBWOODBDJVZYPBPDHMQ","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":"65a199f83c55838092c2ff78430894dd917e0a948d13c3547da66a7004abb009","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-12T17:18:10Z","title_canon_sha256":"1e08a36257d4edc13c1f48e30874e66b7605c0a3798340cad5068ea3cde0ecde"},"schema_version":"1.0","source":{"id":"1701.03414","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03414","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03414v4","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03414","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"MLAW7WKPBWOO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MLAW7WKPBWOODBDJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MLAW7WKP","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:e0e58bf06617be9c43f464883509fe3a609aeb7bd040bab3f7e65c73be171af5","target":"graph","created_at":"2026-05-17T23:47:31Z","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":"A vertex set $D$ in a finite undirected graph $G$ is an efficient dominating set (e.d.s. for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s.\\ in $G$, is known to be \\NP-complete even for very restricted graph classes such as for $2P_3$-free chordal graphs while it is solvable in polynomial time for $P_6$-free chordal graphs (and even for $P_6$-free graphs). A standard reduction from the \\NP-complete Exact Cover problem shows that ED is \\NP-complete for a very special subclass of cho","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-12T17:18:10Z","title":"On Efficient Domination for Some Classes of $H$-Free Chordal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03414","kind":"arxiv","version":4},"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:6db3d0b8e85ce00528e367639f73599df742ce9526094f36e299f0900b7a4d82","target":"record","created_at":"2026-05-17T23:47:31Z","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":"65a199f83c55838092c2ff78430894dd917e0a948d13c3547da66a7004abb009","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-12T17:18:10Z","title_canon_sha256":"1e08a36257d4edc13c1f48e30874e66b7605c0a3798340cad5068ea3cde0ecde"},"schema_version":"1.0","source":{"id":"1701.03414","kind":"arxiv","version":4}},"canonical_sha256":"62c16fd94f0d9ce18469ae70f0bc6764247e8740e1d39e5e2625d77d505888d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62c16fd94f0d9ce18469ae70f0bc6764247e8740e1d39e5e2625d77d505888d1","first_computed_at":"2026-05-17T23:47:31.823287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:31.823287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ZQ0PSrM4fVBIcoaM8ufkGtgTomC/esGZKUrS+AzLdiow/NATkYEos8/E6oru4wBl+hIkkFQjT6r9etlcxM+Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:31.823754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03414","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6db3d0b8e85ce00528e367639f73599df742ce9526094f36e299f0900b7a4d82","sha256:e0e58bf06617be9c43f464883509fe3a609aeb7bd040bab3f7e65c73be171af5"],"state_sha256":"e38d4989988ea00c6dcf0c9ddd6098cbde2f2fd30c4fad4a2c36daf5b8b610dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAtxoJrA4GdhtIIqYb1uVdtV0DJeI8YN/AoLSRiqVOsDryRz48CFhpphu3NC9/zf9o4bQQyvwqgjWI1CW5cCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:35:18.217951Z","bundle_sha256":"79de65203bafc1dbd6a3e8c791c30bebaf4f5d3534289a85fe6998c959aa36ce"}}