{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PEXAHWWUKM425KMQDENZS55YQL","short_pith_number":"pith:PEXAHWWU","schema_version":"1.0","canonical_sha256":"792e03dad45339aea990191b9977b882f3db57d1e101af80126cd4b10d35260f","source":{"kind":"arxiv","id":"1706.01583","version":1},"attestation_state":"computed","paper":{"title":"Classifying Documents within Multiple Hierarchical Datasets using Multi-Task Learning","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anveshi Charuvaka, Azad Naik, Huzefa Rangwala","submitted_at":"2017-06-06T02:17:40Z","abstract_excerpt":"Multi-task learning (MTL) is a supervised learning paradigm in which the prediction models for several related tasks are learned jointly to achieve better generalization performance. When there are only a few training examples per task, MTL considerably outperforms the traditional Single task learning (STL) in terms of prediction accuracy. In this work we develop an MTL based approach for classifying documents that are archived within dual concept hierarchies, namely, DMOZ and Wikipedia. We solve the multi-class classification problem by defining one-versus-rest binary classification tasks for"},"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":"1706.01583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-06T02:17:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f8df077ce3de0bb14701a200496509861853fd9f7b2faddd2cf11ebd7d1b588e","abstract_canon_sha256":"e19f7ab3850e217b61b3efb14fc4ea320ca74899501cf94614c77d4905cf43b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:56.603035Z","signature_b64":"SUkX9u5AOek7Z3sgq/6S4Jy6gevdpa018e/8ZH7vfjHt0LsP4bBVapzeLQEvCdb+zrweRvaox3LPLoR8NpJ9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"792e03dad45339aea990191b9977b882f3db57d1e101af80126cd4b10d35260f","last_reissued_at":"2026-05-18T00:42:56.602328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:56.602328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classifying Documents within Multiple Hierarchical Datasets using Multi-Task Learning","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anveshi Charuvaka, Azad Naik, Huzefa Rangwala","submitted_at":"2017-06-06T02:17:40Z","abstract_excerpt":"Multi-task learning (MTL) is a supervised learning paradigm in which the prediction models for several related tasks are learned jointly to achieve better generalization performance. When there are only a few training examples per task, MTL considerably outperforms the traditional Single task learning (STL) in terms of prediction accuracy. In this work we develop an MTL based approach for classifying documents that are archived within dual concept hierarchies, namely, DMOZ and Wikipedia. We solve the multi-class classification problem by defining one-versus-rest binary classification tasks for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01583","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.01583","created_at":"2026-05-18T00:42:56.602449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01583v1","created_at":"2026-05-18T00:42:56.602449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01583","created_at":"2026-05-18T00:42:56.602449+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEXAHWWUKM42","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEXAHWWUKM425KMQ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEXAHWWU","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PEXAHWWUKM425KMQDENZS55YQL","json":"https://pith.science/pith/PEXAHWWUKM425KMQDENZS55YQL.json","graph_json":"https://pith.science/api/pith-number/PEXAHWWUKM425KMQDENZS55YQL/graph.json","events_json":"https://pith.science/api/pith-number/PEXAHWWUKM425KMQDENZS55YQL/events.json","paper":"https://pith.science/paper/PEXAHWWU"},"agent_actions":{"view_html":"https://pith.science/pith/PEXAHWWUKM425KMQDENZS55YQL","download_json":"https://pith.science/pith/PEXAHWWUKM425KMQDENZS55YQL.json","view_paper":"https://pith.science/paper/PEXAHWWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01583&json=true","fetch_graph":"https://pith.science/api/pith-number/PEXAHWWUKM425KMQDENZS55YQL/graph.json","fetch_events":"https://pith.science/api/pith-number/PEXAHWWUKM425KMQDENZS55YQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEXAHWWUKM425KMQDENZS55YQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEXAHWWUKM425KMQDENZS55YQL/action/storage_attestation","attest_author":"https://pith.science/pith/PEXAHWWUKM425KMQDENZS55YQL/action/author_attestation","sign_citation":"https://pith.science/pith/PEXAHWWUKM425KMQDENZS55YQL/action/citation_signature","submit_replication":"https://pith.science/pith/PEXAHWWUKM425KMQDENZS55YQL/action/replication_record"}},"created_at":"2026-05-18T00:42:56.602449+00:00","updated_at":"2026-05-18T00:42:56.602449+00:00"}