{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:736CZZOFBYHQTU3XKIFWRVQM6F","short_pith_number":"pith:736CZZOF","canonical_record":{"source":{"id":"1602.04391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-13T22:22:54Z","cross_cats_sorted":["math.OC","stat.AP"],"title_canon_sha256":"03b3adbf5be9b135743c68c3a100f4c18fbb96c92f7dd4a3cd5fa7dc3d6c36d3","abstract_canon_sha256":"41778f3c73dcd2501e20c4e03404f5b86e50ad2891bb3ec1f05c899567d97c64"},"schema_version":"1.0"},"canonical_sha256":"fefc2ce5c50e0f09d377520b68d60cf1476001c34d44deb5bee2261a120a7e10","source":{"kind":"arxiv","id":"1602.04391","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04391","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04391v2","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04391","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"736CZZOFBYHQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"736CZZOFBYHQTU3X","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"736CZZOF","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:736CZZOFBYHQTU3XKIFWRVQM6F","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-13T22:22:54Z","cross_cats_sorted":["math.OC","stat.AP"],"title_canon_sha256":"03b3adbf5be9b135743c68c3a100f4c18fbb96c92f7dd4a3cd5fa7dc3d6c36d3","abstract_canon_sha256":"41778f3c73dcd2501e20c4e03404f5b86e50ad2891bb3ec1f05c899567d97c64"},"schema_version":"1.0"},"canonical_sha256":"fefc2ce5c50e0f09d377520b68d60cf1476001c34d44deb5bee2261a120a7e10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:24.894431Z","signature_b64":"0s5kMi3cMF9wiq9r118GaTlIzLmifSTdtYXSuauy9P//Ga5tttaBfVv7fiDyf0DbewB9CEEetWxiwQ/lFKthBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fefc2ce5c50e0f09d377520b68d60cf1476001c34d44deb5bee2261a120a7e10","last_reissued_at":"2026-05-18T00:44:24.893850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:24.893850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04391","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-18T00:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkK+1UNgBXPvfmKxTECEJaBgKQI7hAcCubyh3LSsuxztdjWQo7HtZ6wXdE5bA0hkgB0/qRhcMISPPgxyWqQIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:10:23.995070Z"},"content_sha256":"ea0948a07b1ff34ee9e694560138cd3b9f6b54b6c58f799eff287af2ae5021c4","schema_version":"1.0","event_id":"sha256:ea0948a07b1ff34ee9e694560138cd3b9f6b54b6c58f799eff287af2ae5021c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:736CZZOFBYHQTU3XKIFWRVQM6F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Multi-Slot Optimization for Ranking Recommendations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.AP"],"primary_cat":"stat.ML","authors_text":"Ankan Saha, Kinjal Basu, Shaunak Chatterjee","submitted_at":"2016-02-13T22:22:54Z","abstract_excerpt":"Ranking items to be recommended to users is one of the main problems in large scale social media applications. This problem can be set up as a multi-objective optimization problem to allow for trading off multiple, potentially conflicting objectives (that are driven by those items) against each other. Most previous approaches to this problem optimize for a single slot without considering the interaction effect of these items on one another.\n  In this paper, we develop a constrained multi-slot optimization formulation, which allows for modeling interactions among the items on the different slot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04391","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-18T00:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlCCWOJ0pMGeDtthn91/NI9AcvfiQBLvqPVMlmdmkHWDgto+CYWo//xxNEcnTy71ltgPOxBKbXtXp5BaIToyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:10:23.995622Z"},"content_sha256":"0036886aac2dd518c3f5a32860f47a1f93130157e30b9fa8296b7fd221688594","schema_version":"1.0","event_id":"sha256:0036886aac2dd518c3f5a32860f47a1f93130157e30b9fa8296b7fd221688594"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F/bundle.json","state_url":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/736CZZOFBYHQTU3XKIFWRVQM6F/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-01T21:10:23Z","links":{"resolver":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F","bundle":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F/bundle.json","state":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/736CZZOFBYHQTU3XKIFWRVQM6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:736CZZOFBYHQTU3XKIFWRVQM6F","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":"41778f3c73dcd2501e20c4e03404f5b86e50ad2891bb3ec1f05c899567d97c64","cross_cats_sorted":["math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-13T22:22:54Z","title_canon_sha256":"03b3adbf5be9b135743c68c3a100f4c18fbb96c92f7dd4a3cd5fa7dc3d6c36d3"},"schema_version":"1.0","source":{"id":"1602.04391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04391","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04391v2","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04391","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"736CZZOFBYHQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"736CZZOFBYHQTU3X","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"736CZZOF","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:0036886aac2dd518c3f5a32860f47a1f93130157e30b9fa8296b7fd221688594","target":"graph","created_at":"2026-05-18T00:44:24Z","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":"Ranking items to be recommended to users is one of the main problems in large scale social media applications. This problem can be set up as a multi-objective optimization problem to allow for trading off multiple, potentially conflicting objectives (that are driven by those items) against each other. Most previous approaches to this problem optimize for a single slot without considering the interaction effect of these items on one another.\n  In this paper, we develop a constrained multi-slot optimization formulation, which allows for modeling interactions among the items on the different slot","authors_text":"Ankan Saha, Kinjal Basu, Shaunak Chatterjee","cross_cats":["math.OC","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-13T22:22:54Z","title":"Constrained Multi-Slot Optimization for Ranking Recommendations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04391","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:ea0948a07b1ff34ee9e694560138cd3b9f6b54b6c58f799eff287af2ae5021c4","target":"record","created_at":"2026-05-18T00:44:24Z","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":"41778f3c73dcd2501e20c4e03404f5b86e50ad2891bb3ec1f05c899567d97c64","cross_cats_sorted":["math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-13T22:22:54Z","title_canon_sha256":"03b3adbf5be9b135743c68c3a100f4c18fbb96c92f7dd4a3cd5fa7dc3d6c36d3"},"schema_version":"1.0","source":{"id":"1602.04391","kind":"arxiv","version":2}},"canonical_sha256":"fefc2ce5c50e0f09d377520b68d60cf1476001c34d44deb5bee2261a120a7e10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fefc2ce5c50e0f09d377520b68d60cf1476001c34d44deb5bee2261a120a7e10","first_computed_at":"2026-05-18T00:44:24.893850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:24.893850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0s5kMi3cMF9wiq9r118GaTlIzLmifSTdtYXSuauy9P//Ga5tttaBfVv7fiDyf0DbewB9CEEetWxiwQ/lFKthBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:24.894431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea0948a07b1ff34ee9e694560138cd3b9f6b54b6c58f799eff287af2ae5021c4","sha256:0036886aac2dd518c3f5a32860f47a1f93130157e30b9fa8296b7fd221688594"],"state_sha256":"0497d42158a46ba31a89ea9fba98b0b469035160b9aebc1540a7d8d3343933bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XwnuMdtZ57HRUMtSoyjdIYEJX697ClZAJV1EAXEEzZT1M9/C/SsL5PHHrmR2AK/lDlAH6N+Fe/qemT7SknFLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:10:23.998367Z","bundle_sha256":"be96c059ac0e4b3042f77b02ed27e22d39f3dde1b4990c49e10368050bb80544"}}