{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R3NFLYEA3VQV2CUBFNQGY2F5LA","short_pith_number":"pith:R3NFLYEA","schema_version":"1.0","canonical_sha256":"8eda55e080dd615d0a812b606c68bd581a042e53631b81b200d9e1581ae67b25","source":{"kind":"arxiv","id":"1610.00297","version":1},"attestation_state":"computed","paper":{"title":"Roman domination excellent graphs: trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Samodivkin","submitted_at":"2016-10-02T15:58:00Z","abstract_excerpt":"A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V \\rightarrow \\{0, 1, 2\\}$ such that every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = \\Sigma_{v\\in V} f(v)$. The Roman domination number, $\\gamma_R(G)$, of $G$ is the minimum weight of an RDF on $G$. An RDF of minimum weight is called a $\\gamma_R$-function. A graph G is said to be $\\gamma_R$-excellent if for each vertex $x \\in V$ there is a $\\gamma_R$-function $h_x$ on $G$ with $h_x(x) \\not = 0$. We present a constructive characterization of $\\gamma_R$-excellent trees u"},"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":"1610.00297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-02T15:58:00Z","cross_cats_sorted":[],"title_canon_sha256":"0804581ff838569741badca7fd919c78be211ab6c04e76a32a96ae2c2713468d","abstract_canon_sha256":"e88d6a3cbf940fe32914f1efb82191ce886e88f5961a1baed80168b44a5412d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:25.836463Z","signature_b64":"PyUu1eNpjwtKX6FaCJsz8aq+0J33QbPtGYORQ2ac0+xs34V0IEqGjOyBFFzad9NkJE0xrFDHWdGv4G8kscOyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8eda55e080dd615d0a812b606c68bd581a042e53631b81b200d9e1581ae67b25","last_reissued_at":"2026-05-18T01:03:25.835955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:25.835955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Roman domination excellent graphs: trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Samodivkin","submitted_at":"2016-10-02T15:58:00Z","abstract_excerpt":"A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V \\rightarrow \\{0, 1, 2\\}$ such that every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = \\Sigma_{v\\in V} f(v)$. The Roman domination number, $\\gamma_R(G)$, of $G$ is the minimum weight of an RDF on $G$. An RDF of minimum weight is called a $\\gamma_R$-function. A graph G is said to be $\\gamma_R$-excellent if for each vertex $x \\in V$ there is a $\\gamma_R$-function $h_x$ on $G$ with $h_x(x) \\not = 0$. We present a constructive characterization of $\\gamma_R$-excellent trees u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00297","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":"1610.00297","created_at":"2026-05-18T01:03:25.836031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00297v1","created_at":"2026-05-18T01:03:25.836031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00297","created_at":"2026-05-18T01:03:25.836031+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3NFLYEA3VQV","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3NFLYEA3VQV2CUB","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3NFLYEA","created_at":"2026-05-18T12:30:41.710351+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/R3NFLYEA3VQV2CUBFNQGY2F5LA","json":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA.json","graph_json":"https://pith.science/api/pith-number/R3NFLYEA3VQV2CUBFNQGY2F5LA/graph.json","events_json":"https://pith.science/api/pith-number/R3NFLYEA3VQV2CUBFNQGY2F5LA/events.json","paper":"https://pith.science/paper/R3NFLYEA"},"agent_actions":{"view_html":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA","download_json":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA.json","view_paper":"https://pith.science/paper/R3NFLYEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00297&json=true","fetch_graph":"https://pith.science/api/pith-number/R3NFLYEA3VQV2CUBFNQGY2F5LA/graph.json","fetch_events":"https://pith.science/api/pith-number/R3NFLYEA3VQV2CUBFNQGY2F5LA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/action/storage_attestation","attest_author":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/action/author_attestation","sign_citation":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/action/citation_signature","submit_replication":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/action/replication_record"}},"created_at":"2026-05-18T01:03:25.836031+00:00","updated_at":"2026-05-18T01:03:25.836031+00:00"}