{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IR4YGI5R7R3LMPTQCLO56NOJYH","short_pith_number":"pith:IR4YGI5R","schema_version":"1.0","canonical_sha256":"44798323b1fc76b63e7012dddf35c9c1cb9e391bac1d4d786eeebfecbb72a1b7","source":{"kind":"arxiv","id":"2310.04604","version":1},"attestation_state":"computed","paper":{"title":"PriViT: Vision Transformers for Fast Private Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Ameya Joshi, Brandon Reagen, Chinmay Hegde, Jianqiao Mo, Minsu Cho, Naren Dhyani, Siddharth Garg","submitted_at":"2023-10-06T21:45:05Z","abstract_excerpt":"The Vision Transformer (ViT) architecture has emerged as the backbone of choice for state-of-the-art deep models for computer vision applications. However, ViTs are ill-suited for private inference using secure multi-party computation (MPC) protocols, due to the large number of non-polynomial operations (self-attention, feed-forward rectifiers, layer normalization). We propose PriViT, a gradient based algorithm to selectively \"Taylorize\" nonlinearities in ViTs while maintaining their prediction accuracy. Our algorithm is conceptually simple, easy to implement, and achieves improved performance"},"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":"2310.04604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2023-10-06T21:45:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4a6c60c083e977bc44c43790ab8c6898fcd99fb30ca611d96a065ee2063b1420","abstract_canon_sha256":"090095cf4efe3198bca41c57e41c3b5e7e50805afc9280d9d1df3d6fcc74f07d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:20.533322Z","signature_b64":"cUQz35z5X09BdYGB4S+lP5OkEI3hxmZiI+H/mXsLnRSEe71CL44amg/Mq1CozejLlk07M1+Td7rNaT64cGcUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44798323b1fc76b63e7012dddf35c9c1cb9e391bac1d4d786eeebfecbb72a1b7","last_reissued_at":"2026-07-05T06:58:20.532853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:20.532853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PriViT: Vision Transformers for Fast Private Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Ameya Joshi, Brandon Reagen, Chinmay Hegde, Jianqiao Mo, Minsu Cho, Naren Dhyani, Siddharth Garg","submitted_at":"2023-10-06T21:45:05Z","abstract_excerpt":"The Vision Transformer (ViT) architecture has emerged as the backbone of choice for state-of-the-art deep models for computer vision applications. However, ViTs are ill-suited for private inference using secure multi-party computation (MPC) protocols, due to the large number of non-polynomial operations (self-attention, feed-forward rectifiers, layer normalization). We propose PriViT, a gradient based algorithm to selectively \"Taylorize\" nonlinearities in ViTs while maintaining their prediction accuracy. Our algorithm is conceptually simple, easy to implement, and achieves improved performance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04604","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/2310.04604/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":"2310.04604","created_at":"2026-07-05T06:58:20.532909+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04604v1","created_at":"2026-07-05T06:58:20.532909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04604","created_at":"2026-07-05T06:58:20.532909+00:00"},{"alias_kind":"pith_short_12","alias_value":"IR4YGI5R7R3L","created_at":"2026-07-05T06:58:20.532909+00:00"},{"alias_kind":"pith_short_16","alias_value":"IR4YGI5R7R3LMPTQ","created_at":"2026-07-05T06:58:20.532909+00:00"},{"alias_kind":"pith_short_8","alias_value":"IR4YGI5R","created_at":"2026-07-05T06:58:20.532909+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.19711","citing_title":"CrypTorch: PyTorch-based Auto-tuning Compiler for Machine Learning with Multi-party Computation","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IR4YGI5R7R3LMPTQCLO56NOJYH","json":"https://pith.science/pith/IR4YGI5R7R3LMPTQCLO56NOJYH.json","graph_json":"https://pith.science/api/pith-number/IR4YGI5R7R3LMPTQCLO56NOJYH/graph.json","events_json":"https://pith.science/api/pith-number/IR4YGI5R7R3LMPTQCLO56NOJYH/events.json","paper":"https://pith.science/paper/IR4YGI5R"},"agent_actions":{"view_html":"https://pith.science/pith/IR4YGI5R7R3LMPTQCLO56NOJYH","download_json":"https://pith.science/pith/IR4YGI5R7R3LMPTQCLO56NOJYH.json","view_paper":"https://pith.science/paper/IR4YGI5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04604&json=true","fetch_graph":"https://pith.science/api/pith-number/IR4YGI5R7R3LMPTQCLO56NOJYH/graph.json","fetch_events":"https://pith.science/api/pith-number/IR4YGI5R7R3LMPTQCLO56NOJYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IR4YGI5R7R3LMPTQCLO56NOJYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IR4YGI5R7R3LMPTQCLO56NOJYH/action/storage_attestation","attest_author":"https://pith.science/pith/IR4YGI5R7R3LMPTQCLO56NOJYH/action/author_attestation","sign_citation":"https://pith.science/pith/IR4YGI5R7R3LMPTQCLO56NOJYH/action/citation_signature","submit_replication":"https://pith.science/pith/IR4YGI5R7R3LMPTQCLO56NOJYH/action/replication_record"}},"created_at":"2026-07-05T06:58:20.532909+00:00","updated_at":"2026-07-05T06:58:20.532909+00:00"}