{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EWKGMV5SBFCNIKMGU6APAQUYN7","short_pith_number":"pith:EWKGMV5S","schema_version":"1.0","canonical_sha256":"25946657b20944d42986a780f042986fe08a2ee6b13335da0ca7b5f4aa534994","source":{"kind":"arxiv","id":"2605.20482","version":1},"attestation_state":"computed","paper":{"title":"Quadratic Characterizations for Reachability Analysis of Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Elias Khalife, Mazen Farhood, Pierre-Loic Garoche","submitted_at":"2026-05-19T20:45:31Z","abstract_excerpt":"Quadratic constraints (QCs) are widely used to characterize nonlinearities and uncertainties, but generic analytical characterizations can be conservative on bounded domains. This paper develops a framework for constructing verified quadratic characterizations of scalar relations in the two-dimensional real plane. Candidate quadratic inequalities are locally generated by solving convex quadratic programs using samples from the relation and exterior sample points. They are then verified globally using sum-of-squares certificates over an exact semialgebraic description or, in the case of nonpoly"},"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":"2605.20482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-19T20:45:31Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"3c645587a4ed68feb942b26060b94d2c5f60b7a7e7f517383dcc2a93503ac76e","abstract_canon_sha256":"9b194683a568360e25786d2a4aa73d6dd8c2512928a36db5795175d681aedad3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:39.336725Z","signature_b64":"6zqkQHWbP+u+YZVQNsSw1LMyjjnMSPz5/V3WMRU+i6GrHUm9QyMDgKhBRLEkclARPDE5YFvA5P1yF2eiQNSjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25946657b20944d42986a780f042986fe08a2ee6b13335da0ca7b5f4aa534994","last_reissued_at":"2026-05-21T01:04:39.336082Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:39.336082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadratic Characterizations for Reachability Analysis of Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Elias Khalife, Mazen Farhood, Pierre-Loic Garoche","submitted_at":"2026-05-19T20:45:31Z","abstract_excerpt":"Quadratic constraints (QCs) are widely used to characterize nonlinearities and uncertainties, but generic analytical characterizations can be conservative on bounded domains. This paper develops a framework for constructing verified quadratic characterizations of scalar relations in the two-dimensional real plane. Candidate quadratic inequalities are locally generated by solving convex quadratic programs using samples from the relation and exterior sample points. They are then verified globally using sum-of-squares certificates over an exact semialgebraic description or, in the case of nonpoly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20482","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.20482/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.20482","created_at":"2026-05-21T01:04:39.336181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20482v1","created_at":"2026-05-21T01:04:39.336181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20482","created_at":"2026-05-21T01:04:39.336181+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWKGMV5SBFCN","created_at":"2026-05-21T01:04:39.336181+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWKGMV5SBFCNIKMG","created_at":"2026-05-21T01:04:39.336181+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWKGMV5S","created_at":"2026-05-21T01:04:39.336181+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/EWKGMV5SBFCNIKMGU6APAQUYN7","json":"https://pith.science/pith/EWKGMV5SBFCNIKMGU6APAQUYN7.json","graph_json":"https://pith.science/api/pith-number/EWKGMV5SBFCNIKMGU6APAQUYN7/graph.json","events_json":"https://pith.science/api/pith-number/EWKGMV5SBFCNIKMGU6APAQUYN7/events.json","paper":"https://pith.science/paper/EWKGMV5S"},"agent_actions":{"view_html":"https://pith.science/pith/EWKGMV5SBFCNIKMGU6APAQUYN7","download_json":"https://pith.science/pith/EWKGMV5SBFCNIKMGU6APAQUYN7.json","view_paper":"https://pith.science/paper/EWKGMV5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20482&json=true","fetch_graph":"https://pith.science/api/pith-number/EWKGMV5SBFCNIKMGU6APAQUYN7/graph.json","fetch_events":"https://pith.science/api/pith-number/EWKGMV5SBFCNIKMGU6APAQUYN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWKGMV5SBFCNIKMGU6APAQUYN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWKGMV5SBFCNIKMGU6APAQUYN7/action/storage_attestation","attest_author":"https://pith.science/pith/EWKGMV5SBFCNIKMGU6APAQUYN7/action/author_attestation","sign_citation":"https://pith.science/pith/EWKGMV5SBFCNIKMGU6APAQUYN7/action/citation_signature","submit_replication":"https://pith.science/pith/EWKGMV5SBFCNIKMGU6APAQUYN7/action/replication_record"}},"created_at":"2026-05-21T01:04:39.336181+00:00","updated_at":"2026-05-21T01:04:39.336181+00:00"}