{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CAK5MI74FQUZMSPJWXGMP2K2UC","short_pith_number":"pith:CAK5MI74","schema_version":"1.0","canonical_sha256":"1015d623fc2c299649e9b5ccc7e95aa08b526e7a41dd2d893bd4c401df8caea5","source":{"kind":"arxiv","id":"2311.01864","version":1},"attestation_state":"computed","paper":{"title":"SortNet: Learning To Rank By a Neural-Based Sorting Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.IR"],"primary_cat":"cs.LG","authors_text":"Franco Scarselli, Leonardo Rigutini, Marco Maggini, Tiziano Papini","submitted_at":"2023-11-03T12:14:26Z","abstract_excerpt":"The problem of relevance ranking consists of sorting a set of objects with respect to a given criterion. Since users may prefer different relevance criteria, the ranking algorithms should be adaptable to the user needs. Two main approaches exist in literature for the task of learning to rank: 1) a score function, learned by examples, which evaluates the properties of each object yielding an absolute relevance value that can be used to order the objects or 2) a pairwise approach, where a \"preference function\" is learned using pairs of objects to define which one has to be ranked first. In this "},"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":"2311.01864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-03T12:14:26Z","cross_cats_sorted":["cs.AI","cs.CL","cs.IR"],"title_canon_sha256":"d65ddbcb6459d2a3a55dc5c036bde0212572258b3b98fd82cfbce0b77b9f3c0a","abstract_canon_sha256":"29e08025085d1afd5785981b29c1dea0af141043c2874316f605130c9742a9fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:08:46.399454Z","signature_b64":"r9bf1hAI0Kl0ln5+LvMQETNaCQuHC8hKoqxvur2fGHscxldpo4W6f5ROZMRwDMwpt6H1Bme71cB78IkiXLB8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1015d623fc2c299649e9b5ccc7e95aa08b526e7a41dd2d893bd4c401df8caea5","last_reissued_at":"2026-07-05T07:08:46.399046Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:08:46.399046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SortNet: Learning To Rank By a Neural-Based Sorting Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.IR"],"primary_cat":"cs.LG","authors_text":"Franco Scarselli, Leonardo Rigutini, Marco Maggini, Tiziano Papini","submitted_at":"2023-11-03T12:14:26Z","abstract_excerpt":"The problem of relevance ranking consists of sorting a set of objects with respect to a given criterion. Since users may prefer different relevance criteria, the ranking algorithms should be adaptable to the user needs. Two main approaches exist in literature for the task of learning to rank: 1) a score function, learned by examples, which evaluates the properties of each object yielding an absolute relevance value that can be used to order the objects or 2) a pairwise approach, where a \"preference function\" is learned using pairs of objects to define which one has to be ranked first. In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.01864","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/2311.01864/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":"2311.01864","created_at":"2026-07-05T07:08:46.399101+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.01864v1","created_at":"2026-07-05T07:08:46.399101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.01864","created_at":"2026-07-05T07:08:46.399101+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAK5MI74FQUZ","created_at":"2026-07-05T07:08:46.399101+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAK5MI74FQUZMSPJ","created_at":"2026-07-05T07:08:46.399101+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAK5MI74","created_at":"2026-07-05T07:08:46.399101+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/CAK5MI74FQUZMSPJWXGMP2K2UC","json":"https://pith.science/pith/CAK5MI74FQUZMSPJWXGMP2K2UC.json","graph_json":"https://pith.science/api/pith-number/CAK5MI74FQUZMSPJWXGMP2K2UC/graph.json","events_json":"https://pith.science/api/pith-number/CAK5MI74FQUZMSPJWXGMP2K2UC/events.json","paper":"https://pith.science/paper/CAK5MI74"},"agent_actions":{"view_html":"https://pith.science/pith/CAK5MI74FQUZMSPJWXGMP2K2UC","download_json":"https://pith.science/pith/CAK5MI74FQUZMSPJWXGMP2K2UC.json","view_paper":"https://pith.science/paper/CAK5MI74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.01864&json=true","fetch_graph":"https://pith.science/api/pith-number/CAK5MI74FQUZMSPJWXGMP2K2UC/graph.json","fetch_events":"https://pith.science/api/pith-number/CAK5MI74FQUZMSPJWXGMP2K2UC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAK5MI74FQUZMSPJWXGMP2K2UC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAK5MI74FQUZMSPJWXGMP2K2UC/action/storage_attestation","attest_author":"https://pith.science/pith/CAK5MI74FQUZMSPJWXGMP2K2UC/action/author_attestation","sign_citation":"https://pith.science/pith/CAK5MI74FQUZMSPJWXGMP2K2UC/action/citation_signature","submit_replication":"https://pith.science/pith/CAK5MI74FQUZMSPJWXGMP2K2UC/action/replication_record"}},"created_at":"2026-07-05T07:08:46.399101+00:00","updated_at":"2026-07-05T07:08:46.399101+00:00"}