{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2KD4DQR3TEX7STQHSBSWC6HUVJ","short_pith_number":"pith:2KD4DQR3","schema_version":"1.0","canonical_sha256":"d287c1c23b992ff94e0790656178f4aa64563a412ae78d6d2c6fe0a7bf465d79","source":{"kind":"arxiv","id":"1109.6277","version":2},"attestation_state":"computed","paper":{"title":"Domination Value in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eunjeong Yi","submitted_at":"2011-09-28T17:26:45Z","abstract_excerpt":"A set $D \\subseteq V(G)$ is a \\emph{dominating set} of $G$ if every vertex not in $D$ is adjacent to at least one vertex in $D$. A dominating set of $G$ of minimum cardinality is called a $\\gamma(G)$-set. For each vertex $v \\in V(G)$, we define the \\emph{domination value} of $v$ to be the number of $\\gamma(G)$-sets to which $v$ belongs. In this paper, we study some basic properties of the domination value function, thus initiating \\emph{a local study of domination} in graphs. Further, we characterize domination value for the Petersen graph, complete $n$-partite graphs, cycles, and paths."},"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.6277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T17:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"0ea4a9c21efcb033c262aa2d8d4c690c68e02e939f97649272db340c8fa64001","abstract_canon_sha256":"b2d6f816eb77ffcd5f014a7804d7fa2c2be417ad0ce8019467ce92f6ce182ada"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:53.262558Z","signature_b64":"5x/fJgHo9xKFXA6TsRkxvA8fcwEsnUIzcczrto42j93200+Bc6jgqElyvQt21WekUqCh9NaOiCla/jXSY5erCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d287c1c23b992ff94e0790656178f4aa64563a412ae78d6d2c6fe0a7bf465d79","last_reissued_at":"2026-05-18T03:37:53.261842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:53.261842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination Value in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eunjeong Yi","submitted_at":"2011-09-28T17:26:45Z","abstract_excerpt":"A set $D \\subseteq V(G)$ is a \\emph{dominating set} of $G$ if every vertex not in $D$ is adjacent to at least one vertex in $D$. A dominating set of $G$ of minimum cardinality is called a $\\gamma(G)$-set. For each vertex $v \\in V(G)$, we define the \\emph{domination value} of $v$ to be the number of $\\gamma(G)$-sets to which $v$ belongs. In this paper, we study some basic properties of the domination value function, thus initiating \\emph{a local study of domination} in graphs. Further, we characterize domination value for the Petersen graph, complete $n$-partite graphs, cycles, and paths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6277","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":"1109.6277","created_at":"2026-05-18T03:37:53.261966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6277v2","created_at":"2026-05-18T03:37:53.261966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6277","created_at":"2026-05-18T03:37:53.261966+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KD4DQR3TEX7","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KD4DQR3TEX7STQH","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KD4DQR3","created_at":"2026-05-18T12:26:18.847500+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/2KD4DQR3TEX7STQHSBSWC6HUVJ","json":"https://pith.science/pith/2KD4DQR3TEX7STQHSBSWC6HUVJ.json","graph_json":"https://pith.science/api/pith-number/2KD4DQR3TEX7STQHSBSWC6HUVJ/graph.json","events_json":"https://pith.science/api/pith-number/2KD4DQR3TEX7STQHSBSWC6HUVJ/events.json","paper":"https://pith.science/paper/2KD4DQR3"},"agent_actions":{"view_html":"https://pith.science/pith/2KD4DQR3TEX7STQHSBSWC6HUVJ","download_json":"https://pith.science/pith/2KD4DQR3TEX7STQHSBSWC6HUVJ.json","view_paper":"https://pith.science/paper/2KD4DQR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6277&json=true","fetch_graph":"https://pith.science/api/pith-number/2KD4DQR3TEX7STQHSBSWC6HUVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2KD4DQR3TEX7STQHSBSWC6HUVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KD4DQR3TEX7STQHSBSWC6HUVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KD4DQR3TEX7STQHSBSWC6HUVJ/action/storage_attestation","attest_author":"https://pith.science/pith/2KD4DQR3TEX7STQHSBSWC6HUVJ/action/author_attestation","sign_citation":"https://pith.science/pith/2KD4DQR3TEX7STQHSBSWC6HUVJ/action/citation_signature","submit_replication":"https://pith.science/pith/2KD4DQR3TEX7STQHSBSWC6HUVJ/action/replication_record"}},"created_at":"2026-05-18T03:37:53.261966+00:00","updated_at":"2026-05-18T03:37:53.261966+00:00"}