{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IUMO54CHH6AIWOSCEM2E3AU2JW","short_pith_number":"pith:IUMO54CH","schema_version":"1.0","canonical_sha256":"4518eef0473f808b3a4223344d829a4d85a9aaaf26c3ea33afb18e34a77c759e","source":{"kind":"arxiv","id":"2312.12556","version":2},"attestation_state":"computed","paper":{"title":"Tensor Train Decomposition for Adversarial Attacks on Computer Vision Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Andrei Chertkov, Ivan Oseledets","submitted_at":"2023-12-19T19:52:41Z","abstract_excerpt":"Deep neural networks (DNNs) are widely used today, but they are vulnerable to adversarial attacks. To develop effective methods of defense, it is important to understand the potential weak spots of DNNs. Often attacks are organized taking into account the architecture of models (white-box approach) and based on gradient methods, but for real-world DNNs this approach in most cases is impossible. At the same time, several gradient-free optimization algorithms are used to attack black-box models. However, classical methods are often ineffective in the multidimensional case. To organize black-box "},"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":"2312.12556","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-12-19T19:52:41Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"2eef320ea1b35b8b5cac91ab7a2b2699d2b7f580430a35f802d804c0a6445366","abstract_canon_sha256":"dbbb889090b72b91409b1eefacac09b7c2c5ebff13ad8aa1cb4f53974ee720dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:47.756900Z","signature_b64":"o9Z1oZOhwO032sXHijGePze6vi9eHNmdDFTfQuqofNyr/bvKs7jJDnYJPmKMly8eQGJA+4juj3dfMRiJUl76BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4518eef0473f808b3a4223344d829a4d85a9aaaf26c3ea33afb18e34a77c759e","last_reissued_at":"2026-07-05T11:56:47.756406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:47.756406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Train Decomposition for Adversarial Attacks on Computer Vision Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Andrei Chertkov, Ivan Oseledets","submitted_at":"2023-12-19T19:52:41Z","abstract_excerpt":"Deep neural networks (DNNs) are widely used today, but they are vulnerable to adversarial attacks. To develop effective methods of defense, it is important to understand the potential weak spots of DNNs. Often attacks are organized taking into account the architecture of models (white-box approach) and based on gradient methods, but for real-world DNNs this approach in most cases is impossible. At the same time, several gradient-free optimization algorithms are used to attack black-box models. However, classical methods are often ineffective in the multidimensional case. To organize black-box "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.12556","kind":"arxiv","version":2},"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/2312.12556/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":"2312.12556","created_at":"2026-07-05T11:56:47.756466+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.12556v2","created_at":"2026-07-05T11:56:47.756466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.12556","created_at":"2026-07-05T11:56:47.756466+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUMO54CHH6AI","created_at":"2026-07-05T11:56:47.756466+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUMO54CHH6AIWOSC","created_at":"2026-07-05T11:56:47.756466+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUMO54CH","created_at":"2026-07-05T11:56:47.756466+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.12383","citing_title":"High-dimensional Optimization with Low Rank Tensor Sampling and Local Search","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IUMO54CHH6AIWOSCEM2E3AU2JW","json":"https://pith.science/pith/IUMO54CHH6AIWOSCEM2E3AU2JW.json","graph_json":"https://pith.science/api/pith-number/IUMO54CHH6AIWOSCEM2E3AU2JW/graph.json","events_json":"https://pith.science/api/pith-number/IUMO54CHH6AIWOSCEM2E3AU2JW/events.json","paper":"https://pith.science/paper/IUMO54CH"},"agent_actions":{"view_html":"https://pith.science/pith/IUMO54CHH6AIWOSCEM2E3AU2JW","download_json":"https://pith.science/pith/IUMO54CHH6AIWOSCEM2E3AU2JW.json","view_paper":"https://pith.science/paper/IUMO54CH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.12556&json=true","fetch_graph":"https://pith.science/api/pith-number/IUMO54CHH6AIWOSCEM2E3AU2JW/graph.json","fetch_events":"https://pith.science/api/pith-number/IUMO54CHH6AIWOSCEM2E3AU2JW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUMO54CHH6AIWOSCEM2E3AU2JW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUMO54CHH6AIWOSCEM2E3AU2JW/action/storage_attestation","attest_author":"https://pith.science/pith/IUMO54CHH6AIWOSCEM2E3AU2JW/action/author_attestation","sign_citation":"https://pith.science/pith/IUMO54CHH6AIWOSCEM2E3AU2JW/action/citation_signature","submit_replication":"https://pith.science/pith/IUMO54CHH6AIWOSCEM2E3AU2JW/action/replication_record"}},"created_at":"2026-07-05T11:56:47.756466+00:00","updated_at":"2026-07-05T11:56:47.756466+00:00"}