{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OKVICRWFVL52Y72F5Y5WJRRIRX","short_pith_number":"pith:OKVICRWF","canonical_record":{"source":{"id":"1711.03067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T17:46:55Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"8349ac9ecedce5129a0b4366b670fa38195304d73560c7849aafc5c18e5f81de","abstract_canon_sha256":"49b49abd55ead08fa0b28c2ebe55d7bfb176d953ac559d2f6b2b327b3bb885ab"},"schema_version":"1.0"},"canonical_sha256":"72aa8146c5aafbac7f45ee3b64c6288dc22d80aff1506b821fda1f80765d501e","source":{"kind":"arxiv","id":"1711.03067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03067","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03067v3","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03067","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"OKVICRWFVL52","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKVICRWFVL52Y72F","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKVICRWF","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OKVICRWFVL52Y72F5Y5WJRRIRX","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T17:46:55Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"8349ac9ecedce5129a0b4366b670fa38195304d73560c7849aafc5c18e5f81de","abstract_canon_sha256":"49b49abd55ead08fa0b28c2ebe55d7bfb176d953ac559d2f6b2b327b3bb885ab"},"schema_version":"1.0"},"canonical_sha256":"72aa8146c5aafbac7f45ee3b64c6288dc22d80aff1506b821fda1f80765d501e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:22.282454Z","signature_b64":"QKruoa0iSgaYmfHaXzLpLM1zlqnohpli4fQlDSluQmXOPSZvK1hYrRcQ8lUrNVjNYG+75RpTIbbHYi03D8zVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72aa8146c5aafbac7f45ee3b64c6288dc22d80aff1506b821fda1f80765d501e","last_reissued_at":"2026-05-18T00:28:22.281769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:22.281769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03067","source_version":3,"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-18T00:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9YqVrcVrOlnr5lXcoSU9tOM7CHw3K5WQSptOCzkm0KfTxoYaHMDV+1CWn/QLER23dgiTKrmqol5dCCFyMcgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:23:05.423948Z"},"content_sha256":"7e3ecf3e5d9e0f2be7a72100bffd35a65f0b361373392ab86d94afc86da93a24","schema_version":"1.0","event_id":"sha256:7e3ecf3e5d9e0f2be7a72100bffd35a65f0b361373392ab86d94afc86da93a24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OKVICRWFVL52Y72F5Y5WJRRIRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning K-way D-dimensional Discrete Code For Compact Embedding Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Martin Renqiang Min, Ting Chen, Yizhou Sun","submitted_at":"2017-11-08T17:46:55Z","abstract_excerpt":"Embedding methods such as word embedding have become pillars for many applications containing discrete structures. Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying linear transformation based on \"one-hot\" encoding of the discrete symbols. Despite its simplicity, such approach yields number of parameters that grows linearly with the vocabulary size and can lead to overfitting. In this work we propose a much more compact K-way D-dimensional discrete encoding scheme to replace the \"one-hot\" encoding. In \"KD encoding\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03067","kind":"arxiv","version":3},"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-18T00:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YIlvRScXmj0WLYr7bfxKUpad2fy1LvYKyXBG3ZxkMukIwQXb75+FxemF4uMoQHbXYa5/eHV2MZ8RToPCBmzSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:23:05.424579Z"},"content_sha256":"e67077ea92e9a090e1c67b2a05184369fcd07ab08ca98ec025f913bc62280e92","schema_version":"1.0","event_id":"sha256:e67077ea92e9a090e1c67b2a05184369fcd07ab08ca98ec025f913bc62280e92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKVICRWFVL52Y72F5Y5WJRRIRX/bundle.json","state_url":"https://pith.science/pith/OKVICRWFVL52Y72F5Y5WJRRIRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKVICRWFVL52Y72F5Y5WJRRIRX/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-06-03T02:23:05Z","links":{"resolver":"https://pith.science/pith/OKVICRWFVL52Y72F5Y5WJRRIRX","bundle":"https://pith.science/pith/OKVICRWFVL52Y72F5Y5WJRRIRX/bundle.json","state":"https://pith.science/pith/OKVICRWFVL52Y72F5Y5WJRRIRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKVICRWFVL52Y72F5Y5WJRRIRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OKVICRWFVL52Y72F5Y5WJRRIRX","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":"49b49abd55ead08fa0b28c2ebe55d7bfb176d953ac559d2f6b2b327b3bb885ab","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T17:46:55Z","title_canon_sha256":"8349ac9ecedce5129a0b4366b670fa38195304d73560c7849aafc5c18e5f81de"},"schema_version":"1.0","source":{"id":"1711.03067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03067","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03067v3","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03067","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"OKVICRWFVL52","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKVICRWFVL52Y72F","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKVICRWF","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:e67077ea92e9a090e1c67b2a05184369fcd07ab08ca98ec025f913bc62280e92","target":"graph","created_at":"2026-05-18T00:28:22Z","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":"Embedding methods such as word embedding have become pillars for many applications containing discrete structures. Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying linear transformation based on \"one-hot\" encoding of the discrete symbols. Despite its simplicity, such approach yields number of parameters that grows linearly with the vocabulary size and can lead to overfitting. In this work we propose a much more compact K-way D-dimensional discrete encoding scheme to replace the \"one-hot\" encoding. In \"KD encoding\"","authors_text":"Martin Renqiang Min, Ting Chen, Yizhou Sun","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T17:46:55Z","title":"Learning K-way D-dimensional Discrete Code For Compact Embedding Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03067","kind":"arxiv","version":3},"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:7e3ecf3e5d9e0f2be7a72100bffd35a65f0b361373392ab86d94afc86da93a24","target":"record","created_at":"2026-05-18T00:28:22Z","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":"49b49abd55ead08fa0b28c2ebe55d7bfb176d953ac559d2f6b2b327b3bb885ab","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T17:46:55Z","title_canon_sha256":"8349ac9ecedce5129a0b4366b670fa38195304d73560c7849aafc5c18e5f81de"},"schema_version":"1.0","source":{"id":"1711.03067","kind":"arxiv","version":3}},"canonical_sha256":"72aa8146c5aafbac7f45ee3b64c6288dc22d80aff1506b821fda1f80765d501e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72aa8146c5aafbac7f45ee3b64c6288dc22d80aff1506b821fda1f80765d501e","first_computed_at":"2026-05-18T00:28:22.281769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:22.281769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QKruoa0iSgaYmfHaXzLpLM1zlqnohpli4fQlDSluQmXOPSZvK1hYrRcQ8lUrNVjNYG+75RpTIbbHYi03D8zVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:22.282454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e3ecf3e5d9e0f2be7a72100bffd35a65f0b361373392ab86d94afc86da93a24","sha256:e67077ea92e9a090e1c67b2a05184369fcd07ab08ca98ec025f913bc62280e92"],"state_sha256":"d5caaed1414ce1f1ff300b4cee9451f6e0a5cd9d3dabc08c0a2eee6d50e4c7a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfFXLuaRUcpoUNx3AoANR5Wkbqv/Ycajx+MiDiMJUaMBVEx/vrPepNy1t0MnP5jFqdYDKvZ20pmq5OyZ3mg1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:23:05.427293Z","bundle_sha256":"7120cec59d0aedfee8f7b9d3b080e0e15dee591bf01c7b56cc6160700911e5f3"}}