{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6IAY4UFSDIJFAIOFMYGZZEACIO","short_pith_number":"pith:6IAY4UFS","schema_version":"1.0","canonical_sha256":"f2018e50b21a125021c5660d9c900243a343e450274f94a18f673adb122b7bb5","source":{"kind":"arxiv","id":"2407.14799","version":1},"attestation_state":"computed","paper":{"title":"FairViT: Fair Vision Transformer via Adaptive Masking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cs.CV","authors_text":"Bowei Tian, Ruijie Du, Yanning Shen","submitted_at":"2024-07-20T08:10:37Z","abstract_excerpt":"Vision Transformer (ViT) has achieved excellent performance and demonstrated its promising potential in various computer vision tasks. The wide deployment of ViT in real-world tasks requires a thorough understanding of the societal impact of the model. However, most ViT-based works do not take fairness into account and it is unclear whether directly applying CNN-oriented debiased algorithm to ViT is feasible. Moreover, previous works typically sacrifice accuracy for fairness. Therefore, we aim to develop an algorithm that improves accuracy without sacrificing fairness. In this paper, we propos"},"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":"2407.14799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-07-20T08:10:37Z","cross_cats_sorted":["cs.CY"],"title_canon_sha256":"bfc3d33825cdd56ab6147ec53280c6c1b7cfffe1bd22f9d09ed3ac7c5f5e63f7","abstract_canon_sha256":"2355bd30461102f58b0629c49d6f37b21391b08f3f0af8a72817dbccf3b234ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:33.873730Z","signature_b64":"wosvSp1zKBReLarOKBc6KdChqp5MOebLsYx9COLsfz1BlORXXwDbmgzN1zxNnxy0z8Dwmj/p6GSq2W4nesHOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2018e50b21a125021c5660d9c900243a343e450274f94a18f673adb122b7bb5","last_reissued_at":"2026-07-05T08:46:33.873335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:33.873335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FairViT: Fair Vision Transformer via Adaptive Masking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cs.CV","authors_text":"Bowei Tian, Ruijie Du, Yanning Shen","submitted_at":"2024-07-20T08:10:37Z","abstract_excerpt":"Vision Transformer (ViT) has achieved excellent performance and demonstrated its promising potential in various computer vision tasks. The wide deployment of ViT in real-world tasks requires a thorough understanding of the societal impact of the model. However, most ViT-based works do not take fairness into account and it is unclear whether directly applying CNN-oriented debiased algorithm to ViT is feasible. Moreover, previous works typically sacrifice accuracy for fairness. Therefore, we aim to develop an algorithm that improves accuracy without sacrificing fairness. In this paper, we propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14799","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/2407.14799/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":"2407.14799","created_at":"2026-07-05T08:46:33.873398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.14799v1","created_at":"2026-07-05T08:46:33.873398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14799","created_at":"2026-07-05T08:46:33.873398+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IAY4UFSDIJF","created_at":"2026-07-05T08:46:33.873398+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IAY4UFSDIJFAIOF","created_at":"2026-07-05T08:46:33.873398+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IAY4UFS","created_at":"2026-07-05T08:46:33.873398+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06094","citing_title":"Fair-MoE: Fairness-Oriented Mixture of Experts in Vision-Language Models","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6IAY4UFSDIJFAIOFMYGZZEACIO","json":"https://pith.science/pith/6IAY4UFSDIJFAIOFMYGZZEACIO.json","graph_json":"https://pith.science/api/pith-number/6IAY4UFSDIJFAIOFMYGZZEACIO/graph.json","events_json":"https://pith.science/api/pith-number/6IAY4UFSDIJFAIOFMYGZZEACIO/events.json","paper":"https://pith.science/paper/6IAY4UFS"},"agent_actions":{"view_html":"https://pith.science/pith/6IAY4UFSDIJFAIOFMYGZZEACIO","download_json":"https://pith.science/pith/6IAY4UFSDIJFAIOFMYGZZEACIO.json","view_paper":"https://pith.science/paper/6IAY4UFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.14799&json=true","fetch_graph":"https://pith.science/api/pith-number/6IAY4UFSDIJFAIOFMYGZZEACIO/graph.json","fetch_events":"https://pith.science/api/pith-number/6IAY4UFSDIJFAIOFMYGZZEACIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IAY4UFSDIJFAIOFMYGZZEACIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IAY4UFSDIJFAIOFMYGZZEACIO/action/storage_attestation","attest_author":"https://pith.science/pith/6IAY4UFSDIJFAIOFMYGZZEACIO/action/author_attestation","sign_citation":"https://pith.science/pith/6IAY4UFSDIJFAIOFMYGZZEACIO/action/citation_signature","submit_replication":"https://pith.science/pith/6IAY4UFSDIJFAIOFMYGZZEACIO/action/replication_record"}},"created_at":"2026-07-05T08:46:33.873398+00:00","updated_at":"2026-07-05T08:46:33.873398+00:00"}