{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N23FZPJ3REHYNFUG3X5DSXWRI6","short_pith_number":"pith:N23FZPJ3","schema_version":"1.0","canonical_sha256":"6eb65cbd3b890f869686ddfa395ed147bbb6a2133d294837592b0062130c7bcf","source":{"kind":"arxiv","id":"2403.14119","version":3},"attestation_state":"computed","paper":{"title":"C-TPT: Calibrated Test-Time Prompt Tuning for Vision-Language Models via Text Feature Dispersion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.CV","authors_text":"Chang D. Yoo, Eunseop Yoon, Hee Suk Yoon, Joshua Tian Jin Tee, Mark Hasegawa-Johnson, Yingzhen Li","submitted_at":"2024-03-21T04:08:29Z","abstract_excerpt":"In deep learning, test-time adaptation has gained attention as a method for model fine-tuning without the need for labeled data. A prime exemplification is the recently proposed test-time prompt tuning for large-scale vision-language models such as CLIP. Unfortunately, these prompts have been mainly developed to improve accuracy, overlooking the importance of calibration, which is a crucial aspect for quantifying prediction uncertainty. However, traditional calibration methods rely on substantial amounts of labeled data, making them impractical for test-time scenarios. To this end, this paper "},"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":"2403.14119","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-03-21T04:08:29Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"b68a47bdfb2e6891b1c7c4b53222b50191390cf24e552e00d76d9910e263d4fa","abstract_canon_sha256":"e246aa5ea27a26ec48377750ae349a7fef1490fbc27c3c9ab4da20506d542162"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:52.211970Z","signature_b64":"oPCz6inNMhpYnuQFw4xsAdok+SWO2M155JhENy2MGG2MKByxqCDyEcIdvGXcJiSTpuQDqafdmrlwbLoUJ4s1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eb65cbd3b890f869686ddfa395ed147bbb6a2133d294837592b0062130c7bcf","last_reissued_at":"2026-07-05T08:02:52.211465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:52.211465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"C-TPT: Calibrated Test-Time Prompt Tuning for Vision-Language Models via Text Feature Dispersion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.CV","authors_text":"Chang D. Yoo, Eunseop Yoon, Hee Suk Yoon, Joshua Tian Jin Tee, Mark Hasegawa-Johnson, Yingzhen Li","submitted_at":"2024-03-21T04:08:29Z","abstract_excerpt":"In deep learning, test-time adaptation has gained attention as a method for model fine-tuning without the need for labeled data. A prime exemplification is the recently proposed test-time prompt tuning for large-scale vision-language models such as CLIP. Unfortunately, these prompts have been mainly developed to improve accuracy, overlooking the importance of calibration, which is a crucial aspect for quantifying prediction uncertainty. However, traditional calibration methods rely on substantial amounts of labeled data, making them impractical for test-time scenarios. To this end, this paper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14119","kind":"arxiv","version":3},"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/2403.14119/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":"2403.14119","created_at":"2026-07-05T08:02:52.211525+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.14119v3","created_at":"2026-07-05T08:02:52.211525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14119","created_at":"2026-07-05T08:02:52.211525+00:00"},{"alias_kind":"pith_short_12","alias_value":"N23FZPJ3REHY","created_at":"2026-07-05T08:02:52.211525+00:00"},{"alias_kind":"pith_short_16","alias_value":"N23FZPJ3REHYNFUG","created_at":"2026-07-05T08:02:52.211525+00:00"},{"alias_kind":"pith_short_8","alias_value":"N23FZPJ3","created_at":"2026-07-05T08:02:52.211525+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25922","citing_title":"Closed-Loop Bidirectional Prompting for Adversarial Robustness of Vision Language Models","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26221","citing_title":"Seeking Consensus: Geometric-Semantic On-the-Fly Recalibration for Open-Vocabulary Remote Sensing Semantic Segmentation","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13546","citing_title":"Learning Inference Concurrency in DynamicGate MLP Structural and Mathematical Justification","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N23FZPJ3REHYNFUG3X5DSXWRI6","json":"https://pith.science/pith/N23FZPJ3REHYNFUG3X5DSXWRI6.json","graph_json":"https://pith.science/api/pith-number/N23FZPJ3REHYNFUG3X5DSXWRI6/graph.json","events_json":"https://pith.science/api/pith-number/N23FZPJ3REHYNFUG3X5DSXWRI6/events.json","paper":"https://pith.science/paper/N23FZPJ3"},"agent_actions":{"view_html":"https://pith.science/pith/N23FZPJ3REHYNFUG3X5DSXWRI6","download_json":"https://pith.science/pith/N23FZPJ3REHYNFUG3X5DSXWRI6.json","view_paper":"https://pith.science/paper/N23FZPJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.14119&json=true","fetch_graph":"https://pith.science/api/pith-number/N23FZPJ3REHYNFUG3X5DSXWRI6/graph.json","fetch_events":"https://pith.science/api/pith-number/N23FZPJ3REHYNFUG3X5DSXWRI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N23FZPJ3REHYNFUG3X5DSXWRI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N23FZPJ3REHYNFUG3X5DSXWRI6/action/storage_attestation","attest_author":"https://pith.science/pith/N23FZPJ3REHYNFUG3X5DSXWRI6/action/author_attestation","sign_citation":"https://pith.science/pith/N23FZPJ3REHYNFUG3X5DSXWRI6/action/citation_signature","submit_replication":"https://pith.science/pith/N23FZPJ3REHYNFUG3X5DSXWRI6/action/replication_record"}},"created_at":"2026-07-05T08:02:52.211525+00:00","updated_at":"2026-07-05T08:02:52.211525+00:00"}