{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4H4WWUJMPNMCKZ2DAFNYHNQZAE","short_pith_number":"pith:4H4WWUJM","schema_version":"1.0","canonical_sha256":"e1f96b512c7b58256743015b83b619011dc86396586897d941c1549716bc7fb7","source":{"kind":"arxiv","id":"2311.07870","version":2},"attestation_state":"computed","paper":{"title":"AutoML for Large Capacity Modeling of Meta's Ranking Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Buyun Zhang, Daifeng Guo, Eugen Hotaj, Hang Yin, Huayu Li, Jamey Zhang, Jiang Liu, Jiyan Yang, Kuang-Hung Liu, Mengying Sun, Rudresh Rajnikant Panchal, Shali Jiang, Vivek Sehgal, Wei Wen, Wen-yen Chen, Xi Liu, Yuxin Chen, Zhengxing Chen, Zhou Wang","submitted_at":"2023-11-14T03:00:50Z","abstract_excerpt":"Web-scale ranking systems at Meta serving billions of users is complex. Improving ranking models is essential but engineering heavy. Automated Machine Learning (AutoML) can release engineers from labor intensive work of tuning ranking models; however, it is unknown if AutoML is efficient enough to meet tight production timeline in real-world and, at the same time, bring additional improvements to the strong baselines. Moreover, to achieve higher ranking performance, there is an ever-increasing demand to scale up ranking models to even larger capacity, which imposes more challenges on the effic"},"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.07870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-11-14T03:00:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a4d4a8614ffa9506d06fc3751ca96defc13594581bc3ff7a7a80c7d2019ee16c","abstract_canon_sha256":"7710eb9de600ab7d8e633e9e454491f5e4b297112a7060541c0c690ecf3197e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:26.459234Z","signature_b64":"1EsyY3ZICXH9vQqgaVimoAN9+YCByM3tmSW7UuObY0hry8ec89V7V4GJIe016ds8UBqlEd7DbHisk96FcalzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f96b512c7b58256743015b83b619011dc86396586897d941c1549716bc7fb7","last_reissued_at":"2026-07-05T07:13:26.458776Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:26.458776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AutoML for Large Capacity Modeling of Meta's Ranking Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Buyun Zhang, Daifeng Guo, Eugen Hotaj, Hang Yin, Huayu Li, Jamey Zhang, Jiang Liu, Jiyan Yang, Kuang-Hung Liu, Mengying Sun, Rudresh Rajnikant Panchal, Shali Jiang, Vivek Sehgal, Wei Wen, Wen-yen Chen, Xi Liu, Yuxin Chen, Zhengxing Chen, Zhou Wang","submitted_at":"2023-11-14T03:00:50Z","abstract_excerpt":"Web-scale ranking systems at Meta serving billions of users is complex. Improving ranking models is essential but engineering heavy. Automated Machine Learning (AutoML) can release engineers from labor intensive work of tuning ranking models; however, it is unknown if AutoML is efficient enough to meet tight production timeline in real-world and, at the same time, bring additional improvements to the strong baselines. Moreover, to achieve higher ranking performance, there is an ever-increasing demand to scale up ranking models to even larger capacity, which imposes more challenges on the effic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.07870","kind":"arxiv","version":2},"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.07870/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.07870","created_at":"2026-07-05T07:13:26.458834+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.07870v2","created_at":"2026-07-05T07:13:26.458834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.07870","created_at":"2026-07-05T07:13:26.458834+00:00"},{"alias_kind":"pith_short_12","alias_value":"4H4WWUJMPNMC","created_at":"2026-07-05T07:13:26.458834+00:00"},{"alias_kind":"pith_short_16","alias_value":"4H4WWUJMPNMCKZ2D","created_at":"2026-07-05T07:13:26.458834+00:00"},{"alias_kind":"pith_short_8","alias_value":"4H4WWUJM","created_at":"2026-07-05T07:13:26.458834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01387","citing_title":"Bi-NAS: Towards Effective and Personalized Explanation for Recommender Systems via Bi-Level Neural Architecture Search","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4H4WWUJMPNMCKZ2DAFNYHNQZAE","json":"https://pith.science/pith/4H4WWUJMPNMCKZ2DAFNYHNQZAE.json","graph_json":"https://pith.science/api/pith-number/4H4WWUJMPNMCKZ2DAFNYHNQZAE/graph.json","events_json":"https://pith.science/api/pith-number/4H4WWUJMPNMCKZ2DAFNYHNQZAE/events.json","paper":"https://pith.science/paper/4H4WWUJM"},"agent_actions":{"view_html":"https://pith.science/pith/4H4WWUJMPNMCKZ2DAFNYHNQZAE","download_json":"https://pith.science/pith/4H4WWUJMPNMCKZ2DAFNYHNQZAE.json","view_paper":"https://pith.science/paper/4H4WWUJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.07870&json=true","fetch_graph":"https://pith.science/api/pith-number/4H4WWUJMPNMCKZ2DAFNYHNQZAE/graph.json","fetch_events":"https://pith.science/api/pith-number/4H4WWUJMPNMCKZ2DAFNYHNQZAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4H4WWUJMPNMCKZ2DAFNYHNQZAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4H4WWUJMPNMCKZ2DAFNYHNQZAE/action/storage_attestation","attest_author":"https://pith.science/pith/4H4WWUJMPNMCKZ2DAFNYHNQZAE/action/author_attestation","sign_citation":"https://pith.science/pith/4H4WWUJMPNMCKZ2DAFNYHNQZAE/action/citation_signature","submit_replication":"https://pith.science/pith/4H4WWUJMPNMCKZ2DAFNYHNQZAE/action/replication_record"}},"created_at":"2026-07-05T07:13:26.458834+00:00","updated_at":"2026-07-05T07:13:26.458834+00:00"}