{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TJ3VWZBCNYFROXBOARUD2WKY2B","short_pith_number":"pith:TJ3VWZBC","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"},"canonical_sha256":"9a775b64226e0b175c2e04683d5958d079f8306ddc21aaec259bcec71eb26e88","source":{"kind":"arxiv","id":"1109.1150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1150","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1150v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1150","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"TJ3VWZBCNYFR","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJ3VWZBCNYFROXBO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJ3VWZBC","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TJ3VWZBCNYFROXBOARUD2WKY2B","target":"record","payload":{"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"},"canonical_sha256":"9a775b64226e0b175c2e04683d5958d079f8306ddc21aaec259bcec71eb26e88","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"},"source_kind":"arxiv","source_id":"1109.1150","source_version":1,"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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mt/ssHaUNw2bN8gWi7CScT1MIKkHTAFJK9MbYCyOSHOpX87yCFGmMwuZgTfCG6cm83WqQLX1w0MMpKl+X/PwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:13:28.973345Z"},"content_sha256":"2c7e1a74b6b9571285a17a7030db52c8fe8b9879cc4548388646e4ca4f420c22","schema_version":"1.0","event_id":"sha256:2c7e1a74b6b9571285a17a7030db52c8fe8b9879cc4548388646e4ca4f420c22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TJ3VWZBCNYFROXBOARUD2WKY2B","target":"graph","payload":{"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"},"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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nQT/GdY+Y9ltZRkLeOpB9m5n73ySK83UHpW6iwTi8Deu9pLUpSrTHpjRUB6BPw+PYdrLvu6DeagwAuRiylJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:13:28.973994Z"},"content_sha256":"58d06240914eb4e3a20ca22d2ced27e869bd9d508d108c187b717a0a3de9c752","schema_version":"1.0","event_id":"sha256:58d06240914eb4e3a20ca22d2ced27e869bd9d508d108c187b717a0a3de9c752"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/bundle.json","state_url":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/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-06-11T05:13:28Z","links":{"resolver":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B","bundle":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/bundle.json","state":"https://pith.science/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJ3VWZBCNYFROXBOARUD2WKY2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TJ3VWZBCNYFROXBOARUD2WKY2B","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":"20b2800fd1b6f7c682a37e4376c22d6e71e0ad33be04c40e29cba99314c75bbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T11:43:22Z","title_canon_sha256":"7159a0f42af2be850ffe640a69e9d6874cd3e696598818c41e6670ebacab123c"},"schema_version":"1.0","source":{"id":"1109.1150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1150","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1150v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1150","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"TJ3VWZBCNYFR","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJ3VWZBCNYFROXBO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJ3VWZBC","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:58d06240914eb4e3a20ca22d2ced27e869bd9d508d108c187b717a0a3de9c752","target":"graph","created_at":"2026-05-18T04:14:05Z","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 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","authors_text":"Adriana Hansberg, Michael A. Henning, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T11:43:22Z","title":"Fair Domination in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1150","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:2c7e1a74b6b9571285a17a7030db52c8fe8b9879cc4548388646e4ca4f420c22","target":"record","created_at":"2026-05-18T04:14:05Z","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":"20b2800fd1b6f7c682a37e4376c22d6e71e0ad33be04c40e29cba99314c75bbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T11:43:22Z","title_canon_sha256":"7159a0f42af2be850ffe640a69e9d6874cd3e696598818c41e6670ebacab123c"},"schema_version":"1.0","source":{"id":"1109.1150","kind":"arxiv","version":1}},"canonical_sha256":"9a775b64226e0b175c2e04683d5958d079f8306ddc21aaec259bcec71eb26e88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a775b64226e0b175c2e04683d5958d079f8306ddc21aaec259bcec71eb26e88","first_computed_at":"2026-05-18T04:14:05.247840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:05.247840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XzUdOjUeiwF3St6qpBhJRDjyLxkmId8Lw2O3EAq7wnLdan5FYZya1xjAjBS71SlvAzo+MeImhDs9ykbIbjvCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:05.248492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c7e1a74b6b9571285a17a7030db52c8fe8b9879cc4548388646e4ca4f420c22","sha256:58d06240914eb4e3a20ca22d2ced27e869bd9d508d108c187b717a0a3de9c752"],"state_sha256":"fbe4f8ca037bc30734b402eb1127c68cd7bac6e7e9fef3d407b38166c18f605b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9N+bW4UhJ/ra3ooFf9WbZMhPWyOG/XPiiBRd2KLYziYke3geQt+y6BCEGj0q0XuzRun14oLukjBbj3DggaeGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:13:28.977221Z","bundle_sha256":"19001c8cb561effbd24dc8d2929b665c777b712be6c0ab0af1c50f740a830097"}}