{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2WKEMTEK7XD6HG775VDMFAWBLA","short_pith_number":"pith:2WKEMTEK","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"},"canonical_sha256":"d594464c8afdc7e39bffed46c282c158344206ce08ad2e314090e2d6e2644a8b","source":{"kind":"arxiv","id":"1705.01465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01465","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01465v1","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01465","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"2WKEMTEK7XD6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WKEMTEK7XD6HG77","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WKEMTEK","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2WKEMTEK7XD6HG775VDMFAWBLA","target":"record","payload":{"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"},"canonical_sha256":"d594464c8afdc7e39bffed46c282c158344206ce08ad2e314090e2d6e2644a8b","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"},"source_kind":"arxiv","source_id":"1705.01465","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5wUtD0I8nlNe/rABDL2lGS9Ojb8JHM325mp/Dy5hr+FYsPKlCDBnGUACq8V0v6HElWO8fOAx3/IyywdRUuGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:54.368874Z"},"content_sha256":"05ca362c724e7333c2b96912d7cbc914c35fa7c89254f63273e87335b6ddc6f1","schema_version":"1.0","event_id":"sha256:05ca362c724e7333c2b96912d7cbc914c35fa7c89254f63273e87335b6ddc6f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2WKEMTEK7XD6HG775VDMFAWBLA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7UYW811MF13QNxcudwK2uksobQmkTNmbAqxnh49ohgCO5vcQ5lFgb365PlHt9cWWORtIPOXLIYmJPSXDCyxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:54.369610Z"},"content_sha256":"cb1441a462cbdea37ce4e5e9ab97f5bf079ab0805db039ce53016273d574d8b3","schema_version":"1.0","event_id":"sha256:cb1441a462cbdea37ce4e5e9ab97f5bf079ab0805db039ce53016273d574d8b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA/bundle.json","state_url":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WKEMTEK7XD6HG775VDMFAWBLA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T16:35:54Z","links":{"resolver":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA","bundle":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA/bundle.json","state":"https://pith.science/pith/2WKEMTEK7XD6HG775VDMFAWBLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WKEMTEK7XD6HG775VDMFAWBLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2WKEMTEK7XD6HG775VDMFAWBLA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aabe782c0d6193ff5febfd5200cb9f284590cebbb30f7473cc15ccb305e99461","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-05-03T14:48:56Z","title_canon_sha256":"032ad27739d612bdf30a88dea209fe5dcdc611abfc9dce3fc90cf6df380d2582"},"schema_version":"1.0","source":{"id":"1705.01465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01465","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01465v1","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01465","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"2WKEMTEK7XD6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WKEMTEK7XD6HG77","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WKEMTEK","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:cb1441a462cbdea37ce4e5e9ab97f5bf079ab0805db039ce53016273d574d8b3","target":"graph","created_at":"2026-05-18T00:45:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Hans L. Bodlaender, Mark de Berg, S\\'andor Kisfaludi-Bak","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-05-03T14:48:56Z","title":"The Homogeneous Broadcast Problem in Narrow and Wide Strips"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01465","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:05ca362c724e7333c2b96912d7cbc914c35fa7c89254f63273e87335b6ddc6f1","target":"record","created_at":"2026-05-18T00:45:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aabe782c0d6193ff5febfd5200cb9f284590cebbb30f7473cc15ccb305e99461","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-05-03T14:48:56Z","title_canon_sha256":"032ad27739d612bdf30a88dea209fe5dcdc611abfc9dce3fc90cf6df380d2582"},"schema_version":"1.0","source":{"id":"1705.01465","kind":"arxiv","version":1}},"canonical_sha256":"d594464c8afdc7e39bffed46c282c158344206ce08ad2e314090e2d6e2644a8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d594464c8afdc7e39bffed46c282c158344206ce08ad2e314090e2d6e2644a8b","first_computed_at":"2026-05-18T00:45:05.142664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:05.142664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3BLYKdAi/rQxzbSU2nuGeHR5NZBPsP5depZ7U24xk06Ou+GKgSw5YK80MFqIhuLtZGPTS8bQZqWkY18Xc0eMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:05.143156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05ca362c724e7333c2b96912d7cbc914c35fa7c89254f63273e87335b6ddc6f1","sha256:cb1441a462cbdea37ce4e5e9ab97f5bf079ab0805db039ce53016273d574d8b3"],"state_sha256":"e9b6bf52d05dbcfd3f02b357b279c94c54e153c2d90289e6ddfb875e507c1515"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ja+1sMLST9jey1a2EjVfmtJBjyQbfjqxPCnEYz9LIUCFUBIJmZtbbBD1lwLYY9ubcX/KZwB1Pg89VNF7iV9oAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:35:54.373508Z","bundle_sha256":"f2c73c6629097c6828e671798d0a573eb956e6788b8502e347fa7086d848f47b"}}