{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZNRVR72LUM2G67HVXOODDOKYEX","short_pith_number":"pith:ZNRVR72L","schema_version":"1.0","canonical_sha256":"cb6358ff4ba3346f7cf5bb9c31b95825e6a6a55f62d66ff9ae106610a9d8aa5e","source":{"kind":"arxiv","id":"1204.1438","version":1},"attestation_state":"computed","paper":{"title":"On the Roman bondage number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Bahremandpour, Fu-Tao Hu, Jun-Ming Xu, S. M. Sheikholeslami","submitted_at":"2012-04-06T09:02:19Z","abstract_excerpt":"A Roman dominating function on a graph $G=(V,E)$ is a function $f:V\\rightarrow\\{0,1,2\\}$ such that every vertex $v\\in V$ with $f(v)=0$ has at least one neighbor $u\\in V$ with $f(u)=2$. The weight of a Roman dominating function is the value $f(V(G))=\\sum_{u\\in V(G)}f(u)$. The minimum weight of a Roman dominating function on a graph $G$ is called the Roman domination number, denoted by $\\gamma_{R}(G)$. The Roman bondage number $b_{R}(G)$ of a graph $G$ with maximum degree at least two is the minimum cardinality of all sets $E'\\subseteq E(G)$ for which $\\gamma_{R}(G-E')>\\gamma_R(G)$. In this pape"},"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":"1204.1438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-06T09:02:19Z","cross_cats_sorted":[],"title_canon_sha256":"4a98e0316cba8599615f82e95638899b91da71940ca25674ecc31bfbc07f069a","abstract_canon_sha256":"69c3b818a3b33e7a1e38b0adb86368ca27e03806ee338939b906b2cf75336c3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:25.589240Z","signature_b64":"OBnMjz2pJlqH9+Ewu3PdisKLpmXIzB47z3zn+XUrdCpsdoO8P9IqnZr3sNk6e2sZvDbLjMO1zST6NksuozitAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb6358ff4ba3346f7cf5bb9c31b95825e6a6a55f62d66ff9ae106610a9d8aa5e","last_reissued_at":"2026-05-18T03:58:25.588495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:25.588495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Roman bondage number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Bahremandpour, Fu-Tao Hu, Jun-Ming Xu, S. M. Sheikholeslami","submitted_at":"2012-04-06T09:02:19Z","abstract_excerpt":"A Roman dominating function on a graph $G=(V,E)$ is a function $f:V\\rightarrow\\{0,1,2\\}$ such that every vertex $v\\in V$ with $f(v)=0$ has at least one neighbor $u\\in V$ with $f(u)=2$. The weight of a Roman dominating function is the value $f(V(G))=\\sum_{u\\in V(G)}f(u)$. The minimum weight of a Roman dominating function on a graph $G$ is called the Roman domination number, denoted by $\\gamma_{R}(G)$. The Roman bondage number $b_{R}(G)$ of a graph $G$ with maximum degree at least two is the minimum cardinality of all sets $E'\\subseteq E(G)$ for which $\\gamma_{R}(G-E')>\\gamma_R(G)$. In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1438","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":"1204.1438","created_at":"2026-05-18T03:58:25.588614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1438v1","created_at":"2026-05-18T03:58:25.588614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1438","created_at":"2026-05-18T03:58:25.588614+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNRVR72LUM2G","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNRVR72LUM2G67HV","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNRVR72L","created_at":"2026-05-18T12:27:30.460161+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/ZNRVR72LUM2G67HVXOODDOKYEX","json":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX.json","graph_json":"https://pith.science/api/pith-number/ZNRVR72LUM2G67HVXOODDOKYEX/graph.json","events_json":"https://pith.science/api/pith-number/ZNRVR72LUM2G67HVXOODDOKYEX/events.json","paper":"https://pith.science/paper/ZNRVR72L"},"agent_actions":{"view_html":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX","download_json":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX.json","view_paper":"https://pith.science/paper/ZNRVR72L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1438&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNRVR72LUM2G67HVXOODDOKYEX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNRVR72LUM2G67HVXOODDOKYEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX/action/storage_attestation","attest_author":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX/action/author_attestation","sign_citation":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX/action/citation_signature","submit_replication":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX/action/replication_record"}},"created_at":"2026-05-18T03:58:25.588614+00:00","updated_at":"2026-05-18T03:58:25.588614+00:00"}