{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6OLU6LUI32G3EMT7U6JNDTKESM","short_pith_number":"pith:6OLU6LUI","schema_version":"1.0","canonical_sha256":"f3974f2e88de8db2327fa792d1cd44931beb280b9c45bc3c43c3dbbfc08cc2cb","source":{"kind":"arxiv","id":"1611.02379","version":1},"attestation_state":"computed","paper":{"title":"The sub-$k$-domination number of a graph with applications to $k$-domination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Boris Brimkov, David Amos, John Asplund, Randy Davila","submitted_at":"2016-11-08T03:38:39Z","abstract_excerpt":"In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph $G$, called the sub-$k$-domination number and denoted $sub_k(G)$. We show that $sub_k(G)$ is a computationally efficient sharp lower bound on the $k$-domination number of $G$, and improves on several known lower bounds. We also characterize the sub-$k$-domination numbers of several families of graphs, provide structural results on sub-$k$-domination, and explore properties of graphs which are $sub_k(G)$-critical with respect to addition and deletion of vertices and edges."},"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":"1611.02379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-08T03:38:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"daa3e28b8f30568a00be6d726c1903af2a91875c86c26d1d196531ad0917b603","abstract_canon_sha256":"8e8c96fea55b7f5ab1f89e7f76120f123a64031cccd8a7a47bbe6aeb41cdf768"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:52.242424Z","signature_b64":"UYitsh1sCRr482gSOaqB41a7CHXUDSr73JGnxGuoQ320ZFPz0cFobUya/u6HWpqUa5UnESDAmqq3uDoJ0Mp3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3974f2e88de8db2327fa792d1cd44931beb280b9c45bc3c43c3dbbfc08cc2cb","last_reissued_at":"2026-05-18T00:59:52.241705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:52.241705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sub-$k$-domination number of a graph with applications to $k$-domination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Boris Brimkov, David Amos, John Asplund, Randy Davila","submitted_at":"2016-11-08T03:38:39Z","abstract_excerpt":"In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph $G$, called the sub-$k$-domination number and denoted $sub_k(G)$. We show that $sub_k(G)$ is a computationally efficient sharp lower bound on the $k$-domination number of $G$, and improves on several known lower bounds. We also characterize the sub-$k$-domination numbers of several families of graphs, provide structural results on sub-$k$-domination, and explore properties of graphs which are $sub_k(G)$-critical with respect to addition and deletion of vertices and edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02379","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":"1611.02379","created_at":"2026-05-18T00:59:52.241796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02379v1","created_at":"2026-05-18T00:59:52.241796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02379","created_at":"2026-05-18T00:59:52.241796+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OLU6LUI32G3","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OLU6LUI32G3EMT7","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OLU6LUI","created_at":"2026-05-18T12:30:01.593930+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/6OLU6LUI32G3EMT7U6JNDTKESM","json":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM.json","graph_json":"https://pith.science/api/pith-number/6OLU6LUI32G3EMT7U6JNDTKESM/graph.json","events_json":"https://pith.science/api/pith-number/6OLU6LUI32G3EMT7U6JNDTKESM/events.json","paper":"https://pith.science/paper/6OLU6LUI"},"agent_actions":{"view_html":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM","download_json":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM.json","view_paper":"https://pith.science/paper/6OLU6LUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02379&json=true","fetch_graph":"https://pith.science/api/pith-number/6OLU6LUI32G3EMT7U6JNDTKESM/graph.json","fetch_events":"https://pith.science/api/pith-number/6OLU6LUI32G3EMT7U6JNDTKESM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM/action/storage_attestation","attest_author":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM/action/author_attestation","sign_citation":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM/action/citation_signature","submit_replication":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM/action/replication_record"}},"created_at":"2026-05-18T00:59:52.241796+00:00","updated_at":"2026-05-18T00:59:52.241796+00:00"}