{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3SQIP6PFF4ZMCWIRBPYP36XCPI","short_pith_number":"pith:3SQIP6PF","schema_version":"1.0","canonical_sha256":"dca087f9e52f32c159110bf0fdfae27a396f6d0c83ee07051707834ea85cf156","source":{"kind":"arxiv","id":"1609.05675","version":4},"attestation_state":"computed","paper":{"title":"General bounds on limited broadcast domination","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":"2016-09-19T11:53:23Z","abstract_excerpt":"Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and classical domination. In this limited version, the broadcast function is upper bounded by an integer $k$ and the minimum cost of such function is the dominating $k$-broadcast number. Our main result is a unified upper bound on this parameter for any value of $k$ in general graphs, in terms of both $k$ and the order of the graph. We also study the computational complexity of "},"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":"1609.05675","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-19T11:53:23Z","cross_cats_sorted":[],"title_canon_sha256":"fd91c1fe6b9b24a0f5051c8f569a6d49946abe6b5b11452ce8aec24bbe0fbed8","abstract_canon_sha256":"fd74c00b45f3e1163b7c1dc556b711fa5e119a0c2468df8cd0bc291281ed5f8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:17.659594Z","signature_b64":"cIk5Ako4iJayrBynyDV9zUOgX47qJv6haVuexuA96rB+XZRwSMyG0eHeZb3uLKS8aa3/yElWyPa5kdSapEUWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dca087f9e52f32c159110bf0fdfae27a396f6d0c83ee07051707834ea85cf156","last_reissued_at":"2026-07-05T06:23:17.659187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:17.659187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General bounds on limited broadcast domination","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":"2016-09-19T11:53:23Z","abstract_excerpt":"Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and classical domination. In this limited version, the broadcast function is upper bounded by an integer $k$ and the minimum cost of such function is the dominating $k$-broadcast number. Our main result is a unified upper bound on this parameter for any value of $k$ in general graphs, in terms of both $k$ and the order of the graph. We also study the computational complexity of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05675","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1609.05675/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1609.05675","created_at":"2026-07-05T06:23:17.659245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05675v4","created_at":"2026-07-05T06:23:17.659245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05675","created_at":"2026-07-05T06:23:17.659245+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SQIP6PFF4ZM","created_at":"2026-07-05T06:23:17.659245+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SQIP6PFF4ZMCWIR","created_at":"2026-07-05T06:23:17.659245+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SQIP6PF","created_at":"2026-07-05T06:23:17.659245+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/3SQIP6PFF4ZMCWIRBPYP36XCPI","json":"https://pith.science/pith/3SQIP6PFF4ZMCWIRBPYP36XCPI.json","graph_json":"https://pith.science/api/pith-number/3SQIP6PFF4ZMCWIRBPYP36XCPI/graph.json","events_json":"https://pith.science/api/pith-number/3SQIP6PFF4ZMCWIRBPYP36XCPI/events.json","paper":"https://pith.science/paper/3SQIP6PF"},"agent_actions":{"view_html":"https://pith.science/pith/3SQIP6PFF4ZMCWIRBPYP36XCPI","download_json":"https://pith.science/pith/3SQIP6PFF4ZMCWIRBPYP36XCPI.json","view_paper":"https://pith.science/paper/3SQIP6PF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05675&json=true","fetch_graph":"https://pith.science/api/pith-number/3SQIP6PFF4ZMCWIRBPYP36XCPI/graph.json","fetch_events":"https://pith.science/api/pith-number/3SQIP6PFF4ZMCWIRBPYP36XCPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SQIP6PFF4ZMCWIRBPYP36XCPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SQIP6PFF4ZMCWIRBPYP36XCPI/action/storage_attestation","attest_author":"https://pith.science/pith/3SQIP6PFF4ZMCWIRBPYP36XCPI/action/author_attestation","sign_citation":"https://pith.science/pith/3SQIP6PFF4ZMCWIRBPYP36XCPI/action/citation_signature","submit_replication":"https://pith.science/pith/3SQIP6PFF4ZMCWIRBPYP36XCPI/action/replication_record"}},"created_at":"2026-07-05T06:23:17.659245+00:00","updated_at":"2026-07-05T06:23:17.659245+00:00"}