{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HXHHNDD663CSM2ESZGOJBGGTYW","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":"cee9da88149f38047cfba99608fec787a7b02b71c0f364b80d740744b2ec737a","cross_cats_sorted":["cs.LO","cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-31T17:00:50Z","title_canon_sha256":"1670956b3a9b052b75fae9a1a0c59145e403719488fbc503b7e132c4c2bb73a5"},"schema_version":"1.0","source":{"id":"2201.13351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.13351","created_at":"2026-07-05T03:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"2201.13351v1","created_at":"2026-07-05T03:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.13351","created_at":"2026-07-05T03:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"HXHHNDD663CS","created_at":"2026-07-05T03:52:51Z"},{"alias_kind":"pith_short_16","alias_value":"HXHHNDD663CSM2ES","created_at":"2026-07-05T03:52:51Z"},{"alias_kind":"pith_short_8","alias_value":"HXHHNDD6","created_at":"2026-07-05T03:52:51Z"}],"graph_snapshots":[{"event_id":"sha256:e6b2c4e828a2fc082ac56e176b7691ed60ec275a6427907c81ca6fd45f0e67c5","target":"graph","created_at":"2026-07-05T03:52:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.13351/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The most scalable approaches to certifying neural network robustness depend on computing sound linear lower and upper bounds for the network's activation functions. Current approaches are limited in that the linear bounds must be handcrafted by an expert, and can be sub-optimal, especially when the network's architecture composes operations using, for example, multiplication such as in LSTMs and the recently popular Swish activation. The dependence on an expert prevents the application of robustness certification to developments in the state-of-the-art of activation functions, and furthermore ","authors_text":"Brandon Paulsen, Chao Wang","cross_cats":["cs.LO","cs.NA","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-31T17:00:50Z","title":"LinSyn: Synthesizing Tight Linear Bounds for Arbitrary Neural Network Activation Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.13351","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:d04315579531caabcccffd81ddf47499eb45bcb492e81fd6b40e92789f358400","target":"record","created_at":"2026-07-05T03:52:51Z","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":"cee9da88149f38047cfba99608fec787a7b02b71c0f364b80d740744b2ec737a","cross_cats_sorted":["cs.LO","cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-31T17:00:50Z","title_canon_sha256":"1670956b3a9b052b75fae9a1a0c59145e403719488fbc503b7e132c4c2bb73a5"},"schema_version":"1.0","source":{"id":"2201.13351","kind":"arxiv","version":1}},"canonical_sha256":"3dce768c7ef6c5266892c99c9098d3c5aba1c3f11cd8d1f284ce72aea6062329","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dce768c7ef6c5266892c99c9098d3c5aba1c3f11cd8d1f284ce72aea6062329","first_computed_at":"2026-07-05T03:52:51.277408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:52:51.277408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8lG2sjCI9WpaSpSvX+PSLFj33sXjWrlkznkTSBmInlaikhVxsF12XgDQtLa+Ufg7SWlVxpMymQIe9StGq3pqDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:52:51.277773Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.13351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d04315579531caabcccffd81ddf47499eb45bcb492e81fd6b40e92789f358400","sha256:e6b2c4e828a2fc082ac56e176b7691ed60ec275a6427907c81ca6fd45f0e67c5"],"state_sha256":"92d64df30badff57aa2dc31fbc1bf7f4db2e12034feebd39207b4113cf7048ab"}