{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FVLWYTYYYMP2ML6NQWRGYF7JKA","short_pith_number":"pith:FVLWYTYY","schema_version":"1.0","canonical_sha256":"2d576c4f18c31fa62fcd85a26c17e9501adfa285f541a7e953a50ace3c7642b7","source":{"kind":"arxiv","id":"2210.12530","version":1},"attestation_state":"computed","paper":{"title":"LMPriors: Pre-Trained Language Models as Task-Specific Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Chris Cundy, Kristy Choi, Sanjari Srivastava, Stefano Ermon","submitted_at":"2022-10-22T19:09:18Z","abstract_excerpt":"Particularly in low-data regimes, an outstanding challenge in machine learning is developing principled techniques for augmenting our models with suitable priors. This is to encourage them to learn in ways that are compatible with our understanding of the world. But in contrast to generic priors such as shrinkage or sparsity, we draw inspiration from the recent successes of large-scale language models (LMs) to construct task-specific priors distilled from the rich knowledge of LMs. Our method, Language Model Priors (LMPriors), incorporates auxiliary natural language metadata about the task -- "},"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":"2210.12530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-22T19:09:18Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"c1c96dd4974cb7db6121520b033527f311722dc1935d0dff0a512da7d71ef7a2","abstract_canon_sha256":"2e4ea6377e28401f91889e83e561e81cc3559016c27ab9ea14b27a4d34dc09d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:29.517769Z","signature_b64":"OhA6JXWMC2GXlLJpa018wchJQWs2eiz63QQt4lVUllGrtGVrABH5MdWrCrb7xNRUZq3OxH9oWzaCFRC1HatHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d576c4f18c31fa62fcd85a26c17e9501adfa285f541a7e953a50ace3c7642b7","last_reissued_at":"2026-07-05T05:09:29.517349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:29.517349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LMPriors: Pre-Trained Language Models as Task-Specific Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Chris Cundy, Kristy Choi, Sanjari Srivastava, Stefano Ermon","submitted_at":"2022-10-22T19:09:18Z","abstract_excerpt":"Particularly in low-data regimes, an outstanding challenge in machine learning is developing principled techniques for augmenting our models with suitable priors. This is to encourage them to learn in ways that are compatible with our understanding of the world. But in contrast to generic priors such as shrinkage or sparsity, we draw inspiration from the recent successes of large-scale language models (LMs) to construct task-specific priors distilled from the rich knowledge of LMs. Our method, Language Model Priors (LMPriors), incorporates auxiliary natural language metadata about the task -- "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.12530","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/2210.12530/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":"2210.12530","created_at":"2026-07-05T05:09:29.517414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.12530v1","created_at":"2026-07-05T05:09:29.517414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.12530","created_at":"2026-07-05T05:09:29.517414+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVLWYTYYYMP2","created_at":"2026-07-05T05:09:29.517414+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVLWYTYYYMP2ML6N","created_at":"2026-07-05T05:09:29.517414+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVLWYTYY","created_at":"2026-07-05T05:09:29.517414+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18812","citing_title":"Reinforcement Learning Foundation Models Should Already Be A Thing","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27281","citing_title":"Causal Risk Minimization for High-Dimensional Treatments","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2402.01207","citing_title":"Efficient Causal Graph Discovery Using Large Language Models","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FVLWYTYYYMP2ML6NQWRGYF7JKA","json":"https://pith.science/pith/FVLWYTYYYMP2ML6NQWRGYF7JKA.json","graph_json":"https://pith.science/api/pith-number/FVLWYTYYYMP2ML6NQWRGYF7JKA/graph.json","events_json":"https://pith.science/api/pith-number/FVLWYTYYYMP2ML6NQWRGYF7JKA/events.json","paper":"https://pith.science/paper/FVLWYTYY"},"agent_actions":{"view_html":"https://pith.science/pith/FVLWYTYYYMP2ML6NQWRGYF7JKA","download_json":"https://pith.science/pith/FVLWYTYYYMP2ML6NQWRGYF7JKA.json","view_paper":"https://pith.science/paper/FVLWYTYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.12530&json=true","fetch_graph":"https://pith.science/api/pith-number/FVLWYTYYYMP2ML6NQWRGYF7JKA/graph.json","fetch_events":"https://pith.science/api/pith-number/FVLWYTYYYMP2ML6NQWRGYF7JKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVLWYTYYYMP2ML6NQWRGYF7JKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVLWYTYYYMP2ML6NQWRGYF7JKA/action/storage_attestation","attest_author":"https://pith.science/pith/FVLWYTYYYMP2ML6NQWRGYF7JKA/action/author_attestation","sign_citation":"https://pith.science/pith/FVLWYTYYYMP2ML6NQWRGYF7JKA/action/citation_signature","submit_replication":"https://pith.science/pith/FVLWYTYYYMP2ML6NQWRGYF7JKA/action/replication_record"}},"created_at":"2026-07-05T05:09:29.517414+00:00","updated_at":"2026-07-05T05:09:29.517414+00:00"}