{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6OLU6LUI32G3EMT7U6JNDTKESM","short_pith_number":"pith:6OLU6LUI","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"},"canonical_sha256":"f3974f2e88de8db2327fa792d1cd44931beb280b9c45bc3c43c3dbbfc08cc2cb","source":{"kind":"arxiv","id":"1611.02379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02379","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02379v1","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02379","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"6OLU6LUI32G3","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6OLU6LUI32G3EMT7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6OLU6LUI","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6OLU6LUI32G3EMT7U6JNDTKESM","target":"record","payload":{"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"},"canonical_sha256":"f3974f2e88de8db2327fa792d1cd44931beb280b9c45bc3c43c3dbbfc08cc2cb","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"},"source_kind":"arxiv","source_id":"1611.02379","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-18T00:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/sbUBqpU9BMyfr3WkmNDN+wQQQmgb/LtrdwbXcPP2DsD3rtSuZsLaSeKCBdUVapoFuyfz76hdj9efqulDqAcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:16:15.902703Z"},"content_sha256":"15d2317f7f7a99e38af9cd368b1634f035cb59f9d3f40ec86e8b7f226d79e5e3","schema_version":"1.0","event_id":"sha256:15d2317f7f7a99e38af9cd368b1634f035cb59f9d3f40ec86e8b7f226d79e5e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6OLU6LUI32G3EMT7U6JNDTKESM","target":"graph","payload":{"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"},"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-18T00:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCTwxGvTLsQr9Sc9onFMOp/oM345rXp1Fg9rM4kwl8Z6mQWarRO/mB8jvt5VYchH/6vCnFilGijqrkWmuOk3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:16:15.903060Z"},"content_sha256":"6ecd3788925f52df48fa16c184e60c9f18ee69572897f5e514365e9f8e280eab","schema_version":"1.0","event_id":"sha256:6ecd3788925f52df48fa16c184e60c9f18ee69572897f5e514365e9f8e280eab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM/bundle.json","state_url":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OLU6LUI32G3EMT7U6JNDTKESM/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-05-30T07:16:15Z","links":{"resolver":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM","bundle":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM/bundle.json","state":"https://pith.science/pith/6OLU6LUI32G3EMT7U6JNDTKESM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OLU6LUI32G3EMT7U6JNDTKESM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6OLU6LUI32G3EMT7U6JNDTKESM","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":"8e8c96fea55b7f5ab1f89e7f76120f123a64031cccd8a7a47bbe6aeb41cdf768","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-08T03:38:39Z","title_canon_sha256":"daa3e28b8f30568a00be6d726c1903af2a91875c86c26d1d196531ad0917b603"},"schema_version":"1.0","source":{"id":"1611.02379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02379","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02379v1","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02379","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"6OLU6LUI32G3","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6OLU6LUI32G3EMT7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6OLU6LUI","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:6ecd3788925f52df48fa16c184e60c9f18ee69572897f5e514365e9f8e280eab","target":"graph","created_at":"2026-05-18T00:59:52Z","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":"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.","authors_text":"Boris Brimkov, David Amos, John Asplund, Randy Davila","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-08T03:38:39Z","title":"The sub-$k$-domination number of a graph with applications to $k$-domination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02379","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:15d2317f7f7a99e38af9cd368b1634f035cb59f9d3f40ec86e8b7f226d79e5e3","target":"record","created_at":"2026-05-18T00:59:52Z","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":"8e8c96fea55b7f5ab1f89e7f76120f123a64031cccd8a7a47bbe6aeb41cdf768","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-08T03:38:39Z","title_canon_sha256":"daa3e28b8f30568a00be6d726c1903af2a91875c86c26d1d196531ad0917b603"},"schema_version":"1.0","source":{"id":"1611.02379","kind":"arxiv","version":1}},"canonical_sha256":"f3974f2e88de8db2327fa792d1cd44931beb280b9c45bc3c43c3dbbfc08cc2cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3974f2e88de8db2327fa792d1cd44931beb280b9c45bc3c43c3dbbfc08cc2cb","first_computed_at":"2026-05-18T00:59:52.241705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:52.241705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UYitsh1sCRr482gSOaqB41a7CHXUDSr73JGnxGuoQ320ZFPz0cFobUya/u6HWpqUa5UnESDAmqq3uDoJ0Mp3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:52.242424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15d2317f7f7a99e38af9cd368b1634f035cb59f9d3f40ec86e8b7f226d79e5e3","sha256:6ecd3788925f52df48fa16c184e60c9f18ee69572897f5e514365e9f8e280eab"],"state_sha256":"249660a337b1d1e69ce0d78fc05a79a39c907f58aed70c806bc22ca62de625db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/aZ640VpnVT7YvRMQZmg42f5ARAyRL+oPGvw9CW/MQuRsE/igpB6rTH7zyX32G042jsu3SzuG7lfKx5XqM0mBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:16:15.905127Z","bundle_sha256":"3e3c54758c0136c226dde82f88e6ce607acd6a6d412b19d1296286c1409ef04b"}}