{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VNHOSXS65JCGTGFY63KCBBQYCT","short_pith_number":"pith:VNHOSXS6","canonical_record":{"source":{"id":"1806.00386","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-30T15:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"e904af43de5bf158852b54b2dabdcfedc3a9f1b5220bc5f5e951abd60ba9103f","abstract_canon_sha256":"449ef209b4de43f49c3f3c95798fa450b32c744b13bc81aacaaf911207a2d9df"},"schema_version":"1.0"},"canonical_sha256":"ab4ee95e5eea446998b8f6d420861814fb00bffb550e7ac252be048d8d456a60","source":{"kind":"arxiv","id":"1806.00386","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00386","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00386v4","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00386","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"VNHOSXS65JCG","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VNHOSXS65JCGTGFY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VNHOSXS6","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VNHOSXS65JCGTGFY63KCBBQYCT","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00386","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-30T15:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"e904af43de5bf158852b54b2dabdcfedc3a9f1b5220bc5f5e951abd60ba9103f","abstract_canon_sha256":"449ef209b4de43f49c3f3c95798fa450b32c744b13bc81aacaaf911207a2d9df"},"schema_version":"1.0"},"canonical_sha256":"ab4ee95e5eea446998b8f6d420861814fb00bffb550e7ac252be048d8d456a60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:58.561379Z","signature_b64":"CbWwDn/2OD+0XzUCxa0ndAzlaptceHIkV8aiEw0XtTP+63qmZPO0idBCBtjnBmXyYHwRZsBIvOrROG1kCvBkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab4ee95e5eea446998b8f6d420861814fb00bffb550e7ac252be048d8d456a60","last_reissued_at":"2026-05-17T23:39:58.561026Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:58.561026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00386","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:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdSlR0WZrgBsJ1Urlhty8RGjlFOMYayA6RqPdkk5EpdfAN8n5MmSV5kfECcX2z3RVmsI/QEtXutnUGQPVbjiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:37:13.333459Z"},"content_sha256":"27d627253c71cdb52e6434319d9dd08eb2da97fc3cd2fde353316e28a4947700","schema_version":"1.0","event_id":"sha256:27d627253c71cdb52e6434319d9dd08eb2da97fc3cd2fde353316e28a4947700"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VNHOSXS65JCGTGFY63KCBBQYCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Efficient Domination for Some Classes of $H$-Free Bipartite 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":"2018-05-30T15:52:09Z","abstract_excerpt":"A vertex set $D$ in a finite undirected graph $G$ is an {\\em efficient dominating set} (\\emph{e.d.s.}\\ 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.s.\\ in $G$, is known to be \\NP-complete even for very restricted $H$-free graph classes such as for $2P_3$-free chordal graphs while it is solvable in polynomial time for $P_6$-free graphs. Here we focus on $H$-free bipartite graphs: We show that (weighted) ED can be solved in polynomial time for $H$-free bipartite graphs when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00386","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:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uN6fI7RVWB1kwJVNI7m4AuLTkPCnQFnFMgzSI7WFZDTxuVij2y6fbFL9d8iq4qR/sezrmu2QLXP27NFjjDZ/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:37:13.334123Z"},"content_sha256":"ab7b54cc07079d8d4694720eaa92b68067a931a9cf83f4c9c6c60c7a18d1daf1","schema_version":"1.0","event_id":"sha256:ab7b54cc07079d8d4694720eaa92b68067a931a9cf83f4c9c6c60c7a18d1daf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNHOSXS65JCGTGFY63KCBBQYCT/bundle.json","state_url":"https://pith.science/pith/VNHOSXS65JCGTGFY63KCBBQYCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNHOSXS65JCGTGFY63KCBBQYCT/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-05T03:37:13Z","links":{"resolver":"https://pith.science/pith/VNHOSXS65JCGTGFY63KCBBQYCT","bundle":"https://pith.science/pith/VNHOSXS65JCGTGFY63KCBBQYCT/bundle.json","state":"https://pith.science/pith/VNHOSXS65JCGTGFY63KCBBQYCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNHOSXS65JCGTGFY63KCBBQYCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VNHOSXS65JCGTGFY63KCBBQYCT","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":"449ef209b4de43f49c3f3c95798fa450b32c744b13bc81aacaaf911207a2d9df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-30T15:52:09Z","title_canon_sha256":"e904af43de5bf158852b54b2dabdcfedc3a9f1b5220bc5f5e951abd60ba9103f"},"schema_version":"1.0","source":{"id":"1806.00386","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00386","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00386v4","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00386","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"VNHOSXS65JCG","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VNHOSXS65JCGTGFY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VNHOSXS6","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:ab7b54cc07079d8d4694720eaa92b68067a931a9cf83f4c9c6c60c7a18d1daf1","target":"graph","created_at":"2026-05-17T23:39:58Z","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 {\\em efficient dominating set} (\\emph{e.d.s.}\\ 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.s.\\ in $G$, is known to be \\NP-complete even for very restricted $H$-free graph classes such as for $2P_3$-free chordal graphs while it is solvable in polynomial time for $P_6$-free graphs. Here we focus on $H$-free bipartite graphs: We show that (weighted) ED can be solved in polynomial time for $H$-free bipartite graphs when","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":"2018-05-30T15:52:09Z","title":"On Efficient Domination for Some Classes of $H$-Free Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00386","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:27d627253c71cdb52e6434319d9dd08eb2da97fc3cd2fde353316e28a4947700","target":"record","created_at":"2026-05-17T23:39:58Z","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":"449ef209b4de43f49c3f3c95798fa450b32c744b13bc81aacaaf911207a2d9df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-30T15:52:09Z","title_canon_sha256":"e904af43de5bf158852b54b2dabdcfedc3a9f1b5220bc5f5e951abd60ba9103f"},"schema_version":"1.0","source":{"id":"1806.00386","kind":"arxiv","version":4}},"canonical_sha256":"ab4ee95e5eea446998b8f6d420861814fb00bffb550e7ac252be048d8d456a60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab4ee95e5eea446998b8f6d420861814fb00bffb550e7ac252be048d8d456a60","first_computed_at":"2026-05-17T23:39:58.561026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:58.561026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CbWwDn/2OD+0XzUCxa0ndAzlaptceHIkV8aiEw0XtTP+63qmZPO0idBCBtjnBmXyYHwRZsBIvOrROG1kCvBkCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:58.561379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00386","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27d627253c71cdb52e6434319d9dd08eb2da97fc3cd2fde353316e28a4947700","sha256:ab7b54cc07079d8d4694720eaa92b68067a931a9cf83f4c9c6c60c7a18d1daf1"],"state_sha256":"fb812119b1b38eb84c0a2fbf33629e623608403232f1ae590c377d3e5c33ef31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+eScSgX6WU9i+ZCNdecqoKB1aUr4iQI3LQYW9xxqbi6G1mtDkFFO7xlPNtNUJ6RfQbaBwqfyEt9qou1lkmKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:37:13.337929Z","bundle_sha256":"b6df6b1ca3602cc45e4b92b9fef84bec0cf58873f97d743875f9c8d08c369c0c"}}