{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:W3EIAVLLETQNZFZ4C5KOT6Z3DL","short_pith_number":"pith:W3EIAVLL","canonical_record":{"source":{"id":"2105.10006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-05-20T19:45:00Z","cross_cats_sorted":[],"title_canon_sha256":"baf221ede057a3bc8446c7195231c1a9eacd76cb2bc5650ccebae662df853ba8","abstract_canon_sha256":"b816a72dee1c3aa458de92ffdae3713605a626213fe5c6c473c11dc649d063d5"},"schema_version":"1.0"},"canonical_sha256":"b6c880556b24e0dc973c1754e9fb3b1aee9c52a434ee7b567144289857172d9d","source":{"kind":"arxiv","id":"2105.10006","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.10006","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"arxiv_version","alias_value":"2105.10006v1","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.10006","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"pith_short_12","alias_value":"W3EIAVLLETQN","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"pith_short_16","alias_value":"W3EIAVLLETQNZFZ4","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"pith_short_8","alias_value":"W3EIAVLL","created_at":"2026-07-05T02:42:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:W3EIAVLLETQNZFZ4C5KOT6Z3DL","target":"record","payload":{"canonical_record":{"source":{"id":"2105.10006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-05-20T19:45:00Z","cross_cats_sorted":[],"title_canon_sha256":"baf221ede057a3bc8446c7195231c1a9eacd76cb2bc5650ccebae662df853ba8","abstract_canon_sha256":"b816a72dee1c3aa458de92ffdae3713605a626213fe5c6c473c11dc649d063d5"},"schema_version":"1.0"},"canonical_sha256":"b6c880556b24e0dc973c1754e9fb3b1aee9c52a434ee7b567144289857172d9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:06.319913Z","signature_b64":"OwY+cixsm9fUmYzi89R879AfTtOQ8YYJVLlJ76scsOJB/WVvGewHxM1q27QT+LkSwvGJKTc5AATCfAo7ORnaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6c880556b24e0dc973c1754e9fb3b1aee9c52a434ee7b567144289857172d9d","last_reissued_at":"2026-07-05T02:42:06.319549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:06.319549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.10006","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-07-05T02:42:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHUEXkU/G3oP9ngaXn9Mwra+KWDTZR+wjl8NsxjJpTVEi+TKdcMxoNpzNMk5DlFHBKxyisEXt+gfYkOAYjecBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T21:57:35.048338Z"},"content_sha256":"33dc6db6c8244500f5afa903c76a0d33500668d9e5b81fb0148f5ddef1888aea","schema_version":"1.0","event_id":"sha256:33dc6db6c8244500f5afa903c76a0d33500668d9e5b81fb0148f5ddef1888aea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:W3EIAVLLETQNZFZ4C5KOT6Z3DL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Roman domination in direct product graphs and rooted product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abel Cabrera Martinez, Ismael G. Yero, Iztok Peterin","submitted_at":"2021-05-20T19:45:00Z","abstract_excerpt":"Let $G$ be a graph with vertex set $V(G)$. A function $f:V(G)\\rightarrow \\{0,1,2\\}$ is a Roman dominating function on $G$ if every vertex $v\\in V(G)$ for which $f(v)=0$ is adjacent to at least one vertex $u\\in V(G)$ such that $f(u)=2$. The Roman domination number of $G$ is the minimum weight $\\omega(f)=\\sum_{x\\in V(G)}f(x)$ among all Roman dominating functions $f$ on $G$. In this article we study the Roman domination number of direct product graphs and rooted product graphs. Specifically, we give several tight lower and upper bounds for the Roman domination number of direct product graphs invo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.10006","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.10006/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-05T02:42:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWc2748utHKBqyG7mjYVvZkOYbL7c5c3Abt7+YD2McR+GnYUKr1tfDK1BuILZF8GBNYjJj70dnmmUxH7jSeZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T21:57:35.049292Z"},"content_sha256":"409e18c325d7f7c85c789ad9b03003fa797b79ab2ae9c4ee50d307eddf0f1468","schema_version":"1.0","event_id":"sha256:409e18c325d7f7c85c789ad9b03003fa797b79ab2ae9c4ee50d307eddf0f1468"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3EIAVLLETQNZFZ4C5KOT6Z3DL/bundle.json","state_url":"https://pith.science/pith/W3EIAVLLETQNZFZ4C5KOT6Z3DL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3EIAVLLETQNZFZ4C5KOT6Z3DL/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-14T21:57:35Z","links":{"resolver":"https://pith.science/pith/W3EIAVLLETQNZFZ4C5KOT6Z3DL","bundle":"https://pith.science/pith/W3EIAVLLETQNZFZ4C5KOT6Z3DL/bundle.json","state":"https://pith.science/pith/W3EIAVLLETQNZFZ4C5KOT6Z3DL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3EIAVLLETQNZFZ4C5KOT6Z3DL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:W3EIAVLLETQNZFZ4C5KOT6Z3DL","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":"b816a72dee1c3aa458de92ffdae3713605a626213fe5c6c473c11dc649d063d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-05-20T19:45:00Z","title_canon_sha256":"baf221ede057a3bc8446c7195231c1a9eacd76cb2bc5650ccebae662df853ba8"},"schema_version":"1.0","source":{"id":"2105.10006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.10006","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"arxiv_version","alias_value":"2105.10006v1","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.10006","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"pith_short_12","alias_value":"W3EIAVLLETQN","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"pith_short_16","alias_value":"W3EIAVLLETQNZFZ4","created_at":"2026-07-05T02:42:06Z"},{"alias_kind":"pith_short_8","alias_value":"W3EIAVLL","created_at":"2026-07-05T02:42:06Z"}],"graph_snapshots":[{"event_id":"sha256:409e18c325d7f7c85c789ad9b03003fa797b79ab2ae9c4ee50d307eddf0f1468","target":"graph","created_at":"2026-07-05T02:42:06Z","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/2105.10006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a graph with vertex set $V(G)$. A function $f:V(G)\\rightarrow \\{0,1,2\\}$ is a Roman dominating function on $G$ if every vertex $v\\in V(G)$ for which $f(v)=0$ is adjacent to at least one vertex $u\\in V(G)$ such that $f(u)=2$. The Roman domination number of $G$ is the minimum weight $\\omega(f)=\\sum_{x\\in V(G)}f(x)$ among all Roman dominating functions $f$ on $G$. In this article we study the Roman domination number of direct product graphs and rooted product graphs. Specifically, we give several tight lower and upper bounds for the Roman domination number of direct product graphs invo","authors_text":"Abel Cabrera Martinez, Ismael G. Yero, Iztok Peterin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-05-20T19:45:00Z","title":"Roman domination in direct product graphs and rooted product graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.10006","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:33dc6db6c8244500f5afa903c76a0d33500668d9e5b81fb0148f5ddef1888aea","target":"record","created_at":"2026-07-05T02:42:06Z","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":"b816a72dee1c3aa458de92ffdae3713605a626213fe5c6c473c11dc649d063d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-05-20T19:45:00Z","title_canon_sha256":"baf221ede057a3bc8446c7195231c1a9eacd76cb2bc5650ccebae662df853ba8"},"schema_version":"1.0","source":{"id":"2105.10006","kind":"arxiv","version":1}},"canonical_sha256":"b6c880556b24e0dc973c1754e9fb3b1aee9c52a434ee7b567144289857172d9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6c880556b24e0dc973c1754e9fb3b1aee9c52a434ee7b567144289857172d9d","first_computed_at":"2026-07-05T02:42:06.319549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:42:06.319549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OwY+cixsm9fUmYzi89R879AfTtOQ8YYJVLlJ76scsOJB/WVvGewHxM1q27QT+LkSwvGJKTc5AATCfAo7ORnaBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:42:06.319913Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.10006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33dc6db6c8244500f5afa903c76a0d33500668d9e5b81fb0148f5ddef1888aea","sha256:409e18c325d7f7c85c789ad9b03003fa797b79ab2ae9c4ee50d307eddf0f1468"],"state_sha256":"81a74f45e31b53ae09041a5db4a6c8478d7cd12acde9855de24b9804fda70440"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gr2dqfE6Ng6U8+KTqRcylEb9d8bP4J2HGiRQSjI64xxqCrno4bCIT3BCv+NKAZZt5s4OwOgzfVJuAGj9qbDbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T21:57:35.066322Z","bundle_sha256":"8e54ac5ad550e7e3e15da2f2049328e696cb29e58883759c5bb373862964d877"}}