{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B66JWKPUUCFNTIBR3KNDDOTCQY","short_pith_number":"pith:B66JWKPU","canonical_record":{"source":{"id":"1508.07733","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-31T09:29:11Z","cross_cats_sorted":[],"title_canon_sha256":"00a262002c2065f51542077a83c51c79236e516a748f9f62380d7956a94d19c7","abstract_canon_sha256":"815ec824aa078ca95a139d3754f0cc1789dbff9698ee9d2c1beafe0a8294c3fc"},"schema_version":"1.0"},"canonical_sha256":"0fbc9b29f4a08ad9a031da9a31ba628621d7ce661e3eae593557c1f5ea7e3e28","source":{"kind":"arxiv","id":"1508.07733","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07733","created_at":"2026-05-18T01:33:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07733v2","created_at":"2026-05-18T01:33:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07733","created_at":"2026-05-18T01:33:15Z"},{"alias_kind":"pith_short_12","alias_value":"B66JWKPUUCFN","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B66JWKPUUCFNTIBR","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B66JWKPU","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B66JWKPUUCFNTIBR3KNDDOTCQY","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07733","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-31T09:29:11Z","cross_cats_sorted":[],"title_canon_sha256":"00a262002c2065f51542077a83c51c79236e516a748f9f62380d7956a94d19c7","abstract_canon_sha256":"815ec824aa078ca95a139d3754f0cc1789dbff9698ee9d2c1beafe0a8294c3fc"},"schema_version":"1.0"},"canonical_sha256":"0fbc9b29f4a08ad9a031da9a31ba628621d7ce661e3eae593557c1f5ea7e3e28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:15.139679Z","signature_b64":"GOJ3402lGZtPsm5fC2baGKK9jLctx6YoCgDxU8rcwhqdv4Y3T41FwCaI7wxehlmldVGotG5jQK7KlLEkHtUADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fbc9b29f4a08ad9a031da9a31ba628621d7ce661e3eae593557c1f5ea7e3e28","last_reissued_at":"2026-05-18T01:33:15.139129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:15.139129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07733","source_version":2,"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-18T01:33:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VeTYUmTBQFGfeJ91H7R9rpzAcjHyCkW89+79WeqHyzTtJ5ZD6VY7R/+PLWAJi8B5drsUjPb6Ki/6K3BS44WCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:57:08.888039Z"},"content_sha256":"907d4d87e583eb440a522f8e0c8a68c640df76278c89161c56e5e275b10d010e","schema_version":"1.0","event_id":"sha256:907d4d87e583eb440a522f8e0c8a68c640df76278c89161c56e5e275b10d010e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B66JWKPUUCFNTIBR3KNDDOTCQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Efficient Domination for $P_6$-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, Raffaele Mosca","submitted_at":"2015-08-31T09:29:11Z","abstract_excerpt":"In a finite undirected graph $G=(V,E)$, a vertex $v \\in V$ {\\em dominates} itself and its neighbors in $G$. A vertex set $D \\subseteq V$ is an {\\em efficient dominating set} ({\\em e.d.} for short) of $G$ if every $v \\in V$ is dominated in $G$ by exactly one vertex of $D$. The {\\em Efficient Domination} (ED) problem, which asks for the existence of an e.d. in $G$, is known to be NP-complete for $P_7$-free graphs but solvable in polynomial time for $P_5$-free graphs. The $P_6$-free case was the last open question for the complexity of ED on $F$-free graphs.\n  Recently, Lokshtanov, Pilipczuk and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07733","kind":"arxiv","version":2},"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-18T01:33:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlgKq2CpqVVHjHG3XBoclk0wS7d7XJ/RXmCUnOZGyID70dzIvU2orOBwDCr6b6kd17DywQmnZsGX6aKCOIlnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:57:08.888829Z"},"content_sha256":"6c1f343121408eafc81e39d48bb3cd284bef67bae1abfc5b1f6c36b020edc106","schema_version":"1.0","event_id":"sha256:6c1f343121408eafc81e39d48bb3cd284bef67bae1abfc5b1f6c36b020edc106"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B66JWKPUUCFNTIBR3KNDDOTCQY/bundle.json","state_url":"https://pith.science/pith/B66JWKPUUCFNTIBR3KNDDOTCQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B66JWKPUUCFNTIBR3KNDDOTCQY/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:57:08Z","links":{"resolver":"https://pith.science/pith/B66JWKPUUCFNTIBR3KNDDOTCQY","bundle":"https://pith.science/pith/B66JWKPUUCFNTIBR3KNDDOTCQY/bundle.json","state":"https://pith.science/pith/B66JWKPUUCFNTIBR3KNDDOTCQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B66JWKPUUCFNTIBR3KNDDOTCQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B66JWKPUUCFNTIBR3KNDDOTCQY","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":"815ec824aa078ca95a139d3754f0cc1789dbff9698ee9d2c1beafe0a8294c3fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-31T09:29:11Z","title_canon_sha256":"00a262002c2065f51542077a83c51c79236e516a748f9f62380d7956a94d19c7"},"schema_version":"1.0","source":{"id":"1508.07733","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07733","created_at":"2026-05-18T01:33:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07733v2","created_at":"2026-05-18T01:33:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07733","created_at":"2026-05-18T01:33:15Z"},{"alias_kind":"pith_short_12","alias_value":"B66JWKPUUCFN","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B66JWKPUUCFNTIBR","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B66JWKPU","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:6c1f343121408eafc81e39d48bb3cd284bef67bae1abfc5b1f6c36b020edc106","target":"graph","created_at":"2026-05-18T01:33:15Z","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":"In a finite undirected graph $G=(V,E)$, a vertex $v \\in V$ {\\em dominates} itself and its neighbors in $G$. A vertex set $D \\subseteq V$ is an {\\em efficient dominating set} ({\\em e.d.} for short) of $G$ if every $v \\in V$ is dominated in $G$ by exactly one vertex of $D$. The {\\em Efficient Domination} (ED) problem, which asks for the existence of an e.d. in $G$, is known to be NP-complete for $P_7$-free graphs but solvable in polynomial time for $P_5$-free graphs. The $P_6$-free case was the last open question for the complexity of ED on $F$-free graphs.\n  Recently, Lokshtanov, Pilipczuk and ","authors_text":"Andreas Brandstadt, Raffaele Mosca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-31T09:29:11Z","title":"Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07733","kind":"arxiv","version":2},"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:907d4d87e583eb440a522f8e0c8a68c640df76278c89161c56e5e275b10d010e","target":"record","created_at":"2026-05-18T01:33:15Z","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":"815ec824aa078ca95a139d3754f0cc1789dbff9698ee9d2c1beafe0a8294c3fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-31T09:29:11Z","title_canon_sha256":"00a262002c2065f51542077a83c51c79236e516a748f9f62380d7956a94d19c7"},"schema_version":"1.0","source":{"id":"1508.07733","kind":"arxiv","version":2}},"canonical_sha256":"0fbc9b29f4a08ad9a031da9a31ba628621d7ce661e3eae593557c1f5ea7e3e28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fbc9b29f4a08ad9a031da9a31ba628621d7ce661e3eae593557c1f5ea7e3e28","first_computed_at":"2026-05-18T01:33:15.139129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:15.139129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GOJ3402lGZtPsm5fC2baGKK9jLctx6YoCgDxU8rcwhqdv4Y3T41FwCaI7wxehlmldVGotG5jQK7KlLEkHtUADw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:15.139679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07733","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:907d4d87e583eb440a522f8e0c8a68c640df76278c89161c56e5e275b10d010e","sha256:6c1f343121408eafc81e39d48bb3cd284bef67bae1abfc5b1f6c36b020edc106"],"state_sha256":"df3a83b273f940b53246e7f56fc6867ef849c892ed1572d73439b238b00d5307"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfppIVn2AJu/C7frobVPaiQxaTy0hcFU0U+zPmsdEfRhVk30tXbnn0EZrtu9unL1YM7XZQh26KWN9nzJZi/1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:57:08.893968Z","bundle_sha256":"d7e2b32db59cda95a80d87cffb98f4df594fb1dabe9b067e2ce857e32f617335"}}