{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7NU66D3FFQQGFGZLFJL5JT24C2","short_pith_number":"pith:7NU66D3F","canonical_record":{"source":{"id":"2505.05235","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-08T13:29:46Z","cross_cats_sorted":[],"title_canon_sha256":"2da95e32ccddef34c63fe26c67d0056a83f9f8a226cad274d2f11fdf197bbf24","abstract_canon_sha256":"03db872302718a023e08e04f2c2bafb31bedb2a07c634c5ded15a4d209ecb8f5"},"schema_version":"1.0"},"canonical_sha256":"fb69ef0f652c20629b2b2a57d4cf5c16bd845e16c677da9c750f0f8ea42e2a7e","source":{"kind":"arxiv","id":"2505.05235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.05235","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"arxiv_version","alias_value":"2505.05235v1","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05235","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"pith_short_12","alias_value":"7NU66D3FFQQG","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"pith_short_16","alias_value":"7NU66D3FFQQGFGZL","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"pith_short_8","alias_value":"7NU66D3F","created_at":"2026-07-05T11:00:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7NU66D3FFQQGFGZLFJL5JT24C2","target":"record","payload":{"canonical_record":{"source":{"id":"2505.05235","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-08T13:29:46Z","cross_cats_sorted":[],"title_canon_sha256":"2da95e32ccddef34c63fe26c67d0056a83f9f8a226cad274d2f11fdf197bbf24","abstract_canon_sha256":"03db872302718a023e08e04f2c2bafb31bedb2a07c634c5ded15a4d209ecb8f5"},"schema_version":"1.0"},"canonical_sha256":"fb69ef0f652c20629b2b2a57d4cf5c16bd845e16c677da9c750f0f8ea42e2a7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:21.101022Z","signature_b64":"67vTi+VMR7EXEFn2Gfy/oD0/vFCigQBLH1ZXMZlKhDkhMaC4MoQrSkw2h+W7PfYVJYZqRVw5d6x3gztHpoMxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb69ef0f652c20629b2b2a57d4cf5c16bd845e16c677da9c750f0f8ea42e2a7e","last_reissued_at":"2026-07-05T11:00:21.100333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:21.100333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.05235","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-07-05T11:00:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yC8NJcFoncYzgx4Tym21m2pUcFzpXkw3QxlYkLH24fKA+8NfvIbBZGXQZVj31QK+b95gRb/LMEwY13dFikaZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:08:46.118908Z"},"content_sha256":"e29d4d6d61422f8fc540be62a8704b507218272f67ac28f33993f9babc55e536","schema_version":"1.0","event_id":"sha256:e29d4d6d61422f8fc540be62a8704b507218272f67ac28f33993f9babc55e536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7NU66D3FFQQGFGZLFJL5JT24C2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Advancing Neural Network Verification through Hierarchical Safety Abstract Interpretation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alessandro Farinelli, Isabella Mastroeni, Luca Marzari","submitted_at":"2025-05-08T13:29:46Z","abstract_excerpt":"Traditional methods for formal verification (FV) of deep neural networks (DNNs) are constrained by a binary encoding of safety properties, where a model is classified as either safe or unsafe (robust or not robust). This binary encoding fails to capture the nuanced safety levels within a model, often resulting in either overly restrictive or too permissive requirements. In this paper, we introduce a novel problem formulation called Abstract DNN-Verification, which verifies a hierarchical structure of unsafe outputs, providing a more granular analysis of the safety aspect for a given DNN. Cruci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05235","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/2505.05235/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"},"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-07-05T11:00:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNOpWO9d30nHoEd2fESnTuhUQ23bW/kw4OJ9kFwz9um6Wy/nw6K6zQw7Qb5vTMTCZ/wPRmDbb6jW++nPTUbfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:08:46.119863Z"},"content_sha256":"18672951317ca1e35488d111fb755dcda8e68d3884e5849ce057081ce35ba3d3","schema_version":"1.0","event_id":"sha256:18672951317ca1e35488d111fb755dcda8e68d3884e5849ce057081ce35ba3d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NU66D3FFQQGFGZLFJL5JT24C2/bundle.json","state_url":"https://pith.science/pith/7NU66D3FFQQGFGZLFJL5JT24C2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NU66D3FFQQGFGZLFJL5JT24C2/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-08-09T01:08:46Z","links":{"resolver":"https://pith.science/pith/7NU66D3FFQQGFGZLFJL5JT24C2","bundle":"https://pith.science/pith/7NU66D3FFQQGFGZLFJL5JT24C2/bundle.json","state":"https://pith.science/pith/7NU66D3FFQQGFGZLFJL5JT24C2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NU66D3FFQQGFGZLFJL5JT24C2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7NU66D3FFQQGFGZLFJL5JT24C2","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":"03db872302718a023e08e04f2c2bafb31bedb2a07c634c5ded15a4d209ecb8f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-08T13:29:46Z","title_canon_sha256":"2da95e32ccddef34c63fe26c67d0056a83f9f8a226cad274d2f11fdf197bbf24"},"schema_version":"1.0","source":{"id":"2505.05235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.05235","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"arxiv_version","alias_value":"2505.05235v1","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05235","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"pith_short_12","alias_value":"7NU66D3FFQQG","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"pith_short_16","alias_value":"7NU66D3FFQQGFGZL","created_at":"2026-07-05T11:00:21Z"},{"alias_kind":"pith_short_8","alias_value":"7NU66D3F","created_at":"2026-07-05T11:00:21Z"}],"graph_snapshots":[{"event_id":"sha256:18672951317ca1e35488d111fb755dcda8e68d3884e5849ce057081ce35ba3d3","target":"graph","created_at":"2026-07-05T11:00:21Z","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/2505.05235/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Traditional methods for formal verification (FV) of deep neural networks (DNNs) are constrained by a binary encoding of safety properties, where a model is classified as either safe or unsafe (robust or not robust). This binary encoding fails to capture the nuanced safety levels within a model, often resulting in either overly restrictive or too permissive requirements. In this paper, we introduce a novel problem formulation called Abstract DNN-Verification, which verifies a hierarchical structure of unsafe outputs, providing a more granular analysis of the safety aspect for a given DNN. Cruci","authors_text":"Alessandro Farinelli, Isabella Mastroeni, Luca Marzari","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-08T13:29:46Z","title":"Advancing Neural Network Verification through Hierarchical Safety Abstract Interpretation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05235","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:e29d4d6d61422f8fc540be62a8704b507218272f67ac28f33993f9babc55e536","target":"record","created_at":"2026-07-05T11:00:21Z","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":"03db872302718a023e08e04f2c2bafb31bedb2a07c634c5ded15a4d209ecb8f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-08T13:29:46Z","title_canon_sha256":"2da95e32ccddef34c63fe26c67d0056a83f9f8a226cad274d2f11fdf197bbf24"},"schema_version":"1.0","source":{"id":"2505.05235","kind":"arxiv","version":1}},"canonical_sha256":"fb69ef0f652c20629b2b2a57d4cf5c16bd845e16c677da9c750f0f8ea42e2a7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb69ef0f652c20629b2b2a57d4cf5c16bd845e16c677da9c750f0f8ea42e2a7e","first_computed_at":"2026-07-05T11:00:21.100333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:21.100333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"67vTi+VMR7EXEFn2Gfy/oD0/vFCigQBLH1ZXMZlKhDkhMaC4MoQrSkw2h+W7PfYVJYZqRVw5d6x3gztHpoMxCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:21.101022Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.05235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e29d4d6d61422f8fc540be62a8704b507218272f67ac28f33993f9babc55e536","sha256:18672951317ca1e35488d111fb755dcda8e68d3884e5849ce057081ce35ba3d3"],"state_sha256":"4b8251f318de312e07ac5e47601110a099c4c6463e4f72503f9b12e2999c940d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rn7hsVLDcUy+E/UZn4RGP78yCrdxbxL0AzuQYlUwYrJ3Bu1UP5yeHkr4m2vee9+7nxxzGRUxXtwLcvRt/nDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T01:08:46.125676Z","bundle_sha256":"294076f36e6ea3992f6f7d9eb1980e5607854c6f012f7a7b264ad3611c9dde26"}}