{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TAW6KPYSSWC65BTXX5DL37RVN2","short_pith_number":"pith:TAW6KPYS","canonical_record":{"source":{"id":"1811.06029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T19:40:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"17ce882e8323be7dccd919b32aac21729570270c27f219c02bd7ce9fa84f2dfc","abstract_canon_sha256":"bce9d898505ba471f7f6baa53a915e304e4c99dfbea6605d8676758fb428e8f8"},"schema_version":"1.0"},"canonical_sha256":"982de53f129585ee8677bf46bdfe356ebd6ab41d4119875f028351bf964f7cb3","source":{"kind":"arxiv","id":"1811.06029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06029","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06029v1","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06029","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"TAW6KPYSSWC6","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TAW6KPYSSWC65BTX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TAW6KPYS","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TAW6KPYSSWC65BTXX5DL37RVN2","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T19:40:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"17ce882e8323be7dccd919b32aac21729570270c27f219c02bd7ce9fa84f2dfc","abstract_canon_sha256":"bce9d898505ba471f7f6baa53a915e304e4c99dfbea6605d8676758fb428e8f8"},"schema_version":"1.0"},"canonical_sha256":"982de53f129585ee8677bf46bdfe356ebd6ab41d4119875f028351bf964f7cb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:38.841929Z","signature_b64":"TmG6AWGNT/olwUjjmcizsVZhaFrLFnIJECiV483ZHK6fqbm9IbIgqiLVFfIoY91SnXB79XzcAWowtXTyocJIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"982de53f129585ee8677bf46bdfe356ebd6ab41d4119875f028351bf964f7cb3","last_reissued_at":"2026-05-18T00:00:38.841415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:38.841415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06029","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-18T00:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ew7UIOGSYWDlXkQ321E50soA+Csw4EOVPmNobD0ejInb+nTWYuKsKMTbJvj4pJ1pHFVq+DIckkvXK1igb2epBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:58:57.862172Z"},"content_sha256":"0751c66a9ec53e874a0f0905e5dfb2cb255c5f8b2e8cef0b9574553e6d8619ba","schema_version":"1.0","event_id":"sha256:0751c66a9ec53e874a0f0905e5dfb2cb255c5f8b2e8cef0b9574553e6d8619ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TAW6KPYSSWC65BTXX5DL37RVN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of Recurrent Neural Networks Through Rule Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"C. Lee Giles, Kaixuan Zhang, Qinglong Wang, Xue Liu","submitted_at":"2018-11-14T19:40:30Z","abstract_excerpt":"The verification problem for neural networks is verifying whether a neural network will suffer from adversarial samples, or approximating the maximal allowed scale of adversarial perturbation that can be endured. While most prior work contributes to verifying feed-forward networks, little has been explored for verifying recurrent networks. This is due to the existence of a more rigorous constraint on the perturbation space for sequential data, and the lack of a proper metric for measuring the perturbation. In this work, we address these challenges by proposing a metric which measures the dista"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06029","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-18T00:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QjwqjctZbEeA2VCPolRwAVNGLzU/+RUh4xF5fEMRzFxDYqE8KuxMbCxlVPZSrMQiVw1FYZ9DHhQXwYV0Pwv+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:58:57.862749Z"},"content_sha256":"09ecaeafe0472e8321ffc8463c8b683237d657929b474784fec9cf6e824579ff","schema_version":"1.0","event_id":"sha256:09ecaeafe0472e8321ffc8463c8b683237d657929b474784fec9cf6e824579ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAW6KPYSSWC65BTXX5DL37RVN2/bundle.json","state_url":"https://pith.science/pith/TAW6KPYSSWC65BTXX5DL37RVN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAW6KPYSSWC65BTXX5DL37RVN2/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-24T10:58:57Z","links":{"resolver":"https://pith.science/pith/TAW6KPYSSWC65BTXX5DL37RVN2","bundle":"https://pith.science/pith/TAW6KPYSSWC65BTXX5DL37RVN2/bundle.json","state":"https://pith.science/pith/TAW6KPYSSWC65BTXX5DL37RVN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAW6KPYSSWC65BTXX5DL37RVN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TAW6KPYSSWC65BTXX5DL37RVN2","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":"bce9d898505ba471f7f6baa53a915e304e4c99dfbea6605d8676758fb428e8f8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T19:40:30Z","title_canon_sha256":"17ce882e8323be7dccd919b32aac21729570270c27f219c02bd7ce9fa84f2dfc"},"schema_version":"1.0","source":{"id":"1811.06029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06029","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06029v1","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06029","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"TAW6KPYSSWC6","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TAW6KPYSSWC65BTX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TAW6KPYS","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:09ecaeafe0472e8321ffc8463c8b683237d657929b474784fec9cf6e824579ff","target":"graph","created_at":"2026-05-18T00:00:38Z","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 verification problem for neural networks is verifying whether a neural network will suffer from adversarial samples, or approximating the maximal allowed scale of adversarial perturbation that can be endured. While most prior work contributes to verifying feed-forward networks, little has been explored for verifying recurrent networks. This is due to the existence of a more rigorous constraint on the perturbation space for sequential data, and the lack of a proper metric for measuring the perturbation. In this work, we address these challenges by proposing a metric which measures the dista","authors_text":"C. Lee Giles, Kaixuan Zhang, Qinglong Wang, Xue Liu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T19:40:30Z","title":"Verification of Recurrent Neural Networks Through Rule Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06029","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:0751c66a9ec53e874a0f0905e5dfb2cb255c5f8b2e8cef0b9574553e6d8619ba","target":"record","created_at":"2026-05-18T00:00:38Z","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":"bce9d898505ba471f7f6baa53a915e304e4c99dfbea6605d8676758fb428e8f8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T19:40:30Z","title_canon_sha256":"17ce882e8323be7dccd919b32aac21729570270c27f219c02bd7ce9fa84f2dfc"},"schema_version":"1.0","source":{"id":"1811.06029","kind":"arxiv","version":1}},"canonical_sha256":"982de53f129585ee8677bf46bdfe356ebd6ab41d4119875f028351bf964f7cb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"982de53f129585ee8677bf46bdfe356ebd6ab41d4119875f028351bf964f7cb3","first_computed_at":"2026-05-18T00:00:38.841415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:38.841415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TmG6AWGNT/olwUjjmcizsVZhaFrLFnIJECiV483ZHK6fqbm9IbIgqiLVFfIoY91SnXB79XzcAWowtXTyocJIBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:38.841929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0751c66a9ec53e874a0f0905e5dfb2cb255c5f8b2e8cef0b9574553e6d8619ba","sha256:09ecaeafe0472e8321ffc8463c8b683237d657929b474784fec9cf6e824579ff"],"state_sha256":"2b4f94ec06cdcce3112330ceee332d13e3ea880a4dde8102121a6591261e0085"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t3XP8ydrvHCIseJZxTCYjwM3QLHD3VgstQT2lXAuCwfUL0x7/3tHWIFQsQvWhHebOWMckDuMTq2e+s2Pi2iJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T10:58:57.866483Z","bundle_sha256":"240c08dca4cdd124091c64163f36277e3d512481d755fe05b5c8d84821b706b2"}}