{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5MBHRTHJV6GQCEWFQRPF5ZSWFR","short_pith_number":"pith:5MBHRTHJ","schema_version":"1.0","canonical_sha256":"eb0278cce9af8d0112c5845e5ee6562c4cf3aca2f931123c70067d5b40da2de3","source":{"kind":"arxiv","id":"1711.11116","version":1},"attestation_state":"computed","paper":{"title":"Optimal $(t,r)$ Broadcasts On the Infinite Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin F. Drews, Pamela E. Harris, Timothy W. Randolph","submitted_at":"2017-11-29T21:37:05Z","abstract_excerpt":"Let $G=(V,E)$ be a graph and $t,r$ be positive integers. The signal that a vertex $v$ receives from a tower of signal strength $t$ located at vertex $T$ is defined as $sig(v,T)=max(t-dist(v,T),0)$, where $dist(v,T)$ denotes the distance between the vertices $v$ and $T$. In 2015 Blessing, Insko, Johnson, and Mauretour defined a $(t,r)$ broadcast dominating set, or simply a $(t,r)$ broadcast, on $G$ as a set $\\mathbb{T}\\subseteq V$ such that the sum of all signal received at each vertex $v \\in V$ is at least $r$. We say that $\\mathbb{T}$ is optimal if $|\\mathbb{T}|$ is minimal among all such set"},"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":"1711.11116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-29T21:37:05Z","cross_cats_sorted":[],"title_canon_sha256":"1c1a02ba9658d4295da67f5a19b9d5b9fffe406d67c3e6a6c0ecf127e874dd71","abstract_canon_sha256":"b3c94dba5e3dfc8392971244181f4c1d7bf883889ca3b6408eb72420a9ded709"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:12.462569Z","signature_b64":"DWQ8DHShMcECZIZ1alKvkoo0EwZPjOhtFpil/T9p8UFn/GHWGeIADrvHVKm40lnm4AI9rFuQ/IO66yS6VTePBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb0278cce9af8d0112c5845e5ee6562c4cf3aca2f931123c70067d5b40da2de3","last_reissued_at":"2026-05-18T00:29:12.462105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:12.462105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal $(t,r)$ Broadcasts On the Infinite Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin F. Drews, Pamela E. Harris, Timothy W. Randolph","submitted_at":"2017-11-29T21:37:05Z","abstract_excerpt":"Let $G=(V,E)$ be a graph and $t,r$ be positive integers. The signal that a vertex $v$ receives from a tower of signal strength $t$ located at vertex $T$ is defined as $sig(v,T)=max(t-dist(v,T),0)$, where $dist(v,T)$ denotes the distance between the vertices $v$ and $T$. In 2015 Blessing, Insko, Johnson, and Mauretour defined a $(t,r)$ broadcast dominating set, or simply a $(t,r)$ broadcast, on $G$ as a set $\\mathbb{T}\\subseteq V$ such that the sum of all signal received at each vertex $v \\in V$ is at least $r$. We say that $\\mathbb{T}$ is optimal if $|\\mathbb{T}|$ is minimal among all such set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11116","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":"1711.11116","created_at":"2026-05-18T00:29:12.462191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.11116v1","created_at":"2026-05-18T00:29:12.462191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11116","created_at":"2026-05-18T00:29:12.462191+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MBHRTHJV6GQ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MBHRTHJV6GQCEWF","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MBHRTHJ","created_at":"2026-05-18T12:31:00.734936+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/5MBHRTHJV6GQCEWFQRPF5ZSWFR","json":"https://pith.science/pith/5MBHRTHJV6GQCEWFQRPF5ZSWFR.json","graph_json":"https://pith.science/api/pith-number/5MBHRTHJV6GQCEWFQRPF5ZSWFR/graph.json","events_json":"https://pith.science/api/pith-number/5MBHRTHJV6GQCEWFQRPF5ZSWFR/events.json","paper":"https://pith.science/paper/5MBHRTHJ"},"agent_actions":{"view_html":"https://pith.science/pith/5MBHRTHJV6GQCEWFQRPF5ZSWFR","download_json":"https://pith.science/pith/5MBHRTHJV6GQCEWFQRPF5ZSWFR.json","view_paper":"https://pith.science/paper/5MBHRTHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.11116&json=true","fetch_graph":"https://pith.science/api/pith-number/5MBHRTHJV6GQCEWFQRPF5ZSWFR/graph.json","fetch_events":"https://pith.science/api/pith-number/5MBHRTHJV6GQCEWFQRPF5ZSWFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MBHRTHJV6GQCEWFQRPF5ZSWFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MBHRTHJV6GQCEWFQRPF5ZSWFR/action/storage_attestation","attest_author":"https://pith.science/pith/5MBHRTHJV6GQCEWFQRPF5ZSWFR/action/author_attestation","sign_citation":"https://pith.science/pith/5MBHRTHJV6GQCEWFQRPF5ZSWFR/action/citation_signature","submit_replication":"https://pith.science/pith/5MBHRTHJV6GQCEWFQRPF5ZSWFR/action/replication_record"}},"created_at":"2026-05-18T00:29:12.462191+00:00","updated_at":"2026-05-18T00:29:12.462191+00:00"}