{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GRX6S5NS5JFZ4E5OWJHWS5BFBN","short_pith_number":"pith:GRX6S5NS","schema_version":"1.0","canonical_sha256":"346fe975b2ea4b9e13aeb24f6974250b748cca88afb0c07b748c5685ac700461","source":{"kind":"arxiv","id":"1507.08745","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds on the Distance Domination Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caleb Fast, Franklin Kenter, Michael Henning, Randy Davila","submitted_at":"2015-07-31T04:00:51Z","abstract_excerpt":"For an integer $k \\ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G) \\setminus S$ is at distance at most~$k$ from some vertex of $S$. The $k$-domination number, $\\gamma_k(G)$, of $G$ is the minimum cardinality of a $k$-dominating set of $G$. In this paper, we establish lower bounds on the $k$-domination number of a graph in terms of its diameter, radius and girth. We prove that for connected graphs $G$ and $H$, $\\gamma_k(G \\times H) \\ge \\gamma_k(G) + \\gamma_k(H) -1$, where $G \\times H$ denotes the direct product of $"},"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":"1507.08745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-31T04:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"3f1d078c44cc0f67b439fb33705bbb975ae784e6dafa8a4d1f32a36db02d26b8","abstract_canon_sha256":"7439e33b1fbbb079873c50a669914664b2c97275799ef0773b34e79ff32277f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:02.968962Z","signature_b64":"UZYSuJTL009H1bb5DT4kscXXRnw9q9rG7xbhvsWb3L2Eqg5MNPdtm6/7sKcTmDO/GzBTMQLPt8D4ZmlWmiBWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"346fe975b2ea4b9e13aeb24f6974250b748cca88afb0c07b748c5685ac700461","last_reissued_at":"2026-05-18T01:36:02.968409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:02.968409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on the Distance Domination Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caleb Fast, Franklin Kenter, Michael Henning, Randy Davila","submitted_at":"2015-07-31T04:00:51Z","abstract_excerpt":"For an integer $k \\ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G) \\setminus S$ is at distance at most~$k$ from some vertex of $S$. The $k$-domination number, $\\gamma_k(G)$, of $G$ is the minimum cardinality of a $k$-dominating set of $G$. In this paper, we establish lower bounds on the $k$-domination number of a graph in terms of its diameter, radius and girth. We prove that for connected graphs $G$ and $H$, $\\gamma_k(G \\times H) \\ge \\gamma_k(G) + \\gamma_k(H) -1$, where $G \\times H$ denotes the direct product of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08745","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":"1507.08745","created_at":"2026-05-18T01:36:02.968506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08745v1","created_at":"2026-05-18T01:36:02.968506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08745","created_at":"2026-05-18T01:36:02.968506+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRX6S5NS5JFZ","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRX6S5NS5JFZ4E5O","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRX6S5NS","created_at":"2026-05-18T12:29:22.688609+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/GRX6S5NS5JFZ4E5OWJHWS5BFBN","json":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN.json","graph_json":"https://pith.science/api/pith-number/GRX6S5NS5JFZ4E5OWJHWS5BFBN/graph.json","events_json":"https://pith.science/api/pith-number/GRX6S5NS5JFZ4E5OWJHWS5BFBN/events.json","paper":"https://pith.science/paper/GRX6S5NS"},"agent_actions":{"view_html":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN","download_json":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN.json","view_paper":"https://pith.science/paper/GRX6S5NS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08745&json=true","fetch_graph":"https://pith.science/api/pith-number/GRX6S5NS5JFZ4E5OWJHWS5BFBN/graph.json","fetch_events":"https://pith.science/api/pith-number/GRX6S5NS5JFZ4E5OWJHWS5BFBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/action/storage_attestation","attest_author":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/action/author_attestation","sign_citation":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/action/citation_signature","submit_replication":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/action/replication_record"}},"created_at":"2026-05-18T01:36:02.968506+00:00","updated_at":"2026-05-18T01:36:02.968506+00:00"}