{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4DDZUOCGPVEDLJDNAPUD3NNP3I","short_pith_number":"pith:4DDZUOCG","schema_version":"1.0","canonical_sha256":"e0c79a38467d4835a46d03e83db5afda0211f28d1a1a076503d409eb056989aa","source":{"kind":"arxiv","id":"1908.07586","version":6},"attestation_state":"computed","paper":{"title":"Bounds On $(t,r)$ Broadcast Domination of $n$-Dimensional Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tom Shlomi","submitted_at":"2019-08-20T19:49:39Z","abstract_excerpt":"In this paper, we study a variant of graph domination known as $(t, r)$ broadcast domination, first defined in Blessing, Insko, Johnson, and Mauretour in 2015. In this variant, each broadcast provides $t-d$ reception to each vertex a distance $d < t$ from the broadcast. If $d \\ge t$ then no reception is provided. A vertex is considered dominated if it receives $r$ total reception from all broadcasts. Our main results provide some upper and lower bounds on the density of a $(t, r)$ dominating pattern of an infinite grid, as well as methods of computing them. Also, when $r \\ge 2$ we describe a f"},"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":"1908.07586","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-20T19:49:39Z","cross_cats_sorted":[],"title_canon_sha256":"9df2704ccce33caeb3b0dda941fc3e0ad622db7d87c45d854ebad99566d9540f","abstract_canon_sha256":"2f8fe6cf56c4ef7e45b602cfece6d26cdfb7fa89fc9de5702b440d684c6952d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:22:51.662137Z","signature_b64":"I64xGcQZX/xKMyM8Ub1HeCtyPJuvrptNMVm9aQtTdu9x9NAVT5r8fXSaCT2ur9s/JdJBH3SSj87Si4kaHPWnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0c79a38467d4835a46d03e83db5afda0211f28d1a1a076503d409eb056989aa","last_reissued_at":"2026-07-05T06:22:51.661686Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:22:51.661686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds On $(t,r)$ Broadcast Domination of $n$-Dimensional Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tom Shlomi","submitted_at":"2019-08-20T19:49:39Z","abstract_excerpt":"In this paper, we study a variant of graph domination known as $(t, r)$ broadcast domination, first defined in Blessing, Insko, Johnson, and Mauretour in 2015. In this variant, each broadcast provides $t-d$ reception to each vertex a distance $d < t$ from the broadcast. If $d \\ge t$ then no reception is provided. A vertex is considered dominated if it receives $r$ total reception from all broadcasts. Our main results provide some upper and lower bounds on the density of a $(t, r)$ dominating pattern of an infinite grid, as well as methods of computing them. Also, when $r \\ge 2$ we describe a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07586","kind":"arxiv","version":6},"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/1908.07586/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":"1908.07586","created_at":"2026-07-05T06:22:51.661748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07586v6","created_at":"2026-07-05T06:22:51.661748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07586","created_at":"2026-07-05T06:22:51.661748+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DDZUOCGPVED","created_at":"2026-07-05T06:22:51.661748+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DDZUOCGPVEDLJDN","created_at":"2026-07-05T06:22:51.661748+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DDZUOCG","created_at":"2026-07-05T06:22:51.661748+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/4DDZUOCGPVEDLJDNAPUD3NNP3I","json":"https://pith.science/pith/4DDZUOCGPVEDLJDNAPUD3NNP3I.json","graph_json":"https://pith.science/api/pith-number/4DDZUOCGPVEDLJDNAPUD3NNP3I/graph.json","events_json":"https://pith.science/api/pith-number/4DDZUOCGPVEDLJDNAPUD3NNP3I/events.json","paper":"https://pith.science/paper/4DDZUOCG"},"agent_actions":{"view_html":"https://pith.science/pith/4DDZUOCGPVEDLJDNAPUD3NNP3I","download_json":"https://pith.science/pith/4DDZUOCGPVEDLJDNAPUD3NNP3I.json","view_paper":"https://pith.science/paper/4DDZUOCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07586&json=true","fetch_graph":"https://pith.science/api/pith-number/4DDZUOCGPVEDLJDNAPUD3NNP3I/graph.json","fetch_events":"https://pith.science/api/pith-number/4DDZUOCGPVEDLJDNAPUD3NNP3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DDZUOCGPVEDLJDNAPUD3NNP3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DDZUOCGPVEDLJDNAPUD3NNP3I/action/storage_attestation","attest_author":"https://pith.science/pith/4DDZUOCGPVEDLJDNAPUD3NNP3I/action/author_attestation","sign_citation":"https://pith.science/pith/4DDZUOCGPVEDLJDNAPUD3NNP3I/action/citation_signature","submit_replication":"https://pith.science/pith/4DDZUOCGPVEDLJDNAPUD3NNP3I/action/replication_record"}},"created_at":"2026-07-05T06:22:51.661748+00:00","updated_at":"2026-07-05T06:22:51.661748+00:00"}