{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KRWJ5F7IILFHRGBU3LZLGSWBFY","short_pith_number":"pith:KRWJ5F7I","schema_version":"1.0","canonical_sha256":"546c9e97e842ca789834daf2b34ac12e3deb17c7d714b63dccf8a1bb60db4b17","source":{"kind":"arxiv","id":"1905.06724","version":1},"attestation_state":"computed","paper":{"title":"On The Double Roman bondage numbers of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F. Rahimi Mahid, H.R. Maimani, M. Momeni, N. Jafari Rad","submitted_at":"2019-05-16T13:17:12Z","abstract_excerpt":"For a graph $G=(V,E)$, a double roman dominating function (DRDF) is a function $f : V \\longrightarrow \\{0, 1, 2,3\\}$ having the property that if $f(v)=0$ for some vertex $v$, then $v$ has at least two neighbors assigned $2$ under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$ then $v$ has at least one neighbor $w$ with $f(w) \\geq 2$. The weight of a DRDF $f$ is the sum $f (V) =\\sum_{u\\in V} f (u)$. The minimum weight of a DRDF on a graph $G$ is the double Roman domination number of $G$ and is denoted by $\\gamma_{dR}(G)$. The double roman bondage number of $G$, denoted by $b_{dR}(G)$, i"},"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":"1905.06724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-16T13:17:12Z","cross_cats_sorted":[],"title_canon_sha256":"e2e9d6b14d1b675a8f80fe2b5f5f2fb6342c1d7ccf881aafd6c0911dc9544c1a","abstract_canon_sha256":"db8243bdd677dfa1e16928f5dbdb5918036899b6b3ed4cc393a6f65d754bc896"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:01.238561Z","signature_b64":"Y7ufJAQcFjAZi+66CR4tuRAYO+nJoaSqKdq9Hi4auneMhpva1Nt5UctZXpjrxtOTF0xc26tYKw9ajnUySc0QBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"546c9e97e842ca789834daf2b34ac12e3deb17c7d714b63dccf8a1bb60db4b17","last_reissued_at":"2026-05-17T23:46:01.237855Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:01.237855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The Double Roman bondage numbers of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F. Rahimi Mahid, H.R. Maimani, M. Momeni, N. Jafari Rad","submitted_at":"2019-05-16T13:17:12Z","abstract_excerpt":"For a graph $G=(V,E)$, a double roman dominating function (DRDF) is a function $f : V \\longrightarrow \\{0, 1, 2,3\\}$ having the property that if $f(v)=0$ for some vertex $v$, then $v$ has at least two neighbors assigned $2$ under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$ then $v$ has at least one neighbor $w$ with $f(w) \\geq 2$. The weight of a DRDF $f$ is the sum $f (V) =\\sum_{u\\in V} f (u)$. The minimum weight of a DRDF on a graph $G$ is the double Roman domination number of $G$ and is denoted by $\\gamma_{dR}(G)$. The double roman bondage number of $G$, denoted by $b_{dR}(G)$, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06724","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.06724","created_at":"2026-05-17T23:46:01.237989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.06724v1","created_at":"2026-05-17T23:46:01.237989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06724","created_at":"2026-05-17T23:46:01.237989+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRWJ5F7IILFH","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRWJ5F7IILFHRGBU","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRWJ5F7I","created_at":"2026-05-18T12:33:21.387695+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/KRWJ5F7IILFHRGBU3LZLGSWBFY","json":"https://pith.science/pith/KRWJ5F7IILFHRGBU3LZLGSWBFY.json","graph_json":"https://pith.science/api/pith-number/KRWJ5F7IILFHRGBU3LZLGSWBFY/graph.json","events_json":"https://pith.science/api/pith-number/KRWJ5F7IILFHRGBU3LZLGSWBFY/events.json","paper":"https://pith.science/paper/KRWJ5F7I"},"agent_actions":{"view_html":"https://pith.science/pith/KRWJ5F7IILFHRGBU3LZLGSWBFY","download_json":"https://pith.science/pith/KRWJ5F7IILFHRGBU3LZLGSWBFY.json","view_paper":"https://pith.science/paper/KRWJ5F7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.06724&json=true","fetch_graph":"https://pith.science/api/pith-number/KRWJ5F7IILFHRGBU3LZLGSWBFY/graph.json","fetch_events":"https://pith.science/api/pith-number/KRWJ5F7IILFHRGBU3LZLGSWBFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRWJ5F7IILFHRGBU3LZLGSWBFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRWJ5F7IILFHRGBU3LZLGSWBFY/action/storage_attestation","attest_author":"https://pith.science/pith/KRWJ5F7IILFHRGBU3LZLGSWBFY/action/author_attestation","sign_citation":"https://pith.science/pith/KRWJ5F7IILFHRGBU3LZLGSWBFY/action/citation_signature","submit_replication":"https://pith.science/pith/KRWJ5F7IILFHRGBU3LZLGSWBFY/action/replication_record"}},"created_at":"2026-05-17T23:46:01.237989+00:00","updated_at":"2026-05-17T23:46:01.237989+00:00"}