{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DURFL77Z25MZ4IVOXC32SJZJOI","short_pith_number":"pith:DURFL77Z","canonical_record":{"source":{"id":"1105.3290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-17T07:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"42134262aadbfbefdfd6074a5133c9bd55b460f0bb5d6ecf005cab9a38e752d6","abstract_canon_sha256":"4d2051b58a6062ddba4677fc6d8f22a678e69f33d7c0130212934d65e264ba3f"},"schema_version":"1.0"},"canonical_sha256":"1d2255fff9d7599e22aeb8b7a92729722d9e048cc54f58644e8e72344c61d504","source":{"kind":"arxiv","id":"1105.3290","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3290","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3290v1","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3290","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"DURFL77Z25MZ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DURFL77Z25MZ4IVO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DURFL77Z","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DURFL77Z25MZ4IVOXC32SJZJOI","target":"record","payload":{"canonical_record":{"source":{"id":"1105.3290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-17T07:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"42134262aadbfbefdfd6074a5133c9bd55b460f0bb5d6ecf005cab9a38e752d6","abstract_canon_sha256":"4d2051b58a6062ddba4677fc6d8f22a678e69f33d7c0130212934d65e264ba3f"},"schema_version":"1.0"},"canonical_sha256":"1d2255fff9d7599e22aeb8b7a92729722d9e048cc54f58644e8e72344c61d504","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:43.678065Z","signature_b64":"vCpWz3ZthQlwZS7e/xWKqYzSORC4ORiCuxpazzITRkWJTR+BLtIjol2iU8sC206/1ZfcW7ZDv6VnnSNKVVrfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d2255fff9d7599e22aeb8b7a92729722d9e048cc54f58644e8e72344c61d504","last_reissued_at":"2026-05-17T23:43:43.677418Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:43.677418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.3290","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-17T23:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GoP2/7zd0G6YU6zsXX4Jwu/5tbfX1Ia5u2YDsU91hrVlCgC7LEEZyeNcrpjnWEUVhrBBgTulNFDXkuUmFrwZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:47:29.147985Z"},"content_sha256":"95702130789f7078d4ff75d9fa0cad7c101388a6ca730c0d5fc7651717440576","schema_version":"1.0","event_id":"sha256:95702130789f7078d4ff75d9fa0cad7c101388a6ca730c0d5fc7651717440576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DURFL77Z25MZ4IVOXC32SJZJOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Roman domination and Mycieleki's structure in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi","submitted_at":"2011-05-17T07:11:38Z","abstract_excerpt":"For a graph $G=(V,E)$, a function $f:V\\rightarrow \\{0,1,2\\}$ is called Roman dominating function (RDF) if for any vertex $v$ with $f(v)=0$, there is at least one vertex $w$ in its neighborhood with $f(w)=2$. The weight of an RDF $f$ of $G$ is the value $f(V)=\\sum_{v\\in V}f(v)$. The minimum weight of an RDF of $G$ is its Roman domination number and denoted by $\\gamma_ R(G)$. In this paper, we first show that $\\gamma_{R}(G)+1\\leq \\gamma_{R}(\\mu (G))\\leq \\gamma_{R}(G)+2$, where $\\mu (G)$ is the Mycielekian graph of $G$, and then characterize the graphs achieving equality in these bounds. Then for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3290","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-17T23:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PN91H2ZHnx9ZvCtcL0AOiU1iBsKalCxwjJklmH10CxFpH+1hww1/knhoQSQ/iHm++NGTaMxX4QzqS+VAw9tZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:47:29.148336Z"},"content_sha256":"7f4d71beb601a3b5b10c8ba26ff5ad20a68551169e9ae3c17188fc74000bf263","schema_version":"1.0","event_id":"sha256:7f4d71beb601a3b5b10c8ba26ff5ad20a68551169e9ae3c17188fc74000bf263"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DURFL77Z25MZ4IVOXC32SJZJOI/bundle.json","state_url":"https://pith.science/pith/DURFL77Z25MZ4IVOXC32SJZJOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DURFL77Z25MZ4IVOXC32SJZJOI/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-22T12:47:29Z","links":{"resolver":"https://pith.science/pith/DURFL77Z25MZ4IVOXC32SJZJOI","bundle":"https://pith.science/pith/DURFL77Z25MZ4IVOXC32SJZJOI/bundle.json","state":"https://pith.science/pith/DURFL77Z25MZ4IVOXC32SJZJOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DURFL77Z25MZ4IVOXC32SJZJOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DURFL77Z25MZ4IVOXC32SJZJOI","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":"4d2051b58a6062ddba4677fc6d8f22a678e69f33d7c0130212934d65e264ba3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-17T07:11:38Z","title_canon_sha256":"42134262aadbfbefdfd6074a5133c9bd55b460f0bb5d6ecf005cab9a38e752d6"},"schema_version":"1.0","source":{"id":"1105.3290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3290","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3290v1","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3290","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"DURFL77Z25MZ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DURFL77Z25MZ4IVO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DURFL77Z","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:7f4d71beb601a3b5b10c8ba26ff5ad20a68551169e9ae3c17188fc74000bf263","target":"graph","created_at":"2026-05-17T23:43:43Z","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 a graph $G=(V,E)$, a function $f:V\\rightarrow \\{0,1,2\\}$ is called Roman dominating function (RDF) if for any vertex $v$ with $f(v)=0$, there is at least one vertex $w$ in its neighborhood with $f(w)=2$. The weight of an RDF $f$ of $G$ is the value $f(V)=\\sum_{v\\in V}f(v)$. The minimum weight of an RDF of $G$ is its Roman domination number and denoted by $\\gamma_ R(G)$. In this paper, we first show that $\\gamma_{R}(G)+1\\leq \\gamma_{R}(\\mu (G))\\leq \\gamma_{R}(G)+2$, where $\\mu (G)$ is the Mycielekian graph of $G$, and then characterize the graphs achieving equality in these bounds. Then for","authors_text":"Adel P. Kazemi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-17T07:11:38Z","title":"Roman domination and Mycieleki's structure in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3290","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:95702130789f7078d4ff75d9fa0cad7c101388a6ca730c0d5fc7651717440576","target":"record","created_at":"2026-05-17T23:43:43Z","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":"4d2051b58a6062ddba4677fc6d8f22a678e69f33d7c0130212934d65e264ba3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-17T07:11:38Z","title_canon_sha256":"42134262aadbfbefdfd6074a5133c9bd55b460f0bb5d6ecf005cab9a38e752d6"},"schema_version":"1.0","source":{"id":"1105.3290","kind":"arxiv","version":1}},"canonical_sha256":"1d2255fff9d7599e22aeb8b7a92729722d9e048cc54f58644e8e72344c61d504","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d2255fff9d7599e22aeb8b7a92729722d9e048cc54f58644e8e72344c61d504","first_computed_at":"2026-05-17T23:43:43.677418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:43.677418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCpWz3ZthQlwZS7e/xWKqYzSORC4ORiCuxpazzITRkWJTR+BLtIjol2iU8sC206/1ZfcW7ZDv6VnnSNKVVrfAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:43.678065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.3290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95702130789f7078d4ff75d9fa0cad7c101388a6ca730c0d5fc7651717440576","sha256:7f4d71beb601a3b5b10c8ba26ff5ad20a68551169e9ae3c17188fc74000bf263"],"state_sha256":"807d18ee91268658dd7177bd761b1d39c6a7b78d5e2129fc6302f73fbf76f858"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t01usWSP2h/rdUgQnkFnfR0WiVtbR+o054Xh0fZOUJrS1dgfbRscAMWu+GV/sX1+AhWYBpzu1iwy6LlZA92NDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:47:29.150080Z","bundle_sha256":"11eff792b7d2940c6f8b2905acd45b12d9e9fc2699c6200801b1568dbb520dc1"}}