{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L6F6HUO7UTBIZYZJSQUOZDRPP6","short_pith_number":"pith:L6F6HUO7","schema_version":"1.0","canonical_sha256":"5f8be3d1dfa4c28ce3299428ec8e2f7f9070677dd6b2f30d2a593b7a9cc47932","source":{"kind":"arxiv","id":"1809.06120","version":1},"attestation_state":"computed","paper":{"title":"cf2vec: Collaborative Filtering algorithm selection using graph distributed representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Andr\\'e C.P.L.F. de Carvalho, Carlos Soares, Tiago Cunha","submitted_at":"2018-09-17T10:36:16Z","abstract_excerpt":"Algorithm selection using Metalearning aims to find mappings between problem characteristics (i.e. metafeatures) with relative algorithm performance to predict the best algorithm(s) for new datasets. Therefore, it is of the utmost importance that the metafeatures used are informative. In Collaborative Filtering, recent research has created an extensive collection of such metafeatures. However, since these are created based on the practitioner's understanding of the problem, they may not capture the most relevant aspects necessary to properly characterize the problem. We propose to overcome thi"},"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":"1809.06120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-17T10:36:16Z","cross_cats_sorted":[],"title_canon_sha256":"e7702edcd9154424731c24202c448ef4669227d0ca0a6f756cff990272710769","abstract_canon_sha256":"300554da1ce1d4d567db3e55b0d61757a8ce083097d2f1523761b7b5c0aedf39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:35.590840Z","signature_b64":"y8236w/UjxXlpjUO4ntz925RUZm8gRwyis9EgI8qh7do73MzR38RWpRPfbHm8amW1zsoiKAP34cxyYPOQK8tBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f8be3d1dfa4c28ce3299428ec8e2f7f9070677dd6b2f30d2a593b7a9cc47932","last_reissued_at":"2026-05-18T00:05:35.590373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:35.590373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"cf2vec: Collaborative Filtering algorithm selection using graph distributed representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Andr\\'e C.P.L.F. de Carvalho, Carlos Soares, Tiago Cunha","submitted_at":"2018-09-17T10:36:16Z","abstract_excerpt":"Algorithm selection using Metalearning aims to find mappings between problem characteristics (i.e. metafeatures) with relative algorithm performance to predict the best algorithm(s) for new datasets. Therefore, it is of the utmost importance that the metafeatures used are informative. In Collaborative Filtering, recent research has created an extensive collection of such metafeatures. However, since these are created based on the practitioner's understanding of the problem, they may not capture the most relevant aspects necessary to properly characterize the problem. We propose to overcome thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06120","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":"1809.06120","created_at":"2026-05-18T00:05:35.590445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06120v1","created_at":"2026-05-18T00:05:35.590445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06120","created_at":"2026-05-18T00:05:35.590445+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6F6HUO7UTBI","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6F6HUO7UTBIZYZJ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6F6HUO7","created_at":"2026-05-18T12:32:33.847187+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/L6F6HUO7UTBIZYZJSQUOZDRPP6","json":"https://pith.science/pith/L6F6HUO7UTBIZYZJSQUOZDRPP6.json","graph_json":"https://pith.science/api/pith-number/L6F6HUO7UTBIZYZJSQUOZDRPP6/graph.json","events_json":"https://pith.science/api/pith-number/L6F6HUO7UTBIZYZJSQUOZDRPP6/events.json","paper":"https://pith.science/paper/L6F6HUO7"},"agent_actions":{"view_html":"https://pith.science/pith/L6F6HUO7UTBIZYZJSQUOZDRPP6","download_json":"https://pith.science/pith/L6F6HUO7UTBIZYZJSQUOZDRPP6.json","view_paper":"https://pith.science/paper/L6F6HUO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06120&json=true","fetch_graph":"https://pith.science/api/pith-number/L6F6HUO7UTBIZYZJSQUOZDRPP6/graph.json","fetch_events":"https://pith.science/api/pith-number/L6F6HUO7UTBIZYZJSQUOZDRPP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6F6HUO7UTBIZYZJSQUOZDRPP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6F6HUO7UTBIZYZJSQUOZDRPP6/action/storage_attestation","attest_author":"https://pith.science/pith/L6F6HUO7UTBIZYZJSQUOZDRPP6/action/author_attestation","sign_citation":"https://pith.science/pith/L6F6HUO7UTBIZYZJSQUOZDRPP6/action/citation_signature","submit_replication":"https://pith.science/pith/L6F6HUO7UTBIZYZJSQUOZDRPP6/action/replication_record"}},"created_at":"2026-05-18T00:05:35.590445+00:00","updated_at":"2026-05-18T00:05:35.590445+00:00"}