{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UGL2DIIQ7OJ2HYNDHJAQOGOWWJ","short_pith_number":"pith:UGL2DIIQ","canonical_record":{"source":{"id":"1507.08586","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-07-30T17:09:28Z","cross_cats_sorted":[],"title_canon_sha256":"ced78d31110b24feae002c053dd6e392433dec9447e9ae1fe324c82bbf4cca69","abstract_canon_sha256":"64cf8f4a7e78132ce8aaebf7b59cf04dff302fa447bef31b162e86ca71a6fa11"},"schema_version":"1.0"},"canonical_sha256":"a197a1a110fb93a3e1a33a410719d6b264b82d3fcef815ed4fd00a0cfd1660c0","source":{"kind":"arxiv","id":"1507.08586","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08586","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08586v3","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08586","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"UGL2DIIQ7OJ2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UGL2DIIQ7OJ2HYND","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UGL2DIIQ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UGL2DIIQ7OJ2HYNDHJAQOGOWWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08586","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-07-30T17:09:28Z","cross_cats_sorted":[],"title_canon_sha256":"ced78d31110b24feae002c053dd6e392433dec9447e9ae1fe324c82bbf4cca69","abstract_canon_sha256":"64cf8f4a7e78132ce8aaebf7b59cf04dff302fa447bef31b162e86ca71a6fa11"},"schema_version":"1.0"},"canonical_sha256":"a197a1a110fb93a3e1a33a410719d6b264b82d3fcef815ed4fd00a0cfd1660c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:34.296072Z","signature_b64":"RElkeupJOWFM7lytE3HtxNlj3Bg0vBJmQc6eNrcuJbdZJCF5qKm5I3yOAfJMS3WRX3sOL67lrBb7Eh35hCkTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a197a1a110fb93a3e1a33a410719d6b264b82d3fcef815ed4fd00a0cfd1660c0","last_reissued_at":"2026-05-18T00:51:34.295687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:34.295687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08586","source_version":3,"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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQzo7mPBL2gVAmSB72MvdjfJ1y3Ty9SrjcFcuNkJLOQh9k3zC179IBumLkE6dT98yWhJ/Klvc3MlP94ej6KnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:32:54.060890Z"},"content_sha256":"47bdec58cf497b5c4a3057dd3fa79591553b8ee44c87b72a3e99187c72c1abf6","schema_version":"1.0","event_id":"sha256:47bdec58cf497b5c4a3057dd3fa79591553b8ee44c87b72a3e99187c72c1abf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UGL2DIIQ7OJ2HYNDHJAQOGOWWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Ensemble Model for Document Ranking in Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hongfang Liu, In-Chan Choi, Yanshan Wang","submitted_at":"2015-07-30T17:09:28Z","abstract_excerpt":"A generalized ensemble model (gEnM) for document ranking is proposed in this paper. The gEnM linearly combines basis document retrieval models and tries to retrieve relevant documents at high positions. In order to obtain the optimal linear combination of multiple document retrieval models or rankers, an optimization program is formulated by directly maximizing the mean average precision. Both supervised and unsupervised learning algorithms are presented to solve this program. For the supervised scheme, two approaches are considered based on the data setting, namely batch and online setting. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08586","kind":"arxiv","version":3},"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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXWrA3zeQxWomC5bij9+u/1pwkrmCWwuHhEIgaaPwJSl30c3EZNrjTztobeZaI7A+XR3zbihE57Zc9VfamNPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:32:54.061524Z"},"content_sha256":"4f7eb092f5b68eb0629bc8421fb4ce90e467eed64e2a1a56eb1a57148337766d","schema_version":"1.0","event_id":"sha256:4f7eb092f5b68eb0629bc8421fb4ce90e467eed64e2a1a56eb1a57148337766d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGL2DIIQ7OJ2HYNDHJAQOGOWWJ/bundle.json","state_url":"https://pith.science/pith/UGL2DIIQ7OJ2HYNDHJAQOGOWWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGL2DIIQ7OJ2HYNDHJAQOGOWWJ/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-28T22:32:54Z","links":{"resolver":"https://pith.science/pith/UGL2DIIQ7OJ2HYNDHJAQOGOWWJ","bundle":"https://pith.science/pith/UGL2DIIQ7OJ2HYNDHJAQOGOWWJ/bundle.json","state":"https://pith.science/pith/UGL2DIIQ7OJ2HYNDHJAQOGOWWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGL2DIIQ7OJ2HYNDHJAQOGOWWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UGL2DIIQ7OJ2HYNDHJAQOGOWWJ","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":"64cf8f4a7e78132ce8aaebf7b59cf04dff302fa447bef31b162e86ca71a6fa11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-07-30T17:09:28Z","title_canon_sha256":"ced78d31110b24feae002c053dd6e392433dec9447e9ae1fe324c82bbf4cca69"},"schema_version":"1.0","source":{"id":"1507.08586","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08586","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08586v3","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08586","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"UGL2DIIQ7OJ2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UGL2DIIQ7OJ2HYND","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UGL2DIIQ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:4f7eb092f5b68eb0629bc8421fb4ce90e467eed64e2a1a56eb1a57148337766d","target":"graph","created_at":"2026-05-18T00:51:34Z","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":"A generalized ensemble model (gEnM) for document ranking is proposed in this paper. The gEnM linearly combines basis document retrieval models and tries to retrieve relevant documents at high positions. In order to obtain the optimal linear combination of multiple document retrieval models or rankers, an optimization program is formulated by directly maximizing the mean average precision. Both supervised and unsupervised learning algorithms are presented to solve this program. For the supervised scheme, two approaches are considered based on the data setting, namely batch and online setting. I","authors_text":"Hongfang Liu, In-Chan Choi, Yanshan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-07-30T17:09:28Z","title":"Generalized Ensemble Model for Document Ranking in Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08586","kind":"arxiv","version":3},"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:47bdec58cf497b5c4a3057dd3fa79591553b8ee44c87b72a3e99187c72c1abf6","target":"record","created_at":"2026-05-18T00:51:34Z","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":"64cf8f4a7e78132ce8aaebf7b59cf04dff302fa447bef31b162e86ca71a6fa11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-07-30T17:09:28Z","title_canon_sha256":"ced78d31110b24feae002c053dd6e392433dec9447e9ae1fe324c82bbf4cca69"},"schema_version":"1.0","source":{"id":"1507.08586","kind":"arxiv","version":3}},"canonical_sha256":"a197a1a110fb93a3e1a33a410719d6b264b82d3fcef815ed4fd00a0cfd1660c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a197a1a110fb93a3e1a33a410719d6b264b82d3fcef815ed4fd00a0cfd1660c0","first_computed_at":"2026-05-18T00:51:34.295687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:34.295687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RElkeupJOWFM7lytE3HtxNlj3Bg0vBJmQc6eNrcuJbdZJCF5qKm5I3yOAfJMS3WRX3sOL67lrBb7Eh35hCkTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:34.296072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08586","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47bdec58cf497b5c4a3057dd3fa79591553b8ee44c87b72a3e99187c72c1abf6","sha256:4f7eb092f5b68eb0629bc8421fb4ce90e467eed64e2a1a56eb1a57148337766d"],"state_sha256":"1a86f0112cdad4502a43c3f8560ea7928c73ff672611c6ccbf844a7b7800f3a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2vMVuKSinzsyRX5yxToHMsx1fcqYE+2kGx0A8soJgjLpRGWBdRTdLERGs2/8PuFzOpeLu74AO+NetA73r0BCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:32:54.064748Z","bundle_sha256":"af4ebc87a0afd128935e00f0be5a3be2eabbd5d065f71f02e6c2e1935a2c99ae"}}