{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XATMYOEXSUW22FN6QRMIYXXB43","short_pith_number":"pith:XATMYOEX","schema_version":"1.0","canonical_sha256":"b826cc3897952dad15be84588c5ee1e6c5fa027e7ce596c1ec30a5241e8283c3","source":{"kind":"arxiv","id":"1710.02059","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.02059","created_at":"2026-05-18T00:33:34.346451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02059v2","created_at":"2026-05-18T00:33:34.346451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02059","created_at":"2026-05-18T00:33:34.346451+00:00"},{"alias_kind":"pith_short_12","alias_value":"XATMYOEXSUW2","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XATMYOEXSUW22FN6","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XATMYOEX","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43","json":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43.json","graph_json":"https://pith.science/api/pith-number/XATMYOEXSUW22FN6QRMIYXXB43/graph.json","events_json":"https://pith.science/api/pith-number/XATMYOEXSUW22FN6QRMIYXXB43/events.json","paper":"https://pith.science/paper/XATMYOEX"},"agent_actions":{"view_html":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43","download_json":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43.json","view_paper":"https://pith.science/paper/XATMYOEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02059&json=true","fetch_graph":"https://pith.science/api/pith-number/XATMYOEXSUW22FN6QRMIYXXB43/graph.json","fetch_events":"https://pith.science/api/pith-number/XATMYOEXSUW22FN6QRMIYXXB43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43/action/storage_attestation","attest_author":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43/action/author_attestation","sign_citation":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43/action/citation_signature","submit_replication":"https://pith.science/pith/XATMYOEXSUW22FN6QRMIYXXB43/action/replication_record"}},"created_at":"2026-05-18T00:33:34.346451+00:00","updated_at":"2026-05-18T00:33:34.346451+00:00"}