---
_id: '11951'
abstract:
- lang: eng
text: The mammalian hippocampal formation (HF) plays a key role in several higher
brain functions, such as spatial coding, learning and memory. Its simple circuit
architecture is often viewed as a trisynaptic loop, processing input originating
from the superficial layers of the entorhinal cortex (EC) and sending it back
to its deeper layers. Here, we show that excitatory neurons in layer 6b of the
mouse EC project to all sub-regions comprising the HF and receive input from the
CA1, thalamus and claustrum. Furthermore, their output is characterized by unique
slow-decaying excitatory postsynaptic currents capable of driving plateau-like
potentials in their postsynaptic targets. Optogenetic inhibition of the EC-6b
pathway affects spatial coding in CA1 pyramidal neurons, while cell ablation impairs
not only acquisition of new spatial memories, but also degradation of previously
acquired ones. Our results provide evidence of a functional role for cortical
layer 6b neurons in the adult brain.
acknowledged_ssus:
- _id: Bio
- _id: SSU
acknowledgement: We thank F. Marr and A. Schlögl for technical assistance, E. Kralli-Beller
for manuscript editing, as well as C. Sommer and the Imaging and Optics Facility
of the Institute of Science and Technology Austria (ISTA) for image analysis scripts
and microscopy support. We extend our gratitude to J. Wallenschus and D. Rangel
Guerrero for technical assistance acquiring single-unit data and I. Gridchyn for
help with single-unit clustering. Finally, we also thank B. Suter for discussions,
A. Saunders, M. Jösch, and H. Monyer for critically reading earlier versions of
the manuscript, C. Petersen for sharing clearing protocols, and the Scientific Service
Units of ISTA for efficient support. This project was funded by the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(ERC advanced grant No 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen
Forschung (Z 312-B27, Wittgenstein award for P.J. and I3600-B27 for J.G.D. and P.V.).
article_number: '4826'
article_processing_charge: No
article_type: original
author:
- first_name: Yoav
full_name: Ben Simon, Yoav
id: 43DF3136-F248-11E8-B48F-1D18A9856A87
last_name: Ben Simon
- first_name: Karola
full_name: Käfer, Karola
id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87
last_name: Käfer
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. A direct
excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes
to spatial coding and memory. Nature Communications. 2022;13. doi:10.1038/s41467-022-32559-8
apa: Ben Simon, Y., Käfer, K., Velicky, P., Csicsvari, J. L., Danzl, J. G., &
Jonas, P. M. (2022). A direct excitatory projection from entorhinal layer 6b neurons
to the hippocampus contributes to spatial coding and memory. Nature Communications.
Springer Nature. https://doi.org/10.1038/s41467-022-32559-8
chicago: Ben Simon, Yoav, Karola Käfer, Philipp Velicky, Jozsef L Csicsvari, Johann
G Danzl, and Peter M Jonas. “A Direct Excitatory Projection from Entorhinal Layer
6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” Nature
Communications. Springer Nature, 2022. https://doi.org/10.1038/s41467-022-32559-8.
ieee: Y. Ben Simon, K. Käfer, P. Velicky, J. L. Csicsvari, J. G. Danzl, and P. M.
Jonas, “A direct excitatory projection from entorhinal layer 6b neurons to the
hippocampus contributes to spatial coding and memory,” Nature Communications,
vol. 13. Springer Nature, 2022.
ista: Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. 2022. A
direct excitatory projection from entorhinal layer 6b neurons to the hippocampus
contributes to spatial coding and memory. Nature Communications. 13, 4826.
mla: Ben Simon, Yoav, et al. “A Direct Excitatory Projection from Entorhinal Layer
6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” Nature
Communications, vol. 13, 4826, Springer Nature, 2022, doi:10.1038/s41467-022-32559-8.
short: Y. Ben Simon, K. Käfer, P. Velicky, J.L. Csicsvari, J.G. Danzl, P.M. Jonas,
Nature Communications 13 (2022).
date_created: 2022-08-24T08:25:50Z
date_published: 2022-08-16T00:00:00Z
date_updated: 2023-08-03T13:01:19Z
day: '16'
ddc:
- '570'
department:
- _id: JoCs
- _id: PeJo
- _id: JoDa
doi: 10.1038/s41467-022-32559-8
ec_funded: 1
external_id:
isi:
- '000841396400008'
file:
- access_level: open_access
checksum: 405936d9e4d33625d80c093c9713a91f
content_type: application/pdf
creator: dernst
date_created: 2022-08-26T11:51:40Z
date_updated: 2022-08-26T11:51:40Z
file_id: '11990'
file_name: 2022_NatureCommunications_BenSimon.pdf
file_size: 5910357
relation: main_file
success: 1
file_date_updated: 2022-08-26T11:51:40Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
keyword:
- General Physics and Astronomy
- General Biochemistry
- Genetics and Molecular Biology
- General Chemistry
- Multidisciplinary
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glumatergic synapse
- _id: 265CB4D0-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03600
name: Optical control of synaptic function via adhesion molecules
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: The Wittgenstein Prize
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus
contributes to spatial coding and memory
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2022'
...
---
_id: '11991'
abstract:
- lang: eng
text: The study of the complexity of the constraint satisfaction problem (CSP),
centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in
the last two decades. After a long concerted effort and many partial results,
the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and
Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP,
has started to gain prominence. In this survey, we explain the importance of promise
CSP and highlight many new very interesting features that the study of promise
CSP has brought to light. The complexity classification quest for the promise
CSP is wide open, and we argue that, despite the promise CSP being more general,
this quest is rather more accessible to a wide range of researchers than the dichotomy-led
study of the CSP has been.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Andrei
full_name: Krokhin, Andrei
last_name: Krokhin
- first_name: Jakub
full_name: Opršal, Jakub
id: ec596741-c539-11ec-b829-c79322a91242
last_name: Opršal
orcid: 0000-0003-1245-3456
citation:
ama: Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem.
ACM SIGLOG News. 2022;9(3):30-59. doi:10.1145/3559736.3559740
apa: Krokhin, A., & Opršal, J. (2022). An invitation to the promise constraint
satisfaction problem. ACM SIGLOG News. Association for Computing Machinery.
https://doi.org/10.1145/3559736.3559740
chicago: Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint
Satisfaction Problem.” ACM SIGLOG News. Association for Computing Machinery,
2022. https://doi.org/10.1145/3559736.3559740.
ieee: A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction
problem,” ACM SIGLOG News, vol. 9, no. 3. Association for Computing Machinery,
pp. 30–59, 2022.
ista: Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction
problem. ACM SIGLOG News. 9(3), 30–59.
mla: Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint
Satisfaction Problem.” ACM SIGLOG News, vol. 9, no. 3, Association for
Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740.
short: A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.
date_created: 2022-08-27T11:23:37Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2022-09-05T08:19:38Z
day: '01'
department:
- _id: UlWa
doi: 10.1145/3559736.3559740
external_id:
arxiv:
- '2208.13538'
intvolume: ' 9'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/2208.13538
month: '07'
oa: 1
oa_version: Preprint
page: 30-59
publication: ACM SIGLOG News
publication_identifier:
issn:
- 2372-3491
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: An invitation to the promise constraint satisfaction problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2022'
...
---
_id: '11993'
abstract:
- lang: eng
text: Moulding refers to a set of manufacturing techniques in which a mould, usually
a cavity or a solid frame, is used to shape a liquid or pliable material into
an object of the desired shape. The popularity of moulding comes from its effectiveness,
scalability and versatility in terms of employed materials. Its relevance as a
fabrication process is demonstrated by the extensive literature covering different
aspects related to mould design, from material flow simulation to the automation
of mould geometry design. In this state-of-the-art report, we provide an extensive
review of the automatic methods for the design of moulds, focusing on contributions
from a geometric perspective. We classify existing mould design methods based
on their computational approach and the nature of their target moulding process.
We summarize the relationships between computational approaches and moulding techniques,
highlighting their strengths and limitations. Finally, we discuss potential future
research directions.
article_processing_charge: No
article_type: original
author:
- first_name: Thomas
full_name: Alderighi, Thomas
last_name: Alderighi
- first_name: Luigi
full_name: Malomo, Luigi
last_name: Malomo
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Paulo
full_name: Cignoni, Paulo
last_name: Cignoni
- first_name: Nico
full_name: Pietroni, Nico
last_name: Pietroni
citation:
ama: Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. State of
the art in computational mould design. Computer Graphics Forum. 2022;41(6):435-452.
doi:10.1111/cgf.14581
apa: Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P., & Pietroni,
N. (2022). State of the art in computational mould design. Computer Graphics
Forum. Wiley. https://doi.org/10.1111/cgf.14581
chicago: Alderighi, Thomas, Luigi Malomo, Thomas Auzinger, Bernd Bickel, Paulo Cignoni,
and Nico Pietroni. “State of the Art in Computational Mould Design.” Computer
Graphics Forum. Wiley, 2022. https://doi.org/10.1111/cgf.14581.
ieee: T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, and N. Pietroni,
“State of the art in computational mould design,” Computer Graphics Forum,
vol. 41, no. 6. Wiley, pp. 435–452, 2022.
ista: Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. 2022.
State of the art in computational mould design. Computer Graphics Forum. 41(6),
435–452.
mla: Alderighi, Thomas, et al. “State of the Art in Computational Mould Design.”
Computer Graphics Forum, vol. 41, no. 6, Wiley, 2022, pp. 435–52, doi:10.1111/cgf.14581.
short: T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, N. Pietroni,
Computer Graphics Forum 41 (2022) 435–452.
date_created: 2022-08-28T18:17:01Z
date_published: 2022-09-01T00:00:00Z
date_updated: 2023-08-03T13:21:55Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1111/cgf.14581
external_id:
isi:
- '000842638900001'
file:
- access_level: open_access
checksum: c40cc8ceb7b7f0512172b883d712198e
content_type: application/pdf
creator: bbickel
date_created: 2022-08-28T18:18:08Z
date_updated: 2022-08-28T18:18:08Z
description: 'This is the pre-peer reviewed version of the following article: Alderighi,
T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P. and Pietroni, N. (2022),
State of the Art in Computational Mould Design. Computer Graphics Forum, which
has been published in final form at https://doi.org/10.1111/cgf.14581. This article
may be used for non-commercial purposes in accordance with Wiley Terms and Conditions
for Use of Self-Archived Versions.'
file_id: '11994'
file_name: star_molding_preprint.pdf
file_size: 32480850
relation: main_file
title: pre-peer reviewed version
file_date_updated: 2022-08-28T18:18:08Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '6'
keyword:
- Computer Graphics and Computer-Aided Design
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 435-452
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: State of the art in computational mould design
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2022'
...
---
_id: '11995'
abstract:
- lang: eng
text: G protein-coupled receptors (GPCRs) regulate processes ranging from immune
responses to neuronal signaling. However, ligands for many GPCRs remain unknown,
suffer from off-target effects or have poor bioavailability. Additionally, dissecting
cell type-specific responses is challenging when the same GPCR is expressed on
different cells within a tissue. Here, we overcome these limitations by engineering
DREADD-based GPCR chimeras that bind clozapine-N-oxide and mimic a GPCR-of-interest.
We show that chimeric DREADD-β2AR triggers responses comparable to β2AR on second
messenger and kinase activity, post-translational modifications, and protein-protein
interactions. Moreover, we successfully recapitulate β2AR-mediated filopodia formation
in microglia, an immune cell capable of driving central nervous system inflammation.
When dissecting microglial inflammation, we included two additional DREADD-based
chimeras mimicking microglia-enriched GPR65 and GPR109A. DREADD-β2AR and DREADD-GPR65
modulate the inflammatory response with high similarity to endogenous β2AR, while
DREADD-GPR109A shows no impact. Our DREADD-based approach allows investigation
of cell type-dependent pathways without known endogenous ligands.
acknowledged_ssus:
- _id: PreCl
- _id: Bio
- _id: LifeSc
acknowledgement: The authors thank the Scientific Service Units at ISTA, in particular
the Molecular Biology Service of the Lab Support Facility, Imaging & Optics Facility,
and the Preclinical Facility, and the Novarino group, Harald Janoviak, and Marco
Benevento for sharing reagents and expertise. This research was supported by a DOC
Fellowship (24979) awarded to R.S. by the Austrian Academy of Sciences.
article_number: '4728'
article_processing_charge: No
article_type: original
author:
- first_name: Rouven
full_name: Schulz, Rouven
id: 4C5E7B96-F248-11E8-B48F-1D18A9856A87
last_name: Schulz
orcid: 0000-0001-5297-733X
- first_name: Medina
full_name: Korkut, Medina
id: 4B51CE74-F248-11E8-B48F-1D18A9856A87
last_name: Korkut
orcid: 0000-0003-4309-2251
- first_name: Alessandro
full_name: Venturino, Alessandro
id: 41CB84B2-F248-11E8-B48F-1D18A9856A87
last_name: Venturino
orcid: 0000-0003-2356-9403
- first_name: Gloria
full_name: Colombo, Gloria
id: 3483CF6C-F248-11E8-B48F-1D18A9856A87
last_name: Colombo
orcid: 0000-0001-9434-8902
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
citation:
ama: Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. Chimeric GPCRs mimic
distinct signaling pathways and modulate microglia responses. Nature Communications.
2022;13. doi:10.1038/s41467-022-32390-1
apa: Schulz, R., Korkut, M., Venturino, A., Colombo, G., & Siegert, S. (2022).
Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses.
Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-022-32390-1
chicago: Schulz, Rouven, Medina Korkut, Alessandro Venturino, Gloria Colombo, and
Sandra Siegert. “Chimeric GPCRs Mimic Distinct Signaling Pathways and Modulate
Microglia Responses.” Nature Communications. Springer Nature, 2022. https://doi.org/10.1038/s41467-022-32390-1.
ieee: R. Schulz, M. Korkut, A. Venturino, G. Colombo, and S. Siegert, “Chimeric
GPCRs mimic distinct signaling pathways and modulate microglia responses,” Nature
Communications, vol. 13. Springer Nature, 2022.
ista: Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. 2022. Chimeric GPCRs
mimic distinct signaling pathways and modulate microglia responses. Nature Communications.
13, 4728.
mla: Schulz, Rouven, et al. “Chimeric GPCRs Mimic Distinct Signaling Pathways and
Modulate Microglia Responses.” Nature Communications, vol. 13, 4728, Springer
Nature, 2022, doi:10.1038/s41467-022-32390-1.
short: R. Schulz, M. Korkut, A. Venturino, G. Colombo, S. Siegert, Nature Communications
13 (2022).
date_created: 2022-08-28T22:01:59Z
date_published: 2022-08-15T00:00:00Z
date_updated: 2024-02-21T12:34:51Z
day: '15'
ddc:
- '570'
department:
- _id: SaSi
doi: 10.1038/s41467-022-32390-1
external_id:
isi:
- '000840984400032'
pmid:
- '35970889'
file:
- access_level: open_access
checksum: 191d9db0266e14a28d3a56dc7f65da84
content_type: application/pdf
creator: cchlebak
date_created: 2022-08-29T06:44:30Z
date_updated: 2022-08-29T06:44:30Z
file_id: '12002'
file_name: 2022_NatComm_Schulz.pdf
file_size: 7317396
relation: main_file
success: 1
file_date_updated: 2022-08-29T06:44:30Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 267F75D8-B435-11E9-9278-68D0E5697425
name: Modulating microglia through G protein-coupled receptor (GPCR) signaling
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on ISTA website
relation: press_release
url: https://ista.ac.at/en/news/dreaddful-mimicry/
record:
- id: '11945'
relation: part_of_dissertation
status: public
- id: '11542'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2022'
...
---
_id: '11996'
abstract:
- lang: eng
text: If you mix fruit syrups with alcohol to make a schnapps, the two liquids will
remain perfectly blended forever. But if you mix oil with vinegar to make a vinaigrette,
the oil and vinegar will soon separate back into their previous selves. Such liquid-liquid
phase separation is a thermodynamically driven phenomenon and plays an important
role in many biological processes (1). Although energy injection at the macroscale
can reverse the phase separation—a strong shake is the normal response to a separated
vinaigrette—little is known about the effect of energy added at the microscopic
level on phase separation. This fundamental question has deep ramifications, notably
in biology, because active processes also make the interior of a living cell different
from a dead one. On page 768 of this issue, Adkins et al. (2) examine how mechanical
activity at the microscopic scale affects liquid-liquid phase separation and allows
liquids to climb surfaces.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Jérémie A
full_name: Palacci, Jérémie A
id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d
last_name: Palacci
orcid: 0000-0002-7253-9465
citation:
ama: Palacci JA. A soft active matter that can climb walls. Science. 2022;377(6607):710-711.
doi:10.1126/science.adc9202
apa: Palacci, J. A. (2022). A soft active matter that can climb walls. Science.
American Association for the Advancement of Science. https://doi.org/10.1126/science.adc9202
chicago: Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” Science.
American Association for the Advancement of Science, 2022. https://doi.org/10.1126/science.adc9202.
ieee: J. A. Palacci, “A soft active matter that can climb walls,” Science,
vol. 377, no. 6607. American Association for the Advancement of Science, pp. 710–711,
2022.
ista: Palacci JA. 2022. A soft active matter that can climb walls. Science. 377(6607),
710–711.
mla: Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” Science,
vol. 377, no. 6607, American Association for the Advancement of Science, 2022,
pp. 710–11, doi:10.1126/science.adc9202.
short: J.A. Palacci, Science 377 (2022) 710–711.
date_created: 2022-08-28T22:02:00Z
date_published: 2022-08-12T00:00:00Z
date_updated: 2022-09-05T07:37:37Z
day: '12'
department:
- _id: JePa
doi: 10.1126/science.adc9202
external_id:
pmid:
- '35951689 '
intvolume: ' 377'
issue: '6607'
language:
- iso: eng
month: '08'
oa_version: None
page: 710-711
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: A soft active matter that can climb walls
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 377
year: '2022'
...
---
_id: '11997'
abstract:
- lang: eng
text: "We study the fate of an impurity in an ultracold heteronuclear Bose mixture,
focusing on the experimentally relevant case of a ⁴¹K - ⁸⁷Rb mixture, with the
impurity in a ⁴¹K hyperfine state. Our paper provides a comprehensive description
of an impurity in a BEC mixture with contact interactions across its phase diagram.
We present results for the miscible and immiscible regimes, as well as for the
impurity in a self-bound quantum droplet. Here, varying the interactions, we find
exotic states where the impurity localizes either at the center or\r\nat the surface
of the droplet. "
acknowledgement: We thank A. Simoni for providing the calculations of the intercomponent
scattering lengths. We gratefully acknowledge stimulating discussions with L. A.
Peña Ardila, R. Schmidt, H. Silva, V. Zampronio, and M. Prevedelli for careful reading.
G.B. acknowledges support from the Austrian Science Fund (FWF) under Project No.
M2641-N27. T.M. acknowledges CNPq for support through Bolsa de produtividade em
Pesquisa No. 311079/2015-6. This work is supported by the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) under Germany's Excellence Strategy No. EXC2181/1-390900948
(the Heidelberg STRUCTURES Excellence Cluster). This work was supported by the Serrapilheira
Institute (Grant No. Serra-1812-27802). We thank the High-Performance Computing
Center (NPAD) at UFRN for providing computational resources.
article_number: '023301'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: A.
full_name: Burchianti, A.
last_name: Burchianti
- first_name: F.
full_name: Minardi, F.
last_name: Minardi
- first_name: T.
full_name: Macrì, T.
last_name: Macrì
citation:
ama: Bighin G, Burchianti A, Minardi F, Macrì T. Impurity in a heteronuclear two-component
Bose mixture. Physical Review A. 2022;106(2). doi:10.1103/PhysRevA.106.023301
apa: Bighin, G., Burchianti, A., Minardi, F., & Macrì, T. (2022). Impurity in
a heteronuclear two-component Bose mixture. Physical Review A. American
Physical Society. https://doi.org/10.1103/PhysRevA.106.023301
chicago: Bighin, Giacomo, A. Burchianti, F. Minardi, and T. Macrì. “Impurity in
a Heteronuclear Two-Component Bose Mixture.” Physical Review A. American
Physical Society, 2022. https://doi.org/10.1103/PhysRevA.106.023301.
ieee: G. Bighin, A. Burchianti, F. Minardi, and T. Macrì, “Impurity in a heteronuclear
two-component Bose mixture,” Physical Review A, vol. 106, no. 2. American
Physical Society, 2022.
ista: Bighin G, Burchianti A, Minardi F, Macrì T. 2022. Impurity in a heteronuclear
two-component Bose mixture. Physical Review A. 106(2), 023301.
mla: Bighin, Giacomo, et al. “Impurity in a Heteronuclear Two-Component Bose Mixture.”
Physical Review A, vol. 106, no. 2, 023301, American Physical Society,
2022, doi:10.1103/PhysRevA.106.023301.
short: G. Bighin, A. Burchianti, F. Minardi, T. Macrì, Physical Review A 106 (2022).
date_created: 2022-08-28T22:02:00Z
date_published: 2022-08-04T00:00:00Z
date_updated: 2024-08-07T07:16:52Z
day: '04'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.106.023301
external_id:
arxiv:
- '2109.07451'
isi:
- '000837953600006'
intvolume: ' 106'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2109.07451
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 26986C82-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02641
name: A path-integral approach to composite impurities
publication: Physical Review A
publication_identifier:
eissn:
- 2469-9934
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Impurity in a heteronuclear two-component Bose mixture
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 106
year: '2022'
...
---
_id: '11998'
abstract:
- lang: eng
text: Recently it became possible to study highly excited rotational states of molecules
in superfluid helium through nonadiabatic alignment experiments (Cherepanov et
al 2021 Phys. Rev. A 104 L061303). This calls for theoretical approaches that
go beyond explaining renormalized values of molecular spectroscopic constants,
which suffices when only the lowest few rotational states are involved. As the
first step in this direction, here we present a basic quantum mechanical model
describing highly excited rotational states of molecules in superfluid helium
nanodroplets. We show that a linear molecule immersed in a superfluid can be seen
as an effective symmetric top, similar to the rotational structure of radicals,
such as OH or NO, but with the angular momentum of the superfluid playing the
role of the electronic angular momentum in free molecules. The simple theory sheds
light onto what happens when the rotational angular momentum of the molecule increases
beyond the lowest excited states accessible by infrared spectroscopy. In addition,
the model allows to estimate the effective rotational and centrifugal distortion
constants for a broad range of species and to explain the crossover between light
and heavy molecules in superfluid 4He in terms of the many-body wavefunction structure.
Some of the above mentioned insights can be acquired by analyzing a simple 2 ×
2 matrix.
acknowledgement: IC acknowledges the support by the European Union's Horizon 2020
research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 665385. GB acknowledges support from the Austrian Science Fund (FWF), under
Project No. M2461-N27 and from the Deutsche Forschungsgemeinschaft (DFG, German
Research Foundation) under Germany's Excellence Strategy EXC2181/1-390900948 (the
Heidelberg STRUCTURES Excellence Cluster). ML acknowledges support by the Austrian
Science Fund (FWF), under Project No. P29902-N27, and by the European Research Council
(ERC) starting Grant No. 801770 (ANGULON). HS acknowledges support from the Independent
Research Fund Denmark (Project No. 8021-00232B) and from the Villum Fonden through
a Villum Investigator Grant No. 25886.
article_number: '075004'
article_processing_charge: Yes
article_type: original
author:
- first_name: Igor
full_name: Cherepanov, Igor
id: 339C7E5A-F248-11E8-B48F-1D18A9856A87
last_name: Cherepanov
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: Constant A.
full_name: Schouder, Constant A.
last_name: Schouder
- first_name: Adam S.
full_name: Chatterley, Adam S.
last_name: Chatterley
- first_name: Henrik
full_name: Stapelfeldt, Henrik
last_name: Stapelfeldt
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Stapelfeldt H, Lemeshko
M. A simple model for high rotational excitations of molecules in a superfluid.
New Journal of Physics. 2022;24(7). doi:10.1088/1367-2630/ac8113
apa: Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Stapelfeldt,
H., & Lemeshko, M. (2022). A simple model for high rotational excitations
of molecules in a superfluid. New Journal of Physics. IOP. https://doi.org/10.1088/1367-2630/ac8113
chicago: Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley,
Henrik Stapelfeldt, and Mikhail Lemeshko. “A Simple Model for High Rotational
Excitations of Molecules in a Superfluid.” New Journal of Physics. IOP,
2022. https://doi.org/10.1088/1367-2630/ac8113.
ieee: I. Cherepanov, G. Bighin, C. A. Schouder, A. S. Chatterley, H. Stapelfeldt,
and M. Lemeshko, “A simple model for high rotational excitations of molecules
in a superfluid,” New Journal of Physics, vol. 24, no. 7. IOP, 2022.
ista: Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Stapelfeldt H, Lemeshko
M. 2022. A simple model for high rotational excitations of molecules in a superfluid.
New Journal of Physics. 24(7), 075004.
mla: Cherepanov, Igor, et al. “A Simple Model for High Rotational Excitations of
Molecules in a Superfluid.” New Journal of Physics, vol. 24, no. 7, 075004,
IOP, 2022, doi:10.1088/1367-2630/ac8113.
short: I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, H. Stapelfeldt,
M. Lemeshko, New Journal of Physics 24 (2022).
date_created: 2022-08-28T22:02:01Z
date_published: 2022-08-11T00:00:00Z
date_updated: 2024-08-07T07:16:52Z
day: '11'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1088/1367-2630/ac8113
ec_funded: 1
external_id:
isi:
- '000839216900001'
file:
- access_level: open_access
checksum: 10116a08d3489befc13dba2cc44490f1
content_type: application/pdf
creator: alisjak
date_created: 2022-08-29T09:57:40Z
date_updated: 2022-08-29T09:57:40Z
file_id: '12005'
file_name: 2022_NewJournalofPhysics_Cherepanov.pdf
file_size: 1912882
relation: main_file
success: 1
file_date_updated: 2022-08-29T09:57:40Z
has_accepted_license: '1'
intvolume: ' 24'
isi: 1
issue: '7'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 26986C82-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02641
name: A path-integral approach to composite impurities
publication: New Journal of Physics
publication_identifier:
issn:
- 1367-2630
publication_status: published
publisher: IOP
quality_controlled: '1'
scopus_import: '1'
status: public
title: A simple model for high rotational excitations of molecules in a superfluid
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 24
year: '2022'
...
---
_id: '12000'
abstract:
- lang: eng
text: "We consider the quantitative problem of obtaining lower-bounds on the probability
of termination of a given non-deterministic probabilistic program. Specifically,
given a non-termination threshold p∈[0,1], we aim for certificates proving that
the program terminates with probability at least 1−p. The basic idea of our approach
is to find a terminating stochastic invariant, i.e. a subset SI of program states
such that (i) the probability of the program ever leaving SI is no more than p,
and (ii) almost-surely, the program either leaves SI or terminates.\r\n\r\nWhile
stochastic invariants are already well-known, we provide the first proof that
the idea above is not only sound, but also complete for quantitative termination
analysis. We then introduce a novel sound and complete characterization of stochastic
invariants that enables template-based approaches for easy synthesis of quantitative
termination certificates, especially in affine or polynomial forms. Finally, by
combining this idea with the existing martingale-based methods that are relatively
complete for qualitative termination analysis, we obtain the first automated,
sound, and relatively complete algorithm for quantitative termination analysis.
Notably, our completeness guarantees for quantitative termination analysis are
as strong as the best-known methods for the qualitative variant.\r\n\r\nOur prototype
implementation demonstrates the effectiveness of our approach on various probabilistic
programs. We also demonstrate that our algorithm certifies lower bounds on termination
probability for probabilistic programs that are beyond the reach of previous methods."
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt),
the HKUST-Kaisa Joint Research Institute Project Grant HKJRI3A-055, the HKUST Startup
Grant R9272 and the European Union’s Horizon 2020 research and innovation programme
under the Marie Skłodowska-Curie Grant Agreement No. 665385.
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Sound and complete
certificates for auantitative termination analysis of probabilistic programs.
In: Proceedings of the 34th International Conference on Computer Aided Verification.
Vol 13371. Springer; 2022:55-78. doi:10.1007/978-3-031-13185-1_4'
apa: 'Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022).
Sound and complete certificates for auantitative termination analysis of probabilistic
programs. In Proceedings of the 34th International Conference on Computer Aided
Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. https://doi.org/10.1007/978-3-031-13185-1_4'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer,
and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination
Analysis of Probabilistic Programs.” In Proceedings of the 34th International
Conference on Computer Aided Verification, 13371:55–78. Springer, 2022. https://doi.org/10.1007/978-3-031-13185-1_4.
ieee: K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete
certificates for auantitative termination analysis of probabilistic programs,”
in Proceedings of the 34th International Conference on Computer Aided Verification,
Haifa, Israel, 2022, vol. 13371, pp. 55–78.
ista: 'Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2022. Sound and complete
certificates for auantitative termination analysis of probabilistic programs.
Proceedings of the 34th International Conference on Computer Aided Verification.
CAV: Computer Aided Verification, LNCS, vol. 13371, 55–78.'
mla: Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative
Termination Analysis of Probabilistic Programs.” Proceedings of the 34th International
Conference on Computer Aided Verification, vol. 13371, Springer, 2022, pp.
55–78, doi:10.1007/978-3-031-13185-1_4.
short: K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, in:, Proceedings
of the 34th International Conference on Computer Aided Verification, Springer,
2022, pp. 55–78.
conference:
end_date: 2022-08-10
location: Haifa, Israel
name: 'CAV: Computer Aided Verification'
start_date: 2022-08-07
date_created: 2022-08-28T22:02:02Z
date_published: 2022-08-07T00:00:00Z
date_updated: 2025-07-14T09:09:58Z
day: '07'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-13185-1_4
ec_funded: 1
external_id:
isi:
- '000870304500004'
file:
- access_level: open_access
checksum: 24e0f810ec52735a90ade95198bc641d
content_type: application/pdf
creator: alisjak
date_created: 2022-08-29T09:17:01Z
date_updated: 2022-08-29T09:17:01Z
file_id: '12003'
file_name: 2022_LNCS_Chatterjee.pdf
file_size: 505094
relation: main_file
success: 1
file_date_updated: 2022-08-29T09:17:01Z
has_accepted_license: '1'
intvolume: ' 13371'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 55-78
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Proceedings of the 34th International Conference on Computer Aided Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031131844'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '14539'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Sound and complete certificates for auantitative termination analysis of probabilistic
programs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13371
year: '2022'
...
---
_id: '12001'
abstract:
- lang: eng
text: 'Sexual antagonism is a common hypothesis for driving the evolution of sex
chromosomes, whereby recombination suppression is favored between sexually antagonistic
loci and the sex-determining locus to maintain beneficial combinations of alleles.
This results in the formation of a sex-determining region. Chromosomal inversions
may contribute to recombination suppression but their precise role in sex chromosome
evolution remains unclear. Because local adaptation is frequently facilitated
through the suppression of recombination between adaptive loci by chromosomal
inversions, there is potential for inversions that cover sex-determining regions
to be involved in local adaptation as well, particularly if habitat variation
creates environment-dependent sexual antagonism. With these processes in mind,
we investigated sex determination in a well-studied example of local adaptation
within a species: the intertidal snail, Littorina saxatilis. Using SNP data from
a Swedish hybrid zone, we find novel evidence for a female-heterogametic sex determination
system that is restricted to one ecotype. Our results suggest that four putative
chromosomal inversions, two previously described and two newly discovered, span
the putative sex chromosome pair. We determine their differing associations with
sex, which suggest distinct strata of differing ages. The same inversions are
found in the second ecotype but do not show any sex association. The striking
disparity in inversion-sex associations between ecotypes that are connected by
gene flow across a habitat transition that is just a few meters wide indicates
a difference in selective regime that has produced a distinct barrier to the spread
of the newly discovered sex-determining region between ecotypes. Such sex chromosome-environment
interactions have not previously been uncovered in L. saxatilis and are known
in few other organisms. A combination of both sex-specific selection and divergent
natural selection is required to explain these highly unusual patterns.'
acknowledgement: We thank A. Wright and four anonymous reviewers for valuable comments
on an earlier draft of this manuscript and all members of the Littorina group for
helpful discussions. This work was supported by a European Research Council grant
to RKB and by a Natural Environment Research Council studentship to KEH through
the ACCE doctoral training program. KJ acknowledges support from the Swedish Science
Research Council VR (Vetenskaprådet) (2017-03798). RF was supported by an FCT CEEC
(Fundação para a Ciênca e a Tecnologia, Concurso Estímulo ao Emprego Científico)
contract (2020.00275.CEECIND).
article_processing_charge: Yes
article_type: original
author:
- first_name: Katherine E.
full_name: Hearn, Katherine E.
last_name: Hearn
- first_name: Eva L.
full_name: Koch, Eva L.
last_name: Koch
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
citation:
ama: Hearn KE, Koch EL, Stankowski S, et al. Differing associations between sex
determination and sex-linked inversions in two ecotypes of Littorina saxatilis.
Evolution Letters. 2022;6(5):358-374. doi:10.1002/evl3.295
apa: Hearn, K. E., Koch, E. L., Stankowski, S., Butlin, R. K., Faria, R., Johannesson,
K., & Westram, A. M. (2022). Differing associations between sex determination
and sex-linked inversions in two ecotypes of Littorina saxatilis. Evolution
Letters. Oxford Academic. https://doi.org/10.1002/evl3.295
chicago: Hearn, Katherine E., Eva L. Koch, Sean Stankowski, Roger K. Butlin, Rui
Faria, Kerstin Johannesson, and Anja M Westram. “Differing Associations between
Sex Determination and Sex-Linked Inversions in Two Ecotypes of Littorina Saxatilis.”
Evolution Letters. Oxford Academic, 2022. https://doi.org/10.1002/evl3.295.
ieee: K. E. Hearn et al., “Differing associations between sex determination
and sex-linked inversions in two ecotypes of Littorina saxatilis,” Evolution
Letters, vol. 6, no. 5. Oxford Academic, pp. 358–374, 2022.
ista: Hearn KE, Koch EL, Stankowski S, Butlin RK, Faria R, Johannesson K, Westram
AM. 2022. Differing associations between sex determination and sex-linked inversions
in two ecotypes of Littorina saxatilis. Evolution Letters. 6(5), 358–374.
mla: Hearn, Katherine E., et al. “Differing Associations between Sex Determination
and Sex-Linked Inversions in Two Ecotypes of Littorina Saxatilis.” Evolution
Letters, vol. 6, no. 5, Oxford Academic, 2022, pp. 358–74, doi:10.1002/evl3.295.
short: K.E. Hearn, E.L. Koch, S. Stankowski, R.K. Butlin, R. Faria, K. Johannesson,
A.M. Westram, Evolution Letters 6 (2022) 358–374.
date_created: 2022-08-28T22:02:02Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2023-08-03T13:18:17Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1002/evl3.295
external_id:
isi:
- '000839621100001'
file:
- access_level: open_access
checksum: 2dcd06186a11b7d1be4cddc6b189f8fb
content_type: application/pdf
creator: dernst
date_created: 2023-02-27T07:17:42Z
date_updated: 2023-02-27T07:17:42Z
file_id: '12686'
file_name: 2022_EvolutionLetters_Hearn.pdf
file_size: 2368965
relation: main_file
success: 1
file_date_updated: 2023-02-27T07:17:42Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
issue: '5'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 358-374
publication: Evolution Letters
publication_identifier:
eissn:
- 2056-3744
publication_status: published
publisher: Oxford Academic
quality_controlled: '1'
scopus_import: '1'
status: public
title: Differing associations between sex determination and sex-linked inversions
in two ecotypes of Littorina saxatilis
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 6
year: '2022'
...
---
_id: '12009'
abstract:
- lang: eng
text: Changes in the short-term dynamics of excitatory synapses over development
have been observed throughout cortex, but their purpose and consequences remain
unclear. Here, we propose that developmental changes in synaptic dynamics buffer
the effect of slow inhibitory long-term plasticity, allowing for continuously
stable neural activity. Using computational modeling we demonstrate that early
in development excitatory short-term depression quickly stabilises neural activity,
even in the face of strong, unbalanced excitation. We introduce a model of the
commonly observed developmental shift from depression to facilitation and show
that neural activity remains stable throughout development, while inhibitory synaptic
plasticity slowly balances excitation, consistent with experimental observations.
Our model predicts changes in the input responses from phasic to phasic-and-tonic
and more precise spike timings. We also observe a gradual emergence of short-lasting
memory traces governed by short-term plasticity development. We conclude that
the developmental depression-to-facilitation shift may control excitation-inhibition
balance throughout development with important functional consequences.
acknowledgement: We would like to thank the Vogels Lab for feedback on an earlier
version of this manuscript. D.W.J. was supported by a Marshall Scholarship and a
Clarendon Scholarship. R.P.C. and T.P.V. were supported by a Wellcome Trust and
Royal Society Sir Henry Dale Fellowship (WT 100000), a Wellcome Trust Senior Research
Fellowship (214316/Z/18/Z), and an ERC Consolidator Grant (SYNAPSEEK).
article_number: '873'
article_processing_charge: No
article_type: original
author:
- first_name: David W.
full_name: Jia, David W.
last_name: Jia
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
- first_name: Rui Ponte
full_name: Costa, Rui Ponte
last_name: Costa
citation:
ama: Jia DW, Vogels TP, Costa RP. Developmental depression-to-facilitation shift
controls excitation-inhibition balance. Communications biology. 2022;5.
doi:10.1038/s42003-022-03801-2
apa: Jia, D. W., Vogels, T. P., & Costa, R. P. (2022). Developmental depression-to-facilitation
shift controls excitation-inhibition balance. Communications Biology. Springer
Nature. https://doi.org/10.1038/s42003-022-03801-2
chicago: Jia, David W., Tim P Vogels, and Rui Ponte Costa. “Developmental Depression-to-Facilitation
Shift Controls Excitation-Inhibition Balance.” Communications Biology.
Springer Nature, 2022. https://doi.org/10.1038/s42003-022-03801-2.
ieee: D. W. Jia, T. P. Vogels, and R. P. Costa, “Developmental depression-to-facilitation
shift controls excitation-inhibition balance,” Communications biology,
vol. 5. Springer Nature, 2022.
ista: Jia DW, Vogels TP, Costa RP. 2022. Developmental depression-to-facilitation
shift controls excitation-inhibition balance. Communications biology. 5, 873.
mla: Jia, David W., et al. “Developmental Depression-to-Facilitation Shift Controls
Excitation-Inhibition Balance.” Communications Biology, vol. 5, 873, Springer
Nature, 2022, doi:10.1038/s42003-022-03801-2.
short: D.W. Jia, T.P. Vogels, R.P. Costa, Communications Biology 5 (2022).
date_created: 2022-09-04T22:02:02Z
date_published: 2022-08-25T00:00:00Z
date_updated: 2023-08-03T13:22:42Z
day: '25'
ddc:
- '570'
department:
- _id: TiVo
doi: 10.1038/s42003-022-03801-2
ec_funded: 1
external_id:
isi:
- '000844814800007'
file:
- access_level: open_access
checksum: 3ec724c4f6d3440028c217305e32915f
content_type: application/pdf
creator: dernst
date_created: 2022-09-05T08:55:11Z
date_updated: 2022-09-05T08:55:11Z
file_id: '12022'
file_name: 2022_CommBiology_Jia.pdf
file_size: 2491191
relation: main_file
success: 1
file_date_updated: 2022-09-05T08:55:11Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: c084a126-5a5b-11eb-8a69-d75314a70a87
grant_number: 214316/Z/18/Z
name: What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent
neuronal networks.
- _id: 0aacfa84-070f-11eb-9043-d7eb2c709234
call_identifier: H2020
grant_number: '819603'
name: Learning the shape of synaptic plasticity rules for neuronal architectures
and function through machine learning.
publication: Communications biology
publication_identifier:
eissn:
- 2399-3642
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Developmental depression-to-facilitation shift controls excitation-inhibition
balance
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 5
year: '2022'
...
---
_id: '12010'
abstract:
- lang: eng
text: World models learn behaviors in a latent imagination space to enhance the
sample-efficiency of deep reinforcement learning (RL) algorithms. While learning
world models for high-dimensional observations (e.g., pixel inputs) has become
practicable on standard RL benchmarks and some games, their effectiveness in real-world
robotics applications has not been explored. In this paper, we investigate how
such agents generalize to real-world autonomous vehicle control tasks, where advanced
model-free deep RL algorithms fail. In particular, we set up a series of time-lap
tasks for an F1TENTH racing robot, equipped with a high-dimensional LiDAR sensor,
on a set of test tracks with a gradual increase in their complexity. In this continuous-control
setting, we show that model-based agents capable of learning in imagination substantially
outperform model-free agents with respect to performance, sample efficiency, successful
task completion, and generalization. Moreover, we show that the generalization
ability of model-based agents strongly depends on the choice of their observation
model. We provide extensive empirical evidence for the effectiveness of world
models provided with long enough memory horizons in sim2real tasks.
acknowledgement: L.B. was supported by the Doctoral College Resilient Embedded Systems.
M.L. was supported in part by the ERC2020-AdG 101020093 and the Austrian Science
Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. were supported
by The Boeing Company and the Office of Naval Research (ONR) Grant N00014-18-1-2830.
R.G. was partially supported by the Horizon-2020 ECSEL Project grant No. 783163
(iDev40) and A.B. by FFG Project ADEX.
article_processing_charge: No
arxiv: 1
author:
- first_name: Axel
full_name: Brunnbauer, Axel
last_name: Brunnbauer
- first_name: Luigi
full_name: Berducci, Luigi
last_name: Berducci
- first_name: Andreas
full_name: Brandstatter, Andreas
last_name: Brandstatter
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Brunnbauer A, Berducci L, Brandstatter A, et al. Latent imagination facilitates
zero-shot transfer in autonomous racing. In: 2022 International Conference
on Robotics and Automation. IEEE; 2022:7513-7520. doi:10.1109/ICRA46639.2022.9811650'
apa: 'Brunnbauer, A., Berducci, L., Brandstatter, A., Lechner, M., Hasani, R., Rus,
D., & Grosu, R. (2022). Latent imagination facilitates zero-shot transfer
in autonomous racing. In 2022 International Conference on Robotics and Automation
(pp. 7513–7520). Philadelphia, PA, United States: IEEE. https://doi.org/10.1109/ICRA46639.2022.9811650'
chicago: Brunnbauer, Axel, Luigi Berducci, Andreas Brandstatter, Mathias Lechner,
Ramin Hasani, Daniela Rus, and Radu Grosu. “Latent Imagination Facilitates Zero-Shot
Transfer in Autonomous Racing.” In 2022 International Conference on Robotics
and Automation, 7513–20. IEEE, 2022. https://doi.org/10.1109/ICRA46639.2022.9811650.
ieee: A. Brunnbauer et al., “Latent imagination facilitates zero-shot transfer
in autonomous racing,” in 2022 International Conference on Robotics and Automation,
Philadelphia, PA, United States, 2022, pp. 7513–7520.
ista: 'Brunnbauer A, Berducci L, Brandstatter A, Lechner M, Hasani R, Rus D, Grosu
R. 2022. Latent imagination facilitates zero-shot transfer in autonomous racing.
2022 International Conference on Robotics and Automation. ICRA: International
Conference on Robotics and Automation, 7513–7520.'
mla: Brunnbauer, Axel, et al. “Latent Imagination Facilitates Zero-Shot Transfer
in Autonomous Racing.” 2022 International Conference on Robotics and Automation,
IEEE, 2022, pp. 7513–20, doi:10.1109/ICRA46639.2022.9811650.
short: A. Brunnbauer, L. Berducci, A. Brandstatter, M. Lechner, R. Hasani, D. Rus,
R. Grosu, in:, 2022 International Conference on Robotics and Automation, IEEE,
2022, pp. 7513–7520.
conference:
end_date: 2022-05-27
location: Philadelphia, PA, United States
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2022-05-23
date_created: 2022-09-04T22:02:02Z
date_published: 2022-07-12T00:00:00Z
date_updated: 2022-09-05T08:46:12Z
day: '12'
department:
- _id: ToHe
doi: 10.1109/ICRA46639.2022.9811650
ec_funded: 1
external_id:
arxiv:
- '2103.04909'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2103.04909
month: '07'
oa: 1
oa_version: Preprint
page: 7513-7520
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 2022 International Conference on Robotics and Automation
publication_identifier:
isbn:
- '9781728196817'
issn:
- 1050-4729
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Latent imagination facilitates zero-shot transfer in autonomous racing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12011'
abstract:
- lang: eng
text: We characterize the capacity for the discrete-time arbitrarily varying channel
with discrete inputs, outputs, and states when (a) the encoder and decoder do
not share common randomness, (b) the input and state are subject to cost constraints,
(c) the transition matrix of the channel is deterministic given the state, and
(d) at each time step the adversary can only observe the current and past channel
inputs when choosing the state at that time. The achievable strategy involves
stochastic encoding together with list decoding and a disambiguation step. The
converse uses a two-phase "babble-and-push" strategy where the adversary chooses
the state randomly in the first phase, list decodes the output, and then chooses
state inputs to symmetrize the channel in the second phase. These results generalize
prior work on specific channels models (additive, erasure) to general discrete
alphabets and models.
acknowledgement: The work of ADS and ML was supported in part by the US National Science
Foundation under awards CCF-1909468 and CCF-1909451.
article_processing_charge: No
arxiv: 1
author:
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
- first_name: Sidharth
full_name: Jaggi, Sidharth
last_name: Jaggi
- first_name: Michael
full_name: Langberg, Michael
last_name: Langberg
- first_name: Anand D.
full_name: Sarwate, Anand D.
last_name: Sarwate
citation:
ama: 'Zhang Y, Jaggi S, Langberg M, Sarwate AD. The capacity of causal adversarial
channels. In: 2022 IEEE International Symposium on Information Theory.
Vol 2022. IEEE; 2022:2523-2528. doi:10.1109/ISIT50566.2022.9834709'
apa: 'Zhang, Y., Jaggi, S., Langberg, M., & Sarwate, A. D. (2022). The capacity
of causal adversarial channels. In 2022 IEEE International Symposium on Information
Theory (Vol. 2022, pp. 2523–2528). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834709'
chicago: Zhang, Yihan, Sidharth Jaggi, Michael Langberg, and Anand D. Sarwate. “The
Capacity of Causal Adversarial Channels.” In 2022 IEEE International Symposium
on Information Theory, 2022:2523–28. IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834709.
ieee: Y. Zhang, S. Jaggi, M. Langberg, and A. D. Sarwate, “The capacity of causal
adversarial channels,” in 2022 IEEE International Symposium on Information
Theory, Espoo, Finland, 2022, vol. 2022, pp. 2523–2528.
ista: 'Zhang Y, Jaggi S, Langberg M, Sarwate AD. 2022. The capacity of causal adversarial
channels. 2022 IEEE International Symposium on Information Theory. ISIT: Internation
Symposium on Information Theory vol. 2022, 2523–2528.'
mla: Zhang, Yihan, et al. “The Capacity of Causal Adversarial Channels.” 2022
IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022,
pp. 2523–28, doi:10.1109/ISIT50566.2022.9834709.
short: Y. Zhang, S. Jaggi, M. Langberg, A.D. Sarwate, in:, 2022 IEEE International
Symposium on Information Theory, IEEE, 2022, pp. 2523–2528.
conference:
end_date: 2022-07-01
location: Espoo, Finland
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2022-06-26
date_created: 2022-09-04T22:02:03Z
date_published: 2022-08-03T00:00:00Z
date_updated: 2022-09-05T09:09:15Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834709
external_id:
arxiv:
- '2205.06708'
intvolume: ' 2022'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2205.06708'
month: '08'
oa: 1
oa_version: Preprint
page: 2523-2528
publication: 2022 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781665421591'
issn:
- 2157-8095
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: The capacity of causal adversarial channels
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...
---
_id: '12012'
abstract:
- lang: eng
text: This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. We
generalize a previous framework for designing utility-optimal differentially private
(DP) mechanisms via graphs, where datasets are vertices in the graph and edges
represent dataset neighborhood. The boundary set contains datasets where an individual’s
response changes the binary-valued query compared to its neighbors. Previous work
was limited to the homogeneous case where the privacy parameter ε across all datasets
was the same and the mechanism at boundary datasets was identical. In our work,
the mechanism can take different distributions at the boundary and the privacy
parameter ε is a function of neighboring datasets, which recovers an earlier definition
of personalized DP as special case. The problem is how to extend the mechanism,
which is only defined at the boundary set, to other datasets in the graph in a
computationally efficient and utility optimal manner. Using the concept of strongest
induced DP condition we solve this problem efficiently in polynomial time (in
the size of the graph).
article_processing_charge: No
arxiv: 1
author:
- first_name: Sahel
full_name: Torkamani, Sahel
id: 0503e7f8-2d05-11ed-aa17-db0640c720fc
last_name: Torkamani
- first_name: Javad B.
full_name: Ebrahimi, Javad B.
last_name: Ebrahimi
- first_name: Parastoo
full_name: Sadeghi, Parastoo
last_name: Sadeghi
- first_name: Rafael G.L.
full_name: D'Oliveira, Rafael G.L.
last_name: D'Oliveira
- first_name: Muriel
full_name: Médard, Muriel
last_name: Médard
citation:
ama: 'Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. Heterogeneous
differential privacy via graphs. In: 2022 IEEE International Symposium on Information
Theory. Vol 2022. IEEE; 2022:1623-1628. doi:10.1109/ISIT50566.2022.9834711'
apa: 'Torkamani, S., Ebrahimi, J. B., Sadeghi, P., D’Oliveira, R. G. L., & Médard,
M. (2022). Heterogeneous differential privacy via graphs. In 2022 IEEE International
Symposium on Information Theory (Vol. 2022, pp. 1623–1628). Espoo, Finland:
IEEE. https://doi.org/10.1109/ISIT50566.2022.9834711'
chicago: Torkamani, Sahel, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G.L. D’Oliveira,
and Muriel Médard. “Heterogeneous Differential Privacy via Graphs.” In 2022
IEEE International Symposium on Information Theory, 2022:1623–28. IEEE, 2022.
https://doi.org/10.1109/ISIT50566.2022.9834711.
ieee: S. Torkamani, J. B. Ebrahimi, P. Sadeghi, R. G. L. D’Oliveira, and M. Médard,
“Heterogeneous differential privacy via graphs,” in 2022 IEEE International
Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 1623–1628.
ista: 'Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. 2022. Heterogeneous
differential privacy via graphs. 2022 IEEE International Symposium on Information
Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 1623–1628.'
mla: Torkamani, Sahel, et al. “Heterogeneous Differential Privacy via Graphs.” 2022
IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022,
pp. 1623–28, doi:10.1109/ISIT50566.2022.9834711.
short: S. Torkamani, J.B. Ebrahimi, P. Sadeghi, R.G.L. D’Oliveira, M. Médard, in:,
2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 1623–1628.
conference:
end_date: 2022-07-01
location: Espoo, Finland
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2022-06-26
date_created: 2022-09-04T22:02:04Z
date_published: 2022-08-03T00:00:00Z
date_updated: 2022-09-05T10:28:35Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834711
external_id:
arxiv:
- '2203.15429'
intvolume: ' 2022'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2203.15429
month: '08'
oa: 1
oa_version: Preprint
page: 1623-1628
publication: 2022 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781665421591'
issn:
- 2157-8095
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Heterogeneous differential privacy via graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...
---
_id: '12013'
abstract:
- lang: eng
text: We consider the problem of communication over adversarial channels with feedback.
Two parties comprising sender Alice and receiver Bob seek to communicate reliably.
An adversary James observes Alice's channel transmission entirely and chooses,
maliciously, its additive channel input or jamming state thereby corrupting Bob's
observation. Bob can communicate over a one-way reverse link with Alice; we assume
that transmissions over this feedback link cannot be corrupted by James. Our goal
in this work is to study the optimum throughput or capacity over such channels
with feedback. We first present results for the quadratically-constrained additive
channel where communication is known to be impossible when the noise-to-signal
(power) ratio (NSR) is at least 1. We present a novel achievability scheme to
establish that positive rate communication is possible even when the NSR is as
high as 8/9. We also present new converse upper bounds on the capacity of this
channel under potentially stochastic encoders and decoders. We also study feedback
communication over the more widely studied q-ary alphabet channel under additive
noise. For the q -ary channel, where q > 2, it is well known that capacity is
positive under full feedback if and only if the adversary can corrupt strictly
less than half the transmitted symbols. We generalize this result and show that
the same threshold holds for positive rate communication when the noiseless feedback
may only be partial; our scheme employs a stochastic decoder. We extend this characterization,
albeit partially, to fully deterministic schemes under partial noiseless feedback.
We also present new converse upper bounds for q-ary channels under full feedback,
where the encoder and/or decoder may privately randomize. Our converse results
bring to the fore an interesting alternate expression for the well known converse
bound for the q—ary channel under full feedback which, when specialized to the
binary channel, also equals its known capacity.
article_processing_charge: No
author:
- first_name: Pranav
full_name: Joshi, Pranav
last_name: Joshi
- first_name: Amritakshya
full_name: Purkayastha, Amritakshya
last_name: Purkayastha
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
- first_name: Amitalok J.
full_name: Budkuley, Amitalok J.
last_name: Budkuley
- first_name: Sidharth
full_name: Jaggi, Sidharth
last_name: Jaggi
citation:
ama: 'Joshi P, Purkayastha A, Zhang Y, Budkuley AJ, Jaggi S. On the capacity of
additive AVCs with feedback. In: 2022 IEEE International Symposium on Information
Theory. Vol 2022. IEEE; 2022:504-509. doi:10.1109/ISIT50566.2022.9834850'
apa: 'Joshi, P., Purkayastha, A., Zhang, Y., Budkuley, A. J., & Jaggi, S. (2022).
On the capacity of additive AVCs with feedback. In 2022 IEEE International
Symposium on Information Theory (Vol. 2022, pp. 504–509). Espoo, Finland:
IEEE. https://doi.org/10.1109/ISIT50566.2022.9834850'
chicago: Joshi, Pranav, Amritakshya Purkayastha, Yihan Zhang, Amitalok J. Budkuley,
and Sidharth Jaggi. “On the Capacity of Additive AVCs with Feedback.” In 2022
IEEE International Symposium on Information Theory, 2022:504–9. IEEE, 2022.
https://doi.org/10.1109/ISIT50566.2022.9834850.
ieee: P. Joshi, A. Purkayastha, Y. Zhang, A. J. Budkuley, and S. Jaggi, “On the
capacity of additive AVCs with feedback,” in 2022 IEEE International Symposium
on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 504–509.
ista: 'Joshi P, Purkayastha A, Zhang Y, Budkuley AJ, Jaggi S. 2022. On the capacity
of additive AVCs with feedback. 2022 IEEE International Symposium on Information
Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 504–509.'
mla: Joshi, Pranav, et al. “On the Capacity of Additive AVCs with Feedback.” 2022
IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022,
pp. 504–09, doi:10.1109/ISIT50566.2022.9834850.
short: P. Joshi, A. Purkayastha, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022 IEEE
International Symposium on Information Theory, IEEE, 2022, pp. 504–509.
conference:
end_date: 2022-07-01
location: Espoo, Finland
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2022-06-26
date_created: 2022-09-04T22:02:04Z
date_published: 2022-08-03T00:00:00Z
date_updated: 2022-09-05T10:23:35Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834850
intvolume: ' 2022'
language:
- iso: eng
month: '08'
oa_version: None
page: 504-509
publication: 2022 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781665421591'
issn:
- 2157-8095
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the capacity of additive AVCs with feedback
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...
---
_id: '12014'
abstract:
- lang: eng
text: We study the problem of high-dimensional multiple packing in Euclidean space.
Multiple packing is a natural generalization of sphere packing and is defined
as follows. Let N > 0 and L∈Z≥2. A multiple packing is a set C of points in Rn
such that any point in Rn lies in the intersection of at most L – 1 balls of radius
nN−−−√ around points in C. Given a well-known connection with coding theory, multiple
packings can be viewed as the Euclidean analog of list-decodable codes, which
are well-studied for finite fields. In this paper, we exactly pin down the asymptotic
density of (expurgated) Poisson Point Processes under a stronger notion called
average-radius multiple packing. To this end, we apply tools from high-dimensional
geometry and large deviation theory. This gives rise to the best known lower bound
on the largest multiple packing density. Our result corrects a mistake in a previous
paper by Blinovsky [Bli05].
article_processing_charge: No
author:
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
- first_name: Shashank
full_name: Vatedka, Shashank
last_name: Vatedka
citation:
ama: 'Zhang Y, Vatedka S. List-decodability of Poisson Point Processes. In: 2022
IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:2559-2564.
doi:10.1109/ISIT50566.2022.9834512'
apa: 'Zhang, Y., & Vatedka, S. (2022). List-decodability of Poisson Point Processes.
In 2022 IEEE International Symposium on Information Theory (Vol. 2022,
pp. 2559–2564). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834512'
chicago: Zhang, Yihan, and Shashank Vatedka. “List-Decodability of Poisson Point
Processes.” In 2022 IEEE International Symposium on Information Theory,
2022:2559–64. IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834512.
ieee: Y. Zhang and S. Vatedka, “List-decodability of Poisson Point Processes,” in
2022 IEEE International Symposium on Information Theory, Espoo, Finland,
2022, vol. 2022, pp. 2559–2564.
ista: 'Zhang Y, Vatedka S. 2022. List-decodability of Poisson Point Processes. 2022
IEEE International Symposium on Information Theory. ISIT: Internation Symposium
on Information Theory vol. 2022, 2559–2564.'
mla: Zhang, Yihan, and Shashank Vatedka. “List-Decodability of Poisson Point Processes.”
2022 IEEE International Symposium on Information Theory, vol. 2022, IEEE,
2022, pp. 2559–64, doi:10.1109/ISIT50566.2022.9834512.
short: Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information
Theory, IEEE, 2022, pp. 2559–2564.
conference:
end_date: 2022-07-01
location: Espoo, Finland
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2022-06-26
date_created: 2022-09-04T22:02:04Z
date_published: 2022-08-03T00:00:00Z
date_updated: 2022-09-05T09:23:04Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834512
intvolume: ' 2022'
language:
- iso: eng
month: '08'
oa_version: None
page: 2559-2564
publication: 2022 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781665421591'
issn:
- 2157-8095
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: List-decodability of Poisson Point Processes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...
---
_id: '12015'
abstract:
- lang: eng
text: We study the problem of high-dimensional multiple packing in Euclidean space.
Multiple packing is a natural generalization of sphere packing and is defined
as follows. Let P, N > 0 and L∈Z≥2. A multiple packing is a set C of points in
Bn(0–,nP−−−√) such that any point in ℝ n lies in the intersection of at most L
– 1 balls of radius nN−−−√ around points in C. 1 In this paper, we derive two
lower bounds on the largest possible density of a multiple packing. These bounds
are obtained through a stronger notion called average-radius multiple packing.
Specifically, we exactly pin down the asymptotics of (expurgated) Gaussian codes
and (expurgated) spherical codes under average-radius multiple packing. To this
end, we apply tools from high-dimensional geometry and large deviation theory.
The bound for spherical codes matches the previous best known bound which was
obtained for the standard (weaker) notion of multiple packing through a curious
connection with error exponents [Bli99], [ZV21]. The bound for Gaussian codes
suggests that they are strictly inferior to spherical codes.
article_processing_charge: No
author:
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
- first_name: Shashank
full_name: Vatedka, Shashank
last_name: Vatedka
citation:
ama: 'Zhang Y, Vatedka S. Lower bounds for multiple packing. In: 2022 IEEE International
Symposium on Information Theory. Vol 2022. IEEE; 2022:3085-3090. doi:10.1109/ISIT50566.2022.9834443'
apa: 'Zhang, Y., & Vatedka, S. (2022). Lower bounds for multiple packing. In
2022 IEEE International Symposium on Information Theory (Vol. 2022, pp.
3085–3090). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834443'
chicago: Zhang, Yihan, and Shashank Vatedka. “Lower Bounds for Multiple Packing.”
In 2022 IEEE International Symposium on Information Theory, 2022:3085–90.
IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834443.
ieee: Y. Zhang and S. Vatedka, “Lower bounds for multiple packing,” in 2022 IEEE
International Symposium on Information Theory, Espoo, Finland, 2022, vol.
2022, pp. 3085–3090.
ista: 'Zhang Y, Vatedka S. 2022. Lower bounds for multiple packing. 2022 IEEE International
Symposium on Information Theory. ISIT: Internation Symposium on Information Theory
vol. 2022, 3085–3090.'
mla: Zhang, Yihan, and Shashank Vatedka. “Lower Bounds for Multiple Packing.” 2022
IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022,
pp. 3085–90, doi:10.1109/ISIT50566.2022.9834443.
short: Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information
Theory, IEEE, 2022, pp. 3085–3090.
conference:
end_date: 2022-07-01
location: Espoo, Finland
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2022-06-26
date_created: 2022-09-04T22:02:05Z
date_published: 2022-08-03T00:00:00Z
date_updated: 2022-09-05T10:39:04Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834443
intvolume: ' 2022'
language:
- iso: eng
month: '08'
oa_version: None
page: 3085-3090
publication: 2022 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781665421591'
issn:
- 2157-8095
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lower bounds for multiple packing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...
---
_id: '12016'
abstract:
- lang: eng
text: We consider the problem of coded distributed computing using polar codes.
The average execution time of a coded computing system is related to the error
probability for transmission over the binary erasure channel in recent work by
Soleymani, Jamali and Mahdavifar, where the performance of binary linear codes
is investigated. In this paper, we focus on polar codes and unveil a connection
between the average execution time and the scaling exponent μ of the family of
codes. In the finite-length characterization of polar codes, the scaling exponent
is a key object capturing the speed of convergence to capacity. In particular,
we show that (i) the gap between the normalized average execution time of polar
codes and that of optimal MDS codes is O(n –1/μ ), and (ii) this upper bound can
be improved to roughly O(n –1/2 ) by considering polar codes with large kernels.
We conjecture that these bounds could be improved to O(n –2/μ ) and O(n –1 ),
respectively, and provide a heuristic argument as well as numerical evidence supporting
this view.
acknowledgement: D. Fathollahi and M. Mondelli were partially supported by the 2019
Lopez-Loreta Prize. The authors thank Hamed Hassani and Hessam Mahdavifar for helpful
discussions.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dorsa
full_name: Fathollahi, Dorsa
last_name: Fathollahi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Fathollahi D, Mondelli M. Polar coded computing: The role of the scaling exponent.
In: 2022 IEEE International Symposium on Information Theory. Vol 2022.
IEEE; 2022:2154-2159. doi:10.1109/ISIT50566.2022.9834712'
apa: 'Fathollahi, D., & Mondelli, M. (2022). Polar coded computing: The role
of the scaling exponent. In 2022 IEEE International Symposium on Information
Theory (Vol. 2022, pp. 2154–2159). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834712'
chicago: 'Fathollahi, Dorsa, and Marco Mondelli. “Polar Coded Computing: The Role
of the Scaling Exponent.” In 2022 IEEE International Symposium on Information
Theory, 2022:2154–59. IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834712.'
ieee: 'D. Fathollahi and M. Mondelli, “Polar coded computing: The role of the scaling
exponent,” in 2022 IEEE International Symposium on Information Theory,
Espoo, Finland, 2022, vol. 2022, pp. 2154–2159.'
ista: 'Fathollahi D, Mondelli M. 2022. Polar coded computing: The role of the scaling
exponent. 2022 IEEE International Symposium on Information Theory. ISIT: Internation
Symposium on Information Theory vol. 2022, 2154–2159.'
mla: 'Fathollahi, Dorsa, and Marco Mondelli. “Polar Coded Computing: The Role of
the Scaling Exponent.” 2022 IEEE International Symposium on Information Theory,
vol. 2022, IEEE, 2022, pp. 2154–59, doi:10.1109/ISIT50566.2022.9834712.'
short: D. Fathollahi, M. Mondelli, in:, 2022 IEEE International Symposium on Information
Theory, IEEE, 2022, pp. 2154–2159.
conference:
end_date: 2022-07-01
location: Espoo, Finland
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2022-06-26
date_created: 2022-09-04T22:02:05Z
date_published: 2022-08-03T00:00:00Z
date_updated: 2024-09-10T13:03:17Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834712
external_id:
arxiv:
- '2201.10082'
intvolume: ' 2022'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2201.10082
month: '08'
oa: 1
oa_version: Preprint
page: 2154-2159
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 2022 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781665421591'
issn:
- 2157-8095
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Polar coded computing: The role of the scaling exponent'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...
---
_id: '12017'
abstract:
- lang: eng
text: 'In the classic adversarial communication problem, two parties communicate
over a noisy channel in the presence of a malicious jamming adversary. The arbitrarily
varying channels (AVCs) offer an elegant framework to study a wide range of interesting
adversary models. The optimal throughput or capacity over such AVCs is intimately
tied to the underlying adversary model; in some cases, capacity is unknown and
the problem is known to be notoriously hard. The omniscient adversary, one which
knows the sender’s entire channel transmission a priori, is one of such classic
models of interest; the capacity under such an adversary remains an exciting open
problem. The myopic adversary is a generalization of that model where the adversary’s
observation may be corrupted over a noisy discrete memoryless channel. Through
the adversary’s myopicity, one can unify the slew of different adversary models,
ranging from the omniscient adversary to one that is completely blind to the transmission
(the latter is the well known oblivious model where the capacity is fully characterized).In
this work, we present new results on the capacity under both the omniscient and
myopic adversary models. We completely characterize the positive capacity threshold
over general AVCs with omniscient adversaries. The characterization is in terms
of two key combinatorial objects: the set of completely positive distributions
and the CP-confusability set. For omniscient AVCs with positive capacity, we present
non-trivial lower and upper bounds on the capacity; unlike some of the previous
bounds, our bounds hold under fairly general input and jamming constraints. Our
lower bound improves upon the generalized Gilbert-Varshamov bound for general
AVCs while the upper bound generalizes the well known Elias-Bassalygo bound (known
for binary and q-ary alphabets). For the myopic AVCs, we build on prior results
known for the so-called sufficiently myopic model, and present new results on
the positive rate communication threshold over the so-called insufficiently myopic
regime (a completely insufficient myopic adversary specializes to an omniscient
adversary). We present interesting examples for the widely studied models of adversarial
bit-flip and bit-erasure channels. In fact, for the bit-flip AVC with additive
adversarial noise as well as random noise, we completely characterize the omniscient
model capacity when the random noise is sufficiently large vis-a-vis the adversary’s
budget.'
article_processing_charge: No
author:
- first_name: Anuj Kumar
full_name: Yadav, Anuj Kumar
last_name: Yadav
- first_name: Mohammadreza
full_name: Alimohammadi, Mohammadreza
last_name: Alimohammadi
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
- first_name: Amitalok J.
full_name: Budkuley, Amitalok J.
last_name: Budkuley
- first_name: Sidharth
full_name: Jaggi, Sidharth
last_name: Jaggi
citation:
ama: 'Yadav AK, Alimohammadi M, Zhang Y, Budkuley AJ, Jaggi S. New results on AVCs
with omniscient and myopic adversaries. In: 2022 IEEE International Symposium
on Information Theory. Vol 2022. Institute of Electrical and Electronics Engineers;
2022:2535-2540. doi:10.1109/ISIT50566.2022.9834632'
apa: 'Yadav, A. K., Alimohammadi, M., Zhang, Y., Budkuley, A. J., & Jaggi, S.
(2022). New results on AVCs with omniscient and myopic adversaries. In 2022
IEEE International Symposium on Information Theory (Vol. 2022, pp. 2535–2540).
Espoo, Finland: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT50566.2022.9834632'
chicago: Yadav, Anuj Kumar, Mohammadreza Alimohammadi, Yihan Zhang, Amitalok J.
Budkuley, and Sidharth Jaggi. “New Results on AVCs with Omniscient and Myopic
Adversaries.” In 2022 IEEE International Symposium on Information Theory,
2022:2535–40. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/ISIT50566.2022.9834632.
ieee: A. K. Yadav, M. Alimohammadi, Y. Zhang, A. J. Budkuley, and S. Jaggi, “New
results on AVCs with omniscient and myopic adversaries,” in 2022 IEEE International
Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2535–2540.
ista: 'Yadav AK, Alimohammadi M, Zhang Y, Budkuley AJ, Jaggi S. 2022. New results
on AVCs with omniscient and myopic adversaries. 2022 IEEE International Symposium
on Information Theory. ISIT: Internation Symposium on Information Theory vol.
2022, 2535–2540.'
mla: Yadav, Anuj Kumar, et al. “New Results on AVCs with Omniscient and Myopic Adversaries.”
2022 IEEE International Symposium on Information Theory, vol. 2022, Institute
of Electrical and Electronics Engineers, 2022, pp. 2535–40, doi:10.1109/ISIT50566.2022.9834632.
short: A.K. Yadav, M. Alimohammadi, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022
IEEE International Symposium on Information Theory, Institute of Electrical and
Electronics Engineers, 2022, pp. 2535–2540.
conference:
end_date: 2022-07-01
location: Espoo, Finland
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2022-06-26
date_created: 2022-09-04T22:02:06Z
date_published: 2022-08-03T00:00:00Z
date_updated: 2023-02-13T09:00:14Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834632
intvolume: ' 2022'
language:
- iso: eng
month: '08'
oa_version: None
page: 2535-2540
publication: 2022 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781665421591'
issn:
- 2157-8095
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: New results on AVCs with omniscient and myopic adversaries
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...
---
_id: '12018'
abstract:
- lang: eng
text: We study the problem of characterizing the maximal rates of list decoding
in Euclidean spaces for finite list sizes. For any positive integer L ≥ 2 and
real N > 0, we say that a subset C⊂Rn is an (N,L – 1)-multiple packing or an (N,L–
1)-list decodable code if every Euclidean ball of radius nN−−−√ in ℝ n contains
no more than L − 1 points of C. We study this problem with and without ℓ 2 norm
constraints on C, and derive the best-known lower bounds on the maximal rate for
(N,L−1) multiple packing. Our bounds are obtained via error exponents for list
decoding over Additive White Gaussian Noise (AWGN) channels. We establish a curious
inequality which relates the error exponent, a quantity of average-case nature,
to the list-decoding radius, a quantity of worst-case nature. We derive various
bounds on the error exponent for list decoding in both bounded and unbounded settings
which could be of independent interest beyond multiple packing.
article_processing_charge: No
author:
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
- first_name: Shashank
full_name: Vatedka, Shashank
last_name: Vatedka
citation:
ama: 'Zhang Y, Vatedka S. Lower bounds on list decoding capacity using error exponents.
In: 2022 IEEE International Symposium on Information Theory. Vol 2022.
Institute of Electrical and Electronics Engineers; 2022:1324-1329. doi:10.1109/ISIT50566.2022.9834815'
apa: 'Zhang, Y., & Vatedka, S. (2022). Lower bounds on list decoding capacity
using error exponents. In 2022 IEEE International Symposium on Information
Theory (Vol. 2022, pp. 1324–1329). Espoo, Finland: Institute of Electrical
and Electronics Engineers. https://doi.org/10.1109/ISIT50566.2022.9834815'
chicago: Zhang, Yihan, and Shashank Vatedka. “Lower Bounds on List Decoding Capacity
Using Error Exponents.” In 2022 IEEE International Symposium on Information
Theory, 2022:1324–29. Institute of Electrical and Electronics Engineers, 2022.
https://doi.org/10.1109/ISIT50566.2022.9834815.
ieee: Y. Zhang and S. Vatedka, “Lower bounds on list decoding capacity using error
exponents,” in 2022 IEEE International Symposium on Information Theory,
Espoo, Finland, 2022, vol. 2022, pp. 1324–1329.
ista: 'Zhang Y, Vatedka S. 2022. Lower bounds on list decoding capacity using error
exponents. 2022 IEEE International Symposium on Information Theory. ISIT: Internation
Symposium on Information Theory vol. 2022, 1324–1329.'
mla: Zhang, Yihan, and Shashank Vatedka. “Lower Bounds on List Decoding Capacity
Using Error Exponents.” 2022 IEEE International Symposium on Information Theory,
vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 1324–29,
doi:10.1109/ISIT50566.2022.9834815.
short: Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information
Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 1324–1329.
conference:
end_date: 2022-07-01
location: Espoo, Finland
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2022-06-26
date_created: 2022-09-04T22:02:06Z
date_published: 2022-08-03T00:00:00Z
date_updated: 2023-02-13T09:02:06Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834815
intvolume: ' 2022'
language:
- iso: eng
month: '08'
oa_version: None
page: 1324-1329
publication: 2022 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781665421591'
issn:
- 2157-8095
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lower bounds on list decoding capacity using error exponents
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...
---
_id: '12019'
abstract:
- lang: eng
text: This paper studies combinatorial properties of codes for the Z-channel. A
Z-channel with error fraction τ takes as input a length-n binary codeword and
injects in an adversarial manner up to nτ asymmetric errors, i.e., errors that
only zero out bits but do not flip 0’s to 1’s. It is known that the largest (L
− 1)-list-decodable code for the Z-channel with error fraction τ has exponential
(in n) size if τ is less than a critical value that we call the Plotkin point
and has constant size if τ is larger than the threshold. The (L−1)-list-decoding
Plotkin point is known to be L−1L−1−L−LL−1. In this paper, we show that the largest
(L−1)-list-decodable code ε-above the Plotkin point has size Θ L (ε −3/2 ) for
any L − 1 ≥ 1.
article_processing_charge: No
author:
- first_name: Nikita
full_name: Polyanskii, Nikita
last_name: Polyanskii
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
citation:
ama: 'Polyanskii N, Zhang Y. List-decodable zero-rate codes for the Z-channel. In:
2022 IEEE International Symposium on Information Theory. Vol 2022. Institute
of Electrical and Electronics Engineers; 2022:2553-2558. doi:10.1109/ISIT50566.2022.9834829'
apa: 'Polyanskii, N., & Zhang, Y. (2022). List-decodable zero-rate codes for
the Z-channel. In 2022 IEEE International Symposium on Information Theory
(Vol. 2022, pp. 2553–2558). Espoo, Finland: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/ISIT50566.2022.9834829'
chicago: Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for
the Z-Channel.” In 2022 IEEE International Symposium on Information Theory,
2022:2553–58. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/ISIT50566.2022.9834829.
ieee: N. Polyanskii and Y. Zhang, “List-decodable zero-rate codes for the Z-channel,”
in 2022 IEEE International Symposium on Information Theory, Espoo, Finland,
2022, vol. 2022, pp. 2553–2558.
ista: 'Polyanskii N, Zhang Y. 2022. List-decodable zero-rate codes for the Z-channel.
2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium
on Information Theory vol. 2022, 2553–2558.'
mla: Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for the
Z-Channel.” 2022 IEEE International Symposium on Information Theory, vol.
2022, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–58, doi:10.1109/ISIT50566.2022.9834829.
short: N. Polyanskii, Y. Zhang, in:, 2022 IEEE International Symposium on Information
Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–2558.
conference:
end_date: 2022-07-01
location: Espoo, Finland
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2022-06-26
date_created: 2022-09-04T22:02:07Z
date_published: 2022-08-03T00:00:00Z
date_updated: 2023-02-13T09:02:18Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834829
intvolume: ' 2022'
language:
- iso: eng
month: '08'
oa_version: None
page: 2553-2558
publication: 2022 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781665421591'
issn:
- 2157-8095
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: List-decodable zero-rate codes for the Z-channel
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...