{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LUDP2WLW5RDYBE6HODPF2Y5HPB","short_pith_number":"pith:LUDP2WLW","schema_version":"1.0","canonical_sha256":"5d06fd5976ec478093c770de5d63a778705263f803a1ea1f578ab8e22f69e9c2","source":{"kind":"arxiv","id":"1812.06161","version":1},"attestation_state":"computed","paper":{"title":"Specification-Guided Safety Verification for Feedforward Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hoang-Dung Tran, Taylor T. Johnson, Weiming Xiang","submitted_at":"2018-12-14T20:47:54Z","abstract_excerpt":"This paper presents a specification-guided safety verification method for feedforward neural networks with general activation functions. As such feedforward networks are memoryless, they can be abstractly represented as mathematical functions, and the reachability analysis of the neural network amounts to interval analysis problems. In the framework of interval analysis, a computationally efficient formula which can quickly compute the output interval sets of a neural network is developed. Then, a specification-guided reachability algorithm is developed. Specifically, the bisection process in "},"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":"1812.06161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-14T20:47:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"66cf1c0f6abb0bd56b615c27fdcd1aaeeeda651ab0a35e2466f749bac58f4964","abstract_canon_sha256":"9f0e8f9e0bc70ad07573038fcaa36050c91ae60b4da0169f1464ded80fbb8aa2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:12.998723Z","signature_b64":"x53+Rw8WmBG1KeE5bJOPVWbbujyeHTwrRFRHz6FSdyIxfBfflwSiLRsjf5BOEpk+JV7mbtA00Yd1G7G4h5pQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d06fd5976ec478093c770de5d63a778705263f803a1ea1f578ab8e22f69e9c2","last_reissued_at":"2026-05-17T23:58:12.998060Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:12.998060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Specification-Guided Safety Verification for Feedforward Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hoang-Dung Tran, Taylor T. Johnson, Weiming Xiang","submitted_at":"2018-12-14T20:47:54Z","abstract_excerpt":"This paper presents a specification-guided safety verification method for feedforward neural networks with general activation functions. As such feedforward networks are memoryless, they can be abstractly represented as mathematical functions, and the reachability analysis of the neural network amounts to interval analysis problems. In the framework of interval analysis, a computationally efficient formula which can quickly compute the output interval sets of a neural network is developed. Then, a specification-guided reachability algorithm is developed. Specifically, the bisection process in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06161","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":"1812.06161","created_at":"2026-05-17T23:58:12.998146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06161v1","created_at":"2026-05-17T23:58:12.998146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06161","created_at":"2026-05-17T23:58:12.998146+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUDP2WLW5RDY","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUDP2WLW5RDYBE6H","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUDP2WLW","created_at":"2026-05-18T12:32:37.024351+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/LUDP2WLW5RDYBE6HODPF2Y5HPB","json":"https://pith.science/pith/LUDP2WLW5RDYBE6HODPF2Y5HPB.json","graph_json":"https://pith.science/api/pith-number/LUDP2WLW5RDYBE6HODPF2Y5HPB/graph.json","events_json":"https://pith.science/api/pith-number/LUDP2WLW5RDYBE6HODPF2Y5HPB/events.json","paper":"https://pith.science/paper/LUDP2WLW"},"agent_actions":{"view_html":"https://pith.science/pith/LUDP2WLW5RDYBE6HODPF2Y5HPB","download_json":"https://pith.science/pith/LUDP2WLW5RDYBE6HODPF2Y5HPB.json","view_paper":"https://pith.science/paper/LUDP2WLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06161&json=true","fetch_graph":"https://pith.science/api/pith-number/LUDP2WLW5RDYBE6HODPF2Y5HPB/graph.json","fetch_events":"https://pith.science/api/pith-number/LUDP2WLW5RDYBE6HODPF2Y5HPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUDP2WLW5RDYBE6HODPF2Y5HPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUDP2WLW5RDYBE6HODPF2Y5HPB/action/storage_attestation","attest_author":"https://pith.science/pith/LUDP2WLW5RDYBE6HODPF2Y5HPB/action/author_attestation","sign_citation":"https://pith.science/pith/LUDP2WLW5RDYBE6HODPF2Y5HPB/action/citation_signature","submit_replication":"https://pith.science/pith/LUDP2WLW5RDYBE6HODPF2Y5HPB/action/replication_record"}},"created_at":"2026-05-17T23:58:12.998146+00:00","updated_at":"2026-05-17T23:58:12.998146+00:00"}