{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KBYLM6WI72AK6Q5LMX2IEMTUXS","short_pith_number":"pith:KBYLM6WI","schema_version":"1.0","canonical_sha256":"5070b67ac8fe80af43ab65f4823274bca3356d756b70834c81372c101e507a73","source":{"kind":"arxiv","id":"2308.14969","version":3},"attestation_state":"computed","paper":{"title":"Uncovering the Hidden Cost of Model Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Agam Goyal, Bharat Runwal, Diganta Misra, Muawiz Chaudhary, Pin Yu Chen","submitted_at":"2023-08-29T01:47:49Z","abstract_excerpt":"In an age dominated by resource-intensive foundation models, the ability to efficiently adapt to downstream tasks is crucial. Visual Prompting (VP), drawing inspiration from the prompting techniques employed in Large Language Models (LLMs), has emerged as a pivotal method for transfer learning in the realm of computer vision. As the importance of efficiency continues to rise, research into model compression has become indispensable in alleviating the computational burdens associated with training and deploying over-parameterized neural networks. A primary objective in model compression is to d"},"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":"2308.14969","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-08-29T01:47:49Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"af9078a9088ccb07b3478f4675865121c8efa8de9458a44a9ba3d7888eaf3b10","abstract_canon_sha256":"8c769a17a84126abd23ffad3b5a8751af9ed794bfab90ab2b76db7f21e66b155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:51.599146Z","signature_b64":"8KIbr2m4P3Nxd6DloXQ7qxk7TRmnP7hAg44/IQVPTZ8FL+GBydRw1p8zqmpHxCr4Qas3/wQ2jqtlXy/KQ/GeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5070b67ac8fe80af43ab65f4823274bca3356d756b70834c81372c101e507a73","last_reissued_at":"2026-07-05T07:56:51.598587Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:51.598587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncovering the Hidden Cost of Model Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Agam Goyal, Bharat Runwal, Diganta Misra, Muawiz Chaudhary, Pin Yu Chen","submitted_at":"2023-08-29T01:47:49Z","abstract_excerpt":"In an age dominated by resource-intensive foundation models, the ability to efficiently adapt to downstream tasks is crucial. Visual Prompting (VP), drawing inspiration from the prompting techniques employed in Large Language Models (LLMs), has emerged as a pivotal method for transfer learning in the realm of computer vision. As the importance of efficiency continues to rise, research into model compression has become indispensable in alleviating the computational burdens associated with training and deploying over-parameterized neural networks. A primary objective in model compression is to d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.14969","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/2308.14969/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":"2308.14969","created_at":"2026-07-05T07:56:51.598660+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.14969v3","created_at":"2026-07-05T07:56:51.598660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.14969","created_at":"2026-07-05T07:56:51.598660+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBYLM6WI72AK","created_at":"2026-07-05T07:56:51.598660+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBYLM6WI72AK6Q5L","created_at":"2026-07-05T07:56:51.598660+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBYLM6WI","created_at":"2026-07-05T07:56:51.598660+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2310.01728","citing_title":"Time-LLM: Time Series Forecasting by Reprogramming Large Language Models","ref_index":102,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KBYLM6WI72AK6Q5LMX2IEMTUXS","json":"https://pith.science/pith/KBYLM6WI72AK6Q5LMX2IEMTUXS.json","graph_json":"https://pith.science/api/pith-number/KBYLM6WI72AK6Q5LMX2IEMTUXS/graph.json","events_json":"https://pith.science/api/pith-number/KBYLM6WI72AK6Q5LMX2IEMTUXS/events.json","paper":"https://pith.science/paper/KBYLM6WI"},"agent_actions":{"view_html":"https://pith.science/pith/KBYLM6WI72AK6Q5LMX2IEMTUXS","download_json":"https://pith.science/pith/KBYLM6WI72AK6Q5LMX2IEMTUXS.json","view_paper":"https://pith.science/paper/KBYLM6WI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.14969&json=true","fetch_graph":"https://pith.science/api/pith-number/KBYLM6WI72AK6Q5LMX2IEMTUXS/graph.json","fetch_events":"https://pith.science/api/pith-number/KBYLM6WI72AK6Q5LMX2IEMTUXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBYLM6WI72AK6Q5LMX2IEMTUXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBYLM6WI72AK6Q5LMX2IEMTUXS/action/storage_attestation","attest_author":"https://pith.science/pith/KBYLM6WI72AK6Q5LMX2IEMTUXS/action/author_attestation","sign_citation":"https://pith.science/pith/KBYLM6WI72AK6Q5LMX2IEMTUXS/action/citation_signature","submit_replication":"https://pith.science/pith/KBYLM6WI72AK6Q5LMX2IEMTUXS/action/replication_record"}},"created_at":"2026-07-05T07:56:51.598660+00:00","updated_at":"2026-07-05T07:56:51.598660+00:00"}