{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EH27KJDKABG2LRHBZ4S7CJCUVX","short_pith_number":"pith:EH27KJDK","canonical_record":{"source":{"id":"1705.05765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T15:27:57Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"6d0260743ba1b8db69a771d4b4e3a01aa117c564ef1385324ca021d73407d991","abstract_canon_sha256":"f75fca57145690d718f4e5b1c820a4e3ac3b34a1792e09358c9b999fe0766e77"},"schema_version":"1.0"},"canonical_sha256":"21f5f5246a004da5c4e1cf25f12454adc62a563d4f26f5e333d7a99b2975ccc7","source":{"kind":"arxiv","id":"1705.05765","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05765","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05765v1","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05765","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"EH27KJDKABG2","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EH27KJDKABG2LRHB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EH27KJDK","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EH27KJDKABG2LRHBZ4S7CJCUVX","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T15:27:57Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"6d0260743ba1b8db69a771d4b4e3a01aa117c564ef1385324ca021d73407d991","abstract_canon_sha256":"f75fca57145690d718f4e5b1c820a4e3ac3b34a1792e09358c9b999fe0766e77"},"schema_version":"1.0"},"canonical_sha256":"21f5f5246a004da5c4e1cf25f12454adc62a563d4f26f5e333d7a99b2975ccc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:20.230624Z","signature_b64":"xTVVMtNxmww28mpNSpaYOLUop26WzsDyqhlF70IIz5c3wqzMpQpXBdoB3PlHbBmwlLZzDEfYLHz3FputECiDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21f5f5246a004da5c4e1cf25f12454adc62a563d4f26f5e333d7a99b2975ccc7","last_reissued_at":"2026-05-18T00:44:20.230028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:20.230028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05765","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-18T00:44:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+o1BAu1PKjv00FVWJgIIMnUyd23DgGvBN1bO3QA9iSZC2eHGGhMmkbE7y5mzRcjDwaSZ02/thS4e+Hpg7KZRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:54:35.459522Z"},"content_sha256":"d6b01f5771fbd002a75dade2ab4e7bfb8e33a229feeeff4fed48ef6086d54044","schema_version":"1.0","event_id":"sha256:d6b01f5771fbd002a75dade2ab4e7bfb8e33a229feeeff4fed48ef6086d54044"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EH27KJDKABG2LRHBZ4S7CJCUVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Article Ranking as a Constrained, Dynamic, Multi-Objective Optimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.AI","authors_text":"Akshay Soni, Jeya Balaji Balasubramanian, Nikolay Laptev, Yashar Mehdad","submitted_at":"2017-05-16T15:27:57Z","abstract_excerpt":"The content ranking problem in a social news website, is typically a function that maximizes a scalar metric of interest like dwell-time. However, like in most real-world applications we are interested in more than one metric---for instance simultaneously maximizing click-through rate, monetization metrics, dwell-time---and also satisfy the traffic requirements promised to different publishers. All this needs to be done on online data and under the settings where the objective function and the constraints can dynamically change; this could happen if for instance new publishers are added, some "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05765","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-18T00:44:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6S3qX239lUFy0lCfvbiu8Ic5jKm3wiRWEeHdStX9VI5Og3yfLTN2pQi0uQiiPGsLgD2/uYrzFJtw5yr95/HCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:54:35.460207Z"},"content_sha256":"32d34172de1848591855b634ee934bfc71a820df3e53a08d8584be6b498868bf","schema_version":"1.0","event_id":"sha256:32d34172de1848591855b634ee934bfc71a820df3e53a08d8584be6b498868bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EH27KJDKABG2LRHBZ4S7CJCUVX/bundle.json","state_url":"https://pith.science/pith/EH27KJDKABG2LRHBZ4S7CJCUVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EH27KJDKABG2LRHBZ4S7CJCUVX/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-26T21:54:35Z","links":{"resolver":"https://pith.science/pith/EH27KJDKABG2LRHBZ4S7CJCUVX","bundle":"https://pith.science/pith/EH27KJDKABG2LRHBZ4S7CJCUVX/bundle.json","state":"https://pith.science/pith/EH27KJDKABG2LRHBZ4S7CJCUVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EH27KJDKABG2LRHBZ4S7CJCUVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EH27KJDKABG2LRHBZ4S7CJCUVX","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":"f75fca57145690d718f4e5b1c820a4e3ac3b34a1792e09358c9b999fe0766e77","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T15:27:57Z","title_canon_sha256":"6d0260743ba1b8db69a771d4b4e3a01aa117c564ef1385324ca021d73407d991"},"schema_version":"1.0","source":{"id":"1705.05765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05765","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05765v1","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05765","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"EH27KJDKABG2","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EH27KJDKABG2LRHB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EH27KJDK","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:32d34172de1848591855b634ee934bfc71a820df3e53a08d8584be6b498868bf","target":"graph","created_at":"2026-05-18T00:44:20Z","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":"The content ranking problem in a social news website, is typically a function that maximizes a scalar metric of interest like dwell-time. However, like in most real-world applications we are interested in more than one metric---for instance simultaneously maximizing click-through rate, monetization metrics, dwell-time---and also satisfy the traffic requirements promised to different publishers. All this needs to be done on online data and under the settings where the objective function and the constraints can dynamically change; this could happen if for instance new publishers are added, some ","authors_text":"Akshay Soni, Jeya Balaji Balasubramanian, Nikolay Laptev, Yashar Mehdad","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T15:27:57Z","title":"Online Article Ranking as a Constrained, Dynamic, Multi-Objective Optimization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05765","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:d6b01f5771fbd002a75dade2ab4e7bfb8e33a229feeeff4fed48ef6086d54044","target":"record","created_at":"2026-05-18T00:44:20Z","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":"f75fca57145690d718f4e5b1c820a4e3ac3b34a1792e09358c9b999fe0766e77","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T15:27:57Z","title_canon_sha256":"6d0260743ba1b8db69a771d4b4e3a01aa117c564ef1385324ca021d73407d991"},"schema_version":"1.0","source":{"id":"1705.05765","kind":"arxiv","version":1}},"canonical_sha256":"21f5f5246a004da5c4e1cf25f12454adc62a563d4f26f5e333d7a99b2975ccc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21f5f5246a004da5c4e1cf25f12454adc62a563d4f26f5e333d7a99b2975ccc7","first_computed_at":"2026-05-18T00:44:20.230028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:20.230028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xTVVMtNxmww28mpNSpaYOLUop26WzsDyqhlF70IIz5c3wqzMpQpXBdoB3PlHbBmwlLZzDEfYLHz3FputECiDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:20.230624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6b01f5771fbd002a75dade2ab4e7bfb8e33a229feeeff4fed48ef6086d54044","sha256:32d34172de1848591855b634ee934bfc71a820df3e53a08d8584be6b498868bf"],"state_sha256":"89aa4d2ebef8d5681acbcb785790666e4193abd70b1d8020870f189dab7043f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyUHO1aKufJ74yRxUkvNVziFJNcyqnvLiE6/0PFegm3VZCE0FmWExpO66PsnSuJo+dSzkwAbKVhnWnJdF8/vDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:54:35.463740Z","bundle_sha256":"956732ff86444a74c7d1b7bcb1c082ef43ea40e93028708c5812acaba78672d7"}}