{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ARUYMXMEQT3DYZIUOTOVS6JBEC","short_pith_number":"pith:ARUYMXME","schema_version":"1.0","canonical_sha256":"0469865d8484f63c651474dd59792120a256f87e3309c5131a2252bb4afd6918","source":{"kind":"arxiv","id":"1912.08694","version":1},"attestation_state":"computed","paper":{"title":"Meta-Learned Per-Instance Algorithm Selection in Scholarly Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DL"],"primary_cat":"cs.IR","authors_text":"Andrew Collins, Joeran Beel","submitted_at":"2019-12-18T16:13:27Z","abstract_excerpt":"The effectiveness of recommender system algorithms varies in different real-world scenarios. It is difficult to choose a best algorithm for a scenario due to the quantity of algorithms available, and because of their varying performances. Furthermore, it is not possible to choose one single algorithm that will work optimally for all recommendation requests. We apply meta-learning to this problem of algorithm selection for scholarly article recommendation. We train a random forest, gradient boosting machine, and generalized linear model, to predict a best-algorithm from a pool of content simila"},"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":"1912.08694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-12-18T16:13:27Z","cross_cats_sorted":["cs.DL"],"title_canon_sha256":"3cfafb7cc3dddba7400658bfd7e34fad4e213f91ea39466feabfe7c938201392","abstract_canon_sha256":"7e953b28e73db06e0f86e5397a8f692fdc18d42b1629bad07c344668c9bec64c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:06.292089Z","signature_b64":"F9n+OU1EBqtzqGYhcZxH7mvExg/dwjWcIrRoCWJ8+Fm9AQtd/WRmGG8BvIm92mwHmel60mqxKiQrQadk3CcwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0469865d8484f63c651474dd59792120a256f87e3309c5131a2252bb4afd6918","last_reissued_at":"2026-07-05T00:27:06.291625Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:06.291625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta-Learned Per-Instance Algorithm Selection in Scholarly Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DL"],"primary_cat":"cs.IR","authors_text":"Andrew Collins, Joeran Beel","submitted_at":"2019-12-18T16:13:27Z","abstract_excerpt":"The effectiveness of recommender system algorithms varies in different real-world scenarios. It is difficult to choose a best algorithm for a scenario due to the quantity of algorithms available, and because of their varying performances. Furthermore, it is not possible to choose one single algorithm that will work optimally for all recommendation requests. We apply meta-learning to this problem of algorithm selection for scholarly article recommendation. We train a random forest, gradient boosting machine, and generalized linear model, to predict a best-algorithm from a pool of content simila"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.08694","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/1912.08694/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":"1912.08694","created_at":"2026-07-05T00:27:06.291678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.08694v1","created_at":"2026-07-05T00:27:06.291678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.08694","created_at":"2026-07-05T00:27:06.291678+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARUYMXMEQT3D","created_at":"2026-07-05T00:27:06.291678+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARUYMXMEQT3DYZIU","created_at":"2026-07-05T00:27:06.291678+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARUYMXME","created_at":"2026-07-05T00:27:06.291678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27930","citing_title":"An LLM-Powered Semantic Alignment Framework for Journal Recommendation","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ARUYMXMEQT3DYZIUOTOVS6JBEC","json":"https://pith.science/pith/ARUYMXMEQT3DYZIUOTOVS6JBEC.json","graph_json":"https://pith.science/api/pith-number/ARUYMXMEQT3DYZIUOTOVS6JBEC/graph.json","events_json":"https://pith.science/api/pith-number/ARUYMXMEQT3DYZIUOTOVS6JBEC/events.json","paper":"https://pith.science/paper/ARUYMXME"},"agent_actions":{"view_html":"https://pith.science/pith/ARUYMXMEQT3DYZIUOTOVS6JBEC","download_json":"https://pith.science/pith/ARUYMXMEQT3DYZIUOTOVS6JBEC.json","view_paper":"https://pith.science/paper/ARUYMXME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.08694&json=true","fetch_graph":"https://pith.science/api/pith-number/ARUYMXMEQT3DYZIUOTOVS6JBEC/graph.json","fetch_events":"https://pith.science/api/pith-number/ARUYMXMEQT3DYZIUOTOVS6JBEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARUYMXMEQT3DYZIUOTOVS6JBEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARUYMXMEQT3DYZIUOTOVS6JBEC/action/storage_attestation","attest_author":"https://pith.science/pith/ARUYMXMEQT3DYZIUOTOVS6JBEC/action/author_attestation","sign_citation":"https://pith.science/pith/ARUYMXMEQT3DYZIUOTOVS6JBEC/action/citation_signature","submit_replication":"https://pith.science/pith/ARUYMXMEQT3DYZIUOTOVS6JBEC/action/replication_record"}},"created_at":"2026-07-05T00:27:06.291678+00:00","updated_at":"2026-07-05T00:27:06.291678+00:00"}