{"schema":"pith.reference-change-event.v1","doi":"10.1038/nbt.1666","canonical_url":"https://pith.science/event/10.1038/nbt.1666","json_url":"https://pith.science/event/10.1038/nbt.1666.json","not_a_judgment":"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.","primary":{"event_id":446574,"doi":"10.1038/nbt.1666","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2012-04-10","title":"Erratum: Corrigendum: The BioPAX community standard for pathway data sharing","work_title":"Demir et al","work_doi":"10.1038/nbt.1666","work_arxiv_id":null,"notice_doi":"10.1038/nbt0412-365c","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1038/nbt.1666","json_href":"/event/10.1038/nbt.1666.json"},"events":[{"event_id":446574,"doi":"10.1038/nbt.1666","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2012-04-10","title":"Erratum: Corrigendum: The BioPAX community standard for pathway data sharing","work_title":"Demir et al","work_doi":"10.1038/nbt.1666","work_arxiv_id":null,"notice_doi":"10.1038/nbt0412-365c","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1038/nbt.1666","json_href":"/event/10.1038/nbt.1666.json"},{"event_id":436519,"doi":"10.1038/nbt.1666","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2010-12-07","title":"Erratum: Corrigendum: The BioPAX community standard for pathway data sharing","work_title":"Demir et al","work_doi":"10.1038/nbt.1666","work_arxiv_id":null,"notice_doi":"10.1038/nbt1210-1308c","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1038/nbt.1666","json_href":"/event/10.1038/nbt.1666.json"}],"flags":[{"id":10517,"status":"open","status_label":"Open","citing_arxiv_id":"2608.11496","citing_title":"Discrete Linear Ensemble Logic","ref_index":7,"evidence_raw":"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.","evidence_cleaned":"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","evidence_source_label":"citation context","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2012-04-10","work_title":"Demir et al","work_doi":"10.1038/nbt.1666","event_doi":"10.1038/nbt.1666","flag_href":"/flags/10517","event_href":"/event/10.1038/nbt.1666","paper_href":"/paper/2608.11496","created_at":"2026-08-16T06:31:06.339917Z","dispute_note":null,"disputed_at":null,"disputed_by":null},{"id":10509,"status":"open","status_label":"Open","citing_arxiv_id":"2608.11496","citing_title":"Discrete Linear Ensemble Logic","ref_index":7,"evidence_raw":"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.","evidence_cleaned":"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","evidence_source_label":"citation context","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2010-12-07","work_title":"Demir et al","work_doi":"10.1038/nbt.1666","event_doi":"10.1038/nbt.1666","flag_href":"/flags/10509","event_href":"/event/10.1038/nbt.1666","paper_href":"/paper/2608.11496","created_at":"2026-08-16T06:31:06.243534Z","dispute_note":null,"disputed_at":null,"disputed_by":null}],"flag_count":2,"flags_open":2,"flags_disputed":0,"desk_url":"https://pith.science/flags"}