{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:C56QENMOSWAQFFDNAVM3DEJYF7","short_pith_number":"pith:C56QENMO","canonical_record":{"source":{"id":"2002.05753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-02-13T19:30:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"208dedbe6afa905b5ccb986359f4d96a5c5a37e14a81e54419ded7fecc8cd634","abstract_canon_sha256":"3475ea085b86b5c741b51123e028b5b0b9928f9679713459bad169d7681d4751"},"schema_version":"1.0"},"canonical_sha256":"177d02358e958102946d0559b191382fedc9afeb23e935f8d99726d57ea26bfd","source":{"kind":"arxiv","id":"2002.05753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.05753","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"2002.05753v1","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.05753","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"C56QENMOSWAQ","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"pith_short_16","alias_value":"C56QENMOSWAQFFDN","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"pith_short_8","alias_value":"C56QENMO","created_at":"2026-07-05T00:40:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:C56QENMOSWAQFFDNAVM3DEJYF7","target":"record","payload":{"canonical_record":{"source":{"id":"2002.05753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-02-13T19:30:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"208dedbe6afa905b5ccb986359f4d96a5c5a37e14a81e54419ded7fecc8cd634","abstract_canon_sha256":"3475ea085b86b5c741b51123e028b5b0b9928f9679713459bad169d7681d4751"},"schema_version":"1.0"},"canonical_sha256":"177d02358e958102946d0559b191382fedc9afeb23e935f8d99726d57ea26bfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:35.765398Z","signature_b64":"kdLtxB6Db887MuMihtseVsj/oU7tNmRKYQnKkrvnGMn3Ba49VHQQQTS56fwaD7j6H6NgGmO//CqwFitFVA1UDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"177d02358e958102946d0559b191382fedc9afeb23e935f8d99726d57ea26bfd","last_reissued_at":"2026-07-05T00:40:35.764964Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:35.764964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.05753","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-07-05T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gndQPqRdtHi8KEBvNJUHl7pWjYa0RtFxkm78nMlDQnYtbySaDSwqccxtkA45QwpRaKI5MGbKq3vrTLgUNSd3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T08:41:13.813941Z"},"content_sha256":"119017dc92cf5199429d0efddfd58fe66332ad4f14e6f3ac4301f325a8e42636","schema_version":"1.0","event_id":"sha256:119017dc92cf5199429d0efddfd58fe66332ad4f14e6f3ac4301f325a8e42636"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:C56QENMOSWAQFFDNAVM3DEJYF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-objective Ranking via Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Alireza Bagheri Garakani, Michinari Momma, Nanxun Ma, Yi Sun","submitted_at":"2020-02-13T19:30:32Z","abstract_excerpt":"In this paper, we introduce an Augmented Lagrangian based method to incorporate the multiple objectives (MO) in a search ranking algorithm. Optimizing MOs is an essential and realistic requirement for building ranking models in production. The proposed method formulates MO in constrained optimization and solves the problem in the popular Boosting framework -- a novel contribution of our work. Furthermore, we propose a procedure to set up all optimization parameters in the problem. The experimental results show that the method successfully achieves MO criteria much more efficiently than existin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.05753","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.05753/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lz8zR9h5HYHksLMn35vqYTxZbJJzp4Nd3If6GS9ORnnjxE+wnfB4gPGQeH/2mI8YcgCAEE4RQ7xQ49fQtO0DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T08:41:13.814307Z"},"content_sha256":"339a74cb2ddb86f4f606da9135f896abac68651b7a67b55547990c5be826edbb","schema_version":"1.0","event_id":"sha256:339a74cb2ddb86f4f606da9135f896abac68651b7a67b55547990c5be826edbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C56QENMOSWAQFFDNAVM3DEJYF7/bundle.json","state_url":"https://pith.science/pith/C56QENMOSWAQFFDNAVM3DEJYF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C56QENMOSWAQFFDNAVM3DEJYF7/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-07-10T08:41:13Z","links":{"resolver":"https://pith.science/pith/C56QENMOSWAQFFDNAVM3DEJYF7","bundle":"https://pith.science/pith/C56QENMOSWAQFFDNAVM3DEJYF7/bundle.json","state":"https://pith.science/pith/C56QENMOSWAQFFDNAVM3DEJYF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C56QENMOSWAQFFDNAVM3DEJYF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:C56QENMOSWAQFFDNAVM3DEJYF7","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":"3475ea085b86b5c741b51123e028b5b0b9928f9679713459bad169d7681d4751","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-02-13T19:30:32Z","title_canon_sha256":"208dedbe6afa905b5ccb986359f4d96a5c5a37e14a81e54419ded7fecc8cd634"},"schema_version":"1.0","source":{"id":"2002.05753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.05753","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"2002.05753v1","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.05753","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"C56QENMOSWAQ","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"pith_short_16","alias_value":"C56QENMOSWAQFFDN","created_at":"2026-07-05T00:40:35Z"},{"alias_kind":"pith_short_8","alias_value":"C56QENMO","created_at":"2026-07-05T00:40:35Z"}],"graph_snapshots":[{"event_id":"sha256:339a74cb2ddb86f4f606da9135f896abac68651b7a67b55547990c5be826edbb","target":"graph","created_at":"2026-07-05T00:40:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.05753/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we introduce an Augmented Lagrangian based method to incorporate the multiple objectives (MO) in a search ranking algorithm. Optimizing MOs is an essential and realistic requirement for building ranking models in production. The proposed method formulates MO in constrained optimization and solves the problem in the popular Boosting framework -- a novel contribution of our work. Furthermore, we propose a procedure to set up all optimization parameters in the problem. The experimental results show that the method successfully achieves MO criteria much more efficiently than existin","authors_text":"Alireza Bagheri Garakani, Michinari Momma, Nanxun Ma, Yi Sun","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-02-13T19:30:32Z","title":"Multi-objective Ranking via Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.05753","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:119017dc92cf5199429d0efddfd58fe66332ad4f14e6f3ac4301f325a8e42636","target":"record","created_at":"2026-07-05T00:40:35Z","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":"3475ea085b86b5c741b51123e028b5b0b9928f9679713459bad169d7681d4751","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-02-13T19:30:32Z","title_canon_sha256":"208dedbe6afa905b5ccb986359f4d96a5c5a37e14a81e54419ded7fecc8cd634"},"schema_version":"1.0","source":{"id":"2002.05753","kind":"arxiv","version":1}},"canonical_sha256":"177d02358e958102946d0559b191382fedc9afeb23e935f8d99726d57ea26bfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"177d02358e958102946d0559b191382fedc9afeb23e935f8d99726d57ea26bfd","first_computed_at":"2026-07-05T00:40:35.764964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:40:35.764964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kdLtxB6Db887MuMihtseVsj/oU7tNmRKYQnKkrvnGMn3Ba49VHQQQTS56fwaD7j6H6NgGmO//CqwFitFVA1UDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:40:35.765398Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.05753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:119017dc92cf5199429d0efddfd58fe66332ad4f14e6f3ac4301f325a8e42636","sha256:339a74cb2ddb86f4f606da9135f896abac68651b7a67b55547990c5be826edbb"],"state_sha256":"e21cf8c13b3724b0a23d06afead275bfe2441df7dd3776b42a0a0ffa2b00334f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kTF33oq2MpXjd9KvSU6ioWJiZjzSiIszVdzcuYdNaNeCuAK5GyTT1jB3n5uc1P5UMvm6v3QbpaRpJ8w9zWxqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T08:41:13.816232Z","bundle_sha256":"3865f392d16a3908dba8ecbaa37cdecdcf8e45bad624e75e595b0482a6e62095"}}