{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IET5NYN4E7ZUNOI32S7CIX2CNL","short_pith_number":"pith:IET5NYN4","canonical_record":{"source":{"id":"2505.18241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-05-23T15:11:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2a89616be0721d947ecdb0d8ff87b759a529ca7cdc5407768dffc665755532ff","abstract_canon_sha256":"ba644107af9460147a8445679f409b4e774f1674bc3a27430cb0bddaf9959188"},"schema_version":"1.0"},"canonical_sha256":"4127d6e1bc27f346b91bd4be245f426afaacdfea6c93d402f29d83e63c96a299","source":{"kind":"arxiv","id":"2505.18241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18241","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18241v1","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18241","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"IET5NYN4E7ZU","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"pith_short_16","alias_value":"IET5NYN4E7ZUNOI3","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"pith_short_8","alias_value":"IET5NYN4","created_at":"2026-07-05T11:08:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IET5NYN4E7ZUNOI32S7CIX2CNL","target":"record","payload":{"canonical_record":{"source":{"id":"2505.18241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-05-23T15:11:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2a89616be0721d947ecdb0d8ff87b759a529ca7cdc5407768dffc665755532ff","abstract_canon_sha256":"ba644107af9460147a8445679f409b4e774f1674bc3a27430cb0bddaf9959188"},"schema_version":"1.0"},"canonical_sha256":"4127d6e1bc27f346b91bd4be245f426afaacdfea6c93d402f29d83e63c96a299","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:43.501763Z","signature_b64":"DAwYMnF9aTkaOQo9UttcDEjcdZW1ciPKI68fojxEh1zo41cSNNxbcMXJ5tIOerBcEdJKU5T/jt9dokyy50y+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4127d6e1bc27f346b91bd4be245f426afaacdfea6c93d402f29d83e63c96a299","last_reissued_at":"2026-07-05T11:08:43.501311Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:43.501311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.18241","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-07-05T11:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPeI366WKD5dg8rvijDDi836OvWaWD46rH6j+qQvJ81w7qqFyjoauhLEcB0hjMbdjXOQiC16YB4McRj0PXuBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:16:35.449248Z"},"content_sha256":"3ae557f3c2ea43f359f3368033ef642c5685c2acbdf27c0fd046725573ca6fd5","schema_version":"1.0","event_id":"sha256:3ae557f3c2ea43f359f3368033ef642c5685c2acbdf27c0fd046725573ca6fd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IET5NYN4E7ZUNOI32S7CIX2CNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intent Classification on Low-Resource Languages with Query Similarity Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Arjun Bhalla, Qi Huang","submitted_at":"2025-05-23T15:11:12Z","abstract_excerpt":"Intent classification is an important component of a functional Information Retrieval ecosystem. Many current approaches to intent classification, typically framed as a classification problem, can be problematic as intents are often hard to define and thus data can be difficult and expensive to annotate. The problem is exacerbated when we need to extend the intent classification system to support multiple and in particular low-resource languages. To address this, we propose casting intent classification as a query similarity search problem - we use previous example queries to define an intent,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18241","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/2505.18241/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"},"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-07-05T11:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kaperc7CFgHKjdwrkX/AyYR5DOk3CKsc5tk2KAXW3KVtwzgrgDbpqkmBSXyF3HljxaZG3zLifKIB2xJT1HcoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:16:35.450184Z"},"content_sha256":"d706cdec060df7aa790dc6c3f169a973f93823f8117cb361707110440515ac43","schema_version":"1.0","event_id":"sha256:d706cdec060df7aa790dc6c3f169a973f93823f8117cb361707110440515ac43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IET5NYN4E7ZUNOI32S7CIX2CNL/bundle.json","state_url":"https://pith.science/pith/IET5NYN4E7ZUNOI32S7CIX2CNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IET5NYN4E7ZUNOI32S7CIX2CNL/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-08-10T03:16:35Z","links":{"resolver":"https://pith.science/pith/IET5NYN4E7ZUNOI32S7CIX2CNL","bundle":"https://pith.science/pith/IET5NYN4E7ZUNOI32S7CIX2CNL/bundle.json","state":"https://pith.science/pith/IET5NYN4E7ZUNOI32S7CIX2CNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IET5NYN4E7ZUNOI32S7CIX2CNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IET5NYN4E7ZUNOI32S7CIX2CNL","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":"ba644107af9460147a8445679f409b4e774f1674bc3a27430cb0bddaf9959188","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-05-23T15:11:12Z","title_canon_sha256":"2a89616be0721d947ecdb0d8ff87b759a529ca7cdc5407768dffc665755532ff"},"schema_version":"1.0","source":{"id":"2505.18241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18241","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18241v1","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18241","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"IET5NYN4E7ZU","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"pith_short_16","alias_value":"IET5NYN4E7ZUNOI3","created_at":"2026-07-05T11:08:43Z"},{"alias_kind":"pith_short_8","alias_value":"IET5NYN4","created_at":"2026-07-05T11:08:43Z"}],"graph_snapshots":[{"event_id":"sha256:d706cdec060df7aa790dc6c3f169a973f93823f8117cb361707110440515ac43","target":"graph","created_at":"2026-07-05T11:08:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.18241/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Intent classification is an important component of a functional Information Retrieval ecosystem. Many current approaches to intent classification, typically framed as a classification problem, can be problematic as intents are often hard to define and thus data can be difficult and expensive to annotate. The problem is exacerbated when we need to extend the intent classification system to support multiple and in particular low-resource languages. To address this, we propose casting intent classification as a query similarity search problem - we use previous example queries to define an intent,","authors_text":"Arjun Bhalla, Qi Huang","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-05-23T15:11:12Z","title":"Intent Classification on Low-Resource Languages with Query Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18241","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:3ae557f3c2ea43f359f3368033ef642c5685c2acbdf27c0fd046725573ca6fd5","target":"record","created_at":"2026-07-05T11:08:43Z","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":"ba644107af9460147a8445679f409b4e774f1674bc3a27430cb0bddaf9959188","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-05-23T15:11:12Z","title_canon_sha256":"2a89616be0721d947ecdb0d8ff87b759a529ca7cdc5407768dffc665755532ff"},"schema_version":"1.0","source":{"id":"2505.18241","kind":"arxiv","version":1}},"canonical_sha256":"4127d6e1bc27f346b91bd4be245f426afaacdfea6c93d402f29d83e63c96a299","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4127d6e1bc27f346b91bd4be245f426afaacdfea6c93d402f29d83e63c96a299","first_computed_at":"2026-07-05T11:08:43.501311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:43.501311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DAwYMnF9aTkaOQo9UttcDEjcdZW1ciPKI68fojxEh1zo41cSNNxbcMXJ5tIOerBcEdJKU5T/jt9dokyy50y+CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:43.501763Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.18241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae557f3c2ea43f359f3368033ef642c5685c2acbdf27c0fd046725573ca6fd5","sha256:d706cdec060df7aa790dc6c3f169a973f93823f8117cb361707110440515ac43"],"state_sha256":"880840d8e6226608dabb4d9cff5a31da191760775bbe7e5f5710b713909a3056"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ztUlfk6904xxvqbtxLnxaq8FAYtefRerzN+20I1dHIkxz8egXDR5IbG6HvcDLCTI5owx9yMfjXYKke6FYmmPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:16:35.519403Z","bundle_sha256":"eaa915abaaa5a38e7214c4262b3f38cd54cce9a341a695de5e74f91a1f3b642b"}}