{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MW5TIZY6N2OBYCGO3ODGKITGBS","short_pith_number":"pith:MW5TIZY6","schema_version":"1.0","canonical_sha256":"65bb34671e6e9c1c08cedb866522660ca10422b33a983cba1537d49591cd859f","source":{"kind":"arxiv","id":"1502.03933","version":2},"attestation_state":"computed","paper":{"title":"On the Strong Roman Domination Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I. Gonzalez Yero, J. C. Valenzuela, M. P. Alvarez-Ruiz, S. M. Sheikholeslami, T. Mediavilla-Gradolph","submitted_at":"2015-02-13T10:14:29Z","abstract_excerpt":"Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a \"stronger\" neighbor place (having two legions), a graph theoretical model called Roman domination in graphs was described. A Roman dominating function for a graph $G=(V,E)$, is a function $f:V\\rightarrow \\{0,1,2\\}$ such that every vertex $v$ with $f(v)=0$ has at least a neighbor $w$ in $G$ for which $f(w)=2$. The Roman domination number of a graph is the minimum weight, $\\sum_{v\\in V}f(v)$, of a Roman dominating function.\n  In this paper we initiate t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1502.03933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-13T10:14:29Z","cross_cats_sorted":[],"title_canon_sha256":"6dc3fcbb6ef21b402e12bbfe32777ce339b25632550a706fc43ded780358d9b8","abstract_canon_sha256":"cadec2284f5316b9aa8f961904b67340646cb2ba3d444b49d503102770d4eb46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:01.544485Z","signature_b64":"YFT9yjM7VzbvESE8kqRslhEB4kc4JP+1ylzaCEYm0X4WL0hbESZVN3UkGe+ft4mjm+VFsUNPsJ38z+hGI4U8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65bb34671e6e9c1c08cedb866522660ca10422b33a983cba1537d49591cd859f","last_reissued_at":"2026-05-18T01:36:01.543806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:01.543806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Strong Roman Domination Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I. Gonzalez Yero, J. C. Valenzuela, M. P. Alvarez-Ruiz, S. M. Sheikholeslami, T. Mediavilla-Gradolph","submitted_at":"2015-02-13T10:14:29Z","abstract_excerpt":"Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a \"stronger\" neighbor place (having two legions), a graph theoretical model called Roman domination in graphs was described. A Roman dominating function for a graph $G=(V,E)$, is a function $f:V\\rightarrow \\{0,1,2\\}$ such that every vertex $v$ with $f(v)=0$ has at least a neighbor $w$ in $G$ for which $f(w)=2$. The Roman domination number of a graph is the minimum weight, $\\sum_{v\\in V}f(v)$, of a Roman dominating function.\n  In this paper we initiate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03933","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.03933","created_at":"2026-05-18T01:36:01.543925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03933v2","created_at":"2026-05-18T01:36:01.543925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03933","created_at":"2026-05-18T01:36:01.543925+00:00"},{"alias_kind":"pith_short_12","alias_value":"MW5TIZY6N2OB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MW5TIZY6N2OBYCGO","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MW5TIZY6","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MW5TIZY6N2OBYCGO3ODGKITGBS","json":"https://pith.science/pith/MW5TIZY6N2OBYCGO3ODGKITGBS.json","graph_json":"https://pith.science/api/pith-number/MW5TIZY6N2OBYCGO3ODGKITGBS/graph.json","events_json":"https://pith.science/api/pith-number/MW5TIZY6N2OBYCGO3ODGKITGBS/events.json","paper":"https://pith.science/paper/MW5TIZY6"},"agent_actions":{"view_html":"https://pith.science/pith/MW5TIZY6N2OBYCGO3ODGKITGBS","download_json":"https://pith.science/pith/MW5TIZY6N2OBYCGO3ODGKITGBS.json","view_paper":"https://pith.science/paper/MW5TIZY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03933&json=true","fetch_graph":"https://pith.science/api/pith-number/MW5TIZY6N2OBYCGO3ODGKITGBS/graph.json","fetch_events":"https://pith.science/api/pith-number/MW5TIZY6N2OBYCGO3ODGKITGBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MW5TIZY6N2OBYCGO3ODGKITGBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MW5TIZY6N2OBYCGO3ODGKITGBS/action/storage_attestation","attest_author":"https://pith.science/pith/MW5TIZY6N2OBYCGO3ODGKITGBS/action/author_attestation","sign_citation":"https://pith.science/pith/MW5TIZY6N2OBYCGO3ODGKITGBS/action/citation_signature","submit_replication":"https://pith.science/pith/MW5TIZY6N2OBYCGO3ODGKITGBS/action/replication_record"}},"created_at":"2026-05-18T01:36:01.543925+00:00","updated_at":"2026-05-18T01:36:01.543925+00:00"}