{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RSMPKWJT6FTWP5N77UR3SB33HY","short_pith_number":"pith:RSMPKWJT","canonical_record":{"source":{"id":"1907.04471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T00:49:06Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"4da23a21fe776ad13b471b3fdeabfcf400b2bb047605d17d5322d6a377a92d49","abstract_canon_sha256":"8cf8813f7b9a9408ba3a426d8d722b6b590e10fd2b868961a933dc55c076058f"},"schema_version":"1.0"},"canonical_sha256":"8c98f55933f16767f5bffd23b9077b3e23012e8d48451d8f1141b35ac6f84051","source":{"kind":"arxiv","id":"1907.04471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04471","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04471v1","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04471","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"RSMPKWJT6FTW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RSMPKWJT6FTWP5N7","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RSMPKWJT","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RSMPKWJT6FTWP5N77UR3SB33HY","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T00:49:06Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"4da23a21fe776ad13b471b3fdeabfcf400b2bb047605d17d5322d6a377a92d49","abstract_canon_sha256":"8cf8813f7b9a9408ba3a426d8d722b6b590e10fd2b868961a933dc55c076058f"},"schema_version":"1.0"},"canonical_sha256":"8c98f55933f16767f5bffd23b9077b3e23012e8d48451d8f1141b35ac6f84051","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:00.190982Z","signature_b64":"rj6qsuK+pLK8dHhdL7m/irWcvJNOck2uJZlwYOuMliJtMANXrPRSpTeLR6P3WnwSdiOw0kRPACobg6PrL0rqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c98f55933f16767f5bffd23b9077b3e23012e8d48451d8f1141b35ac6f84051","last_reissued_at":"2026-05-17T23:41:00.190436Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:00.190436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04471","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/88++nBVP0wKTU/PEZDldVMzvRP5KTV/5AxCV//eHu4TgeA0qqry6TVLdOhIuCJbCyKUsY80oNq75R8YgSZqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:16:06.193903Z"},"content_sha256":"f1f11a16d36f29859bd8c5f58ab81e5092671ead651c26b5104651a263a8f26d","schema_version":"1.0","event_id":"sha256:f1f11a16d36f29859bd8c5f58ab81e5092671ead651c26b5104651a263a8f26d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RSMPKWJT6FTWP5N77UR3SB33HY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Input Search for Large Scale Recommendation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cong Li, Jay K. Adams, Manas R. Joglekar, Pranav Khaitan, Quoc V. Le","submitted_at":"2019-07-10T00:49:06Z","abstract_excerpt":"Recommendation problems with large numbers of discrete items, such as products, webpages, or videos, are ubiquitous in the technology industry. Deep neural networks are being increasingly used for these recommendation problems. These models use embeddings to represent discrete items as continuous vectors, and the vocabulary sizes and embedding dimensions, although heavily influence the model's accuracy, are often manually selected in a heuristical manner. We present Neural Input Search (NIS), a technique for learning the optimal vocabulary sizes and embedding dimensions for categorical feature"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04471","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5emhG0STqByk6iYmXtoLj0HymtE0jhuKBtaXsBtR8+Y6weHvrSU4ygYxYiR3tQ2IidHyqFQHx3/UbfirV2XeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:16:06.194252Z"},"content_sha256":"fabb76b81fe3d3c9e9ed513bb64aad1ccb1cdc43697a933889414bd6d3be4dca","schema_version":"1.0","event_id":"sha256:fabb76b81fe3d3c9e9ed513bb64aad1ccb1cdc43697a933889414bd6d3be4dca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSMPKWJT6FTWP5N77UR3SB33HY/bundle.json","state_url":"https://pith.science/pith/RSMPKWJT6FTWP5N77UR3SB33HY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSMPKWJT6FTWP5N77UR3SB33HY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T04:16:06Z","links":{"resolver":"https://pith.science/pith/RSMPKWJT6FTWP5N77UR3SB33HY","bundle":"https://pith.science/pith/RSMPKWJT6FTWP5N77UR3SB33HY/bundle.json","state":"https://pith.science/pith/RSMPKWJT6FTWP5N77UR3SB33HY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSMPKWJT6FTWP5N77UR3SB33HY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RSMPKWJT6FTWP5N77UR3SB33HY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8cf8813f7b9a9408ba3a426d8d722b6b590e10fd2b868961a933dc55c076058f","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T00:49:06Z","title_canon_sha256":"4da23a21fe776ad13b471b3fdeabfcf400b2bb047605d17d5322d6a377a92d49"},"schema_version":"1.0","source":{"id":"1907.04471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04471","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04471v1","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04471","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"RSMPKWJT6FTW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RSMPKWJT6FTWP5N7","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RSMPKWJT","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:fabb76b81fe3d3c9e9ed513bb64aad1ccb1cdc43697a933889414bd6d3be4dca","target":"graph","created_at":"2026-05-17T23:41:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Recommendation problems with large numbers of discrete items, such as products, webpages, or videos, are ubiquitous in the technology industry. Deep neural networks are being increasingly used for these recommendation problems. These models use embeddings to represent discrete items as continuous vectors, and the vocabulary sizes and embedding dimensions, although heavily influence the model's accuracy, are often manually selected in a heuristical manner. We present Neural Input Search (NIS), a technique for learning the optimal vocabulary sizes and embedding dimensions for categorical feature","authors_text":"Cong Li, Jay K. Adams, Manas R. Joglekar, Pranav Khaitan, Quoc V. Le","cross_cats":["cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T00:49:06Z","title":"Neural Input Search for Large Scale Recommendation Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04471","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f1f11a16d36f29859bd8c5f58ab81e5092671ead651c26b5104651a263a8f26d","target":"record","created_at":"2026-05-17T23:41:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8cf8813f7b9a9408ba3a426d8d722b6b590e10fd2b868961a933dc55c076058f","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T00:49:06Z","title_canon_sha256":"4da23a21fe776ad13b471b3fdeabfcf400b2bb047605d17d5322d6a377a92d49"},"schema_version":"1.0","source":{"id":"1907.04471","kind":"arxiv","version":1}},"canonical_sha256":"8c98f55933f16767f5bffd23b9077b3e23012e8d48451d8f1141b35ac6f84051","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c98f55933f16767f5bffd23b9077b3e23012e8d48451d8f1141b35ac6f84051","first_computed_at":"2026-05-17T23:41:00.190436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:00.190436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rj6qsuK+pLK8dHhdL7m/irWcvJNOck2uJZlwYOuMliJtMANXrPRSpTeLR6P3WnwSdiOw0kRPACobg6PrL0rqAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:00.190982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1f11a16d36f29859bd8c5f58ab81e5092671ead651c26b5104651a263a8f26d","sha256:fabb76b81fe3d3c9e9ed513bb64aad1ccb1cdc43697a933889414bd6d3be4dca"],"state_sha256":"e2e4f8fc1896fbf1246ce157f35d1d0913e02d2f9173522acad43175c322fbae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmfexIXeXSGrhied+K18S0TECCCJyo6aby9fo/het1CPYMUQcj0Kvij2qDE5obevCLVPRsfokojvtHL2jvNeDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:16:06.196400Z","bundle_sha256":"d4a06643659d85a63e4d953d52265b7891dde20cb12b963f385fea4def713309"}}