{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RGSIWDCNMZT7WNRPALB64FTLZI","short_pith_number":"pith:RGSIWDCN","canonical_record":{"source":{"id":"1407.3363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-12T08:36:25Z","cross_cats_sorted":[],"title_canon_sha256":"f67e28becf86d488610b7dfa171c03072f465d35c29e31d4308fa3312a2d6e9f","abstract_canon_sha256":"6e3f1cdfb7386a78df5024c3c89ea7b8d645357319ce26b9d5866e30571a898d"},"schema_version":"1.0"},"canonical_sha256":"89a48b0c4d6667fb362f02c3ee166bca0fba4dcd9ee47274a2d7642bff2bf290","source":{"kind":"arxiv","id":"1407.3363","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3363","created_at":"2026-05-17T23:47:16Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3363v3","created_at":"2026-05-17T23:47:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3363","created_at":"2026-05-17T23:47:16Z"},{"alias_kind":"pith_short_12","alias_value":"RGSIWDCNMZT7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RGSIWDCNMZT7WNRP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RGSIWDCN","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RGSIWDCNMZT7WNRPALB64FTLZI","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-12T08:36:25Z","cross_cats_sorted":[],"title_canon_sha256":"f67e28becf86d488610b7dfa171c03072f465d35c29e31d4308fa3312a2d6e9f","abstract_canon_sha256":"6e3f1cdfb7386a78df5024c3c89ea7b8d645357319ce26b9d5866e30571a898d"},"schema_version":"1.0"},"canonical_sha256":"89a48b0c4d6667fb362f02c3ee166bca0fba4dcd9ee47274a2d7642bff2bf290","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:16.373086Z","signature_b64":"W5ZAe3DBNoqpQ4GIBiMkT4uSrLCc8o7EqYoxn3m5X3fMmGLA7OwqNJYE5Boy9Hs1Tvemq6flako+vooqbv57Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89a48b0c4d6667fb362f02c3ee166bca0fba4dcd9ee47274a2d7642bff2bf290","last_reissued_at":"2026-05-17T23:47:16.372531Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:16.372531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3363","source_version":3,"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-17T23:47:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qn3s1RUCEVoN/KsmHfWBtRjqPehM7iuL++6/0aBKI+KYdjSL3im9It4nhae+Nrt4+DEt+9RHKEwf1krxlzD4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:21:59.650333Z"},"content_sha256":"c4a78106b528e006ddf192da1df04f122acdf8e4c3a406df319674c1f36b6869","schema_version":"1.0","event_id":"sha256:c4a78106b528e006ddf192da1df04f122acdf8e4c3a406df319674c1f36b6869"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RGSIWDCNMZT7WNRPALB64FTLZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Roman k-tuple domination number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi","submitted_at":"2014-07-12T08:36:25Z","abstract_excerpt":"For any integer $k\\geq 1$ and any graph $G=(V,E)$ with minimum degree at least $k-1$, we define a function $f:V\\rightarrow \\{0,1,2\\}$ as a Roman $k$-tuple dominating function on $G$ if for any vertex $v$ with $f(v)=0$ there exist at least $k$ and for any vertex $v$ with $f(v)\\neq 0$ at least $k-1$ vertices in its neighborhood with $f(w)=2$. The minimum weight of a Roman $k$-tuple dominating function $f$ on $G$ is called the Roman $k$-tuple domination number of the graph where the weight of $f$ is $f(V)=\\sum_{v\\in V}f(v)$.\n  In this paper, we initiate to study the Roman $k$-tuple domination num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3363","kind":"arxiv","version":3},"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-17T23:47:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLsEiKSkbyy44naA/JsWZXPr4abkebEARdhmkNDDO/y3qCUlBLhc2zYfFWI7lWafLG294PNkHaXVvHBkkjbmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:21:59.650682Z"},"content_sha256":"1ab3b6b7960fb5a8a85f2436509173e453e6180023a81048bcaabf847a0a9a80","schema_version":"1.0","event_id":"sha256:1ab3b6b7960fb5a8a85f2436509173e453e6180023a81048bcaabf847a0a9a80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGSIWDCNMZT7WNRPALB64FTLZI/bundle.json","state_url":"https://pith.science/pith/RGSIWDCNMZT7WNRPALB64FTLZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGSIWDCNMZT7WNRPALB64FTLZI/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-06-22T14:21:59Z","links":{"resolver":"https://pith.science/pith/RGSIWDCNMZT7WNRPALB64FTLZI","bundle":"https://pith.science/pith/RGSIWDCNMZT7WNRPALB64FTLZI/bundle.json","state":"https://pith.science/pith/RGSIWDCNMZT7WNRPALB64FTLZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGSIWDCNMZT7WNRPALB64FTLZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RGSIWDCNMZT7WNRPALB64FTLZI","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":"6e3f1cdfb7386a78df5024c3c89ea7b8d645357319ce26b9d5866e30571a898d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-12T08:36:25Z","title_canon_sha256":"f67e28becf86d488610b7dfa171c03072f465d35c29e31d4308fa3312a2d6e9f"},"schema_version":"1.0","source":{"id":"1407.3363","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3363","created_at":"2026-05-17T23:47:16Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3363v3","created_at":"2026-05-17T23:47:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3363","created_at":"2026-05-17T23:47:16Z"},{"alias_kind":"pith_short_12","alias_value":"RGSIWDCNMZT7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RGSIWDCNMZT7WNRP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RGSIWDCN","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:1ab3b6b7960fb5a8a85f2436509173e453e6180023a81048bcaabf847a0a9a80","target":"graph","created_at":"2026-05-17T23:47:16Z","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":"For any integer $k\\geq 1$ and any graph $G=(V,E)$ with minimum degree at least $k-1$, we define a function $f:V\\rightarrow \\{0,1,2\\}$ as a Roman $k$-tuple dominating function on $G$ if for any vertex $v$ with $f(v)=0$ there exist at least $k$ and for any vertex $v$ with $f(v)\\neq 0$ at least $k-1$ vertices in its neighborhood with $f(w)=2$. The minimum weight of a Roman $k$-tuple dominating function $f$ on $G$ is called the Roman $k$-tuple domination number of the graph where the weight of $f$ is $f(V)=\\sum_{v\\in V}f(v)$.\n  In this paper, we initiate to study the Roman $k$-tuple domination num","authors_text":"Adel P. Kazemi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-12T08:36:25Z","title":"Roman k-tuple domination number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3363","kind":"arxiv","version":3},"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:c4a78106b528e006ddf192da1df04f122acdf8e4c3a406df319674c1f36b6869","target":"record","created_at":"2026-05-17T23:47:16Z","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":"6e3f1cdfb7386a78df5024c3c89ea7b8d645357319ce26b9d5866e30571a898d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-12T08:36:25Z","title_canon_sha256":"f67e28becf86d488610b7dfa171c03072f465d35c29e31d4308fa3312a2d6e9f"},"schema_version":"1.0","source":{"id":"1407.3363","kind":"arxiv","version":3}},"canonical_sha256":"89a48b0c4d6667fb362f02c3ee166bca0fba4dcd9ee47274a2d7642bff2bf290","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89a48b0c4d6667fb362f02c3ee166bca0fba4dcd9ee47274a2d7642bff2bf290","first_computed_at":"2026-05-17T23:47:16.372531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:16.372531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W5ZAe3DBNoqpQ4GIBiMkT4uSrLCc8o7EqYoxn3m5X3fMmGLA7OwqNJYE5Boy9Hs1Tvemq6flako+vooqbv57Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:16.373086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3363","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4a78106b528e006ddf192da1df04f122acdf8e4c3a406df319674c1f36b6869","sha256:1ab3b6b7960fb5a8a85f2436509173e453e6180023a81048bcaabf847a0a9a80"],"state_sha256":"7d6880495f9f5e1334ec40d0f35c85988f71eebec20c5eab3fe54bec4c153c3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VScTTIuoY2cyQHN+eUUAgXBQwgxKLl97oNtFPMElkqjS087Oo/R/aYa7FmncKWj8hCruOPTTeWDfzyu5n5dAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:21:59.652671Z","bundle_sha256":"85ffdbee2f3831bf25d68adb2c737749180ef96d8965e2455295a2cef6b4eb57"}}