{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PF6R5LXXU3U4FWUIDCKCE5OK7O","short_pith_number":"pith:PF6R5LXX","canonical_record":{"source":{"id":"1605.04764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-16T13:21:15Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"db7a2cf8d70d6a5c12764aafbea7f2b2691eb19c6673bdfff43373163f4e759d","abstract_canon_sha256":"b7651317f09a5f577676df655fe59d4bd6cdcc5c9df585d6f8f609ee9735e9a1"},"schema_version":"1.0"},"canonical_sha256":"797d1eaef7a6e9c2da8818942275cafbb1c742c96cc52eb39c9a9283d761f510","source":{"kind":"arxiv","id":"1605.04764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04764","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04764v1","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04764","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"PF6R5LXXU3U4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PF6R5LXXU3U4FWUI","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PF6R5LXX","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PF6R5LXXU3U4FWUIDCKCE5OK7O","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-16T13:21:15Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"db7a2cf8d70d6a5c12764aafbea7f2b2691eb19c6673bdfff43373163f4e759d","abstract_canon_sha256":"b7651317f09a5f577676df655fe59d4bd6cdcc5c9df585d6f8f609ee9735e9a1"},"schema_version":"1.0"},"canonical_sha256":"797d1eaef7a6e9c2da8818942275cafbb1c742c96cc52eb39c9a9283d761f510","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:46.310168Z","signature_b64":"KHV1HInuQz6vg0EM/8DX/8oyBH3d9ReU7EQkV/7eDW3Sx39gu/RlfReeQGjFp7RoI864knBzdpCkFvEUcvR6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"797d1eaef7a6e9c2da8818942275cafbb1c742c96cc52eb39c9a9283d761f510","last_reissued_at":"2026-05-18T01:14:46.309556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:46.309556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04764","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-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cokjO2W3xaRq4AF6ESh408VckBc3a/wFl5nXb13RTSFyryGobMw2apKU/3fY3InjUHtUYoi7Ohvvf7XKzbqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:38:03.644353Z"},"content_sha256":"46a2e8e1c2bb6a837fa56ac2cf411c85826b1bbec794bd9863b285ab05ad50c3","schema_version":"1.0","event_id":"sha256:46a2e8e1c2bb6a837fa56ac2cf411c85826b1bbec794bd9863b285ab05ad50c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PF6R5LXXU3U4FWUIDCKCE5OK7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometry Aware Mappings for High Dimensional Sparse Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Avradeep Bhowmik, Badri Narayan Bhaskar, Erheng Zhong, Nathan Liu, Suju Rajan","submitted_at":"2016-05-16T13:21:15Z","abstract_excerpt":"While matrix factorisation models are ubiquitous in large scale recommendation and search, real time application of such models requires inner product computations over an intractably large set of item factors. In this manuscript we present a novel framework that uses the inverted index representation to exploit structural properties of sparse vectors to significantly reduce the run time computational cost of factorisation models. We develop techniques that use geometry aware permutation maps on a tessellated unit sphere to obtain high dimensional sparse embeddings for latent factors with spar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04764","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-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+zGQ1L0in96iQELN1kPWjNi0CdDErQ9lwHeEp3xb4hmNg32YLHp9Ed1cDycCRw1t/4w9BctoVvBuS0W9D3gmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:38:03.645075Z"},"content_sha256":"efe8b4891a2f15823c0ca74b2b34098daed8d9a4586420b7936bb71993a0e034","schema_version":"1.0","event_id":"sha256:efe8b4891a2f15823c0ca74b2b34098daed8d9a4586420b7936bb71993a0e034"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PF6R5LXXU3U4FWUIDCKCE5OK7O/bundle.json","state_url":"https://pith.science/pith/PF6R5LXXU3U4FWUIDCKCE5OK7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PF6R5LXXU3U4FWUIDCKCE5OK7O/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-09T21:38:03Z","links":{"resolver":"https://pith.science/pith/PF6R5LXXU3U4FWUIDCKCE5OK7O","bundle":"https://pith.science/pith/PF6R5LXXU3U4FWUIDCKCE5OK7O/bundle.json","state":"https://pith.science/pith/PF6R5LXXU3U4FWUIDCKCE5OK7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PF6R5LXXU3U4FWUIDCKCE5OK7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PF6R5LXXU3U4FWUIDCKCE5OK7O","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":"b7651317f09a5f577676df655fe59d4bd6cdcc5c9df585d6f8f609ee9735e9a1","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-16T13:21:15Z","title_canon_sha256":"db7a2cf8d70d6a5c12764aafbea7f2b2691eb19c6673bdfff43373163f4e759d"},"schema_version":"1.0","source":{"id":"1605.04764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04764","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04764v1","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04764","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"PF6R5LXXU3U4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PF6R5LXXU3U4FWUI","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PF6R5LXX","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:efe8b4891a2f15823c0ca74b2b34098daed8d9a4586420b7936bb71993a0e034","target":"graph","created_at":"2026-05-18T01:14:46Z","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":"While matrix factorisation models are ubiquitous in large scale recommendation and search, real time application of such models requires inner product computations over an intractably large set of item factors. In this manuscript we present a novel framework that uses the inverted index representation to exploit structural properties of sparse vectors to significantly reduce the run time computational cost of factorisation models. We develop techniques that use geometry aware permutation maps on a tessellated unit sphere to obtain high dimensional sparse embeddings for latent factors with spar","authors_text":"Avradeep Bhowmik, Badri Narayan Bhaskar, Erheng Zhong, Nathan Liu, Suju Rajan","cross_cats":["cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-16T13:21:15Z","title":"Geometry Aware Mappings for High Dimensional Sparse Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04764","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:46a2e8e1c2bb6a837fa56ac2cf411c85826b1bbec794bd9863b285ab05ad50c3","target":"record","created_at":"2026-05-18T01:14:46Z","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":"b7651317f09a5f577676df655fe59d4bd6cdcc5c9df585d6f8f609ee9735e9a1","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-16T13:21:15Z","title_canon_sha256":"db7a2cf8d70d6a5c12764aafbea7f2b2691eb19c6673bdfff43373163f4e759d"},"schema_version":"1.0","source":{"id":"1605.04764","kind":"arxiv","version":1}},"canonical_sha256":"797d1eaef7a6e9c2da8818942275cafbb1c742c96cc52eb39c9a9283d761f510","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"797d1eaef7a6e9c2da8818942275cafbb1c742c96cc52eb39c9a9283d761f510","first_computed_at":"2026-05-18T01:14:46.309556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:46.309556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KHV1HInuQz6vg0EM/8DX/8oyBH3d9ReU7EQkV/7eDW3Sx39gu/RlfReeQGjFp7RoI864knBzdpCkFvEUcvR6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:46.310168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46a2e8e1c2bb6a837fa56ac2cf411c85826b1bbec794bd9863b285ab05ad50c3","sha256:efe8b4891a2f15823c0ca74b2b34098daed8d9a4586420b7936bb71993a0e034"],"state_sha256":"0481de818ddc90f030715bba872c136baea4ed468490214a98f0563a95126b29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ro1P2blWEDdwoMZITigNXTh7DJj3uBZbKjcTfsxB+9+lmPSD/FM/If+LlW0IdErPtYH8ONHRgu1JTypz9b9mCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T21:38:03.649241Z","bundle_sha256":"3a8212f5d2dc949ce80f8f4363defe2dfde0286df61a820c00081d5aef5dc378"}}