{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XATMYOEXSUW22FN6QRMIYXXB43","short_pith_number":"pith:XATMYOEX","canonical_record":{"source":{"id":"1710.02059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T14:59:17Z","cross_cats_sorted":[],"title_canon_sha256":"e48f645316854ceb40b53eb622ee3463321031179ec7d726fb0b53985624d319","abstract_canon_sha256":"3449de0b81f0d0ca69f379305fa0bf4afe541ce95a2b2408ef135f551649d80c"},"schema_version":"1.0"},"canonical_sha256":"b826cc3897952dad15be84588c5ee1e6c5fa027e7ce596c1ec30a5241e8283c3","source":{"kind":"arxiv","id":"1710.02059","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02059","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02059v2","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02059","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"XATMYOEXSUW2","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XATMYOEXSUW22FN6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XATMYOEX","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XATMYOEXSUW22FN6QRMIYXXB43","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T14:59:17Z","cross_cats_sorted":[],"title_canon_sha256":"e48f645316854ceb40b53eb622ee3463321031179ec7d726fb0b53985624d319","abstract_canon_sha256":"3449de0b81f0d0ca69f379305fa0bf4afe541ce95a2b2408ef135f551649d80c"},"schema_version":"1.0"},"canonical_sha256":"b826cc3897952dad15be84588c5ee1e6c5fa027e7ce596c1ec30a5241e8283c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:34.346947Z","signature_b64":"GNWJDC+4JMfIrpvpZ0lI6sa8dir1sPFu2wnKHZfAMQ1baoKV7+mO8VNYQQALOkMUFQHgjPkWHJdwtPLmuwbAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b826cc3897952dad15be84588c5ee1e6c5fa027e7ce596c1ec30a5241e8283c3","last_reissued_at":"2026-05-18T00:33:34.346349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:34.346349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02059","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-18T00:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RZNwEG27XxERlCAs5dlUzCAOPYQp4hFhtDTdDiqlqbGGXMH7ZSOaBxnYt1ihHM9D+R+X1bujQC91fmNFbSsBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:28:13.731668Z"},"content_sha256":"adb635ef810bb292be4b7e70aaeecae4f835303a40b2f9275adbab696cae0a04","schema_version":"1.0","event_id":"sha256:adb635ef810bb292be4b7e70aaeecae4f835303a40b2f9275adbab696cae0a04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XATMYOEXSUW22FN6QRMIYXXB43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs with equal domination and certified domination numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jerzy Topp, Magda Dettlaff, Magdalena Lema\\'nska, Mateusz Miotk, Pawe{\\l} \\.Zyli\\'nski, Rados{\\l}aw Ziemann","submitted_at":"2017-10-05T14:59:17Z","abstract_excerpt":"A set $D$ of vertices of a graph $G$ is a dominating set of $G$ if every vertex in $V_G-D$ is adjacent to at least one vertex in $D$. The domination number (upper domination number, respectively) of a graph $G$, denoted by $\\gamma(G)$ ($\\Gamma(G)$, respectively), is the cardinality of a smallest (largest minimal, respectively) dominating set of $G$. A subset $D\\subseteq V_G$ is called a certified dominating set of $G$ if $D$ is a dominating set of $G$ and every vertex in $D$ has either zero or at least two neighbors in $V_G-D$. The cardinality of a~smallest (largest minimal, respectively) cert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02059","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-18T00:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EPwVwSZHDTShLAFS9KvVsItSBcuLiRfxWYKcGXJVAsY0aIHi5OuCdErT9hJaubr1NuT2OT1RLUo4OAQ66bVCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:28:13.732100Z"},"content_sha256":"fa65a673d412240abf7209dc4f474f9db0d98021f0e672fe3edf97a2888d8273","schema_version":"1.0","event_id":"sha256:fa65a673d412240abf7209dc4f474f9db0d98021f0e672fe3edf97a2888d8273"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43/bundle.json","state_url":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XATMYOEXSUW22FN6QRMIYXXB43/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-28T15:28:13Z","links":{"resolver":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43","bundle":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43/bundle.json","state":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XATMYOEXSUW22FN6QRMIYXXB43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XATMYOEXSUW22FN6QRMIYXXB43","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":"3449de0b81f0d0ca69f379305fa0bf4afe541ce95a2b2408ef135f551649d80c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T14:59:17Z","title_canon_sha256":"e48f645316854ceb40b53eb622ee3463321031179ec7d726fb0b53985624d319"},"schema_version":"1.0","source":{"id":"1710.02059","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02059","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02059v2","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02059","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"XATMYOEXSUW2","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XATMYOEXSUW22FN6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XATMYOEX","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:fa65a673d412240abf7209dc4f474f9db0d98021f0e672fe3edf97a2888d8273","target":"graph","created_at":"2026-05-18T00:33:34Z","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 set $D$ of vertices of a graph $G$ is a dominating set of $G$ if every vertex in $V_G-D$ is adjacent to at least one vertex in $D$. The domination number (upper domination number, respectively) of a graph $G$, denoted by $\\gamma(G)$ ($\\Gamma(G)$, respectively), is the cardinality of a smallest (largest minimal, respectively) dominating set of $G$. A subset $D\\subseteq V_G$ is called a certified dominating set of $G$ if $D$ is a dominating set of $G$ and every vertex in $D$ has either zero or at least two neighbors in $V_G-D$. The cardinality of a~smallest (largest minimal, respectively) cert","authors_text":"Jerzy Topp, Magda Dettlaff, Magdalena Lema\\'nska, Mateusz Miotk, Pawe{\\l} \\.Zyli\\'nski, Rados{\\l}aw Ziemann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T14:59:17Z","title":"Graphs with equal domination and certified domination numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02059","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:adb635ef810bb292be4b7e70aaeecae4f835303a40b2f9275adbab696cae0a04","target":"record","created_at":"2026-05-18T00:33:34Z","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":"3449de0b81f0d0ca69f379305fa0bf4afe541ce95a2b2408ef135f551649d80c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T14:59:17Z","title_canon_sha256":"e48f645316854ceb40b53eb622ee3463321031179ec7d726fb0b53985624d319"},"schema_version":"1.0","source":{"id":"1710.02059","kind":"arxiv","version":2}},"canonical_sha256":"b826cc3897952dad15be84588c5ee1e6c5fa027e7ce596c1ec30a5241e8283c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b826cc3897952dad15be84588c5ee1e6c5fa027e7ce596c1ec30a5241e8283c3","first_computed_at":"2026-05-18T00:33:34.346349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:34.346349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GNWJDC+4JMfIrpvpZ0lI6sa8dir1sPFu2wnKHZfAMQ1baoKV7+mO8VNYQQALOkMUFQHgjPkWHJdwtPLmuwbAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:34.346947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02059","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adb635ef810bb292be4b7e70aaeecae4f835303a40b2f9275adbab696cae0a04","sha256:fa65a673d412240abf7209dc4f474f9db0d98021f0e672fe3edf97a2888d8273"],"state_sha256":"ce4dfb8e94561b8a0b7c961f01db73095d9a1103526ceb7881a1baba05bc835d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trB2dW5KIgG1inG1zz797FX1/5A9pNvdiJ5mHbBktvFCh7wWMBsSyF1opHHysXbfNv/Z+z0IJejgnJhNmnFeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:28:13.734658Z","bundle_sha256":"de9659733be226ca71d2e4f55cfca6ea0fbb59c4d4784c3871644c6192818ad6"}}