{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NIK3L7SFFZTAPLLWLWHGGQFTIN","short_pith_number":"pith:NIK3L7SF","schema_version":"1.0","canonical_sha256":"6a15b5fe452e6607ad765d8e6340b3436b9f8301b8f800967797f84603ab8dd5","source":{"kind":"arxiv","id":"1804.09338","version":3},"attestation_state":"computed","paper":{"title":"A Note on Roman \\{2\\}-domination problem in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Changhong Lu, Hangdi Chen","submitted_at":"2018-04-25T04:10:45Z","abstract_excerpt":"For a graph $G=(V,E)$, a Roman $\\{2\\}$-dominating function (R2DF)$f:V\\rightarrow \\{0,1,2\\}$ has the property that for every vertex $v\\in V$ with $f(v)=0$, either there exists a neighbor $u\\in N(v)$, with $f(u)=2$, or at least two neighbors $x,y\\in N(v)$ having $f(x)=f(y)=1$. The weight of a R2DF is the sum $f(V)=\\sum_{v\\in V}{f(v)}$, and the minimum weight of a R2DF is the Roman $\\{2\\}$-domination number $\\gamma_{\\{R2\\}}(G)$. A R2DF is independent if the set of vertices having positive function values is an independent set. The independent Roman $\\{2\\}$-domination number $i_{\\{R2\\}}(G)$ is the"},"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":"1804.09338","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-25T04:10:45Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2b9d78563d4696bbe9c9196463211fad016972e2bd1c6471d26f88d80d63debf","abstract_canon_sha256":"fcee5086af4fc37ba734f602a399f6a07f6ff41028b59f881a9b91ea77052fc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:51.434042Z","signature_b64":"CA9Ee8YXSdCBIdTmKb6rLty3TdSSo6XmbN1N2FDXqYJYkyWA6gq/X+VC/NB3EBGz13NakXIXKOZs/B3S79HECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a15b5fe452e6607ad765d8e6340b3436b9f8301b8f800967797f84603ab8dd5","last_reissued_at":"2026-05-17T23:53:51.433475Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:51.433475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Roman \\{2\\}-domination problem in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Changhong Lu, Hangdi Chen","submitted_at":"2018-04-25T04:10:45Z","abstract_excerpt":"For a graph $G=(V,E)$, a Roman $\\{2\\}$-dominating function (R2DF)$f:V\\rightarrow \\{0,1,2\\}$ has the property that for every vertex $v\\in V$ with $f(v)=0$, either there exists a neighbor $u\\in N(v)$, with $f(u)=2$, or at least two neighbors $x,y\\in N(v)$ having $f(x)=f(y)=1$. The weight of a R2DF is the sum $f(V)=\\sum_{v\\in V}{f(v)}$, and the minimum weight of a R2DF is the Roman $\\{2\\}$-domination number $\\gamma_{\\{R2\\}}(G)$. A R2DF is independent if the set of vertices having positive function values is an independent set. The independent Roman $\\{2\\}$-domination number $i_{\\{R2\\}}(G)$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09338","kind":"arxiv","version":3},"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":"1804.09338","created_at":"2026-05-17T23:53:51.433567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09338v3","created_at":"2026-05-17T23:53:51.433567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09338","created_at":"2026-05-17T23:53:51.433567+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIK3L7SFFZTA","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIK3L7SFFZTAPLLW","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIK3L7SF","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09283","citing_title":"m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NIK3L7SFFZTAPLLWLWHGGQFTIN","json":"https://pith.science/pith/NIK3L7SFFZTAPLLWLWHGGQFTIN.json","graph_json":"https://pith.science/api/pith-number/NIK3L7SFFZTAPLLWLWHGGQFTIN/graph.json","events_json":"https://pith.science/api/pith-number/NIK3L7SFFZTAPLLWLWHGGQFTIN/events.json","paper":"https://pith.science/paper/NIK3L7SF"},"agent_actions":{"view_html":"https://pith.science/pith/NIK3L7SFFZTAPLLWLWHGGQFTIN","download_json":"https://pith.science/pith/NIK3L7SFFZTAPLLWLWHGGQFTIN.json","view_paper":"https://pith.science/paper/NIK3L7SF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09338&json=true","fetch_graph":"https://pith.science/api/pith-number/NIK3L7SFFZTAPLLWLWHGGQFTIN/graph.json","fetch_events":"https://pith.science/api/pith-number/NIK3L7SFFZTAPLLWLWHGGQFTIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIK3L7SFFZTAPLLWLWHGGQFTIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIK3L7SFFZTAPLLWLWHGGQFTIN/action/storage_attestation","attest_author":"https://pith.science/pith/NIK3L7SFFZTAPLLWLWHGGQFTIN/action/author_attestation","sign_citation":"https://pith.science/pith/NIK3L7SFFZTAPLLWLWHGGQFTIN/action/citation_signature","submit_replication":"https://pith.science/pith/NIK3L7SFFZTAPLLWLWHGGQFTIN/action/replication_record"}},"created_at":"2026-05-17T23:53:51.433567+00:00","updated_at":"2026-05-17T23:53:51.433567+00:00"}