{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3JAKK6JSZQGJR5K2TMIBORG6YN","short_pith_number":"pith:3JAKK6JS","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"},"canonical_sha256":"da40a57932cc0c98f55a9b101744dec3666c45e58e855d643bba0367dfac22d4","source":{"kind":"arxiv","id":"1905.07387","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07387","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07387v1","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07387","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"3JAKK6JSZQGJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3JAKK6JSZQGJR5K2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3JAKK6JS","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3JAKK6JSZQGJR5K2TMIBORG6YN","target":"record","payload":{"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"},"canonical_sha256":"da40a57932cc0c98f55a9b101744dec3666c45e58e855d643bba0367dfac22d4","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"},"source_kind":"arxiv","source_id":"1905.07387","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Na/ghaUhAA4tfMpbMk4l/TKt6VSaoojLFbqp9y/IpTT4JzUFDcszEH/fDNByeZqf76sZYjyCxmy6zE6sqVlgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:19:47.948794Z"},"content_sha256":"dc0059d2efdda4d41ce02c7c52a94e65e806078386e1d6853552aad15f7fb279","schema_version":"1.0","event_id":"sha256:dc0059d2efdda4d41ce02c7c52a94e65e806078386e1d6853552aad15f7fb279"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3JAKK6JSZQGJR5K2TMIBORG6YN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDUjmxc3LTuaINdZLnFGV0TfJuLD7sy5XWoN2lfaj8LR7pSaaPUfhdhVyl3ZHkx2PuJ2voXPhf0PWCmp88I7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:19:47.949455Z"},"content_sha256":"a14d2a4ff446e7df76570fd93f20b48452bbab5d2b941c357cfcc0b6826e37b7","schema_version":"1.0","event_id":"sha256:a14d2a4ff446e7df76570fd93f20b48452bbab5d2b941c357cfcc0b6826e37b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/bundle.json","state_url":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-18T22:19:47Z","links":{"resolver":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN","bundle":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/bundle.json","state":"https://pith.science/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JAKK6JSZQGJR5K2TMIBORG6YN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3JAKK6JSZQGJR5K2TMIBORG6YN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"272bb28869465a064395072a6989d9c57fb86b3b02681c50e12b647dd0039c3c","cross_cats_sorted":["cs.CR","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T17:35:04Z","title_canon_sha256":"883bdcd3cdbda536219ee8c6da648ef0ef2312715304338671031d6e4bd8c268"},"schema_version":"1.0","source":{"id":"1905.07387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07387","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07387v1","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07387","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"3JAKK6JSZQGJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3JAKK6JSZQGJR5K2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3JAKK6JS","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:a14d2a4ff446e7df76570fd93f20b48452bbab5d2b941c357cfcc0b6826e37b7","target":"graph","created_at":"2026-05-17T23:45:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ching-Yun Ko, Dahua Lin, Luca Daniel, Ngai Wong, Tsui-Wei Weng, Zhaoyang Lyu","cross_cats":["cs.CR","cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T17:35:04Z","title":"POPQORN: Quantifying Robustness of Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07387","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dc0059d2efdda4d41ce02c7c52a94e65e806078386e1d6853552aad15f7fb279","target":"record","created_at":"2026-05-17T23:45:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"272bb28869465a064395072a6989d9c57fb86b3b02681c50e12b647dd0039c3c","cross_cats_sorted":["cs.CR","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T17:35:04Z","title_canon_sha256":"883bdcd3cdbda536219ee8c6da648ef0ef2312715304338671031d6e4bd8c268"},"schema_version":"1.0","source":{"id":"1905.07387","kind":"arxiv","version":1}},"canonical_sha256":"da40a57932cc0c98f55a9b101744dec3666c45e58e855d643bba0367dfac22d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da40a57932cc0c98f55a9b101744dec3666c45e58e855d643bba0367dfac22d4","first_computed_at":"2026-05-17T23:45:55.747546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:55.747546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jn7vg2oxqei9ctxpsHTznggZS8i7nIKYx6bVOZSlVb2+QUSZ9KVJnGYsvIlSSySUnsLVUpeiS8l3Tyt63dH/Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:55.747989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc0059d2efdda4d41ce02c7c52a94e65e806078386e1d6853552aad15f7fb279","sha256:a14d2a4ff446e7df76570fd93f20b48452bbab5d2b941c357cfcc0b6826e37b7"],"state_sha256":"551df4495ead2c0217e8c2e5e180471e263bb066952b64d08f9022347e6be6c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mh+qIukKtBGyvtcqnDev8eU93nBfL9KisoeZbqO1CIr5PplmLiSwx+eWB8PIrhRViD4mbD45cUONoS3EELrTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T22:19:47.951498Z","bundle_sha256":"0fbcb3e9b68b4c7aad6b85433787926449a43baba0f067b7b4483568edda67a1"}}