{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L5XOKPH55I3TJVATWVCLVRNYCK","short_pith_number":"pith:L5XOKPH5","schema_version":"1.0","canonical_sha256":"5f6ee53cfdea3734d413b544bac5b8129044b6201914405a5579895eb064fe79","source":{"kind":"arxiv","id":"1809.08630","version":1},"attestation_state":"computed","paper":{"title":"Bounds on the nonnegative signed domination number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Babak Samadi, Doost Ali Mojdeh, Lutz Volkmann","submitted_at":"2018-09-23T16:53:22Z","abstract_excerpt":"The aim of this work is to investigate the nonnegative signed domination number $\\gamma^{NN}_s$ with emphasis on regular, ($r+1$)-clique-free graphs and trees. We give lower and upper bounds on $\\gamma^{NN}_s$ for regular graphs and prove that $n/3$ is the best possible upper bound on this parameter for a cubic graph of order $n$, specifically. As an application of the classic theorem of Tur\\'{a}n we bound $\\gamma^{NN}_s(G)$ from below, for an ($r+1$)-clique-free graph $G$ and characterize all such graphs for which the equality holds, which corrects and generalizes a result for bipartite graph"},"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":"1809.08630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-23T16:53:22Z","cross_cats_sorted":[],"title_canon_sha256":"3ee404d1d246a586bd9ee9be53c698269d78bc9f6c859e69bc1aa369a90e941d","abstract_canon_sha256":"8dcef9ef53622fbf48ec430ea06f3793c753640a1e6e2cbf2ea0c7c560a2782a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:03.949943Z","signature_b64":"3iNf+eczdxE6BSeoe2K+Pji6m+1iRMvgfoGo/KQQiFWqpcqVQBumIl0Y7f5ypS4A07oC0WO4TN+ClmfgFawhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f6ee53cfdea3734d413b544bac5b8129044b6201914405a5579895eb064fe79","last_reissued_at":"2026-05-18T00:05:03.949355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:03.949355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the nonnegative signed domination number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Babak Samadi, Doost Ali Mojdeh, Lutz Volkmann","submitted_at":"2018-09-23T16:53:22Z","abstract_excerpt":"The aim of this work is to investigate the nonnegative signed domination number $\\gamma^{NN}_s$ with emphasis on regular, ($r+1$)-clique-free graphs and trees. We give lower and upper bounds on $\\gamma^{NN}_s$ for regular graphs and prove that $n/3$ is the best possible upper bound on this parameter for a cubic graph of order $n$, specifically. As an application of the classic theorem of Tur\\'{a}n we bound $\\gamma^{NN}_s(G)$ from below, for an ($r+1$)-clique-free graph $G$ and characterize all such graphs for which the equality holds, which corrects and generalizes a result for bipartite graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08630","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":"1809.08630","created_at":"2026-05-18T00:05:03.949449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08630v1","created_at":"2026-05-18T00:05:03.949449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08630","created_at":"2026-05-18T00:05:03.949449+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5XOKPH55I3T","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5XOKPH55I3TJVAT","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5XOKPH5","created_at":"2026-05-18T12:32:33.847187+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/L5XOKPH55I3TJVATWVCLVRNYCK","json":"https://pith.science/pith/L5XOKPH55I3TJVATWVCLVRNYCK.json","graph_json":"https://pith.science/api/pith-number/L5XOKPH55I3TJVATWVCLVRNYCK/graph.json","events_json":"https://pith.science/api/pith-number/L5XOKPH55I3TJVATWVCLVRNYCK/events.json","paper":"https://pith.science/paper/L5XOKPH5"},"agent_actions":{"view_html":"https://pith.science/pith/L5XOKPH55I3TJVATWVCLVRNYCK","download_json":"https://pith.science/pith/L5XOKPH55I3TJVATWVCLVRNYCK.json","view_paper":"https://pith.science/paper/L5XOKPH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08630&json=true","fetch_graph":"https://pith.science/api/pith-number/L5XOKPH55I3TJVATWVCLVRNYCK/graph.json","fetch_events":"https://pith.science/api/pith-number/L5XOKPH55I3TJVATWVCLVRNYCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5XOKPH55I3TJVATWVCLVRNYCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5XOKPH55I3TJVATWVCLVRNYCK/action/storage_attestation","attest_author":"https://pith.science/pith/L5XOKPH55I3TJVATWVCLVRNYCK/action/author_attestation","sign_citation":"https://pith.science/pith/L5XOKPH55I3TJVATWVCLVRNYCK/action/citation_signature","submit_replication":"https://pith.science/pith/L5XOKPH55I3TJVATWVCLVRNYCK/action/replication_record"}},"created_at":"2026-05-18T00:05:03.949449+00:00","updated_at":"2026-05-18T00:05:03.949449+00:00"}