{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:W6EVOTIXGUG6SQRS3CP5J566T3","short_pith_number":"pith:W6EVOTIX","schema_version":"1.0","canonical_sha256":"b789574d17350de94232d89fd4f7de9ee07e90068ba2b676b871ab1dd5b2fdae","source":{"kind":"arxiv","id":"2206.07295","version":1},"attestation_state":"computed","paper":{"title":"FOLD-TR: A Scalable and Efficient Inductive Learning Algorithm for Learning To Rank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gopal Gupta, Huaduo Wang","submitted_at":"2022-06-15T04:46:49Z","abstract_excerpt":"FOLD-R++ is a new inductive learning algorithm for binary classification tasks. It generates an (explainable) normal logic program for mixed type (numerical and categorical) data. We present a customized FOLD-R++ algorithm with the ranking framework, called FOLD-TR, that aims to rank new items following the ranking pattern in the training data. Like FOLD-R++, the FOLD-TR algorithm is able to handle mixed-type data directly and provide native justification to explain the comparison between a pair of items."},"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":"2206.07295","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-15T04:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"58f90d25bcc69750a597f4c3e18e1cccb30f378faa755e4df6b74559144540da","abstract_canon_sha256":"4cd75f7bfdde4e657a62c42173c6193c698cc7ee173eaa4a83421421b9fb3124"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:03.166666Z","signature_b64":"vEvXCfPoCqUNo140kjsn+3tLlS6zuJ0R9fTBKwuR/GSLBvxB9qeEu6KULu2WNGuRe2vFvTbeNrTdYJvk6X0XAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b789574d17350de94232d89fd4f7de9ee07e90068ba2b676b871ab1dd5b2fdae","last_reissued_at":"2026-07-05T04:32:03.166184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:03.166184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FOLD-TR: A Scalable and Efficient Inductive Learning Algorithm for Learning To Rank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gopal Gupta, Huaduo Wang","submitted_at":"2022-06-15T04:46:49Z","abstract_excerpt":"FOLD-R++ is a new inductive learning algorithm for binary classification tasks. It generates an (explainable) normal logic program for mixed type (numerical and categorical) data. We present a customized FOLD-R++ algorithm with the ranking framework, called FOLD-TR, that aims to rank new items following the ranking pattern in the training data. Like FOLD-R++, the FOLD-TR algorithm is able to handle mixed-type data directly and provide native justification to explain the comparison between a pair of items."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.07295","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/2206.07295/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":"2206.07295","created_at":"2026-07-05T04:32:03.166248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.07295v1","created_at":"2026-07-05T04:32:03.166248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.07295","created_at":"2026-07-05T04:32:03.166248+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6EVOTIXGUG6","created_at":"2026-07-05T04:32:03.166248+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6EVOTIXGUG6SQRS","created_at":"2026-07-05T04:32:03.166248+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6EVOTIX","created_at":"2026-07-05T04:32:03.166248+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/W6EVOTIXGUG6SQRS3CP5J566T3","json":"https://pith.science/pith/W6EVOTIXGUG6SQRS3CP5J566T3.json","graph_json":"https://pith.science/api/pith-number/W6EVOTIXGUG6SQRS3CP5J566T3/graph.json","events_json":"https://pith.science/api/pith-number/W6EVOTIXGUG6SQRS3CP5J566T3/events.json","paper":"https://pith.science/paper/W6EVOTIX"},"agent_actions":{"view_html":"https://pith.science/pith/W6EVOTIXGUG6SQRS3CP5J566T3","download_json":"https://pith.science/pith/W6EVOTIXGUG6SQRS3CP5J566T3.json","view_paper":"https://pith.science/paper/W6EVOTIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.07295&json=true","fetch_graph":"https://pith.science/api/pith-number/W6EVOTIXGUG6SQRS3CP5J566T3/graph.json","fetch_events":"https://pith.science/api/pith-number/W6EVOTIXGUG6SQRS3CP5J566T3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6EVOTIXGUG6SQRS3CP5J566T3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6EVOTIXGUG6SQRS3CP5J566T3/action/storage_attestation","attest_author":"https://pith.science/pith/W6EVOTIXGUG6SQRS3CP5J566T3/action/author_attestation","sign_citation":"https://pith.science/pith/W6EVOTIXGUG6SQRS3CP5J566T3/action/citation_signature","submit_replication":"https://pith.science/pith/W6EVOTIXGUG6SQRS3CP5J566T3/action/replication_record"}},"created_at":"2026-07-05T04:32:03.166248+00:00","updated_at":"2026-07-05T04:32:03.166248+00:00"}