{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZNRVR72LUM2G67HVXOODDOKYEX","short_pith_number":"pith:ZNRVR72L","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"},"canonical_sha256":"cb6358ff4ba3346f7cf5bb9c31b95825e6a6a55f62d66ff9ae106610a9d8aa5e","source":{"kind":"arxiv","id":"1204.1438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1438","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1438v1","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1438","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZNRVR72LUM2G","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZNRVR72LUM2G67HV","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZNRVR72L","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZNRVR72LUM2G67HVXOODDOKYEX","target":"record","payload":{"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"},"canonical_sha256":"cb6358ff4ba3346f7cf5bb9c31b95825e6a6a55f62d66ff9ae106610a9d8aa5e","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"},"source_kind":"arxiv","source_id":"1204.1438","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-18T03:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oE3rN/dKPONu2Ej/1prOOY7o5HmRakixwqhRJDj58uhlAB6kP1/3NKrmO3jo6B8uXF13BdQJWYYmUbVromtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:55:54.213768Z"},"content_sha256":"54cca373d8d04bc61f8915b9ac196465369fd987476c1a2332724e73eebee824","schema_version":"1.0","event_id":"sha256:54cca373d8d04bc61f8915b9ac196465369fd987476c1a2332724e73eebee824"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZNRVR72LUM2G67HVXOODDOKYEX","target":"graph","payload":{"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"},"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-18T03:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbakIf6L3GhFP8k8Zv0bRSn301d/yzyduWWOxMU/T48vKrbFXx7eYSjFMp21f8zt/Eap3DKQnFxwrUXHy1DNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:55:54.214514Z"},"content_sha256":"e23774e806ff79f57259f280ca1ad6b394c2647b3c5ffdfd76da1bcfa9da4ec8","schema_version":"1.0","event_id":"sha256:e23774e806ff79f57259f280ca1ad6b394c2647b3c5ffdfd76da1bcfa9da4ec8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX/bundle.json","state_url":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNRVR72LUM2G67HVXOODDOKYEX/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-09T04:55:54Z","links":{"resolver":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX","bundle":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX/bundle.json","state":"https://pith.science/pith/ZNRVR72LUM2G67HVXOODDOKYEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNRVR72LUM2G67HVXOODDOKYEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZNRVR72LUM2G67HVXOODDOKYEX","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":"69c3b818a3b33e7a1e38b0adb86368ca27e03806ee338939b906b2cf75336c3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-06T09:02:19Z","title_canon_sha256":"4a98e0316cba8599615f82e95638899b91da71940ca25674ecc31bfbc07f069a"},"schema_version":"1.0","source":{"id":"1204.1438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1438","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1438v1","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1438","created_at":"2026-05-18T03:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZNRVR72LUM2G","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZNRVR72LUM2G67HV","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZNRVR72L","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:e23774e806ff79f57259f280ca1ad6b394c2647b3c5ffdfd76da1bcfa9da4ec8","target":"graph","created_at":"2026-05-18T03:58:25Z","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":"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","authors_text":"A. Bahremandpour, Fu-Tao Hu, Jun-Ming Xu, S. M. Sheikholeslami","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-06T09:02:19Z","title":"On the Roman bondage number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1438","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:54cca373d8d04bc61f8915b9ac196465369fd987476c1a2332724e73eebee824","target":"record","created_at":"2026-05-18T03:58:25Z","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":"69c3b818a3b33e7a1e38b0adb86368ca27e03806ee338939b906b2cf75336c3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-06T09:02:19Z","title_canon_sha256":"4a98e0316cba8599615f82e95638899b91da71940ca25674ecc31bfbc07f069a"},"schema_version":"1.0","source":{"id":"1204.1438","kind":"arxiv","version":1}},"canonical_sha256":"cb6358ff4ba3346f7cf5bb9c31b95825e6a6a55f62d66ff9ae106610a9d8aa5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb6358ff4ba3346f7cf5bb9c31b95825e6a6a55f62d66ff9ae106610a9d8aa5e","first_computed_at":"2026-05-18T03:58:25.588495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:25.588495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OBnMjz2pJlqH9+Ewu3PdisKLpmXIzB47z3zn+XUrdCpsdoO8P9IqnZr3sNk6e2sZvDbLjMO1zST6NksuozitAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:25.589240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54cca373d8d04bc61f8915b9ac196465369fd987476c1a2332724e73eebee824","sha256:e23774e806ff79f57259f280ca1ad6b394c2647b3c5ffdfd76da1bcfa9da4ec8"],"state_sha256":"4586a581f23754c11e012c82cca6137dd6a7ee2ac63375dfa1d7bd83de8193eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OiYm8DFtTiF7BfIX5bCeWUNL5gEvVPgPdafbYlVO3Vkk8E160HsNuMhx8+V1XIjKxiraxarqVxKZrgYu0pdhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:55:54.218278Z","bundle_sha256":"e7b3efb352e8ddd2bacac44846f98a243b8bc76c67f5fa23c071f36c9c1d4bfe"}}