{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AN25ZA4PI2NWWKZHCGB2NKN3YX","short_pith_number":"pith:AN25ZA4P","canonical_record":{"source":{"id":"1207.0953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-04T12:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"c17ca0bb0c4092a5cfec25f081a03bf28bc2e5b0c678878c1a9887a7a79f7d22","abstract_canon_sha256":"4b08651ebdd86776a0491c6c4f9ce41a995391bf3ac1931dd8c327993b85c21f"},"schema_version":"1.0"},"canonical_sha256":"0375dc838f469b6b2b271183a6a9bbc5e776905b150f369106aa92dcc047cef3","source":{"kind":"arxiv","id":"1207.0953","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0953","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0953v2","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0953","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"AN25ZA4PI2NW","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AN25ZA4PI2NWWKZH","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AN25ZA4P","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AN25ZA4PI2NWWKZHCGB2NKN3YX","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-04T12:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"c17ca0bb0c4092a5cfec25f081a03bf28bc2e5b0c678878c1a9887a7a79f7d22","abstract_canon_sha256":"4b08651ebdd86776a0491c6c4f9ce41a995391bf3ac1931dd8c327993b85c21f"},"schema_version":"1.0"},"canonical_sha256":"0375dc838f469b6b2b271183a6a9bbc5e776905b150f369106aa92dcc047cef3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.805819Z","signature_b64":"Q0mmdoB8LsnjmKgV3BBmPyKHjsD9sy/whaEUm0RDtNjh6y8H6MxKZbJvoA7vCOL0IeU9coJKuw2Lgzdv3ZQUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0375dc838f469b6b2b271183a6a9bbc5e776905b150f369106aa92dcc047cef3","last_reissued_at":"2026-05-18T03:51:37.804996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.804996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0953","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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbsQQKtBSeNEkWkYUGjQISe4siwd5VR3PWvsY/zAwDpGZPcbj7mowQ8x6HQ4YuiZlAAVqeZU1EvuCHDvnEWXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:13:31.256881Z"},"content_sha256":"519c936bec9265224e9c01cceffb23a400c33ec9ac037bb63be9e7bb831d6afb","schema_version":"1.0","event_id":"sha256:519c936bec9265224e9c01cceffb23a400c33ec9ac037bb63be9e7bb831d6afb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AN25ZA4PI2NWWKZHCGB2NKN3YX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Arne Leitert, Dieter Rautenbach","submitted_at":"2012-07-04T12:23:00Z","abstract_excerpt":"Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v in V, there is exactly one d in D dominating v. An edge set M is an efficient edge dominating (e.e.d.) set for G if it is an efficient dominating set in the line graph L(G) of G. The ED problem (EED problem, respectively) asks for the existence of an e.d. set (e.e.d. set, respectively) in the given graph.\n  We give a unified framework for investigating the complexity of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0953","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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y7VvOorJZeEMOT6FCK3Jpkb9wsZ3Mpsus1oCAbB6gKEgsYqcx45Mim3TSF8uwLpUmZKjLr2WFXzEoTdGbHY4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:13:31.257741Z"},"content_sha256":"46382033970e70cd6782e9d151a7c9869ee780725223c5ba24cc3d9b70cb4006","schema_version":"1.0","event_id":"sha256:46382033970e70cd6782e9d151a7c9869ee780725223c5ba24cc3d9b70cb4006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN25ZA4PI2NWWKZHCGB2NKN3YX/bundle.json","state_url":"https://pith.science/pith/AN25ZA4PI2NWWKZHCGB2NKN3YX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN25ZA4PI2NWWKZHCGB2NKN3YX/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-04T21:13:31Z","links":{"resolver":"https://pith.science/pith/AN25ZA4PI2NWWKZHCGB2NKN3YX","bundle":"https://pith.science/pith/AN25ZA4PI2NWWKZHCGB2NKN3YX/bundle.json","state":"https://pith.science/pith/AN25ZA4PI2NWWKZHCGB2NKN3YX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN25ZA4PI2NWWKZHCGB2NKN3YX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AN25ZA4PI2NWWKZHCGB2NKN3YX","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":"4b08651ebdd86776a0491c6c4f9ce41a995391bf3ac1931dd8c327993b85c21f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-04T12:23:00Z","title_canon_sha256":"c17ca0bb0c4092a5cfec25f081a03bf28bc2e5b0c678878c1a9887a7a79f7d22"},"schema_version":"1.0","source":{"id":"1207.0953","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0953","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0953v2","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0953","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"AN25ZA4PI2NW","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AN25ZA4PI2NWWKZH","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AN25ZA4P","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:46382033970e70cd6782e9d151a7c9869ee780725223c5ba24cc3d9b70cb4006","target":"graph","created_at":"2026-05-18T03:51:37Z","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=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v in V, there is exactly one d in D dominating v. An edge set M is an efficient edge dominating (e.e.d.) set for G if it is an efficient dominating set in the line graph L(G) of G. The ED problem (EED problem, respectively) asks for the existence of an e.d. set (e.e.d. set, respectively) in the given graph.\n  We give a unified framework for investigating the complexity of th","authors_text":"Andreas Brandst\\\"adt, Arne Leitert, Dieter Rautenbach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-04T12:23:00Z","title":"Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0953","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:519c936bec9265224e9c01cceffb23a400c33ec9ac037bb63be9e7bb831d6afb","target":"record","created_at":"2026-05-18T03:51:37Z","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":"4b08651ebdd86776a0491c6c4f9ce41a995391bf3ac1931dd8c327993b85c21f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-04T12:23:00Z","title_canon_sha256":"c17ca0bb0c4092a5cfec25f081a03bf28bc2e5b0c678878c1a9887a7a79f7d22"},"schema_version":"1.0","source":{"id":"1207.0953","kind":"arxiv","version":2}},"canonical_sha256":"0375dc838f469b6b2b271183a6a9bbc5e776905b150f369106aa92dcc047cef3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0375dc838f469b6b2b271183a6a9bbc5e776905b150f369106aa92dcc047cef3","first_computed_at":"2026-05-18T03:51:37.804996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.804996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q0mmdoB8LsnjmKgV3BBmPyKHjsD9sy/whaEUm0RDtNjh6y8H6MxKZbJvoA7vCOL0IeU9coJKuw2Lgzdv3ZQUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.805819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0953","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:519c936bec9265224e9c01cceffb23a400c33ec9ac037bb63be9e7bb831d6afb","sha256:46382033970e70cd6782e9d151a7c9869ee780725223c5ba24cc3d9b70cb4006"],"state_sha256":"686d7c332d1c2918969f6d4de9b2e630546c98933361c79566ae81eba1de989e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWHcqnSh2t7A3O/g2hUsQTA0yaVoNlU5W0N/a2vSoigqk6dpW53Hnoz983v3raRxrTk+NUur296C/sMqdCn6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:13:31.261905Z","bundle_sha256":"1555d357098cf49750080aa565a92b935b73f93a289fa9e46086ada9078ef8f4"}}