{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5ETKOAIV2C4DFKEFVESLQRNT2M","short_pith_number":"pith:5ETKOAIV","canonical_record":{"source":{"id":"1602.03131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-09T19:43:45Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"61f5caf6b3ce566262010e2a4b153609e61f7bbd2ad64a0a26d84fce1a2ab952","abstract_canon_sha256":"6af42dee060514b5d13fcc1ed231dcebdebbdf77227fd9a6c8c0fde67ce1fde3"},"schema_version":"1.0"},"canonical_sha256":"e926a70115d0b832a885a924b845b3d33c0adc1528c88c5084dfc08f7ac5a91b","source":{"kind":"arxiv","id":"1602.03131","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03131","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03131v2","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03131","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"5ETKOAIV2C4D","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5ETKOAIV2C4DFKEF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5ETKOAIV","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5ETKOAIV2C4DFKEFVESLQRNT2M","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-09T19:43:45Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"61f5caf6b3ce566262010e2a4b153609e61f7bbd2ad64a0a26d84fce1a2ab952","abstract_canon_sha256":"6af42dee060514b5d13fcc1ed231dcebdebbdf77227fd9a6c8c0fde67ce1fde3"},"schema_version":"1.0"},"canonical_sha256":"e926a70115d0b832a885a924b845b3d33c0adc1528c88c5084dfc08f7ac5a91b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:51.614704Z","signature_b64":"40Q2wOlBa8iBkZuMP3imDn393cN7ump7V4TsWEU0ipeTYWiePCFafgJors3GhXEXZu84QLWlLQnQKPBX2ZpjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e926a70115d0b832a885a924b845b3d33c0adc1528c88c5084dfc08f7ac5a91b","last_reissued_at":"2026-05-18T01:20:51.613980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:51.613980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03131","source_version":2,"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:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YeoqamrZPKhqmvjbbBLEr35JE1xW/P8yNwBQr5paQ+cLsfDTM8WxzgVACxnOke/0j9W/qJHmHqE83VHJifkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:18:25.157160Z"},"content_sha256":"a70f3abb74675148ab0a4320cf78cbea0fcc753cf02bb98efd9dd2861bbd0487","schema_version":"1.0","event_id":"sha256:a70f3abb74675148ab0a4320cf78cbea0fcc753cf02bb98efd9dd2861bbd0487"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5ETKOAIV2C4DFKEFVESLQRNT2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large scale multi-objective optimization: Theoretical and practical challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"stat.AP","authors_text":"Ankan Saha, Kinjal Basu, Shaunak Chatterjee","submitted_at":"2016-02-09T19:43:45Z","abstract_excerpt":"Multi-objective optimization (MOO) is a well-studied problem for several important recommendation problems. While multiple approaches have been proposed, in this work, we focus on using constrained optimization formulations (e.g., quadratic and linear programs) to formulate and solve MOO problems. This approach can be used to pick desired operating points on the trade-off curve between multiple objectives. It also works well for internet applications which serve large volumes of online traffic, by working with Lagrangian duality formulation to connect dual solutions (computed offline) with the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03131","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":""},"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:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HN7xCPdy73P8FsKOT+ivRV+w3FmN7a0efZ3wFIxNlIYl4r247kOEAD1iv9L0N5CZc8UY5EChV/Nf1daFRlmWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:18:25.157532Z"},"content_sha256":"e2b36ee40c14a946f525554f006bffa78204ad733bbed5474c73e250b16c3fa7","schema_version":"1.0","event_id":"sha256:e2b36ee40c14a946f525554f006bffa78204ad733bbed5474c73e250b16c3fa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ETKOAIV2C4DFKEFVESLQRNT2M/bundle.json","state_url":"https://pith.science/pith/5ETKOAIV2C4DFKEFVESLQRNT2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ETKOAIV2C4DFKEFVESLQRNT2M/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-02T00:18:25Z","links":{"resolver":"https://pith.science/pith/5ETKOAIV2C4DFKEFVESLQRNT2M","bundle":"https://pith.science/pith/5ETKOAIV2C4DFKEFVESLQRNT2M/bundle.json","state":"https://pith.science/pith/5ETKOAIV2C4DFKEFVESLQRNT2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ETKOAIV2C4DFKEFVESLQRNT2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5ETKOAIV2C4DFKEFVESLQRNT2M","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":"6af42dee060514b5d13fcc1ed231dcebdebbdf77227fd9a6c8c0fde67ce1fde3","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-09T19:43:45Z","title_canon_sha256":"61f5caf6b3ce566262010e2a4b153609e61f7bbd2ad64a0a26d84fce1a2ab952"},"schema_version":"1.0","source":{"id":"1602.03131","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03131","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03131v2","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03131","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"5ETKOAIV2C4D","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5ETKOAIV2C4DFKEF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5ETKOAIV","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:e2b36ee40c14a946f525554f006bffa78204ad733bbed5474c73e250b16c3fa7","target":"graph","created_at":"2026-05-18T01:20:51Z","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":"Multi-objective optimization (MOO) is a well-studied problem for several important recommendation problems. While multiple approaches have been proposed, in this work, we focus on using constrained optimization formulations (e.g., quadratic and linear programs) to formulate and solve MOO problems. This approach can be used to pick desired operating points on the trade-off curve between multiple objectives. It also works well for internet applications which serve large volumes of online traffic, by working with Lagrangian duality formulation to connect dual solutions (computed offline) with the","authors_text":"Ankan Saha, Kinjal Basu, Shaunak Chatterjee","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-09T19:43:45Z","title":"Large scale multi-objective optimization: Theoretical and practical challenges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03131","kind":"arxiv","version":2},"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:a70f3abb74675148ab0a4320cf78cbea0fcc753cf02bb98efd9dd2861bbd0487","target":"record","created_at":"2026-05-18T01:20:51Z","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":"6af42dee060514b5d13fcc1ed231dcebdebbdf77227fd9a6c8c0fde67ce1fde3","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-09T19:43:45Z","title_canon_sha256":"61f5caf6b3ce566262010e2a4b153609e61f7bbd2ad64a0a26d84fce1a2ab952"},"schema_version":"1.0","source":{"id":"1602.03131","kind":"arxiv","version":2}},"canonical_sha256":"e926a70115d0b832a885a924b845b3d33c0adc1528c88c5084dfc08f7ac5a91b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e926a70115d0b832a885a924b845b3d33c0adc1528c88c5084dfc08f7ac5a91b","first_computed_at":"2026-05-18T01:20:51.613980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:51.613980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"40Q2wOlBa8iBkZuMP3imDn393cN7ump7V4TsWEU0ipeTYWiePCFafgJors3GhXEXZu84QLWlLQnQKPBX2ZpjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:51.614704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03131","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a70f3abb74675148ab0a4320cf78cbea0fcc753cf02bb98efd9dd2861bbd0487","sha256:e2b36ee40c14a946f525554f006bffa78204ad733bbed5474c73e250b16c3fa7"],"state_sha256":"1c19bca84480d685eeaebdd31dfd27cb260ec1a3000d5449e0dd8b333415c576"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nx8HV+NHk41M8J9j5TkhWS4WmTxwJcJWrs5gFrCyy7wJv8aJciCxHvS47AW5yxxcgslmx+wiPvN0p+i/Mp53DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:18:25.159609Z","bundle_sha256":"8609fd752910a380e7962fbc3a29217fd4d42da355a939c8a0757e1164245cea"}}