{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RBA2LJMVUQJ22EUPYVRWVTNOQH","short_pith_number":"pith:RBA2LJMV","schema_version":"1.0","canonical_sha256":"8841a5a595a413ad128fc5636acdae81c0ce9f27fb61d7580ef28b45586cece0","source":{"kind":"arxiv","id":"2401.09343","version":2},"attestation_state":"computed","paper":{"title":"Efficient slot labelling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Vladimir Vlasov","submitted_at":"2024-01-17T17:08:36Z","abstract_excerpt":"Slot labelling is an essential component of any dialogue system, aiming to find important arguments in every user turn. Common approaches involve large pre-trained language models (PLMs) like BERT or RoBERTa, but they face challenges such as high computational requirements and dependence on pre-training data. In this work, we propose a lightweight method which performs on par or better than the state-of-the-art PLM-based methods, while having almost 10x less trainable parameters. This makes it especially applicable for real-life industry scenarios."},"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":"2401.09343","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-01-17T17:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"91592bbb6c59849f802d8f54c450f0b515686b873ce9d464e0a8b8514289a09b","abstract_canon_sha256":"28325b5e1dcbc6b3e7d75c1a96e385e0336be074b10fdf8eb92b6fc414eedd6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:24.495140Z","signature_b64":"NI+pAHFKWRjT5qYx+9nDXuADFtJMkkkJCgKNbvNVrcC4iu3wuoGvXnQsCIY2XjS728i4vgnOrq5yMhwz40a3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8841a5a595a413ad128fc5636acdae81c0ce9f27fb61d7580ef28b45586cece0","last_reissued_at":"2026-07-05T07:35:24.494576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:24.494576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient slot labelling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Vladimir Vlasov","submitted_at":"2024-01-17T17:08:36Z","abstract_excerpt":"Slot labelling is an essential component of any dialogue system, aiming to find important arguments in every user turn. Common approaches involve large pre-trained language models (PLMs) like BERT or RoBERTa, but they face challenges such as high computational requirements and dependence on pre-training data. In this work, we propose a lightweight method which performs on par or better than the state-of-the-art PLM-based methods, while having almost 10x less trainable parameters. This makes it especially applicable for real-life industry scenarios."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09343","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.09343/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":"2401.09343","created_at":"2026-07-05T07:35:24.494708+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09343v2","created_at":"2026-07-05T07:35:24.494708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09343","created_at":"2026-07-05T07:35:24.494708+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBA2LJMVUQJ2","created_at":"2026-07-05T07:35:24.494708+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBA2LJMVUQJ22EUP","created_at":"2026-07-05T07:35:24.494708+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBA2LJMV","created_at":"2026-07-05T07:35:24.494708+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03789","citing_title":"Efficient and Effective Query Context-Aware Learning-to-Rank Model for Sequential Recommendation","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RBA2LJMVUQJ22EUPYVRWVTNOQH","json":"https://pith.science/pith/RBA2LJMVUQJ22EUPYVRWVTNOQH.json","graph_json":"https://pith.science/api/pith-number/RBA2LJMVUQJ22EUPYVRWVTNOQH/graph.json","events_json":"https://pith.science/api/pith-number/RBA2LJMVUQJ22EUPYVRWVTNOQH/events.json","paper":"https://pith.science/paper/RBA2LJMV"},"agent_actions":{"view_html":"https://pith.science/pith/RBA2LJMVUQJ22EUPYVRWVTNOQH","download_json":"https://pith.science/pith/RBA2LJMVUQJ22EUPYVRWVTNOQH.json","view_paper":"https://pith.science/paper/RBA2LJMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09343&json=true","fetch_graph":"https://pith.science/api/pith-number/RBA2LJMVUQJ22EUPYVRWVTNOQH/graph.json","fetch_events":"https://pith.science/api/pith-number/RBA2LJMVUQJ22EUPYVRWVTNOQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBA2LJMVUQJ22EUPYVRWVTNOQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBA2LJMVUQJ22EUPYVRWVTNOQH/action/storage_attestation","attest_author":"https://pith.science/pith/RBA2LJMVUQJ22EUPYVRWVTNOQH/action/author_attestation","sign_citation":"https://pith.science/pith/RBA2LJMVUQJ22EUPYVRWVTNOQH/action/citation_signature","submit_replication":"https://pith.science/pith/RBA2LJMVUQJ22EUPYVRWVTNOQH/action/replication_record"}},"created_at":"2026-07-05T07:35:24.494708+00:00","updated_at":"2026-07-05T07:35:24.494708+00:00"}