{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ECRPOCDPTO2VH7N466KR5DTGC2","short_pith_number":"pith:ECRPOCDP","canonical_record":{"source":{"id":"1801.04965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-15T19:51:26Z","cross_cats_sorted":[],"title_canon_sha256":"6ab3a65a851c5b41151e08bd92f8c961120c45d81d0ea8a983da7039a1b53bcc","abstract_canon_sha256":"1ed5d5ebb182ccf1d7c0eefd64c6c0a8b95ee0a0a7711d06f9bd7f54dd9cb043"},"schema_version":"1.0"},"canonical_sha256":"20a2f7086f9bb553fdbcf7951e8e661690551beb14270d81f10928bf455d10c0","source":{"kind":"arxiv","id":"1801.04965","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04965","created_at":"2026-05-18T00:25:50Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04965v1","created_at":"2026-05-18T00:25:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04965","created_at":"2026-05-18T00:25:50Z"},{"alias_kind":"pith_short_12","alias_value":"ECRPOCDPTO2V","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ECRPOCDPTO2VH7N4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ECRPOCDP","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ECRPOCDPTO2VH7N466KR5DTGC2","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-15T19:51:26Z","cross_cats_sorted":[],"title_canon_sha256":"6ab3a65a851c5b41151e08bd92f8c961120c45d81d0ea8a983da7039a1b53bcc","abstract_canon_sha256":"1ed5d5ebb182ccf1d7c0eefd64c6c0a8b95ee0a0a7711d06f9bd7f54dd9cb043"},"schema_version":"1.0"},"canonical_sha256":"20a2f7086f9bb553fdbcf7951e8e661690551beb14270d81f10928bf455d10c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:50.468628Z","signature_b64":"C9o0mtAkrwJ4kb91MmG/QglKJjv+chsc4C1N3GjuwUjDLcMsc6/D8A5mse3c+cQCLRsWzlHXoJOGj25Wxk20Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20a2f7086f9bb553fdbcf7951e8e661690551beb14270d81f10928bf455d10c0","last_reissued_at":"2026-05-18T00:25:50.468009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:50.468009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04965","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-18T00:25:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDDZHo+35iTgC4khpssH02UZfDGZ0h+X6zJeXwC6qkzvP5Bgnf9vCrcExX028T4LNW9dfl/UExHQyjAQmY5XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:59:38.096767Z"},"content_sha256":"f08bbde373e8f84aae169ae2f57ef86a9d6a429907c8e65e77ff91f9cffb7b3c","schema_version":"1.0","event_id":"sha256:f08bbde373e8f84aae169ae2f57ef86a9d6a429907c8e65e77ff91f9cffb7b3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ECRPOCDPTO2VH7N466KR5DTGC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Changing and unchanging of the domination number of a graph: Path addition numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Samodivkin","submitted_at":"2018-01-15T19:51:26Z","abstract_excerpt":"Given a graph $G = (V,E)$ and two its distinct vertices $u$ and $v$. The $(u,v)$-$P_k$-{\\em addition graph} of $G$ is the graph $G_{u,v,k-2}$ obtained from disjoint union of $G$ and a path $P_k: x_0,x_1,..,x_{k-1}$, $k \\geq 2$, by identifying the vertices $u$ and $x_0$, and identifying the vertices $v$ and $x_{k-1}$. We prove that (a) $ \\gamma(G)-1 \\leq \\gamma(G_{u,v,k})$ for all $k \\geq 1$, and (b) $\\gamma(G_{u,v,k}) > \\gamma(G)$ when $k \\geq 5$. We also provide necessary and sufficient conditions for the equality $\\gamma(G_{u,v,k}) = \\gamma(G)$ to be valid for each pair $u,v \\in V(G)$. pair "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04965","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-18T00:25:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gEvuTp3NxvOjciqVd43zzAaFZJx9XANTeDPMPV8OCC+TwrRqFlKgcgx0sB5gPMRaQReXnJvb+FEdkMzbqDQAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:59:38.097115Z"},"content_sha256":"8c39de1268820e47aa0a7195e75c42659d46ae0783d326fcf088825d7870b333","schema_version":"1.0","event_id":"sha256:8c39de1268820e47aa0a7195e75c42659d46ae0783d326fcf088825d7870b333"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECRPOCDPTO2VH7N466KR5DTGC2/bundle.json","state_url":"https://pith.science/pith/ECRPOCDPTO2VH7N466KR5DTGC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECRPOCDPTO2VH7N466KR5DTGC2/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-27T13:59:38Z","links":{"resolver":"https://pith.science/pith/ECRPOCDPTO2VH7N466KR5DTGC2","bundle":"https://pith.science/pith/ECRPOCDPTO2VH7N466KR5DTGC2/bundle.json","state":"https://pith.science/pith/ECRPOCDPTO2VH7N466KR5DTGC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECRPOCDPTO2VH7N466KR5DTGC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ECRPOCDPTO2VH7N466KR5DTGC2","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":"1ed5d5ebb182ccf1d7c0eefd64c6c0a8b95ee0a0a7711d06f9bd7f54dd9cb043","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-15T19:51:26Z","title_canon_sha256":"6ab3a65a851c5b41151e08bd92f8c961120c45d81d0ea8a983da7039a1b53bcc"},"schema_version":"1.0","source":{"id":"1801.04965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04965","created_at":"2026-05-18T00:25:50Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04965v1","created_at":"2026-05-18T00:25:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04965","created_at":"2026-05-18T00:25:50Z"},{"alias_kind":"pith_short_12","alias_value":"ECRPOCDPTO2V","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ECRPOCDPTO2VH7N4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ECRPOCDP","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:8c39de1268820e47aa0a7195e75c42659d46ae0783d326fcf088825d7870b333","target":"graph","created_at":"2026-05-18T00:25:50Z","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":"Given a graph $G = (V,E)$ and two its distinct vertices $u$ and $v$. The $(u,v)$-$P_k$-{\\em addition graph} of $G$ is the graph $G_{u,v,k-2}$ obtained from disjoint union of $G$ and a path $P_k: x_0,x_1,..,x_{k-1}$, $k \\geq 2$, by identifying the vertices $u$ and $x_0$, and identifying the vertices $v$ and $x_{k-1}$. We prove that (a) $ \\gamma(G)-1 \\leq \\gamma(G_{u,v,k})$ for all $k \\geq 1$, and (b) $\\gamma(G_{u,v,k}) > \\gamma(G)$ when $k \\geq 5$. We also provide necessary and sufficient conditions for the equality $\\gamma(G_{u,v,k}) = \\gamma(G)$ to be valid for each pair $u,v \\in V(G)$. pair ","authors_text":"Vladimir Samodivkin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-15T19:51:26Z","title":"Changing and unchanging of the domination number of a graph: Path addition numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04965","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:f08bbde373e8f84aae169ae2f57ef86a9d6a429907c8e65e77ff91f9cffb7b3c","target":"record","created_at":"2026-05-18T00:25:50Z","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":"1ed5d5ebb182ccf1d7c0eefd64c6c0a8b95ee0a0a7711d06f9bd7f54dd9cb043","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-15T19:51:26Z","title_canon_sha256":"6ab3a65a851c5b41151e08bd92f8c961120c45d81d0ea8a983da7039a1b53bcc"},"schema_version":"1.0","source":{"id":"1801.04965","kind":"arxiv","version":1}},"canonical_sha256":"20a2f7086f9bb553fdbcf7951e8e661690551beb14270d81f10928bf455d10c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20a2f7086f9bb553fdbcf7951e8e661690551beb14270d81f10928bf455d10c0","first_computed_at":"2026-05-18T00:25:50.468009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:50.468009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C9o0mtAkrwJ4kb91MmG/QglKJjv+chsc4C1N3GjuwUjDLcMsc6/D8A5mse3c+cQCLRsWzlHXoJOGj25Wxk20Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:50.468628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f08bbde373e8f84aae169ae2f57ef86a9d6a429907c8e65e77ff91f9cffb7b3c","sha256:8c39de1268820e47aa0a7195e75c42659d46ae0783d326fcf088825d7870b333"],"state_sha256":"81745c04aedad0ec3fb90f817676f0898381a347cac788f68e6a56c140c996e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZj26IFOnGJQg1xGFDBTMkhFsG5Dl8L8IgjUmKWDOVnna1NDumJ71GcYpm2D4+knelNM6KlDClyxgljOrILdCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:59:38.099152Z","bundle_sha256":"0f906ddc519dd05e8687176ee2e79a8da0b195979cef4c3dffbbabbb7ea913a8"}}