{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VH5LMBFLV65JWHQT3G62O2QCB4","short_pith_number":"pith:VH5LMBFL","schema_version":"1.0","canonical_sha256":"a9fab604abafba9b1e13d9bda76a020f14068eb798484d59d43ba495b3762c6e","source":{"kind":"arxiv","id":"1912.01093","version":1},"attestation_state":"computed","paper":{"title":"On the total and strong version for Roman dominating functions in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I.G. Yero, M. Soroudi, S.M. Sheikholeslami, S. Nazari-Moghaddam","submitted_at":"2019-12-02T21:55:35Z","abstract_excerpt":"Consider a finite and simple graph $G=(V,E)$ with maximum degree $\\Delta$. A strong Roman dominating function over the graph $G$ is understood as a map $f : V (G)\\rightarrow \\{0, 1,\\ldots , \\left\\lceil \\frac{\\Delta}{2}\\right\\rceil+ 1\\}$ which carries out the condition stating that all the vertices $v$ labeled $f(v)=0$ are adjacent to at least one another vertex $u$ that satisfies $f(u)\\geq 1+ \\left\\lceil \\frac{1}{2}\\vert N(u)\\cap V_0\\vert \\right\\rceil$, such that $V_0=\\{v \\in V \\mid f(v)=0 \\}$ and the notation $N(u)$ stands for the open neighborhood of $u$. The total version of one strong Roma"},"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":"1912.01093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-02T21:55:35Z","cross_cats_sorted":[],"title_canon_sha256":"4a9d68c75b40f1967175a101ad26856919dedf767e34fb1de314652a70ca20ac","abstract_canon_sha256":"c7ed3ccc4852ea1257f3b8fb42395c64c40f385d8df1e9a868ef25ff3db71572"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:26.836280Z","signature_b64":"8MFMIP7ZMtYOId7Zs/9UDpq/dG63FsJW3lbzvsD8oP50PLvGxdmFMygF2Zv7PVMqp+XZ8FWdFirQ76IIet5mBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9fab604abafba9b1e13d9bda76a020f14068eb798484d59d43ba495b3762c6e","last_reissued_at":"2026-07-05T00:23:26.835859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:26.835859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the total and strong version for Roman dominating functions in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I.G. Yero, M. Soroudi, S.M. Sheikholeslami, S. Nazari-Moghaddam","submitted_at":"2019-12-02T21:55:35Z","abstract_excerpt":"Consider a finite and simple graph $G=(V,E)$ with maximum degree $\\Delta$. A strong Roman dominating function over the graph $G$ is understood as a map $f : V (G)\\rightarrow \\{0, 1,\\ldots , \\left\\lceil \\frac{\\Delta}{2}\\right\\rceil+ 1\\}$ which carries out the condition stating that all the vertices $v$ labeled $f(v)=0$ are adjacent to at least one another vertex $u$ that satisfies $f(u)\\geq 1+ \\left\\lceil \\frac{1}{2}\\vert N(u)\\cap V_0\\vert \\right\\rceil$, such that $V_0=\\{v \\in V \\mid f(v)=0 \\}$ and the notation $N(u)$ stands for the open neighborhood of $u$. The total version of one strong Roma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.01093","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/1912.01093/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1912.01093","created_at":"2026-07-05T00:23:26.835923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.01093v1","created_at":"2026-07-05T00:23:26.835923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.01093","created_at":"2026-07-05T00:23:26.835923+00:00"},{"alias_kind":"pith_short_12","alias_value":"VH5LMBFLV65J","created_at":"2026-07-05T00:23:26.835923+00:00"},{"alias_kind":"pith_short_16","alias_value":"VH5LMBFLV65JWHQT","created_at":"2026-07-05T00:23:26.835923+00:00"},{"alias_kind":"pith_short_8","alias_value":"VH5LMBFL","created_at":"2026-07-05T00:23:26.835923+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/VH5LMBFLV65JWHQT3G62O2QCB4","json":"https://pith.science/pith/VH5LMBFLV65JWHQT3G62O2QCB4.json","graph_json":"https://pith.science/api/pith-number/VH5LMBFLV65JWHQT3G62O2QCB4/graph.json","events_json":"https://pith.science/api/pith-number/VH5LMBFLV65JWHQT3G62O2QCB4/events.json","paper":"https://pith.science/paper/VH5LMBFL"},"agent_actions":{"view_html":"https://pith.science/pith/VH5LMBFLV65JWHQT3G62O2QCB4","download_json":"https://pith.science/pith/VH5LMBFLV65JWHQT3G62O2QCB4.json","view_paper":"https://pith.science/paper/VH5LMBFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.01093&json=true","fetch_graph":"https://pith.science/api/pith-number/VH5LMBFLV65JWHQT3G62O2QCB4/graph.json","fetch_events":"https://pith.science/api/pith-number/VH5LMBFLV65JWHQT3G62O2QCB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VH5LMBFLV65JWHQT3G62O2QCB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VH5LMBFLV65JWHQT3G62O2QCB4/action/storage_attestation","attest_author":"https://pith.science/pith/VH5LMBFLV65JWHQT3G62O2QCB4/action/author_attestation","sign_citation":"https://pith.science/pith/VH5LMBFLV65JWHQT3G62O2QCB4/action/citation_signature","submit_replication":"https://pith.science/pith/VH5LMBFLV65JWHQT3G62O2QCB4/action/replication_record"}},"created_at":"2026-07-05T00:23:26.835923+00:00","updated_at":"2026-07-05T00:23:26.835923+00:00"}