{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EXKJWF5ISMK4OKFORPQ26D5U22","short_pith_number":"pith:EXKJWF5I","canonical_record":{"source":{"id":"1304.6255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-23T12:08:28Z","cross_cats_sorted":[],"title_canon_sha256":"02a5e31f49aa8c61b5ea8431e7a398bc5fc3c4d45b14f524939326865ff09b82","abstract_canon_sha256":"57978384d533df3e2dc62f106a5991c1925d0c4e38bca3ebb7c616fedaacbe6b"},"schema_version":"1.0"},"canonical_sha256":"25d49b17a89315c728ae8be1af0fb4d6bbf3fca6b9530068d87c71a1271c2cdb","source":{"kind":"arxiv","id":"1304.6255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6255","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6255v1","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6255","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"pith_short_12","alias_value":"EXKJWF5ISMK4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EXKJWF5ISMK4OKFO","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EXKJWF5I","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EXKJWF5ISMK4OKFORPQ26D5U22","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-23T12:08:28Z","cross_cats_sorted":[],"title_canon_sha256":"02a5e31f49aa8c61b5ea8431e7a398bc5fc3c4d45b14f524939326865ff09b82","abstract_canon_sha256":"57978384d533df3e2dc62f106a5991c1925d0c4e38bca3ebb7c616fedaacbe6b"},"schema_version":"1.0"},"canonical_sha256":"25d49b17a89315c728ae8be1af0fb4d6bbf3fca6b9530068d87c71a1271c2cdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:21.971069Z","signature_b64":"n9cqriHxEES6xxdPxHm7I3YqaepzZjGh/8jI9OPVJ+nstxVdao3pFZ7f7R5TI4CBWBgc2hg6YljAXTBePhU4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25d49b17a89315c728ae8be1af0fb4d6bbf3fca6b9530068d87c71a1271c2cdb","last_reissued_at":"2026-05-18T03:27:21.970270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:21.970270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6255","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-18T03:27:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEy+RNFwgB1n9od0ha3y2hdtXVz2KptylhGpy437ZLaBQzCLHvALGurYa8a9cnruaAa5RNS/EoWE/bOPfGV4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:13:07.061290Z"},"content_sha256":"ba44c9cc1807ee7a4a93355e95eaab3812c692d62621e6a5b9989d5f21190056","schema_version":"1.0","event_id":"sha256:ba44c9cc1807ee7a4a93355e95eaab3812c692d62621e6a5b9989d5f21190056"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EXKJWF5ISMK4OKFORPQ26D5U22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Polynomial Cases of the Weighted Efficient Domination Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Martin Milanic, Ragnar Nevries","submitted_at":"2013-04-23T12:08:28Z","abstract_excerpt":"Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. 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. in G, is known to be NP-complete even for very restricted graph classes.\n  In particular, the ED problem remains NP-complete for 2P3-free graphs and thus for P7-free graphs. We show that the weighted version of the problem (abbreviated WED) is solvable in polynomial time on various subclasses of 2P3-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6255","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-18T03:27:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwoW7KoU8T2rplAt0YPWBet5ocVTSZqQh6Df7plo4nsTyhs3F/jCiNjDdpEYNk611+3Ip9SL2MfMC3EJRsdFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:13:07.061844Z"},"content_sha256":"2f657f88aa13f7a342a985d89fa2c5ad7b3eef5acf8c3490c0581a16f7fe22ca","schema_version":"1.0","event_id":"sha256:2f657f88aa13f7a342a985d89fa2c5ad7b3eef5acf8c3490c0581a16f7fe22ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXKJWF5ISMK4OKFORPQ26D5U22/bundle.json","state_url":"https://pith.science/pith/EXKJWF5ISMK4OKFORPQ26D5U22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXKJWF5ISMK4OKFORPQ26D5U22/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-04T17:13:07Z","links":{"resolver":"https://pith.science/pith/EXKJWF5ISMK4OKFORPQ26D5U22","bundle":"https://pith.science/pith/EXKJWF5ISMK4OKFORPQ26D5U22/bundle.json","state":"https://pith.science/pith/EXKJWF5ISMK4OKFORPQ26D5U22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXKJWF5ISMK4OKFORPQ26D5U22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EXKJWF5ISMK4OKFORPQ26D5U22","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":"57978384d533df3e2dc62f106a5991c1925d0c4e38bca3ebb7c616fedaacbe6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-23T12:08:28Z","title_canon_sha256":"02a5e31f49aa8c61b5ea8431e7a398bc5fc3c4d45b14f524939326865ff09b82"},"schema_version":"1.0","source":{"id":"1304.6255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6255","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6255v1","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6255","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"pith_short_12","alias_value":"EXKJWF5ISMK4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EXKJWF5ISMK4OKFO","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EXKJWF5I","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:2f657f88aa13f7a342a985d89fa2c5ad7b3eef5acf8c3490c0581a16f7fe22ca","target":"graph","created_at":"2026-05-18T03:27:21Z","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 dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. 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. in G, is known to be NP-complete even for very restricted graph classes.\n  In particular, the ED problem remains NP-complete for 2P3-free graphs and thus for P7-free graphs. We show that the weighted version of the problem (abbreviated WED) is solvable in polynomial time on various subclasses of 2P3-","authors_text":"Andreas Brandst\\\"adt, Martin Milanic, Ragnar Nevries","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-23T12:08:28Z","title":"New Polynomial Cases of the Weighted Efficient Domination Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6255","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:ba44c9cc1807ee7a4a93355e95eaab3812c692d62621e6a5b9989d5f21190056","target":"record","created_at":"2026-05-18T03:27:21Z","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":"57978384d533df3e2dc62f106a5991c1925d0c4e38bca3ebb7c616fedaacbe6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-23T12:08:28Z","title_canon_sha256":"02a5e31f49aa8c61b5ea8431e7a398bc5fc3c4d45b14f524939326865ff09b82"},"schema_version":"1.0","source":{"id":"1304.6255","kind":"arxiv","version":1}},"canonical_sha256":"25d49b17a89315c728ae8be1af0fb4d6bbf3fca6b9530068d87c71a1271c2cdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25d49b17a89315c728ae8be1af0fb4d6bbf3fca6b9530068d87c71a1271c2cdb","first_computed_at":"2026-05-18T03:27:21.970270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:21.970270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n9cqriHxEES6xxdPxHm7I3YqaepzZjGh/8jI9OPVJ+nstxVdao3pFZ7f7R5TI4CBWBgc2hg6YljAXTBePhU4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:21.971069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba44c9cc1807ee7a4a93355e95eaab3812c692d62621e6a5b9989d5f21190056","sha256:2f657f88aa13f7a342a985d89fa2c5ad7b3eef5acf8c3490c0581a16f7fe22ca"],"state_sha256":"c9342aa99cea86b3868254c46c6b0d3a0a38a5345375456cd22f8a6a151366a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPRqUi3XRJTm5i8fTBVDYuUq7v9Zf1YCiLyrvB4rLHx81qYTlZfCRW377I4cbpvg8lHbNV9aMUJ3+LkJ/u9EDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:13:07.064439Z","bundle_sha256":"85adbaa0b29680a9382ac4b11c205c8b4686989da650a68b5f44911a5c7258f9"}}