{"id":218,"date":"2021-06-23T03:37:30","date_gmt":"2021-06-23T03:37:30","guid":{"rendered":"http:\/\/www.podc.org\/podc2021\/?page_id=218"},"modified":"2021-10-29T14:41:40","modified_gmt":"2021-10-29T14:41:40","slug":"program","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2021\/program\/","title":{"rendered":"Schedule and Program"},"content":{"rendered":"\n

Schedule<\/h1>\n\n\n\n

All times are in Central European Summer Time (CEST = UTC + 2).<\/p>\n\n\n\n\n \n \n \n <\/colgroup>\n \n \n \n\n \n \n \n \n \n \n
Monday, July 26<\/th>\n<\/thead>\n
15:00 – 15:05<\/td>\n Opening Remarks<\/td>\n <\/tr>\n
15:05 – 16:35<\/td>\n Keynote Session: Cynthia Dwork<\/a><\/td>\n <\/tr>\n
Break (15 minutes)<\/td>\n <\/tr>\n
16:50 – 17:50<\/td>\n Session 1: Robots, Dynamics, and Population Protocols<\/a><\/td>\n <\/tr>\n
Break (15 minutes)<\/td>\n <\/tr>\n
18:05 – 19:05<\/td>\n Session 2: Biological Algorithms, Contention Resolution, and Radio Networks<\/a><\/td>\n <\/tr>\n <\/tbody>\n<\/table>\n\n\n\n\n \n \n \n <\/colgroup>\n \n \n \n\n \n \n \n \n \n \n \n
Tuesday, July 27<\/th>\n<\/thead>\n
15:00 – 15:40<\/td>\n Gem Session<\/a>: Laurent Feuilloley<\/a><\/td>\n <\/tr>\n
Break (5 minutes)<\/td>\n <\/tr>\n
15:45 – 16:30<\/td>\n Session 3: Blockchains<\/a><\/td>\n <\/tr>\n
Break (15 minutes)<\/td>\n <\/tr>\n
16:45 – 17:30<\/td>\n Session 4: Shortcuts, Spanners, and Message Complexity<\/a><\/td>\n <\/tr>\n
Break (15 minutes)<\/td>\n <\/tr>\n
17:45 – 19:15<\/td>\n Awards Session and Business Meeting<\/td>\n <\/tr>\n <\/tbody>\n<\/table>\n\n\n\n\n \n \n \n <\/colgroup>\n \n \n \n\n \n \n \n \n \n \n \n
Wednesday, July 28<\/th>\n<\/thead>\n
15:00 – 15:40<\/td>\n Gem Session<\/a>: Naama Ben-David<\/a><\/td>\n <\/tr>\n
Break (5 minutes)<\/td>\n <\/tr>\n
15:45 – 16:30<\/td>\n Session 5: Local Graph Problems<\/a><\/td>\n <\/tr>\n
Break (15 minutes)<\/td>\n <\/tr>\n
16:45 – 17:30<\/td>\n Session 6: Byzantine Agreement and Broadcast<\/a><\/td>\n <\/tr>\n
Break (15 minutes)<\/td>\n <\/tr>\n
17:45 – 18:30<\/td>\n Session 7: Distributed ML, Topology, and Parallel Algorithms<\/a><\/td>\n <\/tr>\n <\/tbody>\n<\/table>\n\n\n\n\n \n \n \n <\/colgroup>\n \n \n \n\n \n\n \n \n \n \n \n
Thursday, July 29<\/th>\n<\/thead>\n
15:00 – 16:30<\/td>\n Keynote Session: Kyle Kingsbury<\/a><\/td>\n <\/tr>\n
Break (15 minutes)<\/td>\n <\/tr>\n
16:45 – 17:30<\/td>\n Session 8: Fault Tolerance, MPC, and Shortest Paths<\/a><\/td>\n <\/tr>\n
Break (15 minutes)<\/td>\n <\/tr>\n
17:45 – 18:45<\/td>\n Session 9: Concurrency and Shared Memory<\/a><\/td>\n <\/tr>\n
18:45 – 18:50<\/td>\n Closing Remarks<\/td>\n <\/tr>\n <\/tbody>\n<\/table>\n\n\n\n\n \n \n \n <\/colgroup>\n \n \n \n\n \n\n
Workshops & Tutorials – Thursday, July 29<\/th>\n<\/thead>\n
19:00 – 21:00<\/td>\n Biological Distributed Algorithms (BDA) – Day 1<\/a><\/td>\n <\/tr>\n <\/tbody>\n<\/table>\n\n\n\n\n \n \n \n <\/colgroup>\n \n \n \n\n \n\n \n \n \n \n
Workshops & Tutorials – Friday, July 30<\/th>\n<\/thead>\n
13:00 – 21:00<\/td>\n Distributed Algorithms on Realistic Network Models (DARe)<\/a><\/td>\n <\/tr>\n \n
15:00 – 19:20<\/td>\n Workshop on Advanced Tools, Programming Languages, and Platforms for Implementing and Evaluating Algorithms for Distributed Systems (ApPLIED)<\/a><\/td>\n <\/tr>\n\n
15:00 – 18:00<\/td>\n Byzantine Agreement and Leader Election: From Classical to the Modern<\/a><\/td>\n <\/tr>\n\n
15:00 – 18:00<\/td>\n Interaction-Oriented Programming: An Application Semantics Approach for Engineering Decentralized Applications<\/a><\/td>\n <\/tr>\n\n\n
17:00 – 19:00<\/td>\n Biological Distributed Algorithms (BDA) – Day 2<\/a><\/td>\n <\/tr>\n <\/tbody>\n<\/table>\n\n\n\n\n \n \n \n <\/colgroup>\n \n \n \n\n \n\n
Workshops & Tutorials – Saturday, July 31<\/th>\n<\/thead>\n
15:00 – 17:45<\/td>\n Security and Privacy for Distributed Optimization & Distributed Machine Learning<\/a><\/td>\n <\/tr>\n \n\n <\/tbody>\n<\/table>\n\n\n\n

Program<\/h1>\n\n\n\n

All times are in Central European Summer Time (CEST = UTC + 2).
Click on the time to see it in your own time zone.
Click on the name of a talk to access the paper.
Click on “video” next to a talk to access the long version of the talk.<\/p>\n\n\n\n

Monday, July 26<\/h2>\n\n\n\n
\n
15:00 \u2013 15:05<\/a> Opening Remarks<\/h5>\n\n\n\n
15:05 \u2013 16:35<\/a> Keynote Session: Cynthia Dwork<\/a><\/h5>\n\n\n\n
<\/div><\/div>\n\n\n\n
16:50-17:50<\/a> Session 1: Robots, Dynamics, and Population Protocols<\/h5>\n\n\n\n

Session Chair:<\/strong> Gadi Taubenfeld<\/p>\n\n\n\n

\n
D. Kirkpatrick, I. Kostitsyna, A. Navarra, G. Prencipe, N. Santoro<\/td>Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility<\/a><\/td>video<\/a><\/td><\/tr>
K. Altisen, S. Devismes, A. Durand, C. Johnen, F. Petit<\/td>On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics<\/a><\/td>video<\/a><\/td><\/tr>
J. Burman, H. Chen, H. Chen, D. Doty, T. Nowak, E. Severson, C. Xu<\/td>Time-Optimal Self-Stabilizing Leader Election in Population Protocols<\/a><\/td>video<\/a><\/td><\/tr>
P. Czerner, J. Esparza<\/td>Lower Bounds on the State Complexity of Population Protocols<\/a><\/td>video<\/a><\/td><\/tr>
D. Alistarh, M. T\u00f6pfer, P. Uzna\u0144ski<\/td>Fast and Robust Comparison Dynamics in Population Protocols<\/a><\/td>video<\/a><\/td><\/tr>
N. Kang, F. Mallmann-Trenn, N. Rivera<\/td>Diversity, Fairness and Sustainability in Population Protocols<\/a><\/td>video<\/a><\/td><\/tr>
D. Doty, M. Eftekhari, L. G\u0105sieniec, E. Severson, G. Stachowiak, P. Uzna\u0144ski<\/td>Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority<\/a><\/td>video<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

<\/p>\n<\/div><\/div>\n\n\n\n

18:05 \u2013 19:05<\/a> Session 2: Biological Algorithms, Contention Resolution, and Radio Networks<\/h5>\n\n\n\n

Session Chair:<\/strong> Boaz Patt-Shamir <\/p>\n\n\n\n

A. Clementi, F. d\u2019Amore, G. Giakkoupis, E. Natale<\/td>Search via Parallel L\u00e9vy Walks on Z^2<\/a><\/td>video<\/a><\/td><\/tr>
Y. Emek, E. Keren<\/td>A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks<\/a><\/td>video<\/a><\/td><\/tr>
F. Dufoulon, S. Kutten, W. Moses Jr.<\/td>Efficient Deterministic Leader Election for Programmable Matter<\/a><\/td>video<\/a><\/td><\/tr>
P. Czerner, R. Guttenberg, M. Helfrich, J. Esparza<\/td>Decision Power of Weak Asynchronous Models of Distributed Computing<\/a><\/td>video<\/a><\/td><\/tr>
S. Gilbert, C. Newport, N. Vaidya, A. Weaver<\/td>Contention Resolution with Predictions<\/a><\/td>video<\/a><\/td><\/tr>
H. Chen, Y. Jiang, C. Zheng<\/td>Tight Trade-off in Contention Resolution without Collision Detection<\/a><\/td>video<\/a><\/td><\/tr>
V. Dani, A. Gupta, T. Hayes, S. Pettie<\/td>Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks<\/a><\/td>video<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Tuesday, July 27<\/h2>\n\n\n\n

15:00 \u2013 15:40<\/a> Gem Session: Laurent Feuilloley<\/a><\/h5>\n\n\n\n
15:45 \u2013 16:30<\/a> Session 3: Blockchains<\/h5>\n\n\n\n

Session Chair:<\/strong> Yoram Moses<\/p>\n\n\n\n

\n
Y. Xue, M. Herlihy<\/td>Hedging Against Sore Loser Attacks in Cross-Chain Transactions<\/a><\/td>video<\/a><\/td><\/tr>
I. Keidar, E. Kokoris-Kogias, O. Naor, A. Spiegelman<\/td>All You Need is DAG<\/a><\/td>video<\/a><\/td><\/tr>
M. Schett, G. Danezis<\/td>Embedding a Deterministic BFT Protocol in a Block DAG<\/a><\/td>video<\/a><\/td><\/tr>
R. Gelashvili, L. Kokoris-Kogias, A. Spiegelman, Z. Xiang<\/td>Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol<\/a><\/td>video<\/a><\/td><\/tr>
N. Ben-David, K. Nayak<\/td>Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication<\/a><\/td>video<\/a><\/td><\/tr>
M. Rambaud, T. Attema, M. Abspoel<\/td>Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders<\/a><\/td>video<\/a><\/td><\/tr>
E. Chan, M. Lesani<\/td>Brief Announcement: Brokering with Hashed Timelock Contracts is NP-Hard<\/a><\/td>video<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

<\/p>\n<\/div><\/div>\n\n\n\n

16:45 \u2013 17:30<\/a> Session 4: Shortcuts, Spanners, and Message Complexity<\/h5>\n\n\n\n

Session Chair:<\/strong> Peter Davies<\/p>\n\n\n\n

\n
S. Kogan, M. Parter<\/td>Low-Congestion Shortcuts in Constant Diameter Graphs<\/a><\/td>video<\/a><\/td><\/tr>
M. Ghaffari, B. Haeupler<\/td>Low-Congestion Shortcuts for Graphs Excluding Dense Minors<\/a><\/td>video<\/a><\/td><\/tr>
M. Dory, O. Fischer, S. Khoury, D. Leitersdorf<\/td>Constant-Round Spanners and Shortest Paths in Congested Clique and MPC<\/a><\/td>video<\/a><\/td><\/tr>
M. Elkin, S. Matar<\/td>Ultra-Sparse Near-Additive Emulators<\/a><\/td>video<\/a><\/td><\/tr>
S. Pai, G. Pandurangan, S. Pemmaraju, P. Robinson<\/td>Can We Break Symmetry with o(m) Communication?<\/a><\/td>video<\/a><\/td><\/tr>
M. Kumar, A. Molla<\/td>Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement<\/a><\/td>video<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n<\/div><\/div>\n\n\n\n
17:45 \u2013 19:15<\/a> Awards Session and Business Meeting<\/h5>\n\n\n\n

Wednesday, July 28<\/h2>\n\n\n\n

15:00 \u2013 15:40<\/a> Gem Session: Naama Ben-David<\/a><\/h5>\n\n\n\n
15:45 \u2013 16:30<\/a> Session 5: Local Graph Problems<\/h5>\n\n\n\n

Session Chair:<\/strong> Ran Gelles<\/p>\n\n\n\n

\n
A. Balliu, S. Brandt, D. Olivetti, J. Studen\u00fd, J. Suomela, A. Tereshchenko<\/td>Locally Checkable Problems in Rooted Trees<\/a><\/td>video<\/a><\/td><\/tr>
Y. Chang, M. Ghaffari<\/td>Strong-Diameter Network Decomposition<\/a><\/td>video<\/a><\/td><\/tr>
A. Balliu, S. Brandt, F. Kuhn, D. Olivetti<\/td>Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees<\/a><\/td>video<\/a><\/td><\/tr>
D. Harris, H. Su, H. Vu<\/td>On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition<\/a><\/td>video<\/a><\/td><\/tr>
S. Brandt, C. Grunau, V. Rozhon<\/td>The Randomized Local Computation Complexity of the Lov\u00e1sz Local Lemma<\/a><\/td>video<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

<\/p>\n<\/div><\/div>\n\n\n\n

16:45 \u2013 17:30<\/a> Session 6: Byzantine Agreement and Broadcast<\/h5>\n\n\n\n

Session Chair:<\/strong> Alexander Spiegelman<\/p>\n\n\n\n

\n
E. Boyle, R. Cohen, A. Goel<\/td>Breaking the O(sqrt n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party<\/a><\/td>video<\/a><\/td><\/tr>
I. Abraham, K. Nayak, L. Ren, Z. Xiang<\/td>Good-case Latency of Byzantine Broadcast: a Complete Categorization<\/a><\/td>video<\/a><\/td><\/tr>
P. Kuznetsov, A. Tonkikh, Y. Zhang<\/td>Revisiting Optimal Resilience of Fast Byzantine Consensus<\/a><\/td>video<\/a><\/td><\/tr>
M. Fitzi, C. Liu-Zhang, J. Loss<\/td>A New Way to Achieve Round-Efficient Byzantine Agreement<\/a><\/td>video<\/a><\/td><\/tr>
G. Stern, I. Abraham, P. Jovanovic, S. Meiklejohn, A. Tomescu, M. Maller<\/td>Reaching Consensus for Asynchronous Distributed Key Generation<\/a><\/td>video<\/a><\/td><\/tr>
J. Kim, V. Mehta, K. Nayak, N. Shrestha<\/td>Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults<\/a><\/td>video<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n<\/div><\/div>\n\n\n\n
17:45 \u2013 18:30<\/a> Session 7: Distributed ML, Topology, and Parallel Algorithms<\/h5>\n\n\n\n

Session Chair:<\/strong> Christian Scheideler<\/p>\n\n\n\n

S. Liu, N. Gupta, N. Vaidya<\/td>Approximate Byzantine Fault-Tolerance in Distributed Optimization<\/a><\/td>video<\/a><\/td><\/tr>
R. Guerraoui, N. Gupta, R. Pinot, S. Rouault, J. Stephan<\/td>Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?<\/a><\/td>video<\/a><\/td><\/tr>
G. Goren, S. Vargaftik, Y. Moses<\/td>Stochastic Coordination in Heterogeneous Load Balancing Systems<\/a><\/td>video<\/a><\/td><\/tr>
P. Fraigniaud, R. Gelles, Z. Lotker<\/td>The Topology of Randomized Symmetry-Breaking Distributed Computing<\/a><\/td>video<\/a><\/td><\/tr>
J. Ledent<\/td>Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes<\/a><\/td>video<\/a><\/td><\/tr>
M. Charikar, W. Ma, L. Tan<\/td>Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity<\/a><\/td>video<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Thursday, July 29<\/h2>\n\n\n\n

15:00 \u2013 16:30<\/a> Keynote Session: Kyle Kingsbury<\/a><\/h5>\n\n\n\n
16:45 \u2013 17:30<\/a> Session 8: Fault Tolerance, MPC, and Shortest Paths<\/h5>\n\n\n\n

Session Chair:<\/strong> Valerie King<\/p>\n\n\n\n

\n
G. Bodwin, M. Parter<\/td>Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs<\/a>
(best paper award)<\/strong><\/td>		video<\/a><\/td><\/tr>
M. Dory, M. Parter<\/td>Fault-Tolerant Labeling and Compact Routing Schemes<\/a><\/td>video<\/a><\/td><\/tr>
T. G\u00f6tte, K. Hinnenthal, C. Scheideler, J. Werthmann<\/td>Time-Optimal Construction of Overlay Networks<\/a><\/td>video<\/a><\/td><\/tr>
 A. Czumaj, P. Davies, M. Parter<\/td>Improved Deterministic $(Delta+1)$ Coloring in Low-Space MPC<\/a><\/td>video<\/a><\/td><\/tr>
A. Czumaj, P. Davies, M. Parter<\/td>Component Stability in Low-Space Massively Parallel Computation<\/a><\/td>video<\/a><\/td><\/tr>
N. Cao, J. Fineman, K. Russell<\/td>Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm<\/a><\/td>video<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

<\/p>\n<\/div><\/div>\n\n\n\n

17:45 \u2013 18:45<\/a> Session 9: Concurrency and Shared Memory<\/h5>\n\n\n\n

Session Chair:<\/strong> Trevor Brown<\/p>\n\n\n\n

\n
K. Brusse, F. Ellen<\/td>Reductions and Extension-Based Proofs<\/a><\/td>video<\/a><\/td><\/tr>
S. Ovens<\/td>The Space Complexity of Scannable Binary Objects<\/a><\/td>video<\/a><\/td><\/tr>
V. Hadzilacos, X. Hu, S. Toueg<\/td>On Register Linearizability and Termination<\/a><\/td>video<\/a><\/td><\/tr>
D. Chan, P. Woelfel<\/td>A Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion<\/a><\/td>video<\/a><\/td><\/tr>
B. Bashari, P. Woelfel<\/td>An Efficient Adaptive Partial Snapshot Implementation<\/a><\/td>video<\/a><\/td><\/tr>
N. Li, W. Golab<\/td>Brief Announcement: Detectable Sequential Specifications for Recoverable Shared Objects<\/a><\/td>video<\/a><\/td><\/tr>
G. Sela, M. Herlihy, E. Petrank<\/td>Brief Announcement: Linearizability: A Typo<\/a><\/td>video<\/a><\/td><\/tr>
S. Chand, Y. Liu<\/td>Brief Announcement: What’s Live? Understanding Distributed Consensus<\/a><\/td>video<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n<\/div><\/div>\n\n\n\n
18:45 \u2013 18:50<\/a> Closing Remarks<\/h5>\n\n\n\n

Workshops & Tutorials \u2013 Thursday, July 29<\/strong><\/h2>\n\n\n\n
19:00 \u2013 21:00<\/a> Biological Distributed Algorithms (BDA) \u2013 Day 1<\/a><\/h5>\n\n\n\n

Workshops & Tutorials \u2013 Friday, July 30<\/strong><\/strong><\/h2>\n\n\n\n
13:00 \u2013 21:00<\/a> Distributed Algorithms on Realistic Network Models (DARe)<\/a><\/h5>\n\n\n\n
15:00 \u2013 19:20<\/a> Workshop on Advanced Tools, Programming Languages, and Platforms for Implementing and Evaluating Algorithms for Distributed Systems (ApPLIED)<\/a><\/h5>\n\n\n\n
15:00 \u2013 18:00<\/a> Byzantine Agreement and Leader Election: From Classical to the Modern<\/a><\/h5>\n\n\n\n
15:00 \u2013 18:00<\/a> Interaction-Oriented Programming: An Application Semantics Approach for Engineering Decentralized Applications<\/a><\/h5>\n\n\n\n
17:00 \u2013 19:00<\/a> Biological Distributed Algorithms (BDA) \u2013 Day 2<\/a><\/h5>\n\n\n\n

Workshops & Tutorials \u2013 Saturday, July 31<\/strong><\/strong><\/h2>\n\n\n\n
15:00 \u2013 17:45<\/a> Security and Privacy for Distributed Optimization & Distributed Machine Learning<\/a><\/h5>\n\n\n\n

<\/p>\n<\/div><\/div>\n\n\n\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

Schedule All times are in Central European Summer Time (CEST = UTC + 2). Monday, July 26 15:00 – 15:05 Opening Remarks 15:05 – 16:35 Keynote Session: Cynthia Dwork Break (15 minutes) 16:50 – 17:50 Session 1: Robots, Dynamics, and Population Protocols Break (15 minutes) 18:05 – 19:05 Session 2: Biological Algorithms, Contention Resolution, and … Continue reading “Schedule and Program”<\/span><\/a><\/p>\n","protected":false},"author":13,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-218","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages\/218","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/users\/13"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/comments?post=218"}],"version-history":[{"count":88,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages\/218\/revisions"}],"predecessor-version":[{"id":419,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages\/218\/revisions\/419"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/media?parent=218"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}