{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6XL24GZMN4W47BY7XO4KN75LXB","short_pith_number":"pith:6XL24GZM","schema_version":"1.0","canonical_sha256":"f5d7ae1b2c6f2dcf871fbbb8a6ffabb8658aa76b2786b7ffb1c2ce29a4d1e732","source":{"kind":"arxiv","id":"1906.05317","version":2},"attestation_state":"computed","paper":{"title":"COMET: Commonsense Transformers for Automatic Knowledge Graph Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Antoine Bosselut, Asli Celikyilmaz, Chaitanya Malaviya, Hannah Rashkin, Maarten Sap, Yejin Choi","submitted_at":"2019-06-12T18:11:20Z","abstract_excerpt":"We present the first comprehensive study on automatic knowledge base construction for two prevalent commonsense knowledge graphs: ATOMIC (Sap et al., 2019) and ConceptNet (Speer et al., 2017). Contrary to many conventional KBs that store knowledge with canonical templates, commonsense KBs only store loosely structured open-text descriptions of knowledge. We posit that an important step toward automatic commonsense completion is the development of generative models of commonsense knowledge, and propose COMmonsEnse Transformers (COMET) that learn to generate rich and diverse commonsense descript"},"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":"1906.05317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-12T18:11:20Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ddd8b1735d8c528ce9964f4361a7c9ead2569f1d5d39f852d348f9be07202f5e","abstract_canon_sha256":"6982b1a93e63f6de726ba2e0c2c992f5b458462af53df0063ce907d59d63fe6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:14.037721Z","signature_b64":"pE4I9lAOT5n8mEIhqYTpaVEPrGVg8hgblN8E4Qiknkyv7FWliQ3/NK0Xl6L0J5y8EXx/dEvd+84LobzIhc5jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5d7ae1b2c6f2dcf871fbbb8a6ffabb8658aa76b2786b7ffb1c2ce29a4d1e732","last_reissued_at":"2026-05-17T23:43:14.037166Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:14.037166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"COMET: Commonsense Transformers for Automatic Knowledge Graph Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Antoine Bosselut, Asli Celikyilmaz, Chaitanya Malaviya, Hannah Rashkin, Maarten Sap, Yejin Choi","submitted_at":"2019-06-12T18:11:20Z","abstract_excerpt":"We present the first comprehensive study on automatic knowledge base construction for two prevalent commonsense knowledge graphs: ATOMIC (Sap et al., 2019) and ConceptNet (Speer et al., 2017). Contrary to many conventional KBs that store knowledge with canonical templates, commonsense KBs only store loosely structured open-text descriptions of knowledge. We posit that an important step toward automatic commonsense completion is the development of generative models of commonsense knowledge, and propose COMmonsEnse Transformers (COMET) that learn to generate rich and diverse commonsense descript"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05317","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1906.05317","created_at":"2026-05-17T23:43:14.037245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05317v2","created_at":"2026-05-17T23:43:14.037245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05317","created_at":"2026-05-17T23:43:14.037245+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XL24GZMN4W4","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XL24GZMN4W47BY7","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XL24GZM","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.24841","citing_title":"Matching Tasks to Objectives: Fine-Tuning and Prompt-Tuning Strategies for Encoder-Decoder Pre-trained Language Models","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6XL24GZMN4W47BY7XO4KN75LXB","json":"https://pith.science/pith/6XL24GZMN4W47BY7XO4KN75LXB.json","graph_json":"https://pith.science/api/pith-number/6XL24GZMN4W47BY7XO4KN75LXB/graph.json","events_json":"https://pith.science/api/pith-number/6XL24GZMN4W47BY7XO4KN75LXB/events.json","paper":"https://pith.science/paper/6XL24GZM"},"agent_actions":{"view_html":"https://pith.science/pith/6XL24GZMN4W47BY7XO4KN75LXB","download_json":"https://pith.science/pith/6XL24GZMN4W47BY7XO4KN75LXB.json","view_paper":"https://pith.science/paper/6XL24GZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05317&json=true","fetch_graph":"https://pith.science/api/pith-number/6XL24GZMN4W47BY7XO4KN75LXB/graph.json","fetch_events":"https://pith.science/api/pith-number/6XL24GZMN4W47BY7XO4KN75LXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XL24GZMN4W47BY7XO4KN75LXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XL24GZMN4W47BY7XO4KN75LXB/action/storage_attestation","attest_author":"https://pith.science/pith/6XL24GZMN4W47BY7XO4KN75LXB/action/author_attestation","sign_citation":"https://pith.science/pith/6XL24GZMN4W47BY7XO4KN75LXB/action/citation_signature","submit_replication":"https://pith.science/pith/6XL24GZMN4W47BY7XO4KN75LXB/action/replication_record"}},"created_at":"2026-05-17T23:43:14.037245+00:00","updated_at":"2026-05-17T23:43:14.037245+00:00"}