{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WCSHFWKD73L2RFJGV7NOWQUQNR","short_pith_number":"pith:WCSHFWKD","canonical_record":{"source":{"id":"1511.01916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-05T21:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"c279aeab9a85fcadc1401048dba7c4b9a127b20e60ea76435dfa7c5f986732c4","abstract_canon_sha256":"88a2569bbaac33f4792986f24d049a9e171b29d9dc475c3d68377a655d06c2bf"},"schema_version":"1.0"},"canonical_sha256":"b0a472d943fed7a89526afdaeb42906c6c4e3a468f42358b2f8f3bf119037579","source":{"kind":"arxiv","id":"1511.01916","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01916","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01916v1","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01916","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"WCSHFWKD73L2","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WCSHFWKD73L2RFJG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WCSHFWKD","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WCSHFWKD73L2RFJGV7NOWQUQNR","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-05T21:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"c279aeab9a85fcadc1401048dba7c4b9a127b20e60ea76435dfa7c5f986732c4","abstract_canon_sha256":"88a2569bbaac33f4792986f24d049a9e171b29d9dc475c3d68377a655d06c2bf"},"schema_version":"1.0"},"canonical_sha256":"b0a472d943fed7a89526afdaeb42906c6c4e3a468f42358b2f8f3bf119037579","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.132923Z","signature_b64":"6Hq7cr1K6bYnWAoHoMUbbdak+uMAj+EFYC6qmCXDZ25NXr9HnlaCHvBp6/y34yVxwj6WnJIviM/E0peJHlwcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0a472d943fed7a89526afdaeb42906c6c4e3a468f42358b2f8f3bf119037579","last_reissued_at":"2026-05-18T01:27:39.132442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.132442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01916","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-18T01:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fX+CuACdaKH8dUv/W47rD68D/0Ruwh49fm4Wg2S/9zuPuLPgtn05b5aZvwXg67NePKdRV9X8t8REprsSekGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:09:12.808963Z"},"content_sha256":"c1d16fca4728672814a8f31309fa6aa20c2b6d7492e414528c9c40ae6f2734b3","schema_version":"1.0","event_id":"sha256:c1d16fca4728672814a8f31309fa6aa20c2b6d7492e414528c9c40ae6f2734b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WCSHFWKD73L2RFJGV7NOWQUQNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs that are simultaneously efficient open domination and efficient closed domination graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Iztok Peterin, Sandi Klavzar","submitted_at":"2015-11-05T21:11:53Z","abstract_excerpt":"A graph is an efficient open (resp.\\ closed) domination graph if there exists a subset of vertices whose open (resp.\\ closed) neighborhoods partition its vertex set. Graphs that are efficient open as well as efficient closed (shortly EOCD graphs) are investigated. The structure of EOCD graphs with respect to their efficient open and efficient closed dominating sets is explained. It is shown that the decision problem regarding whether a graph is an EOCD graph is an NP-complete problem. A recursive description that constructs all EOCD trees is given and EOCD graphs are characterized among the Si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01916","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-18T01:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e05aP9p0U7GhM+B3wBmkTxFtBX5wzBOxRyr0g0VoP9vPMXBHoTMP1SsmfE/3mBFikgYak2XGbfrSv7xA5qGUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:09:12.809298Z"},"content_sha256":"b8a773f57888931abe1dd2551d1f11ed67f3727bff073b3bacb9ec009c98395c","schema_version":"1.0","event_id":"sha256:b8a773f57888931abe1dd2551d1f11ed67f3727bff073b3bacb9ec009c98395c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCSHFWKD73L2RFJGV7NOWQUQNR/bundle.json","state_url":"https://pith.science/pith/WCSHFWKD73L2RFJGV7NOWQUQNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCSHFWKD73L2RFJGV7NOWQUQNR/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-24T23:09:12Z","links":{"resolver":"https://pith.science/pith/WCSHFWKD73L2RFJGV7NOWQUQNR","bundle":"https://pith.science/pith/WCSHFWKD73L2RFJGV7NOWQUQNR/bundle.json","state":"https://pith.science/pith/WCSHFWKD73L2RFJGV7NOWQUQNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCSHFWKD73L2RFJGV7NOWQUQNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WCSHFWKD73L2RFJGV7NOWQUQNR","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":"88a2569bbaac33f4792986f24d049a9e171b29d9dc475c3d68377a655d06c2bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-05T21:11:53Z","title_canon_sha256":"c279aeab9a85fcadc1401048dba7c4b9a127b20e60ea76435dfa7c5f986732c4"},"schema_version":"1.0","source":{"id":"1511.01916","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01916","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01916v1","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01916","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"WCSHFWKD73L2","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WCSHFWKD73L2RFJG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WCSHFWKD","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:b8a773f57888931abe1dd2551d1f11ed67f3727bff073b3bacb9ec009c98395c","target":"graph","created_at":"2026-05-18T01:27:39Z","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 graph is an efficient open (resp.\\ closed) domination graph if there exists a subset of vertices whose open (resp.\\ closed) neighborhoods partition its vertex set. Graphs that are efficient open as well as efficient closed (shortly EOCD graphs) are investigated. The structure of EOCD graphs with respect to their efficient open and efficient closed dominating sets is explained. It is shown that the decision problem regarding whether a graph is an EOCD graph is an NP-complete problem. A recursive description that constructs all EOCD trees is given and EOCD graphs are characterized among the Si","authors_text":"Ismael G. Yero, Iztok Peterin, Sandi Klavzar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-05T21:11:53Z","title":"Graphs that are simultaneously efficient open domination and efficient closed domination graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01916","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:c1d16fca4728672814a8f31309fa6aa20c2b6d7492e414528c9c40ae6f2734b3","target":"record","created_at":"2026-05-18T01:27:39Z","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":"88a2569bbaac33f4792986f24d049a9e171b29d9dc475c3d68377a655d06c2bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-05T21:11:53Z","title_canon_sha256":"c279aeab9a85fcadc1401048dba7c4b9a127b20e60ea76435dfa7c5f986732c4"},"schema_version":"1.0","source":{"id":"1511.01916","kind":"arxiv","version":1}},"canonical_sha256":"b0a472d943fed7a89526afdaeb42906c6c4e3a468f42358b2f8f3bf119037579","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0a472d943fed7a89526afdaeb42906c6c4e3a468f42358b2f8f3bf119037579","first_computed_at":"2026-05-18T01:27:39.132442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:39.132442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Hq7cr1K6bYnWAoHoMUbbdak+uMAj+EFYC6qmCXDZ25NXr9HnlaCHvBp6/y34yVxwj6WnJIviM/E0peJHlwcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:39.132923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01916","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1d16fca4728672814a8f31309fa6aa20c2b6d7492e414528c9c40ae6f2734b3","sha256:b8a773f57888931abe1dd2551d1f11ed67f3727bff073b3bacb9ec009c98395c"],"state_sha256":"7fbbafeac3210bdb12727610f0b624460ba0ab3452a7be5160873ca0f3167adf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQJfdP3pT0IqnpoLdzWOdGCgJHl3z76UWQWFg6eHQe6Q4XnX8nr6JclMSeBiKstuWbP2H8xrvggZXQ7pSgB/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:09:12.811233Z","bundle_sha256":"3d8809f8e2b3ddfa43dfe9006f3f90a86ad0a2d88f55034b895a4a9a5d245907"}}