{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DDX5V66XXOAHGWJSOQIH7A3U5N","short_pith_number":"pith:DDX5V66X","schema_version":"1.0","canonical_sha256":"18efdafbd7bb8073593274107f8374eb75416d7c7261e00e4fa679650cbd35d8","source":{"kind":"arxiv","id":"1409.4116","version":1},"attestation_state":"computed","paper":{"title":"On Domination Number and Distance in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang","submitted_at":"2014-09-14T23:22:09Z","abstract_excerpt":"A vertex set $S$ of a graph $G$ is a \\emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \\emph{domination number} $\\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over all dominating sets of $G$. It is known that $\\gamma(G) \\ge \\frac{1}{3}(diam(G)+1)$, where $diam(G)$ denotes the diameter of $G$. Define $C_r$ as the largest constant such that $\\gamma(G) \\ge C_r \\sum_{1 \\le i < j \\le r}d(x_i, x_j)$ for any $r$ vertices of an arbitrary connected graph $G$; then $C_2=\\frac{1}{3}$ in this view. The main result of this paper is "},"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":"1409.4116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-14T23:22:09Z","cross_cats_sorted":[],"title_canon_sha256":"20338904ae2690917d2148b3f3c082e9f4d2379405e94afd9b19b39337acc7af","abstract_canon_sha256":"d5b611b9836209256bb80717d416b1770cac258964dd7d73505a8bd0003649c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:53.021857Z","signature_b64":"VOgjqCGhW2OP5P+BilnmGHIXFVgjqm4QYO2+QeU8oH3HyQ2BOqrMmum+fh+Dkttgt8RQ2LWNUnPMvQRyL94FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18efdafbd7bb8073593274107f8374eb75416d7c7261e00e4fa679650cbd35d8","last_reissued_at":"2026-05-18T02:42:53.021454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:53.021454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Domination Number and Distance in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang","submitted_at":"2014-09-14T23:22:09Z","abstract_excerpt":"A vertex set $S$ of a graph $G$ is a \\emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \\emph{domination number} $\\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over all dominating sets of $G$. It is known that $\\gamma(G) \\ge \\frac{1}{3}(diam(G)+1)$, where $diam(G)$ denotes the diameter of $G$. Define $C_r$ as the largest constant such that $\\gamma(G) \\ge C_r \\sum_{1 \\le i < j \\le r}d(x_i, x_j)$ for any $r$ vertices of an arbitrary connected graph $G$; then $C_2=\\frac{1}{3}$ in this view. The main result of this paper is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4116","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":"1409.4116","created_at":"2026-05-18T02:42:53.021523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4116v1","created_at":"2026-05-18T02:42:53.021523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4116","created_at":"2026-05-18T02:42:53.021523+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDX5V66XXOAH","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDX5V66XXOAHGWJS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDX5V66X","created_at":"2026-05-18T12:28:25.294606+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/DDX5V66XXOAHGWJSOQIH7A3U5N","json":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N.json","graph_json":"https://pith.science/api/pith-number/DDX5V66XXOAHGWJSOQIH7A3U5N/graph.json","events_json":"https://pith.science/api/pith-number/DDX5V66XXOAHGWJSOQIH7A3U5N/events.json","paper":"https://pith.science/paper/DDX5V66X"},"agent_actions":{"view_html":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N","download_json":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N.json","view_paper":"https://pith.science/paper/DDX5V66X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4116&json=true","fetch_graph":"https://pith.science/api/pith-number/DDX5V66XXOAHGWJSOQIH7A3U5N/graph.json","fetch_events":"https://pith.science/api/pith-number/DDX5V66XXOAHGWJSOQIH7A3U5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/action/storage_attestation","attest_author":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/action/author_attestation","sign_citation":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/action/citation_signature","submit_replication":"https://pith.science/pith/DDX5V66XXOAHGWJSOQIH7A3U5N/action/replication_record"}},"created_at":"2026-05-18T02:42:53.021523+00:00","updated_at":"2026-05-18T02:42:53.021523+00:00"}