{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TZZRH22YTU4H6IOP4ECE7MDLUK","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":"8da7f2649212be83bfc9add63356f8964de6427c2cf08424b4d1e50bdc75b1cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-10T10:21:38Z","title_canon_sha256":"99aae7e7b6ec9e3ea3d0554b069e526bc82f6ab930b047904b869c938390fc72"},"schema_version":"1.0","source":{"id":"1606.03257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03257","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03257v1","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03257","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"TZZRH22YTU4H","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TZZRH22YTU4H6IOP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TZZRH22Y","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:a144d6f9082f1dfffb34a9ad0bc3e7fff60ea3c31052c5893f876aa5fa9ecf68","target":"graph","created_at":"2026-05-18T01:12: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":"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=(","authors_text":"Jerzy Topp, Magda Dettlaff, Magdalena Lema\\'nska, 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":"2016-06-10T10:21:38Z","title":"Certified domination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03257","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:a8eea9d26ad640fa4a5e4b8fc6f865fc40e0ca5210b0f4da4e0fd427d9d8cfc0","target":"record","created_at":"2026-05-18T01:12: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":"8da7f2649212be83bfc9add63356f8964de6427c2cf08424b4d1e50bdc75b1cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-10T10:21:38Z","title_canon_sha256":"99aae7e7b6ec9e3ea3d0554b069e526bc82f6ab930b047904b869c938390fc72"},"schema_version":"1.0","source":{"id":"1606.03257","kind":"arxiv","version":1}},"canonical_sha256":"9e7313eb589d387f21cfe1044fb06ba2ae0e828055c89697d26a65bb37dc8ed2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e7313eb589d387f21cfe1044fb06ba2ae0e828055c89697d26a65bb37dc8ed2","first_computed_at":"2026-05-18T01:12:37.265674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:37.265674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x/opg6ejk0o3mHpcNhc1abq0fsGQOFIALCnOEnWWwRU1tyXTCjAnMpbvrL9IygttSWVEgHakKBVD+e6CDkEYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:37.266160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8eea9d26ad640fa4a5e4b8fc6f865fc40e0ca5210b0f4da4e0fd427d9d8cfc0","sha256:a144d6f9082f1dfffb34a9ad0bc3e7fff60ea3c31052c5893f876aa5fa9ecf68"],"state_sha256":"7258e9af73b23c425a7c5456d817b038e1141cf74a95ffa2af77c94c503dae0f"}