{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2WKEMTEK7XD6HG775VDMFAWBLA","short_pith_number":"pith:2WKEMTEK","schema_version":"1.0","canonical_sha256":"d594464c8afdc7e39bffed46c282c158344206ce08ad2e314090e2d6e2644a8b","source":{"kind":"arxiv","id":"1705.01465","version":1},"attestation_state":"computed","paper":{"title":"The Homogeneous Broadcast Problem in Narrow and Wide Strips","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Hans L. Bodlaender, Mark de Berg, S\\'andor Kisfaludi-Bak","submitted_at":"2017-05-03T14:48:56Z","abstract_excerpt":"Let $P$ be a set of nodes in a wireless network, where each node is modeled as a point in the plane, and let $s\\in P$ be a given source node. Each node $p$ can transmit information to all other nodes within unit distance, provided $p$ is activated. The (homogeneous) broadcast problem is to activate a minimum number of nodes such that in the resulting directed communication graph, the source $s$ can reach any other node. We study the complexity of the regular and the hop-bounded version of the problem (in the latter, $s$ must be able to reach every node within a specified number of hops), with "},"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":"1705.01465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-05-03T14:48:56Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"032ad27739d612bdf30a88dea209fe5dcdc611abfc9dce3fc90cf6df380d2582","abstract_canon_sha256":"aabe782c0d6193ff5febfd5200cb9f284590cebbb30f7473cc15ccb305e99461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:05.143156Z","signature_b64":"3BLYKdAi/rQxzbSU2nuGeHR5NZBPsP5depZ7U24xk06Ou+GKgSw5YK80MFqIhuLtZGPTS8bQZqWkY18Xc0eMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d594464c8afdc7e39bffed46c282c158344206ce08ad2e314090e2d6e2644a8b","last_reissued_at":"2026-05-18T00:45:05.142664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:05.142664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Homogeneous Broadcast Problem in Narrow and Wide Strips","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Hans L. Bodlaender, Mark de Berg, S\\'andor Kisfaludi-Bak","submitted_at":"2017-05-03T14:48:56Z","abstract_excerpt":"Let $P$ be a set of nodes in a wireless network, where each node is modeled as a point in the plane, and let $s\\in P$ be a given source node. Each node $p$ can transmit information to all other nodes within unit distance, provided $p$ is activated. The (homogeneous) broadcast problem is to activate a minimum number of nodes such that in the resulting directed communication graph, the source $s$ can reach any other node. We study the complexity of the regular and the hop-bounded version of the problem (in the latter, $s$ must be able to reach every node within a specified number of hops), with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01465","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":"1705.01465","created_at":"2026-05-18T00:45:05.142742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01465v1","created_at":"2026-05-18T00:45:05.142742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01465","created_at":"2026-05-18T00:45:05.142742+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WKEMTEK7XD6","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WKEMTEK7XD6HG77","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WKEMTEK","created_at":"2026-05-18T12:30:55.937587+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/2WKEMTEK7XD6HG775VDMFAWBLA","json":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA.json","graph_json":"https://pith.science/api/pith-number/2WKEMTEK7XD6HG775VDMFAWBLA/graph.json","events_json":"https://pith.science/api/pith-number/2WKEMTEK7XD6HG775VDMFAWBLA/events.json","paper":"https://pith.science/paper/2WKEMTEK"},"agent_actions":{"view_html":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA","download_json":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA.json","view_paper":"https://pith.science/paper/2WKEMTEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01465&json=true","fetch_graph":"https://pith.science/api/pith-number/2WKEMTEK7XD6HG775VDMFAWBLA/graph.json","fetch_events":"https://pith.science/api/pith-number/2WKEMTEK7XD6HG775VDMFAWBLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA/action/storage_attestation","attest_author":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA/action/author_attestation","sign_citation":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA/action/citation_signature","submit_replication":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA/action/replication_record"}},"created_at":"2026-05-18T00:45:05.142742+00:00","updated_at":"2026-05-18T00:45:05.142742+00:00"}