{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:66DDPQH2EHSEBCAC3Y3NZIEE6A","short_pith_number":"pith:66DDPQH2","schema_version":"1.0","canonical_sha256":"f78637c0fa21e4408802de36dca084f013435aeca9d2f94c814f752658aaf845","source":{"kind":"arxiv","id":"1410.4334","version":1},"attestation_state":"computed","paper":{"title":"Improved upper bounds on the domination number of graphs with minimum degree at least five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Sandi Klav\\v{z}ar","submitted_at":"2014-10-16T08:40:07Z","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 $"},"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":"1410.4334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-16T08:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"3b8495ceb664cc135f3a9705f487f220ddc73917c22c1cca0fab29308d46a241","abstract_canon_sha256":"5cbfac0d4a5152fe3789dd0754e58bab9ded6f7348029672ac6df20f9792a185"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:56.387179Z","signature_b64":"Bmz/cg0lyFnoETX1zradKZ0oMFapgVy+22vGUZ5kLHgsfZxb4G2+IU7zzDujJex46sjSuaaqExGTOFGtQpIBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f78637c0fa21e4408802de36dca084f013435aeca9d2f94c814f752658aaf845","last_reissued_at":"2026-05-18T02:39:56.386722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:56.386722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved upper bounds on the domination number of graphs with minimum degree at least five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Sandi Klav\\v{z}ar","submitted_at":"2014-10-16T08:40:07Z","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 $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4334","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":"1410.4334","created_at":"2026-05-18T02:39:56.386779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4334v1","created_at":"2026-05-18T02:39:56.386779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4334","created_at":"2026-05-18T02:39:56.386779+00:00"},{"alias_kind":"pith_short_12","alias_value":"66DDPQH2EHSE","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"66DDPQH2EHSEBCAC","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"66DDPQH2","created_at":"2026-05-18T12:28:16.859392+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/66DDPQH2EHSEBCAC3Y3NZIEE6A","json":"https://pith.science/pith/66DDPQH2EHSEBCAC3Y3NZIEE6A.json","graph_json":"https://pith.science/api/pith-number/66DDPQH2EHSEBCAC3Y3NZIEE6A/graph.json","events_json":"https://pith.science/api/pith-number/66DDPQH2EHSEBCAC3Y3NZIEE6A/events.json","paper":"https://pith.science/paper/66DDPQH2"},"agent_actions":{"view_html":"https://pith.science/pith/66DDPQH2EHSEBCAC3Y3NZIEE6A","download_json":"https://pith.science/pith/66DDPQH2EHSEBCAC3Y3NZIEE6A.json","view_paper":"https://pith.science/paper/66DDPQH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4334&json=true","fetch_graph":"https://pith.science/api/pith-number/66DDPQH2EHSEBCAC3Y3NZIEE6A/graph.json","fetch_events":"https://pith.science/api/pith-number/66DDPQH2EHSEBCAC3Y3NZIEE6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66DDPQH2EHSEBCAC3Y3NZIEE6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66DDPQH2EHSEBCAC3Y3NZIEE6A/action/storage_attestation","attest_author":"https://pith.science/pith/66DDPQH2EHSEBCAC3Y3NZIEE6A/action/author_attestation","sign_citation":"https://pith.science/pith/66DDPQH2EHSEBCAC3Y3NZIEE6A/action/citation_signature","submit_replication":"https://pith.science/pith/66DDPQH2EHSEBCAC3Y3NZIEE6A/action/replication_record"}},"created_at":"2026-05-18T02:39:56.386779+00:00","updated_at":"2026-05-18T02:39:56.386779+00:00"}