Reference change · event page
Reference changes · DOI
Demir et al
Published notice on a work cited in the Pith corpus. Exact quotes below. No model judges whether any citation was load-bearing.
This page records that a citing paper's bibliography includes a work with a published notice. It is not a judgment on the citing paper.
Correction
Crossref
2 open · 2 total · 0 disputed
- Event date
- 2012-04-10
01Notices on this DOI
-
Correction
Crossref · 2012-04-10
-
Correction
Crossref · 2010-12-07
02One-hop citing occurrences
Correction
Open
Discrete Linear Ensemble Logic
ref [7] ·
2608.11496
· notice #10517
· dispute
Raw extraction · citation context
lics/BresolinMSS11.html [6] D. C. Cooper. Theorem proving in arithmetic without multiplication. In Bernard Meltzer and Donald Michie, editors,Machine Intelligence, volume 7, pages 91-99. Edinburgh University Press, Edinburgh, 1972. [7] E. Demir et al. The BioPAX community standard for pathway data sharing.Nature Biotechnology, 28:935-942, 2010.https://doi.org/10.1038/nbt.1666 [8] J. Fan, X. Li, Y. Huang, X. Hao, L. Cui, GQ Zhang. Ensemble logic for symbolic representation of sleep medicine guidelines. InProceedings of AMIA 2026, 10 pages, in press. [9] M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy.Mathematical Systems Theory, 17(1):13-27, 1984. [10] J. Håstad. Almost optimal lower bounds for small depth circuits.
Parser render (TeX stripped for reading; raw above is the evidence)
lics/BresolinMSS11.html [6] D. C. Cooper. Theorem proving in arithmetic without multiplication. In Bernard Meltzer and Donald Michie, editors,Machine Intelligence, volume 7, pages 91-99. Edinburgh University Press, Edinburgh, 1972. [7] E. Demir et al. The BioPAX community standard for pathway data sharing.Nature Biotechnology, 28:935-942, 2010.https://doi.org/10.1038/nbt.1666 [8] J. Fan, X. Li, Y. Huang, X. Hao, L. Cui, GQ Zhang. Ensemble logic for symbolic representation of sleep medicine guidelines. InProceedings of AMIA 2026, 10 pages, in press. [9] M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy.Mathematical Systems Theory, 17(1):13-27, 1984. [10] J. Håstad. Almost optimal lower bounds for small depth circuits
Correction
Open
Discrete Linear Ensemble Logic
ref [7] ·
2608.11496
· notice #10509
· dispute
Raw extraction · citation context
lics/BresolinMSS11.html [6] D. C. Cooper. Theorem proving in arithmetic without multiplication. In Bernard Meltzer and Donald Michie, editors,Machine Intelligence, volume 7, pages 91-99. Edinburgh University Press, Edinburgh, 1972. [7] E. Demir et al. The BioPAX community standard for pathway data sharing.Nature Biotechnology, 28:935-942, 2010.https://doi.org/10.1038/nbt.1666 [8] J. Fan, X. Li, Y. Huang, X. Hao, L. Cui, GQ Zhang. Ensemble logic for symbolic representation of sleep medicine guidelines. InProceedings of AMIA 2026, 10 pages, in press. [9] M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy.Mathematical Systems Theory, 17(1):13-27, 1984. [10] J. Håstad. Almost optimal lower bounds for small depth circuits.
Parser render (TeX stripped for reading; raw above is the evidence)
lics/BresolinMSS11.html [6] D. C. Cooper. Theorem proving in arithmetic without multiplication. In Bernard Meltzer and Donald Michie, editors,Machine Intelligence, volume 7, pages 91-99. Edinburgh University Press, Edinburgh, 1972. [7] E. Demir et al. The BioPAX community standard for pathway data sharing.Nature Biotechnology, 28:935-942, 2010.https://doi.org/10.1038/nbt.1666 [8] J. Fan, X. Li, Y. Huang, X. Hao, L. Cui, GQ Zhang. Ensemble logic for symbolic representation of sleep medicine guidelines. InProceedings of AMIA 2026, 10 pages, in press. [9] M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy.Mathematical Systems Theory, 17(1):13-27, 1984. [10] J. Håstad. Almost optimal lower bounds for small depth circuits