{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:24FJRJDE4PIZDJGPVMBZGAQUZE","short_pith_number":"pith:24FJRJDE","canonical_record":{"source":{"id":"1804.08064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-22T03:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"acdf72c0b098fdbe993f83d09058164116d5c92d2c07fef8cda02a4c8e96f139","abstract_canon_sha256":"0e1ff4149b220fe9ad5552a4abcb5378072c2bb5e9ef3a1131c305128936d4a3"},"schema_version":"1.0"},"canonical_sha256":"d70a98a464e3d191a4cfab03930214c93ff237012f9b2e06ec004ef7101ce65a","source":{"kind":"arxiv","id":"1804.08064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08064","created_at":"2026-05-18T00:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08064v1","created_at":"2026-05-18T00:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08064","created_at":"2026-05-18T00:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"24FJRJDE4PIZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"24FJRJDE4PIZDJGP","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"24FJRJDE","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:24FJRJDE4PIZDJGPVMBZGAQUZE","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-22T03:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"acdf72c0b098fdbe993f83d09058164116d5c92d2c07fef8cda02a4c8e96f139","abstract_canon_sha256":"0e1ff4149b220fe9ad5552a4abcb5378072c2bb5e9ef3a1131c305128936d4a3"},"schema_version":"1.0"},"canonical_sha256":"d70a98a464e3d191a4cfab03930214c93ff237012f9b2e06ec004ef7101ce65a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:49.655108Z","signature_b64":"i6A9BxHe7JJpV9TTWwG1lthhLnrofwqGhPBfXyOYjQM9bVTrOsXOJwCfMsuDUl5Bw2zOhZAevHQmmcpnJ9rqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d70a98a464e3d191a4cfab03930214c93ff237012f9b2e06ec004ef7101ce65a","last_reissued_at":"2026-05-18T00:17:49.654352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:49.654352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08064","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqCmQu5xxHXZ64v/jq0v+5zIWQUeDbGliEeXQdjj9xOqyp7U2Xxa7C9llzg6KF97q4waNb/m5wOafGfSUHhaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:04:27.812612Z"},"content_sha256":"b3325634c3a8508066204a7cb000191da74b44678e4a442c8533aab9941d95b6","schema_version":"1.0","event_id":"sha256:b3325634c3a8508066204a7cb000191da74b44678e4a442c8533aab9941d95b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:24FJRJDE4PIZDJGPVMBZGAQUZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scalable Neural Shortlisting-Reranking Approach for Large-Scale Domain Classification in Natural Language Understanding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dongchan Kim, Joo-Kyung Kim, Ruhi Sarikaya, Young-Bum Kim","submitted_at":"2018-04-22T03:56:39Z","abstract_excerpt":"Intelligent personal digital assistants (IPDAs), a popular real-life application with spoken language understanding capabilities, can cover potentially thousands of overlapping domains for natural language understanding, and the task of finding the best domain to handle an utterance becomes a challenging problem on a large scale. In this paper, we propose a set of efficient and scalable neural shortlisting-reranking models for large-scale domain classification in IPDAs. The shortlisting stage focuses on efficiently trimming all domains down to a list of k-best candidate domains, and the rerank"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08064","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPs/hBJB6zGIVysPJrKzywOEzhBvh5aPhQ84+c7AGuMp2jCk7cZ5gPLG4snbjajaJpZwO5/6Skzv6gsAXJX4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:04:27.812983Z"},"content_sha256":"df94617d8989aec1040a6d97fb44ae542d1c943e0efe335b306f4e03a1b74792","schema_version":"1.0","event_id":"sha256:df94617d8989aec1040a6d97fb44ae542d1c943e0efe335b306f4e03a1b74792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24FJRJDE4PIZDJGPVMBZGAQUZE/bundle.json","state_url":"https://pith.science/pith/24FJRJDE4PIZDJGPVMBZGAQUZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24FJRJDE4PIZDJGPVMBZGAQUZE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T00:04:27Z","links":{"resolver":"https://pith.science/pith/24FJRJDE4PIZDJGPVMBZGAQUZE","bundle":"https://pith.science/pith/24FJRJDE4PIZDJGPVMBZGAQUZE/bundle.json","state":"https://pith.science/pith/24FJRJDE4PIZDJGPVMBZGAQUZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24FJRJDE4PIZDJGPVMBZGAQUZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:24FJRJDE4PIZDJGPVMBZGAQUZE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0e1ff4149b220fe9ad5552a4abcb5378072c2bb5e9ef3a1131c305128936d4a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-22T03:56:39Z","title_canon_sha256":"acdf72c0b098fdbe993f83d09058164116d5c92d2c07fef8cda02a4c8e96f139"},"schema_version":"1.0","source":{"id":"1804.08064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08064","created_at":"2026-05-18T00:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08064v1","created_at":"2026-05-18T00:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08064","created_at":"2026-05-18T00:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"24FJRJDE4PIZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"24FJRJDE4PIZDJGP","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"24FJRJDE","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:df94617d8989aec1040a6d97fb44ae542d1c943e0efe335b306f4e03a1b74792","target":"graph","created_at":"2026-05-18T00:17:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Intelligent personal digital assistants (IPDAs), a popular real-life application with spoken language understanding capabilities, can cover potentially thousands of overlapping domains for natural language understanding, and the task of finding the best domain to handle an utterance becomes a challenging problem on a large scale. In this paper, we propose a set of efficient and scalable neural shortlisting-reranking models for large-scale domain classification in IPDAs. The shortlisting stage focuses on efficiently trimming all domains down to a list of k-best candidate domains, and the rerank","authors_text":"Dongchan Kim, Joo-Kyung Kim, Ruhi Sarikaya, Young-Bum Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-22T03:56:39Z","title":"A Scalable Neural Shortlisting-Reranking Approach for Large-Scale Domain Classification in Natural Language Understanding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08064","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b3325634c3a8508066204a7cb000191da74b44678e4a442c8533aab9941d95b6","target":"record","created_at":"2026-05-18T00:17:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0e1ff4149b220fe9ad5552a4abcb5378072c2bb5e9ef3a1131c305128936d4a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-22T03:56:39Z","title_canon_sha256":"acdf72c0b098fdbe993f83d09058164116d5c92d2c07fef8cda02a4c8e96f139"},"schema_version":"1.0","source":{"id":"1804.08064","kind":"arxiv","version":1}},"canonical_sha256":"d70a98a464e3d191a4cfab03930214c93ff237012f9b2e06ec004ef7101ce65a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d70a98a464e3d191a4cfab03930214c93ff237012f9b2e06ec004ef7101ce65a","first_computed_at":"2026-05-18T00:17:49.654352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:49.654352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i6A9BxHe7JJpV9TTWwG1lthhLnrofwqGhPBfXyOYjQM9bVTrOsXOJwCfMsuDUl5Bw2zOhZAevHQmmcpnJ9rqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:49.655108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3325634c3a8508066204a7cb000191da74b44678e4a442c8533aab9941d95b6","sha256:df94617d8989aec1040a6d97fb44ae542d1c943e0efe335b306f4e03a1b74792"],"state_sha256":"8e35b32ed42705076b87938c408359e9f46aca83a9cce73a8ef978515399c3d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C9DQTe6GHcywYLGZeuTbM2V4a0Uwh0xE48Iz6LY8wU80bYKNuqnO0yjeaH6+UGDb9khMU0k+uUrHR3uCfz26AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:04:27.815177Z","bundle_sha256":"4274cab4b8fc505ddf8e4c07e0d6167cd58eb37862da06edb67b70e8ddd8be67"}}