{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7WF6N4SCLWGMRRCBGVJBISNB56","short_pith_number":"pith:7WF6N4SC","schema_version":"1.0","canonical_sha256":"fd8be6f2425d8cc8c44135521449a1efa4841cade866da5dc48d7a3b9e27f794","source":{"kind":"arxiv","id":"1708.05455","version":1},"attestation_state":"computed","paper":{"title":"Broadcasts in Graphs: Diametrical Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C.M. Mynhardt, L. Gemmrich","submitted_at":"2017-08-17T22:54:35Z","abstract_excerpt":"A dominating broadcast on a graph G with vertex set V is a function f that maps V to {0,1,...,diam(G)} such that f(v) does not exceed e(v) (the eccentricity of v) for all vertices v, and each vertex u is at distance at most f(v) from a vertex v with positive f(v). The upper broadcast domination number of G is {\\Gamma}_{b}(G), which equals the maximum of the sum of the function values f(v), the maximum being taken over all minimal dominating broadcasts f on G. As shown by Erwin in [D. Erwin, Cost domination in graphs, Doctoral dissertation, Western Michigan University, 2001], {\\Gamma}_{b}(G) is"},"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":"1708.05455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-17T22:54:35Z","cross_cats_sorted":[],"title_canon_sha256":"cac9a8925d8a894f19b43c012be5bf024cf1193530afa63a69b929ee3b9f0fc4","abstract_canon_sha256":"4e01c77ab99d66dd9ef6b46ad00aa5f3c15f590935abbec02e4ab06ebb5710b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:50.010775Z","signature_b64":"cXzBGCx+c+GQiFWxbQScKz650vR3CPst50ZLmH5bYdB5OP0ue7Vce+P+b3yN33ZmYueKYSgGg9QEepTHLhzVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd8be6f2425d8cc8c44135521449a1efa4841cade866da5dc48d7a3b9e27f794","last_reissued_at":"2026-05-18T00:37:50.010258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:50.010258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Broadcasts in Graphs: Diametrical Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C.M. Mynhardt, L. Gemmrich","submitted_at":"2017-08-17T22:54:35Z","abstract_excerpt":"A dominating broadcast on a graph G with vertex set V is a function f that maps V to {0,1,...,diam(G)} such that f(v) does not exceed e(v) (the eccentricity of v) for all vertices v, and each vertex u is at distance at most f(v) from a vertex v with positive f(v). The upper broadcast domination number of G is {\\Gamma}_{b}(G), which equals the maximum of the sum of the function values f(v), the maximum being taken over all minimal dominating broadcasts f on G. As shown by Erwin in [D. Erwin, Cost domination in graphs, Doctoral dissertation, Western Michigan University, 2001], {\\Gamma}_{b}(G) is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05455","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":"1708.05455","created_at":"2026-05-18T00:37:50.010355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05455v1","created_at":"2026-05-18T00:37:50.010355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05455","created_at":"2026-05-18T00:37:50.010355+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WF6N4SCLWGM","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WF6N4SCLWGMRRCB","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WF6N4SC","created_at":"2026-05-18T12:31:05.417338+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/7WF6N4SCLWGMRRCBGVJBISNB56","json":"https://pith.science/pith/7WF6N4SCLWGMRRCBGVJBISNB56.json","graph_json":"https://pith.science/api/pith-number/7WF6N4SCLWGMRRCBGVJBISNB56/graph.json","events_json":"https://pith.science/api/pith-number/7WF6N4SCLWGMRRCBGVJBISNB56/events.json","paper":"https://pith.science/paper/7WF6N4SC"},"agent_actions":{"view_html":"https://pith.science/pith/7WF6N4SCLWGMRRCBGVJBISNB56","download_json":"https://pith.science/pith/7WF6N4SCLWGMRRCBGVJBISNB56.json","view_paper":"https://pith.science/paper/7WF6N4SC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05455&json=true","fetch_graph":"https://pith.science/api/pith-number/7WF6N4SCLWGMRRCBGVJBISNB56/graph.json","fetch_events":"https://pith.science/api/pith-number/7WF6N4SCLWGMRRCBGVJBISNB56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WF6N4SCLWGMRRCBGVJBISNB56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WF6N4SCLWGMRRCBGVJBISNB56/action/storage_attestation","attest_author":"https://pith.science/pith/7WF6N4SCLWGMRRCBGVJBISNB56/action/author_attestation","sign_citation":"https://pith.science/pith/7WF6N4SCLWGMRRCBGVJBISNB56/action/citation_signature","submit_replication":"https://pith.science/pith/7WF6N4SCLWGMRRCBGVJBISNB56/action/replication_record"}},"created_at":"2026-05-18T00:37:50.010355+00:00","updated_at":"2026-05-18T00:37:50.010355+00:00"}