{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TJ3VWZBCNYFROXBOARUD2WKY2B","short_pith_number":"pith:TJ3VWZBC","schema_version":"1.0","canonical_sha256":"9a775b64226e0b175c2e04683d5958d079f8306ddc21aaec259bcec71eb26e88","source":{"kind":"arxiv","id":"1109.1150","version":1},"attestation_state":"computed","paper":{"title":"Fair Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Michael A. Henning, Yair Caro","submitted_at":"2011-09-06T11:43:22Z","abstract_excerpt":"A fair dominating set in a graph $G$ (or FD-set) is a dominating set $S$ such that all vertices not in $S$ are dominated by the same number of vertices from $S$; that is, every two vertices not in $S$ have the same number of neighbors in $S$. The fair domination number, $fd(G)$, of $G$ is the minimum cardinality of a FD-set. We present various results on the fair domination number of a graph. In particular, we show that if $G$ is a connected graph of order $n \\ge 3$ with no isolated vertex, then $fd(G) \\le n - 2$, and we construct an infinite family of connected graphs achieving equality in th"},"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":"1109.1150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T11:43:22Z","cross_cats_sorted":[],"title_canon_sha256":"7159a0f42af2be850ffe640a69e9d6874cd3e696598818c41e6670ebacab123c","abstract_canon_sha256":"20b2800fd1b6f7c682a37e4376c22d6e71e0ad33be04c40e29cba99314c75bbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:05.248492Z","signature_b64":"XzUdOjUeiwF3St6qpBhJRDjyLxkmId8Lw2O3EAq7wnLdan5FYZya1xjAjBS71SlvAzo+MeImhDs9ykbIbjvCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a775b64226e0b175c2e04683d5958d079f8306ddc21aaec259bcec71eb26e88","last_reissued_at":"2026-05-18T04:14:05.247840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:05.247840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Michael A. Henning, Yair Caro","submitted_at":"2011-09-06T11:43:22Z","abstract_excerpt":"A fair dominating set in a graph $G$ (or FD-set) is a dominating set $S$ such that all vertices not in $S$ are dominated by the same number of vertices from $S$; that is, every two vertices not in $S$ have the same number of neighbors in $S$. The fair domination number, $fd(G)$, of $G$ is the minimum cardinality of a FD-set. We present various results on the fair domination number of a graph. In particular, we show that if $G$ is a connected graph of order $n \\ge 3$ with no isolated vertex, then $fd(G) \\le n - 2$, and we construct an infinite family of connected graphs achieving equality in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1150","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":"1109.1150","created_at":"2026-05-18T04:14:05.247943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1150v1","created_at":"2026-05-18T04:14:05.247943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1150","created_at":"2026-05-18T04:14:05.247943+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJ3VWZBCNYFR","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJ3VWZBCNYFROXBO","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJ3VWZBC","created_at":"2026-05-18T12:26:42.757692+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/TJ3VWZBCNYFROXBOARUD2WKY2B","json":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B.json","graph_json":"https://pith.science/api/pith-number/TJ3VWZBCNYFROXBOARUD2WKY2B/graph.json","events_json":"https://pith.science/api/pith-number/TJ3VWZBCNYFROXBOARUD2WKY2B/events.json","paper":"https://pith.science/paper/TJ3VWZBC"},"agent_actions":{"view_html":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B","download_json":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B.json","view_paper":"https://pith.science/paper/TJ3VWZBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1150&json=true","fetch_graph":"https://pith.science/api/pith-number/TJ3VWZBCNYFROXBOARUD2WKY2B/graph.json","fetch_events":"https://pith.science/api/pith-number/TJ3VWZBCNYFROXBOARUD2WKY2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/action/storage_attestation","attest_author":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/action/author_attestation","sign_citation":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/action/citation_signature","submit_replication":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/action/replication_record"}},"created_at":"2026-05-18T04:14:05.247943+00:00","updated_at":"2026-05-18T04:14:05.247943+00:00"}