{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PY4265Y6G2YPHBWXKK2HP42CUW","short_pith_number":"pith:PY4265Y6","schema_version":"1.0","canonical_sha256":"7e39af771e36b0f386d752b477f342a5ad6409be3473709974e59cac8e2e15d4","source":{"kind":"arxiv","id":"1710.05953","version":1},"attestation_state":"computed","paper":{"title":"Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Jos\\'e C\\'aceres, Mar\\'ia Luz Puertas, Merc\\`e Mora","submitted_at":"2017-10-16T18:35:24Z","abstract_excerpt":"Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating $2$-broadcasts along with the associated parameter, the dominating $2$-broadcast number. We prove that computing the dominating $2$-broadcast number is a NP-complete problem, but can be achieved in linear time for trees. We also give an upper bound for this parameter, that is tight for graphs as large as desired."},"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":"1710.05953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-16T18:35:24Z","cross_cats_sorted":[],"title_canon_sha256":"5e6ac25fdec6aa2537be1488f363c363f7c6b7ea2ad3424cf723ded532ff246c","abstract_canon_sha256":"7ee71fc7ef1a87ed1e56984311c970b5424de6b09dd9dfb664e23ba26eeb234c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:38.227822Z","signature_b64":"Q6syW05EUAzsBUknIuuhitC/NWyANJ7/vRRPQB+3DJ5s8P8G7FoJQHEYL0fQxQ1bWCLrjacwY8JHA1b6cXX7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e39af771e36b0f386d752b477f342a5ad6409be3473709974e59cac8e2e15d4","last_reissued_at":"2026-05-18T00:32:38.227047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:38.227047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Jos\\'e C\\'aceres, Mar\\'ia Luz Puertas, Merc\\`e Mora","submitted_at":"2017-10-16T18:35:24Z","abstract_excerpt":"Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating $2$-broadcasts along with the associated parameter, the dominating $2$-broadcast number. We prove that computing the dominating $2$-broadcast number is a NP-complete problem, but can be achieved in linear time for trees. We also give an upper bound for this parameter, that is tight for graphs as large as desired."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05953","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":"1710.05953","created_at":"2026-05-18T00:32:38.227151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05953v1","created_at":"2026-05-18T00:32:38.227151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05953","created_at":"2026-05-18T00:32:38.227151+00:00"},{"alias_kind":"pith_short_12","alias_value":"PY4265Y6G2YP","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PY4265Y6G2YPHBWX","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PY4265Y6","created_at":"2026-05-18T12:31:37.085036+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/PY4265Y6G2YPHBWXKK2HP42CUW","json":"https://pith.science/pith/PY4265Y6G2YPHBWXKK2HP42CUW.json","graph_json":"https://pith.science/api/pith-number/PY4265Y6G2YPHBWXKK2HP42CUW/graph.json","events_json":"https://pith.science/api/pith-number/PY4265Y6G2YPHBWXKK2HP42CUW/events.json","paper":"https://pith.science/paper/PY4265Y6"},"agent_actions":{"view_html":"https://pith.science/pith/PY4265Y6G2YPHBWXKK2HP42CUW","download_json":"https://pith.science/pith/PY4265Y6G2YPHBWXKK2HP42CUW.json","view_paper":"https://pith.science/paper/PY4265Y6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05953&json=true","fetch_graph":"https://pith.science/api/pith-number/PY4265Y6G2YPHBWXKK2HP42CUW/graph.json","fetch_events":"https://pith.science/api/pith-number/PY4265Y6G2YPHBWXKK2HP42CUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PY4265Y6G2YPHBWXKK2HP42CUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PY4265Y6G2YPHBWXKK2HP42CUW/action/storage_attestation","attest_author":"https://pith.science/pith/PY4265Y6G2YPHBWXKK2HP42CUW/action/author_attestation","sign_citation":"https://pith.science/pith/PY4265Y6G2YPHBWXKK2HP42CUW/action/citation_signature","submit_replication":"https://pith.science/pith/PY4265Y6G2YPHBWXKK2HP42CUW/action/replication_record"}},"created_at":"2026-05-18T00:32:38.227151+00:00","updated_at":"2026-05-18T00:32:38.227151+00:00"}