{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PRCPQU6KQWBFP5OKDOZUQRCQ2P","short_pith_number":"pith:PRCPQU6K","schema_version":"1.0","canonical_sha256":"7c44f853ca858257f5ca1bb3484450d3dfc13ea7bca2d9ac5a8b7016c11cb2d7","source":{"kind":"arxiv","id":"2505.05180","version":1},"attestation_state":"computed","paper":{"title":"OpenworldAUC: Towards Unified Evaluation and Optimization for Open-world Prompt Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cong Hua, Qianqian Xu, Qingming Huang, Shilong Bao, Zhiyong Yang, Zitai Wang","submitted_at":"2025-05-08T12:31:40Z","abstract_excerpt":"Prompt tuning adapts Vision-Language Models like CLIP to open-world tasks with minimal training costs. In this direction, one typical paradigm evaluates model performance separately on known classes (i.e., base domain) and unseen classes (i.e., new domain). However, real-world scenarios require models to handle inputs without prior domain knowledge. This practical challenge has spurred the development of open-world prompt tuning, which demands a unified evaluation of two stages: 1) detecting whether an input belongs to the base or new domain (P1), and 2) classifying the sample into its correct"},"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":"2505.05180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-08T12:31:40Z","cross_cats_sorted":[],"title_canon_sha256":"fca55b0463c7a3007b418de4c308100abadd59d8860315fca64eee717e4230f9","abstract_canon_sha256":"06b64cc0215d04f933e3d91f1791aebc21176cd69e56fa08c2803821f7abf23a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:20.277776Z","signature_b64":"NeeqwaBNwmKHBbzkh5UQTmTgP7m4q09OZX/fPwRr9NgYT/jDxF9Lo/nDoX2JhkVRg5Qwk6OixskVufkJwOjwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c44f853ca858257f5ca1bb3484450d3dfc13ea7bca2d9ac5a8b7016c11cb2d7","last_reissued_at":"2026-07-05T11:00:20.277218Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:20.277218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OpenworldAUC: Towards Unified Evaluation and Optimization for Open-world Prompt Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cong Hua, Qianqian Xu, Qingming Huang, Shilong Bao, Zhiyong Yang, Zitai Wang","submitted_at":"2025-05-08T12:31:40Z","abstract_excerpt":"Prompt tuning adapts Vision-Language Models like CLIP to open-world tasks with minimal training costs. In this direction, one typical paradigm evaluates model performance separately on known classes (i.e., base domain) and unseen classes (i.e., new domain). However, real-world scenarios require models to handle inputs without prior domain knowledge. This practical challenge has spurred the development of open-world prompt tuning, which demands a unified evaluation of two stages: 1) detecting whether an input belongs to the base or new domain (P1), and 2) classifying the sample into its correct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05180","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.05180/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":"2505.05180","created_at":"2026-07-05T11:00:20.277280+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05180v1","created_at":"2026-07-05T11:00:20.277280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05180","created_at":"2026-07-05T11:00:20.277280+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRCPQU6KQWBF","created_at":"2026-07-05T11:00:20.277280+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRCPQU6KQWBFP5OK","created_at":"2026-07-05T11:00:20.277280+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRCPQU6K","created_at":"2026-07-05T11:00:20.277280+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04504","citing_title":"SpecPL: Disentangling Spectral Granularity for Prompt Learning","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PRCPQU6KQWBFP5OKDOZUQRCQ2P","json":"https://pith.science/pith/PRCPQU6KQWBFP5OKDOZUQRCQ2P.json","graph_json":"https://pith.science/api/pith-number/PRCPQU6KQWBFP5OKDOZUQRCQ2P/graph.json","events_json":"https://pith.science/api/pith-number/PRCPQU6KQWBFP5OKDOZUQRCQ2P/events.json","paper":"https://pith.science/paper/PRCPQU6K"},"agent_actions":{"view_html":"https://pith.science/pith/PRCPQU6KQWBFP5OKDOZUQRCQ2P","download_json":"https://pith.science/pith/PRCPQU6KQWBFP5OKDOZUQRCQ2P.json","view_paper":"https://pith.science/paper/PRCPQU6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05180&json=true","fetch_graph":"https://pith.science/api/pith-number/PRCPQU6KQWBFP5OKDOZUQRCQ2P/graph.json","fetch_events":"https://pith.science/api/pith-number/PRCPQU6KQWBFP5OKDOZUQRCQ2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRCPQU6KQWBFP5OKDOZUQRCQ2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRCPQU6KQWBFP5OKDOZUQRCQ2P/action/storage_attestation","attest_author":"https://pith.science/pith/PRCPQU6KQWBFP5OKDOZUQRCQ2P/action/author_attestation","sign_citation":"https://pith.science/pith/PRCPQU6KQWBFP5OKDOZUQRCQ2P/action/citation_signature","submit_replication":"https://pith.science/pith/PRCPQU6KQWBFP5OKDOZUQRCQ2P/action/replication_record"}},"created_at":"2026-07-05T11:00:20.277280+00:00","updated_at":"2026-07-05T11:00:20.277280+00:00"}