{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3JAKK6JSZQGJR5K2TMIBORG6YN","short_pith_number":"pith:3JAKK6JS","schema_version":"1.0","canonical_sha256":"da40a57932cc0c98f55a9b101744dec3666c45e58e855d643bba0367dfac22d4","source":{"kind":"arxiv","id":"1905.07387","version":1},"attestation_state":"computed","paper":{"title":"POPQORN: Quantifying Robustness of Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ching-Yun Ko, Dahua Lin, Luca Daniel, Ngai Wong, Tsui-Wei Weng, Zhaoyang Lyu","submitted_at":"2019-05-17T17:35:04Z","abstract_excerpt":"The vulnerability to adversarial attacks has been a critical issue for deep neural networks. Addressing this issue requires a reliable way to evaluate the robustness of a network. Recently, several methods have been developed to compute $\\textit{robustness quantification}$ for neural networks, namely, certified lower bounds of the minimum adversarial perturbation. Such methods, however, were devised for feed-forward networks, e.g. multi-layer perceptron or convolutional networks. It remains an open problem to quantify robustness for recurrent networks, especially LSTM and GRU. For such network"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.07387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T17:35:04Z","cross_cats_sorted":["cs.CR","cs.CV","stat.ML"],"title_canon_sha256":"883bdcd3cdbda536219ee8c6da648ef0ef2312715304338671031d6e4bd8c268","abstract_canon_sha256":"272bb28869465a064395072a6989d9c57fb86b3b02681c50e12b647dd0039c3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:55.747989Z","signature_b64":"Jn7vg2oxqei9ctxpsHTznggZS8i7nIKYx6bVOZSlVb2+QUSZ9KVJnGYsvIlSSySUnsLVUpeiS8l3Tyt63dH/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da40a57932cc0c98f55a9b101744dec3666c45e58e855d643bba0367dfac22d4","last_reissued_at":"2026-05-17T23:45:55.747546Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:55.747546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"POPQORN: Quantifying Robustness of Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ching-Yun Ko, Dahua Lin, Luca Daniel, Ngai Wong, Tsui-Wei Weng, Zhaoyang Lyu","submitted_at":"2019-05-17T17:35:04Z","abstract_excerpt":"The vulnerability to adversarial attacks has been a critical issue for deep neural networks. Addressing this issue requires a reliable way to evaluate the robustness of a network. Recently, several methods have been developed to compute $\\textit{robustness quantification}$ for neural networks, namely, certified lower bounds of the minimum adversarial perturbation. Such methods, however, were devised for feed-forward networks, e.g. multi-layer perceptron or convolutional networks. It remains an open problem to quantify robustness for recurrent networks, especially LSTM and GRU. For such network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07387","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.07387","created_at":"2026-05-17T23:45:55.747614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07387v1","created_at":"2026-05-17T23:45:55.747614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07387","created_at":"2026-05-17T23:45:55.747614+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JAKK6JSZQGJ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JAKK6JSZQGJR5K2","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JAKK6JS","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN","json":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN.json","graph_json":"https://pith.science/api/pith-number/3JAKK6JSZQGJR5K2TMIBORG6YN/graph.json","events_json":"https://pith.science/api/pith-number/3JAKK6JSZQGJR5K2TMIBORG6YN/events.json","paper":"https://pith.science/paper/3JAKK6JS"},"agent_actions":{"view_html":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN","download_json":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN.json","view_paper":"https://pith.science/paper/3JAKK6JS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07387&json=true","fetch_graph":"https://pith.science/api/pith-number/3JAKK6JSZQGJR5K2TMIBORG6YN/graph.json","fetch_events":"https://pith.science/api/pith-number/3JAKK6JSZQGJR5K2TMIBORG6YN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/action/storage_attestation","attest_author":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/action/author_attestation","sign_citation":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/action/citation_signature","submit_replication":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/action/replication_record"}},"created_at":"2026-05-17T23:45:55.747614+00:00","updated_at":"2026-05-17T23:45:55.747614+00:00"}