{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CVYRJWUCWYY3S6CMVSHOUXVKJ6","short_pith_number":"pith:CVYRJWUC","canonical_record":{"source":{"id":"2505.17254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-22T20:05:20Z","cross_cats_sorted":[],"title_canon_sha256":"df02c5fbbea673ce1dd4ac8800418287b0d4e20c971c0b6da579b1d9b9aabf8c","abstract_canon_sha256":"901cb992d3ffecc1e36d8b5a59e8f9d58ab0951a8402261c23fb9c5e3e5b5af0"},"schema_version":"1.0"},"canonical_sha256":"157114da82b631b9784cac8eea5eaa4fac1b2ec7185e8b4fd13c55e83402553a","source":{"kind":"arxiv","id":"2505.17254","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17254","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17254v1","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17254","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"CVYRJWUCWYY3","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"pith_short_16","alias_value":"CVYRJWUCWYY3S6CM","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"pith_short_8","alias_value":"CVYRJWUC","created_at":"2026-07-05T11:08:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CVYRJWUCWYY3S6CMVSHOUXVKJ6","target":"record","payload":{"canonical_record":{"source":{"id":"2505.17254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-22T20:05:20Z","cross_cats_sorted":[],"title_canon_sha256":"df02c5fbbea673ce1dd4ac8800418287b0d4e20c971c0b6da579b1d9b9aabf8c","abstract_canon_sha256":"901cb992d3ffecc1e36d8b5a59e8f9d58ab0951a8402261c23fb9c5e3e5b5af0"},"schema_version":"1.0"},"canonical_sha256":"157114da82b631b9784cac8eea5eaa4fac1b2ec7185e8b4fd13c55e83402553a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:23.484161Z","signature_b64":"FyCO5U45jGIapirzpXJsqo8YDFQgb8i2x3Nl/AFVbmbcMpaOblWhewuRV7sjX8bI6oY7inEcWTfWAEtOtGh7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"157114da82b631b9784cac8eea5eaa4fac1b2ec7185e8b4fd13c55e83402553a","last_reissued_at":"2026-07-05T11:08:23.483632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:23.483632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.17254","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:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Htc7XgMOt5DKd7cz/Ed6Ek7eO/DCFDKuztDVFi3Wb9XptOx4zrmfih1oF/+6cicXANB71Hk7+XLtty515x5vAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:35:13.379885Z"},"content_sha256":"1e87c5a273c381c65817ad511cf042d0b31ee99fc17ad4145e5decff71efa9ff","schema_version":"1.0","event_id":"sha256:1e87c5a273c381c65817ad511cf042d0b31ee99fc17ad4145e5decff71efa9ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CVYRJWUCWYY3S6CMVSHOUXVKJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approach to Finding a Robust Deep Learning Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexey Boldyrev, Andrey Shevelev, Fedor Ratnikov","submitted_at":"2025-05-22T20:05:20Z","abstract_excerpt":"The rapid development of machine learning (ML) and artificial intelligence (AI) applications requires the training of large numbers of models. This growing demand highlights the importance of training models without human supervision, while ensuring that their predictions are reliable. In response to this need, we propose a novel approach for determining model robustness. This approach, supplemented with a proposed model selection algorithm designed as a meta-algorithm, is versatile and applicable to any machine learning model, provided that it is appropriate for the task at hand. This study d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17254","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.17254/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:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMWdECgN0x1KY+ctv/i9pu+PJqAplLWKcb835Jpe+8S/VW67QOFaS08Etf9Vies+Av4pvAKHBa4ZvIqWQVzHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:35:13.380493Z"},"content_sha256":"f3c8d1588a5ea99e626ba890e4e61ebd038b78415d6eaf59e4c27e293c0cb78b","schema_version":"1.0","event_id":"sha256:f3c8d1588a5ea99e626ba890e4e61ebd038b78415d6eaf59e4c27e293c0cb78b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVYRJWUCWYY3S6CMVSHOUXVKJ6/bundle.json","state_url":"https://pith.science/pith/CVYRJWUCWYY3S6CMVSHOUXVKJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVYRJWUCWYY3S6CMVSHOUXVKJ6/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-08T17:35:13Z","links":{"resolver":"https://pith.science/pith/CVYRJWUCWYY3S6CMVSHOUXVKJ6","bundle":"https://pith.science/pith/CVYRJWUCWYY3S6CMVSHOUXVKJ6/bundle.json","state":"https://pith.science/pith/CVYRJWUCWYY3S6CMVSHOUXVKJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVYRJWUCWYY3S6CMVSHOUXVKJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CVYRJWUCWYY3S6CMVSHOUXVKJ6","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":"901cb992d3ffecc1e36d8b5a59e8f9d58ab0951a8402261c23fb9c5e3e5b5af0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-22T20:05:20Z","title_canon_sha256":"df02c5fbbea673ce1dd4ac8800418287b0d4e20c971c0b6da579b1d9b9aabf8c"},"schema_version":"1.0","source":{"id":"2505.17254","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17254","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17254v1","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17254","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"CVYRJWUCWYY3","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"pith_short_16","alias_value":"CVYRJWUCWYY3S6CM","created_at":"2026-07-05T11:08:23Z"},{"alias_kind":"pith_short_8","alias_value":"CVYRJWUC","created_at":"2026-07-05T11:08:23Z"}],"graph_snapshots":[{"event_id":"sha256:f3c8d1588a5ea99e626ba890e4e61ebd038b78415d6eaf59e4c27e293c0cb78b","target":"graph","created_at":"2026-07-05T11:08:23Z","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.17254/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The rapid development of machine learning (ML) and artificial intelligence (AI) applications requires the training of large numbers of models. This growing demand highlights the importance of training models without human supervision, while ensuring that their predictions are reliable. In response to this need, we propose a novel approach for determining model robustness. This approach, supplemented with a proposed model selection algorithm designed as a meta-algorithm, is versatile and applicable to any machine learning model, provided that it is appropriate for the task at hand. This study d","authors_text":"Alexey Boldyrev, Andrey Shevelev, Fedor Ratnikov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-22T20:05:20Z","title":"Approach to Finding a Robust Deep Learning Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17254","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:1e87c5a273c381c65817ad511cf042d0b31ee99fc17ad4145e5decff71efa9ff","target":"record","created_at":"2026-07-05T11:08:23Z","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":"901cb992d3ffecc1e36d8b5a59e8f9d58ab0951a8402261c23fb9c5e3e5b5af0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-22T20:05:20Z","title_canon_sha256":"df02c5fbbea673ce1dd4ac8800418287b0d4e20c971c0b6da579b1d9b9aabf8c"},"schema_version":"1.0","source":{"id":"2505.17254","kind":"arxiv","version":1}},"canonical_sha256":"157114da82b631b9784cac8eea5eaa4fac1b2ec7185e8b4fd13c55e83402553a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"157114da82b631b9784cac8eea5eaa4fac1b2ec7185e8b4fd13c55e83402553a","first_computed_at":"2026-07-05T11:08:23.483632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:23.483632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FyCO5U45jGIapirzpXJsqo8YDFQgb8i2x3Nl/AFVbmbcMpaOblWhewuRV7sjX8bI6oY7inEcWTfWAEtOtGh7AA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:23.484161Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.17254","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e87c5a273c381c65817ad511cf042d0b31ee99fc17ad4145e5decff71efa9ff","sha256:f3c8d1588a5ea99e626ba890e4e61ebd038b78415d6eaf59e4c27e293c0cb78b"],"state_sha256":"34a2c95c2a9373d06edb5543a3eb6a0374bd9e9774bb4bbcc3d31db4a89e8e08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLxX0FdH971TJHY34QtCIUAtv+FvkWZoPwGLKEd6HIH1AiRZFnQdH6K/1piXfAfWeMSGjRUAwfi9lpbdVOMkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T17:35:13.384517Z","bundle_sha256":"2557539eb61733430fdf056a8dafa7dc4f133bfb850ebf72412e3cecf6351b1a"}}