{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5UMTDZRDQL5OZLAWHKSX3PK7XW","short_pith_number":"pith:5UMTDZRD","canonical_record":{"source":{"id":"1610.03317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-11T13:10:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b756742136241cbf71d209fd06ffea6c60d95bab8e40a4820adb21d436d56c35","abstract_canon_sha256":"501aa58a0dba4926009b2316e1b0e745d56ce8fb5d6af550f6c91810b31c7f87"},"schema_version":"1.0"},"canonical_sha256":"ed1931e62382faecac163aa57dbd5fbdaea29ac6788f8e3f58002e1937b9fbd0","source":{"kind":"arxiv","id":"1610.03317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03317","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03317v1","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03317","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"5UMTDZRDQL5O","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5UMTDZRDQL5OZLAW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5UMTDZRD","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5UMTDZRDQL5OZLAWHKSX3PK7XW","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-11T13:10:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b756742136241cbf71d209fd06ffea6c60d95bab8e40a4820adb21d436d56c35","abstract_canon_sha256":"501aa58a0dba4926009b2316e1b0e745d56ce8fb5d6af550f6c91810b31c7f87"},"schema_version":"1.0"},"canonical_sha256":"ed1931e62382faecac163aa57dbd5fbdaea29ac6788f8e3f58002e1937b9fbd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:31.809268Z","signature_b64":"M8lalgBjEsMLJh+4ZoJyIqw0MOZuEiXItla0NS0npxjijBAS0Gl1FDpD1h0XpmbSOonqH/xkpsh3r8eZb8YqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed1931e62382faecac163aa57dbd5fbdaea29ac6788f8e3f58002e1937b9fbd0","last_reissued_at":"2026-05-18T01:02:31.808626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:31.808626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03317","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:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtpPYW7YJxvUnboQHb4PKUxMWAhuRnazAg34wuQrMduCRBCMvBtTbPsHUlEa4ULjQergYQ1ajbAVBRMavKgdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:01:03.011351Z"},"content_sha256":"1bc63965cf14d2dce7ee07dd0cbca156eb329932ffb058f76c90f9956b9397e8","schema_version":"1.0","event_id":"sha256:1bc63965cf14d2dce7ee07dd0cbca156eb329932ffb058f76c90f9956b9397e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5UMTDZRDQL5OZLAWHKSX3PK7XW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Greedy Approach for Budgeted Maximum Inner Product Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Cho-Jui Hsieh, Hsiang-Fu Yu, Inderjit S. Dhillon, Qi Lei","submitted_at":"2016-10-11T13:10:48Z","abstract_excerpt":"Maximum Inner Product Search (MIPS) is an important task in many machine learning applications such as the prediction phase of a low-rank matrix factorization model for a recommender system. There have been some works on how to perform MIPS in sub-linear time recently. However, most of them do not have the flexibility to control the trade-off between search efficient and search quality. In this paper, we study the MIPS problem with a computational budget. By carefully studying the problem structure of MIPS, we develop a novel Greedy-MIPS algorithm, which can handle budgeted MIPS by design. Whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03317","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:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IDHbDWs55xN0bCCJii0w9nsADSJjnUfGvrS04DOVnSR9TGWiDg6muKBrbrQBPcxdva9w4H2rbBdcgwRl5GUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:01:03.012060Z"},"content_sha256":"eb506b45b2e978001d8545b66782ffab9c177facafd9f3e9b97294a795785cfb","schema_version":"1.0","event_id":"sha256:eb506b45b2e978001d8545b66782ffab9c177facafd9f3e9b97294a795785cfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UMTDZRDQL5OZLAWHKSX3PK7XW/bundle.json","state_url":"https://pith.science/pith/5UMTDZRDQL5OZLAWHKSX3PK7XW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UMTDZRDQL5OZLAWHKSX3PK7XW/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-29T15:01:03Z","links":{"resolver":"https://pith.science/pith/5UMTDZRDQL5OZLAWHKSX3PK7XW","bundle":"https://pith.science/pith/5UMTDZRDQL5OZLAWHKSX3PK7XW/bundle.json","state":"https://pith.science/pith/5UMTDZRDQL5OZLAWHKSX3PK7XW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UMTDZRDQL5OZLAWHKSX3PK7XW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5UMTDZRDQL5OZLAWHKSX3PK7XW","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":"501aa58a0dba4926009b2316e1b0e745d56ce8fb5d6af550f6c91810b31c7f87","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-11T13:10:48Z","title_canon_sha256":"b756742136241cbf71d209fd06ffea6c60d95bab8e40a4820adb21d436d56c35"},"schema_version":"1.0","source":{"id":"1610.03317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03317","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03317v1","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03317","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"5UMTDZRDQL5O","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5UMTDZRDQL5OZLAW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5UMTDZRD","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:eb506b45b2e978001d8545b66782ffab9c177facafd9f3e9b97294a795785cfb","target":"graph","created_at":"2026-05-18T01:02:31Z","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":"Maximum Inner Product Search (MIPS) is an important task in many machine learning applications such as the prediction phase of a low-rank matrix factorization model for a recommender system. There have been some works on how to perform MIPS in sub-linear time recently. However, most of them do not have the flexibility to control the trade-off between search efficient and search quality. In this paper, we study the MIPS problem with a computational budget. By carefully studying the problem structure of MIPS, we develop a novel Greedy-MIPS algorithm, which can handle budgeted MIPS by design. Whi","authors_text":"Cho-Jui Hsieh, Hsiang-Fu Yu, Inderjit S. Dhillon, Qi Lei","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-11T13:10:48Z","title":"A Greedy Approach for Budgeted Maximum Inner Product Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03317","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:1bc63965cf14d2dce7ee07dd0cbca156eb329932ffb058f76c90f9956b9397e8","target":"record","created_at":"2026-05-18T01:02:31Z","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":"501aa58a0dba4926009b2316e1b0e745d56ce8fb5d6af550f6c91810b31c7f87","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-11T13:10:48Z","title_canon_sha256":"b756742136241cbf71d209fd06ffea6c60d95bab8e40a4820adb21d436d56c35"},"schema_version":"1.0","source":{"id":"1610.03317","kind":"arxiv","version":1}},"canonical_sha256":"ed1931e62382faecac163aa57dbd5fbdaea29ac6788f8e3f58002e1937b9fbd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed1931e62382faecac163aa57dbd5fbdaea29ac6788f8e3f58002e1937b9fbd0","first_computed_at":"2026-05-18T01:02:31.808626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:31.808626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M8lalgBjEsMLJh+4ZoJyIqw0MOZuEiXItla0NS0npxjijBAS0Gl1FDpD1h0XpmbSOonqH/xkpsh3r8eZb8YqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:31.809268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bc63965cf14d2dce7ee07dd0cbca156eb329932ffb058f76c90f9956b9397e8","sha256:eb506b45b2e978001d8545b66782ffab9c177facafd9f3e9b97294a795785cfb"],"state_sha256":"8723b665ead3a9a616fd068cc4c668451388c567914ed3c71d34a05ac275a347"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OD83gOfiGYCebtdY/aJdrkwVy2nDorcrFNcZc1403jq4mDiVEG+VZ/KDCxZYHzaWslbY6kYcABUi6Gq7d2IMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:01:03.016086Z","bundle_sha256":"a2accaa4ea5f3e879588413551b8ff0dd95107d5cd7f27839ee9ac1858c1ec94"}}