{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TZZRH22YTU4H6IOP4ECE7MDLUK","short_pith_number":"pith:TZZRH22Y","schema_version":"1.0","canonical_sha256":"9e7313eb589d387f21cfe1044fb06ba2ae0e828055c89697d26a65bb37dc8ed2","source":{"kind":"arxiv","id":"1606.03257","version":1},"attestation_state":"computed","paper":{"title":"Certified domination","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, Pawe{\\l} \\.Zyli\\'nski, Rados{\\l}aw Ziemann","submitted_at":"2016-06-10T10:21:38Z","abstract_excerpt":"Imagine that we are given a set $D$ of officials and a set $W$ of civils. For each civil $x \\in W$, there must be an official $v \\in D$ that can serve $x$, and whenever any such $v$ is serving $x$, there must also be another civil $w \\in W$ that observes $v$, that is, $w$ may act as a kind of witness, to avoid any abuse from $v$. What is the minimum number of officials to guarantee such a service, assuming a given social network?\n  In this paper, we introduce the concept of certified domination that perfectly models the aforementioned problem. Specifically, a dominating set $D$ of a graph $G=("},"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":"1606.03257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-10T10:21:38Z","cross_cats_sorted":[],"title_canon_sha256":"99aae7e7b6ec9e3ea3d0554b069e526bc82f6ab930b047904b869c938390fc72","abstract_canon_sha256":"8da7f2649212be83bfc9add63356f8964de6427c2cf08424b4d1e50bdc75b1cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:37.266160Z","signature_b64":"x/opg6ejk0o3mHpcNhc1abq0fsGQOFIALCnOEnWWwRU1tyXTCjAnMpbvrL9IygttSWVEgHakKBVD+e6CDkEYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e7313eb589d387f21cfe1044fb06ba2ae0e828055c89697d26a65bb37dc8ed2","last_reissued_at":"2026-05-18T01:12:37.265674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:37.265674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certified domination","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, Pawe{\\l} \\.Zyli\\'nski, Rados{\\l}aw Ziemann","submitted_at":"2016-06-10T10:21:38Z","abstract_excerpt":"Imagine that we are given a set $D$ of officials and a set $W$ of civils. For each civil $x \\in W$, there must be an official $v \\in D$ that can serve $x$, and whenever any such $v$ is serving $x$, there must also be another civil $w \\in W$ that observes $v$, that is, $w$ may act as a kind of witness, to avoid any abuse from $v$. What is the minimum number of officials to guarantee such a service, assuming a given social network?\n  In this paper, we introduce the concept of certified domination that perfectly models the aforementioned problem. Specifically, a dominating set $D$ of a graph $G=("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03257","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.03257","created_at":"2026-05-18T01:12:37.265757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03257v1","created_at":"2026-05-18T01:12:37.265757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03257","created_at":"2026-05-18T01:12:37.265757+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZZRH22YTU4H","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZZRH22YTU4H6IOP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZZRH22Y","created_at":"2026-05-18T12:30:46.583412+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/TZZRH22YTU4H6IOP4ECE7MDLUK","json":"https://pith.science/pith/TZZRH22YTU4H6IOP4ECE7MDLUK.json","graph_json":"https://pith.science/api/pith-number/TZZRH22YTU4H6IOP4ECE7MDLUK/graph.json","events_json":"https://pith.science/api/pith-number/TZZRH22YTU4H6IOP4ECE7MDLUK/events.json","paper":"https://pith.science/paper/TZZRH22Y"},"agent_actions":{"view_html":"https://pith.science/pith/TZZRH22YTU4H6IOP4ECE7MDLUK","download_json":"https://pith.science/pith/TZZRH22YTU4H6IOP4ECE7MDLUK.json","view_paper":"https://pith.science/paper/TZZRH22Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03257&json=true","fetch_graph":"https://pith.science/api/pith-number/TZZRH22YTU4H6IOP4ECE7MDLUK/graph.json","fetch_events":"https://pith.science/api/pith-number/TZZRH22YTU4H6IOP4ECE7MDLUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZZRH22YTU4H6IOP4ECE7MDLUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZZRH22YTU4H6IOP4ECE7MDLUK/action/storage_attestation","attest_author":"https://pith.science/pith/TZZRH22YTU4H6IOP4ECE7MDLUK/action/author_attestation","sign_citation":"https://pith.science/pith/TZZRH22YTU4H6IOP4ECE7MDLUK/action/citation_signature","submit_replication":"https://pith.science/pith/TZZRH22YTU4H6IOP4ECE7MDLUK/action/replication_record"}},"created_at":"2026-05-18T01:12:37.265757+00:00","updated_at":"2026-05-18T01:12:37.265757+00:00"}