{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:66DDPQH2EHSEBCAC3Y3NZIEE6A","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":"5cbfac0d4a5152fe3789dd0754e58bab9ded6f7348029672ac6df20f9792a185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-16T08:40:07Z","title_canon_sha256":"3b8495ceb664cc135f3a9705f487f220ddc73917c22c1cca0fab29308d46a241"},"schema_version":"1.0","source":{"id":"1410.4334","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4334","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4334v1","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4334","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"66DDPQH2EHSE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"66DDPQH2EHSEBCAC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"66DDPQH2","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:e608d25589247a5a7e45d9f8a05769f0393a577eed9f30483306d31fabd8c9cf","target":"graph","created_at":"2026-05-18T02:39:56Z","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":"An algorithmic upper bound on the domination number $\\gamma$ of graphs in terms of the order $n$ and the minimum degree $\\delta$ is proved. It is demonstrated that the bound improves best previous bounds for any $5\\le \\delta \\le 50$. In particular, for $\\delta=5$, Xing et al.\\ proved in 2006 that $\\gamma \\le 5n/14 < 0.3572 n$. This bound is improved to $0.3440 n$. For $\\delta=6$, Clark et al.\\ in 1998 established $\\gamma <0.3377 n$, while Bir\\'o et al. recently improved it to $\\gamma <0.3340 n$. Here the bound is further improved to $\\gamma < 0.3159 n$. For $\\delta=7$, the best earlier bound $","authors_text":"Csilla Bujt\\'as, Sandi Klav\\v{z}ar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-16T08:40:07Z","title":"Improved upper bounds on the domination number of graphs with minimum degree at least five"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4334","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:4da481ecd744cc804b02483a9b30d1181835bf6f44d4e2d8afc2c9b2cabfa3fd","target":"record","created_at":"2026-05-18T02:39:56Z","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":"5cbfac0d4a5152fe3789dd0754e58bab9ded6f7348029672ac6df20f9792a185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-16T08:40:07Z","title_canon_sha256":"3b8495ceb664cc135f3a9705f487f220ddc73917c22c1cca0fab29308d46a241"},"schema_version":"1.0","source":{"id":"1410.4334","kind":"arxiv","version":1}},"canonical_sha256":"f78637c0fa21e4408802de36dca084f013435aeca9d2f94c814f752658aaf845","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f78637c0fa21e4408802de36dca084f013435aeca9d2f94c814f752658aaf845","first_computed_at":"2026-05-18T02:39:56.386722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:56.386722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bmz/cg0lyFnoETX1zradKZ0oMFapgVy+22vGUZ5kLHgsfZxb4G2+IU7zzDujJex46sjSuaaqExGTOFGtQpIBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:56.387179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4334","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4da481ecd744cc804b02483a9b30d1181835bf6f44d4e2d8afc2c9b2cabfa3fd","sha256:e608d25589247a5a7e45d9f8a05769f0393a577eed9f30483306d31fabd8c9cf"],"state_sha256":"f9a266737d3241bc022e69261825f48232a7426a09e182f54fa252a08fdf416f"}