{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R3NFLYEA3VQV2CUBFNQGY2F5LA","short_pith_number":"pith:R3NFLYEA","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"},"canonical_sha256":"8eda55e080dd615d0a812b606c68bd581a042e53631b81b200d9e1581ae67b25","source":{"kind":"arxiv","id":"1610.00297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00297","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00297v1","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00297","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"R3NFLYEA3VQV","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R3NFLYEA3VQV2CUB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R3NFLYEA","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R3NFLYEA3VQV2CUBFNQGY2F5LA","target":"record","payload":{"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"},"canonical_sha256":"8eda55e080dd615d0a812b606c68bd581a042e53631b81b200d9e1581ae67b25","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"},"source_kind":"arxiv","source_id":"1610.00297","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-18T01:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2vrpA29LA5AljvgV9uSGZ5gOxbSAa6W8ki76Wn8OKYLmiOYzE7nnWVkVm4r0g4SA//bwKSJ4+M1eASLAFzBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:00:21.859119Z"},"content_sha256":"bdd57824e3367a99c7682fbc0ea6fe388751bbe050ac2989ce369acfa4c7b996","schema_version":"1.0","event_id":"sha256:bdd57824e3367a99c7682fbc0ea6fe388751bbe050ac2989ce369acfa4c7b996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R3NFLYEA3VQV2CUBFNQGY2F5LA","target":"graph","payload":{"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"},"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-18T01:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iuh6IqC+Ft7wT83wR5Tpc0yaC2jrOVpv248XcrmVtnEwhw2qAovP9X/HWaZvufYgEHZsIiXk1GB5xmCwHGUbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:00:21.859475Z"},"content_sha256":"489a7cc26849e988a44ce3302451f6c880b9239743fdabd8819520fde00c88b1","schema_version":"1.0","event_id":"sha256:489a7cc26849e988a44ce3302451f6c880b9239743fdabd8819520fde00c88b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/bundle.json","state_url":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/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-27T14:00:21Z","links":{"resolver":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA","bundle":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/bundle.json","state":"https://pith.science/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3NFLYEA3VQV2CUBFNQGY2F5LA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R3NFLYEA3VQV2CUBFNQGY2F5LA","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":"e88d6a3cbf940fe32914f1efb82191ce886e88f5961a1baed80168b44a5412d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-02T15:58:00Z","title_canon_sha256":"0804581ff838569741badca7fd919c78be211ab6c04e76a32a96ae2c2713468d"},"schema_version":"1.0","source":{"id":"1610.00297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00297","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00297v1","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00297","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"R3NFLYEA3VQV","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R3NFLYEA3VQV2CUB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R3NFLYEA","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:489a7cc26849e988a44ce3302451f6c880b9239743fdabd8819520fde00c88b1","target":"graph","created_at":"2026-05-18T01:03: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 (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","authors_text":"Vladimir Samodivkin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-02T15:58:00Z","title":"Roman domination excellent graphs: trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00297","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:bdd57824e3367a99c7682fbc0ea6fe388751bbe050ac2989ce369acfa4c7b996","target":"record","created_at":"2026-05-18T01:03: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":"e88d6a3cbf940fe32914f1efb82191ce886e88f5961a1baed80168b44a5412d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-02T15:58:00Z","title_canon_sha256":"0804581ff838569741badca7fd919c78be211ab6c04e76a32a96ae2c2713468d"},"schema_version":"1.0","source":{"id":"1610.00297","kind":"arxiv","version":1}},"canonical_sha256":"8eda55e080dd615d0a812b606c68bd581a042e53631b81b200d9e1581ae67b25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8eda55e080dd615d0a812b606c68bd581a042e53631b81b200d9e1581ae67b25","first_computed_at":"2026-05-18T01:03:25.835955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:25.835955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PyUu1eNpjwtKX6FaCJsz8aq+0J33QbPtGYORQ2ac0+xs34V0IEqGjOyBFFzad9NkJE0xrFDHWdGv4G8kscOyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:25.836463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdd57824e3367a99c7682fbc0ea6fe388751bbe050ac2989ce369acfa4c7b996","sha256:489a7cc26849e988a44ce3302451f6c880b9239743fdabd8819520fde00c88b1"],"state_sha256":"1b8047adae33fe2e4638030874047b11aa82e9951d3bbd3cccf5c8ff5fe6e6c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hwtLqMnRbsLcJToAtox41HhkpNcm33fhlOl3J0XPyUpueNsDFMh7gha7GqDW9xjUXkb+xa6nQWzNI/pjKbJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:00:21.861287Z","bundle_sha256":"95e1d5c6c329ee2369808ffa1e5f65188da5d0484d0ec063b3e3149e326b1a0d"}}