{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SQVY2CJO5ND7TFENSFCMUVG3V5","short_pith_number":"pith:SQVY2CJO","canonical_record":{"source":{"id":"1511.07249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-23T14:52:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e053694bb3d4c2855c39ee12a3ef23cf35c8ba638c665b21de0b4086d777ccf9","abstract_canon_sha256":"1596680cbf237af043d7c1f692e6bc5d783741a07cd7185ca85e19275fe96efb"},"schema_version":"1.0"},"canonical_sha256":"942b8d092eeb47f9948d9144ca54dbaf5cc3df8851283357ab73d3c5f7165f68","source":{"kind":"arxiv","id":"1511.07249","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07249","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07249v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07249","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"SQVY2CJO5ND7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SQVY2CJO5ND7TFEN","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SQVY2CJO","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SQVY2CJO5ND7TFENSFCMUVG3V5","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-23T14:52:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e053694bb3d4c2855c39ee12a3ef23cf35c8ba638c665b21de0b4086d777ccf9","abstract_canon_sha256":"1596680cbf237af043d7c1f692e6bc5d783741a07cd7185ca85e19275fe96efb"},"schema_version":"1.0"},"canonical_sha256":"942b8d092eeb47f9948d9144ca54dbaf5cc3df8851283357ab73d3c5f7165f68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.855442Z","signature_b64":"pCXPLtqtmuaqxruxi+uvpLNdqSK/ynu3ayNIO++hkmPhFDyrGnBr/Sw+dIhi9Q3GZNkkKyAXzvKvu4nwCs+tCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"942b8d092eeb47f9948d9144ca54dbaf5cc3df8851283357ab73d3c5f7165f68","last_reissued_at":"2026-05-18T01:26:11.854790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.854790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07249","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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jl3lTZcMgOMG3HCcWljCelgyuxyuOxOR2V0012Dmz/jL1oommmyrns91OI6Whcqj2FkkIq7t52jpkwM2FNMbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T12:52:26.705514Z"},"content_sha256":"58633cfa19a5df0fe6d23f074bc0b2340c1a03033c42c674faa29c15610cd282","schema_version":"1.0","event_id":"sha256:58633cfa19a5df0fe6d23f074bc0b2340c1a03033c42c674faa29c15610cd282"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SQVY2CJO5ND7TFENSFCMUVG3V5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the total $(k,r)$-domination number of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Louisa Harutyunyan","submitted_at":"2015-11-23T14:52:10Z","abstract_excerpt":"A subset $S$ of a vertex set of a graph $G$ is a total $(k,r)$-dominating set if every vertex $u \\in V(G)$ is within distance $k$ of at least $r$ vertices in $S$. The minimum cardinality among all total $(k,r)$-dominating sets of $G$ is called the total $(k,r)$-domination number of $G$, denoted by $\\gamma^{t}_{(k,r)}(G)$. We previously gave an upper bound on $\\gamma^{t}_{(2,r)}(G(n,p))$ in random graphs with non-fixed $p \\in (0,1)$. In this paper we generalize this result to give an upper bound on $\\gamma^{t}_{(k,r)}(G(n,p))$ in random graphs with non-fixed $p \\in (0,1)$ for $k\\geq 3$ as well "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07249","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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjDQ3FmWR4EkjuWS1qS8qFnAlYCNRwIBqqiUk9P4owzzoLZLys1mnyCJ4wJC9cRqwMG85ccwIARAgX64c8fMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T12:52:26.706056Z"},"content_sha256":"d221d8308a36ff2ae78333f1bf71fa23b359f6e1f82dc34a874570887de87f42","schema_version":"1.0","event_id":"sha256:d221d8308a36ff2ae78333f1bf71fa23b359f6e1f82dc34a874570887de87f42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQVY2CJO5ND7TFENSFCMUVG3V5/bundle.json","state_url":"https://pith.science/pith/SQVY2CJO5ND7TFENSFCMUVG3V5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQVY2CJO5ND7TFENSFCMUVG3V5/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-08-18T12:52:26Z","links":{"resolver":"https://pith.science/pith/SQVY2CJO5ND7TFENSFCMUVG3V5","bundle":"https://pith.science/pith/SQVY2CJO5ND7TFENSFCMUVG3V5/bundle.json","state":"https://pith.science/pith/SQVY2CJO5ND7TFENSFCMUVG3V5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQVY2CJO5ND7TFENSFCMUVG3V5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SQVY2CJO5ND7TFENSFCMUVG3V5","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":"1596680cbf237af043d7c1f692e6bc5d783741a07cd7185ca85e19275fe96efb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-23T14:52:10Z","title_canon_sha256":"e053694bb3d4c2855c39ee12a3ef23cf35c8ba638c665b21de0b4086d777ccf9"},"schema_version":"1.0","source":{"id":"1511.07249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07249","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07249v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07249","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"SQVY2CJO5ND7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SQVY2CJO5ND7TFEN","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SQVY2CJO","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:d221d8308a36ff2ae78333f1bf71fa23b359f6e1f82dc34a874570887de87f42","target":"graph","created_at":"2026-05-18T01:26:11Z","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":"A subset $S$ of a vertex set of a graph $G$ is a total $(k,r)$-dominating set if every vertex $u \\in V(G)$ is within distance $k$ of at least $r$ vertices in $S$. The minimum cardinality among all total $(k,r)$-dominating sets of $G$ is called the total $(k,r)$-domination number of $G$, denoted by $\\gamma^{t}_{(k,r)}(G)$. We previously gave an upper bound on $\\gamma^{t}_{(2,r)}(G(n,p))$ in random graphs with non-fixed $p \\in (0,1)$. In this paper we generalize this result to give an upper bound on $\\gamma^{t}_{(k,r)}(G(n,p))$ in random graphs with non-fixed $p \\in (0,1)$ for $k\\geq 3$ as well ","authors_text":"Louisa Harutyunyan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-23T14:52:10Z","title":"On the total $(k,r)$-domination number of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07249","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:58633cfa19a5df0fe6d23f074bc0b2340c1a03033c42c674faa29c15610cd282","target":"record","created_at":"2026-05-18T01:26:11Z","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":"1596680cbf237af043d7c1f692e6bc5d783741a07cd7185ca85e19275fe96efb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-23T14:52:10Z","title_canon_sha256":"e053694bb3d4c2855c39ee12a3ef23cf35c8ba638c665b21de0b4086d777ccf9"},"schema_version":"1.0","source":{"id":"1511.07249","kind":"arxiv","version":1}},"canonical_sha256":"942b8d092eeb47f9948d9144ca54dbaf5cc3df8851283357ab73d3c5f7165f68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"942b8d092eeb47f9948d9144ca54dbaf5cc3df8851283357ab73d3c5f7165f68","first_computed_at":"2026-05-18T01:26:11.854790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:11.854790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pCXPLtqtmuaqxruxi+uvpLNdqSK/ynu3ayNIO++hkmPhFDyrGnBr/Sw+dIhi9Q3GZNkkKyAXzvKvu4nwCs+tCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:11.855442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58633cfa19a5df0fe6d23f074bc0b2340c1a03033c42c674faa29c15610cd282","sha256:d221d8308a36ff2ae78333f1bf71fa23b359f6e1f82dc34a874570887de87f42"],"state_sha256":"0082c951747f7988c34d1f8d5b122801840bc45fa388cb844d059180bfcf3d25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Locv2Y71hmp9rUApig1f1DHmkhvkMxeh+Mwyqaq5dhGcGnS0/cDfmSHZFU7Y0D2g4r/X04aPqsmzPFeJwAUtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T12:52:26.709650Z","bundle_sha256":"edcd7406ec77c0d58ac54b96dac5c7e870b245d021b4de8ef9bb7f61a1bdd46a"}}