{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:UEI632AW6RZ6NS33E7AXEUKFF2","short_pith_number":"pith:UEI632AW","canonical_record":{"source":{"id":"2104.03172","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-07T15:04:02Z","cross_cats_sorted":[],"title_canon_sha256":"e5021681a054824c0f61235b5dce1c1458f95dcb7e4cf6f73e4a3a0a3e07d2aa","abstract_canon_sha256":"5f61ef05ec728c75cdeaada3159a6937cffd9df9746fe9764911dde7a0611292"},"schema_version":"1.0"},"canonical_sha256":"a111ede816f473e6cb7b27c17251452e8189bd79374847e84f0c6349fb0c289e","source":{"kind":"arxiv","id":"2104.03172","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.03172","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"2104.03172v2","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.03172","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"UEI632AW6RZ6","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"pith_short_16","alias_value":"UEI632AW6RZ6NS33","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"pith_short_8","alias_value":"UEI632AW","created_at":"2026-07-05T03:46:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:UEI632AW6RZ6NS33E7AXEUKFF2","target":"record","payload":{"canonical_record":{"source":{"id":"2104.03172","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-07T15:04:02Z","cross_cats_sorted":[],"title_canon_sha256":"e5021681a054824c0f61235b5dce1c1458f95dcb7e4cf6f73e4a3a0a3e07d2aa","abstract_canon_sha256":"5f61ef05ec728c75cdeaada3159a6937cffd9df9746fe9764911dde7a0611292"},"schema_version":"1.0"},"canonical_sha256":"a111ede816f473e6cb7b27c17251452e8189bd79374847e84f0c6349fb0c289e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:46:44.268023Z","signature_b64":"ej2E+jAlF05eRHkqQSI7HW8DuOFM1eV51Dt4xmSmbbVOwXg2PdsG+24mIrcjxEXsCdWW6oBYeY0+KP0bYjkjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a111ede816f473e6cb7b27c17251452e8189bd79374847e84f0c6349fb0c289e","last_reissued_at":"2026-07-05T03:46:44.267606Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:46:44.267606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.03172","source_version":2,"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-07-05T03:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cf2S2zqopkc9TSDZRrb5k9pgMhLGXK6NkfDcrG+sGbJE0dR6ZS7XxAmYeU62l8OmFppzpyLpuU6FUY9qf26/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:29:38.063593Z"},"content_sha256":"a0ec55e5781618c61ebccdbe5e192853f7308d67e33a59a3bf66c4149788433a","schema_version":"1.0","event_id":"sha256:a0ec55e5781618c61ebccdbe5e192853f7308d67e33a59a3bf66c4149788433a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:UEI632AW6RZ6NS33E7AXEUKFF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the k-tuple domination number of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abel Cabrera Martinez","submitted_at":"2021-04-07T15:04:02Z","abstract_excerpt":"In a graph $G$, a vertex dominates itself and its neighbours. A set $D\\subseteq V(G)$ is said to be a $k$-tuple dominating set of $G$ if $D$ dominates every vertex of $G$ at least $k$ times. The minimum cardinality among all $k$-tuple dominating sets is the $k$-tuple domination number of $G$. In this paper, we provide new bounds on this parameter. Some of these bounds generalize other ones that have been given for the case $k=2$. In addition, we improve two well-known lower bounds on the $k$-tuple domination number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.03172","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.03172/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkkiaVFXfSmOKYT3r4ACO4HuEVRSvppGqMyBt0XAXjFbi/CYu51GrTm/Mdc9YUqkh+nFYcSQ0SsWNRmf/QNfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:29:38.063977Z"},"content_sha256":"eec7688fbf348e6a13c9eabd889ffed94ce7203a4e26a1ff673371af9d2d7534","schema_version":"1.0","event_id":"sha256:eec7688fbf348e6a13c9eabd889ffed94ce7203a4e26a1ff673371af9d2d7534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UEI632AW6RZ6NS33E7AXEUKFF2/bundle.json","state_url":"https://pith.science/pith/UEI632AW6RZ6NS33E7AXEUKFF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UEI632AW6RZ6NS33E7AXEUKFF2/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-07-07T10:29:38Z","links":{"resolver":"https://pith.science/pith/UEI632AW6RZ6NS33E7AXEUKFF2","bundle":"https://pith.science/pith/UEI632AW6RZ6NS33E7AXEUKFF2/bundle.json","state":"https://pith.science/pith/UEI632AW6RZ6NS33E7AXEUKFF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UEI632AW6RZ6NS33E7AXEUKFF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UEI632AW6RZ6NS33E7AXEUKFF2","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":"5f61ef05ec728c75cdeaada3159a6937cffd9df9746fe9764911dde7a0611292","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-07T15:04:02Z","title_canon_sha256":"e5021681a054824c0f61235b5dce1c1458f95dcb7e4cf6f73e4a3a0a3e07d2aa"},"schema_version":"1.0","source":{"id":"2104.03172","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.03172","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"2104.03172v2","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.03172","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"UEI632AW6RZ6","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"pith_short_16","alias_value":"UEI632AW6RZ6NS33","created_at":"2026-07-05T03:46:44Z"},{"alias_kind":"pith_short_8","alias_value":"UEI632AW","created_at":"2026-07-05T03:46:44Z"}],"graph_snapshots":[{"event_id":"sha256:eec7688fbf348e6a13c9eabd889ffed94ce7203a4e26a1ff673371af9d2d7534","target":"graph","created_at":"2026-07-05T03:46:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2104.03172/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a graph $G$, a vertex dominates itself and its neighbours. A set $D\\subseteq V(G)$ is said to be a $k$-tuple dominating set of $G$ if $D$ dominates every vertex of $G$ at least $k$ times. The minimum cardinality among all $k$-tuple dominating sets is the $k$-tuple domination number of $G$. In this paper, we provide new bounds on this parameter. Some of these bounds generalize other ones that have been given for the case $k=2$. In addition, we improve two well-known lower bounds on the $k$-tuple domination number.","authors_text":"Abel Cabrera Martinez","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-07T15:04:02Z","title":"A note on the k-tuple domination number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.03172","kind":"arxiv","version":2},"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:a0ec55e5781618c61ebccdbe5e192853f7308d67e33a59a3bf66c4149788433a","target":"record","created_at":"2026-07-05T03:46:44Z","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":"5f61ef05ec728c75cdeaada3159a6937cffd9df9746fe9764911dde7a0611292","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-07T15:04:02Z","title_canon_sha256":"e5021681a054824c0f61235b5dce1c1458f95dcb7e4cf6f73e4a3a0a3e07d2aa"},"schema_version":"1.0","source":{"id":"2104.03172","kind":"arxiv","version":2}},"canonical_sha256":"a111ede816f473e6cb7b27c17251452e8189bd79374847e84f0c6349fb0c289e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a111ede816f473e6cb7b27c17251452e8189bd79374847e84f0c6349fb0c289e","first_computed_at":"2026-07-05T03:46:44.267606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:46:44.267606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ej2E+jAlF05eRHkqQSI7HW8DuOFM1eV51Dt4xmSmbbVOwXg2PdsG+24mIrcjxEXsCdWW6oBYeY0+KP0bYjkjDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:46:44.268023Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.03172","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0ec55e5781618c61ebccdbe5e192853f7308d67e33a59a3bf66c4149788433a","sha256:eec7688fbf348e6a13c9eabd889ffed94ce7203a4e26a1ff673371af9d2d7534"],"state_sha256":"73658b4940baa00d3060a8ee768569cf9732757621f3cca74dba43591e14a36f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4H0shEJbSQmJ0oKYSSQVQ6SE4qGij3LWVYybE7zwTWpuJ53FzPZyEy8+lb1eSCjXH5OSnKlVvW1Z66IWS1MCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:29:38.065888Z","bundle_sha256":"d98399762add9c6a1fc885108504e643b340eeb094177e5720b8052c2ec55d9a"}}