{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FT5E2MPCN2JS4N3DQ2C6XS6ZXC","short_pith_number":"pith:FT5E2MPC","schema_version":"1.0","canonical_sha256":"2cfa4d31e26e932e37638685ebcbd9b8bc9d36c449ed3962961de5a7226d0bbc","source":{"kind":"arxiv","id":"2406.13103","version":2},"attestation_state":"computed","paper":{"title":"A Generic Method for Fine-grained Category Discovery in Natural Language Texts","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Chang Tian, Marie-Francine Moens, Matthew B. Blaschko, Mingzhe Xing, Wenpeng Yin, Yinliang Yue","submitted_at":"2024-06-18T23:27:46Z","abstract_excerpt":"Fine-grained category discovery using only coarse-grained supervision is a cost-effective yet challenging task. Previous training methods focus on aligning query samples with positive samples and distancing them from negatives. They often neglect intra-category and inter-category semantic similarities of fine-grained categories when navigating sample distributions in the embedding space. Furthermore, some evaluation techniques that rely on pre-collected test samples are inadequate for real-time applications. To address these shortcomings, we introduce a method that successfully detects fine-gr"},"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":"2406.13103","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-06-18T23:27:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0887eafa8add735fd4ed8596ea5a8c946e39a06bad5ce499682253b2fbfa038a","abstract_canon_sha256":"66f0e0c0e0af74567ea56f17c0ead36d05393d56f93626a78e1c06486045a9ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:26.800825Z","signature_b64":"Uqjuv/pf6a1PnHv2d0hlGbD6eduIgRjuAH7RYVKU+KRNXmGWYbhJAtjMGMkJjeY0JO/ptmHhy8kyHNM1c2+xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cfa4d31e26e932e37638685ebcbd9b8bc9d36c449ed3962961de5a7226d0bbc","last_reissued_at":"2026-07-05T10:10:26.800354Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:26.800354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generic Method for Fine-grained Category Discovery in Natural Language Texts","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Chang Tian, Marie-Francine Moens, Matthew B. Blaschko, Mingzhe Xing, Wenpeng Yin, Yinliang Yue","submitted_at":"2024-06-18T23:27:46Z","abstract_excerpt":"Fine-grained category discovery using only coarse-grained supervision is a cost-effective yet challenging task. Previous training methods focus on aligning query samples with positive samples and distancing them from negatives. They often neglect intra-category and inter-category semantic similarities of fine-grained categories when navigating sample distributions in the embedding space. Furthermore, some evaluation techniques that rely on pre-collected test samples are inadequate for real-time applications. To address these shortcomings, we introduce a method that successfully detects fine-gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13103","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/2406.13103/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":"2406.13103","created_at":"2026-07-05T10:10:26.800423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.13103v2","created_at":"2026-07-05T10:10:26.800423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13103","created_at":"2026-07-05T10:10:26.800423+00:00"},{"alias_kind":"pith_short_12","alias_value":"FT5E2MPCN2JS","created_at":"2026-07-05T10:10:26.800423+00:00"},{"alias_kind":"pith_short_16","alias_value":"FT5E2MPCN2JS4N3D","created_at":"2026-07-05T10:10:26.800423+00:00"},{"alias_kind":"pith_short_8","alias_value":"FT5E2MPC","created_at":"2026-07-05T10:10:26.800423+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.04848","citing_title":"Large Language Models Reasoning Abilities Under Non-Ideal Conditions After RL-Fine-Tuning","ref_index":2019,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FT5E2MPCN2JS4N3DQ2C6XS6ZXC","json":"https://pith.science/pith/FT5E2MPCN2JS4N3DQ2C6XS6ZXC.json","graph_json":"https://pith.science/api/pith-number/FT5E2MPCN2JS4N3DQ2C6XS6ZXC/graph.json","events_json":"https://pith.science/api/pith-number/FT5E2MPCN2JS4N3DQ2C6XS6ZXC/events.json","paper":"https://pith.science/paper/FT5E2MPC"},"agent_actions":{"view_html":"https://pith.science/pith/FT5E2MPCN2JS4N3DQ2C6XS6ZXC","download_json":"https://pith.science/pith/FT5E2MPCN2JS4N3DQ2C6XS6ZXC.json","view_paper":"https://pith.science/paper/FT5E2MPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.13103&json=true","fetch_graph":"https://pith.science/api/pith-number/FT5E2MPCN2JS4N3DQ2C6XS6ZXC/graph.json","fetch_events":"https://pith.science/api/pith-number/FT5E2MPCN2JS4N3DQ2C6XS6ZXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FT5E2MPCN2JS4N3DQ2C6XS6ZXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FT5E2MPCN2JS4N3DQ2C6XS6ZXC/action/storage_attestation","attest_author":"https://pith.science/pith/FT5E2MPCN2JS4N3DQ2C6XS6ZXC/action/author_attestation","sign_citation":"https://pith.science/pith/FT5E2MPCN2JS4N3DQ2C6XS6ZXC/action/citation_signature","submit_replication":"https://pith.science/pith/FT5E2MPCN2JS4N3DQ2C6XS6ZXC/action/replication_record"}},"created_at":"2026-07-05T10:10:26.800423+00:00","updated_at":"2026-07-05T10:10:26.800423+00:00"}