{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:M3CWRX225QHCHZLG644TIGBPDF","short_pith_number":"pith:M3CWRX22","schema_version":"1.0","canonical_sha256":"66c568df5aec0e23e566f73934182f19489b6d1da37b694cea7b95b2557f8029","source":{"kind":"arxiv","id":"1503.00491","version":1},"attestation_state":"computed","paper":{"title":"Utility-Theoretic Ranking for Semi-Automated Text Classification","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrea Esuli, Fabrizio Sebastiani, Giacomo Berardi","submitted_at":"2015-03-02T12:09:23Z","abstract_excerpt":"\\emph{Semi-Automated Text Classification} (SATC) may be defined as the task of ranking a set $\\mathcal{D}$ of automatically labelled textual documents in such a way that, if a human annotator validates (i.e., inspects and corrects where appropriate) the documents in a top-ranked portion of $\\mathcal{D}$ with the goal of increasing the overall labelling accuracy of $\\mathcal{D}$, the expected increase is maximized. An obvious SATC strategy is to rank $\\mathcal{D}$ so that the documents that the classifier has labelled with the lowest confidence are top-ranked. In this work we show that this str"},"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":"1503.00491","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2015-03-02T12:09:23Z","cross_cats_sorted":[],"title_canon_sha256":"36d84b308cc1c0333806e07d38303f376d03bb517242a5e4b9ff6d5c848210a5","abstract_canon_sha256":"717dad0b15255bd13402d7d1e1527141acbd0c99e54c31685aaa201112608727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:24.377339Z","signature_b64":"iCVsEkts3eCqt09mwQo/EVRReZu1l0aMlALRoQpGEx/imQKviQmsCsrMFOpsKr6P4zuk7RUl8xLTr/BR32wiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66c568df5aec0e23e566f73934182f19489b6d1da37b694cea7b95b2557f8029","last_reissued_at":"2026-07-05T03:15:24.376963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:24.376963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Utility-Theoretic Ranking for Semi-Automated Text Classification","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrea Esuli, Fabrizio Sebastiani, Giacomo Berardi","submitted_at":"2015-03-02T12:09:23Z","abstract_excerpt":"\\emph{Semi-Automated Text Classification} (SATC) may be defined as the task of ranking a set $\\mathcal{D}$ of automatically labelled textual documents in such a way that, if a human annotator validates (i.e., inspects and corrects where appropriate) the documents in a top-ranked portion of $\\mathcal{D}$ with the goal of increasing the overall labelling accuracy of $\\mathcal{D}$, the expected increase is maximized. An obvious SATC strategy is to rank $\\mathcal{D}$ so that the documents that the classifier has labelled with the lowest confidence are top-ranked. In this work we show that this str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00491","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/1503.00491/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":"1503.00491","created_at":"2026-07-05T03:15:24.377011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00491v1","created_at":"2026-07-05T03:15:24.377011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00491","created_at":"2026-07-05T03:15:24.377011+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3CWRX225QHC","created_at":"2026-07-05T03:15:24.377011+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3CWRX225QHCHZLG","created_at":"2026-07-05T03:15:24.377011+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3CWRX22","created_at":"2026-07-05T03:15:24.377011+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/M3CWRX225QHCHZLG644TIGBPDF","json":"https://pith.science/pith/M3CWRX225QHCHZLG644TIGBPDF.json","graph_json":"https://pith.science/api/pith-number/M3CWRX225QHCHZLG644TIGBPDF/graph.json","events_json":"https://pith.science/api/pith-number/M3CWRX225QHCHZLG644TIGBPDF/events.json","paper":"https://pith.science/paper/M3CWRX22"},"agent_actions":{"view_html":"https://pith.science/pith/M3CWRX225QHCHZLG644TIGBPDF","download_json":"https://pith.science/pith/M3CWRX225QHCHZLG644TIGBPDF.json","view_paper":"https://pith.science/paper/M3CWRX22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00491&json=true","fetch_graph":"https://pith.science/api/pith-number/M3CWRX225QHCHZLG644TIGBPDF/graph.json","fetch_events":"https://pith.science/api/pith-number/M3CWRX225QHCHZLG644TIGBPDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3CWRX225QHCHZLG644TIGBPDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3CWRX225QHCHZLG644TIGBPDF/action/storage_attestation","attest_author":"https://pith.science/pith/M3CWRX225QHCHZLG644TIGBPDF/action/author_attestation","sign_citation":"https://pith.science/pith/M3CWRX225QHCHZLG644TIGBPDF/action/citation_signature","submit_replication":"https://pith.science/pith/M3CWRX225QHCHZLG644TIGBPDF/action/replication_record"}},"created_at":"2026-07-05T03:15:24.377011+00:00","updated_at":"2026-07-05T03:15:24.377011+00:00"}