{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3FVZQ2PMOV2VUUEAZ3ROMXHYA4","short_pith_number":"pith:3FVZQ2PM","schema_version":"1.0","canonical_sha256":"d96b9869ec75755a5080cee2e65cf80705e68d19476942b556ef04220ba44554","source":{"kind":"arxiv","id":"2206.06054","version":1},"attestation_state":"computed","paper":{"title":"Specifying and Testing $k$-Safety Properties for Machine-Learning Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LG","authors_text":"Adish Singla, Hasan Ferit Eniser, J\\\"org Hoffmann, Maria Christakis, Valentin W\\\"ustholz","submitted_at":"2022-06-13T11:35:55Z","abstract_excerpt":"Machine-learning models are becoming increasingly prevalent in our lives, for instance assisting in image-classification or decision-making tasks. Consequently, the reliability of these models is of critical importance and has resulted in the development of numerous approaches for validating and verifying their robustness and fairness. However, beyond such specific properties, it is challenging to specify, let alone check, general functional-correctness expectations from models. In this paper, we take inspiration from specifications used in formal methods, expressing functional-correctness pro"},"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":"2206.06054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-13T11:35:55Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"6dc60fe378fb293804c6ff4e803cc254485522ac399d2a243efbd2d8df89228c","abstract_canon_sha256":"8c8999d0b91de6c6be8271cfe2d2a3c6b0f7313a5c1e61e466a64887e5b019c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:14.570881Z","signature_b64":"wk88JIVu/CUzYPAktIhHvssw5ol+2y9GpKtpwlChMv1q4e9KOKgVy6zvafwDwAIQADNSyW2HSXqQKOG6SLeWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d96b9869ec75755a5080cee2e65cf80705e68d19476942b556ef04220ba44554","last_reissued_at":"2026-07-05T04:31:14.570390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:14.570390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Specifying and Testing $k$-Safety Properties for Machine-Learning Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LG","authors_text":"Adish Singla, Hasan Ferit Eniser, J\\\"org Hoffmann, Maria Christakis, Valentin W\\\"ustholz","submitted_at":"2022-06-13T11:35:55Z","abstract_excerpt":"Machine-learning models are becoming increasingly prevalent in our lives, for instance assisting in image-classification or decision-making tasks. Consequently, the reliability of these models is of critical importance and has resulted in the development of numerous approaches for validating and verifying their robustness and fairness. However, beyond such specific properties, it is challenging to specify, let alone check, general functional-correctness expectations from models. In this paper, we take inspiration from specifications used in formal methods, expressing functional-correctness pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06054","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/2206.06054/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":"2206.06054","created_at":"2026-07-05T04:31:14.570458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.06054v1","created_at":"2026-07-05T04:31:14.570458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06054","created_at":"2026-07-05T04:31:14.570458+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FVZQ2PMOV2V","created_at":"2026-07-05T04:31:14.570458+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FVZQ2PMOV2VUUEA","created_at":"2026-07-05T04:31:14.570458+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FVZQ2PM","created_at":"2026-07-05T04:31:14.570458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.05867","citing_title":"Neural Network Verification is a Programming Language Challenge","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3FVZQ2PMOV2VUUEAZ3ROMXHYA4","json":"https://pith.science/pith/3FVZQ2PMOV2VUUEAZ3ROMXHYA4.json","graph_json":"https://pith.science/api/pith-number/3FVZQ2PMOV2VUUEAZ3ROMXHYA4/graph.json","events_json":"https://pith.science/api/pith-number/3FVZQ2PMOV2VUUEAZ3ROMXHYA4/events.json","paper":"https://pith.science/paper/3FVZQ2PM"},"agent_actions":{"view_html":"https://pith.science/pith/3FVZQ2PMOV2VUUEAZ3ROMXHYA4","download_json":"https://pith.science/pith/3FVZQ2PMOV2VUUEAZ3ROMXHYA4.json","view_paper":"https://pith.science/paper/3FVZQ2PM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.06054&json=true","fetch_graph":"https://pith.science/api/pith-number/3FVZQ2PMOV2VUUEAZ3ROMXHYA4/graph.json","fetch_events":"https://pith.science/api/pith-number/3FVZQ2PMOV2VUUEAZ3ROMXHYA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FVZQ2PMOV2VUUEAZ3ROMXHYA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FVZQ2PMOV2VUUEAZ3ROMXHYA4/action/storage_attestation","attest_author":"https://pith.science/pith/3FVZQ2PMOV2VUUEAZ3ROMXHYA4/action/author_attestation","sign_citation":"https://pith.science/pith/3FVZQ2PMOV2VUUEAZ3ROMXHYA4/action/citation_signature","submit_replication":"https://pith.science/pith/3FVZQ2PMOV2VUUEAZ3ROMXHYA4/action/replication_record"}},"created_at":"2026-07-05T04:31:14.570458+00:00","updated_at":"2026-07-05T04:31:14.570458+00:00"}