{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IESXHOVMCNGH4E3VVA7VCAS7BT","short_pith_number":"pith:IESXHOVM","schema_version":"1.0","canonical_sha256":"412573baac134c7e1375a83f51025f0cf1f5358321fda848917fbe9c8faab205","source":{"kind":"arxiv","id":"1108.2754","version":1},"attestation_state":"computed","paper":{"title":"Structured Learning of Two-Level Dynamic Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Karthik Raman, Pannaga Shivaswamy, Thorsten Joachims","submitted_at":"2011-08-13T03:22:48Z","abstract_excerpt":"For ambiguous queries, conventional retrieval systems are bound by two conflicting goals. On the one hand, they should diversify and strive to present results for as many query intents as possible. On the other hand, they should provide depth for each intent by displaying more than a single result. Since both diversity and depth cannot be achieved simultaneously in the conventional static retrieval model, we propose a new dynamic ranking approach. Dynamic ranking models allow users to adapt the ranking through interaction, thus overcoming the constraints of presenting a one-size-fits-all stati"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1108.2754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-08-13T03:22:48Z","cross_cats_sorted":[],"title_canon_sha256":"159df7e797619fb6ab7e2fa0b852afb788aabdce376de61b3d011532706b6444","abstract_canon_sha256":"f28df3a02ed7f76d0c6ef9979ee81645e91062f40635abd31a0caa8c4cb32a56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:41.903378Z","signature_b64":"597Md1pjtOUzc/wdeBAupci1ElTmV9kco/fuVGHKBUgh232QfUrwwEyiJJ5kEkqrAJ/wZidAhViZpA3vLanmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"412573baac134c7e1375a83f51025f0cf1f5358321fda848917fbe9c8faab205","last_reissued_at":"2026-05-18T02:21:41.902842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:41.902842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Learning of Two-Level Dynamic Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Karthik Raman, Pannaga Shivaswamy, Thorsten Joachims","submitted_at":"2011-08-13T03:22:48Z","abstract_excerpt":"For ambiguous queries, conventional retrieval systems are bound by two conflicting goals. On the one hand, they should diversify and strive to present results for as many query intents as possible. On the other hand, they should provide depth for each intent by displaying more than a single result. Since both diversity and depth cannot be achieved simultaneously in the conventional static retrieval model, we propose a new dynamic ranking approach. Dynamic ranking models allow users to adapt the ranking through interaction, thus overcoming the constraints of presenting a one-size-fits-all stati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2754","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.2754","created_at":"2026-05-18T02:21:41.902938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2754v1","created_at":"2026-05-18T02:21:41.902938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2754","created_at":"2026-05-18T02:21:41.902938+00:00"},{"alias_kind":"pith_short_12","alias_value":"IESXHOVMCNGH","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IESXHOVMCNGH4E3V","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IESXHOVM","created_at":"2026-05-18T12:26:30.835961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IESXHOVMCNGH4E3VVA7VCAS7BT","json":"https://pith.science/pith/IESXHOVMCNGH4E3VVA7VCAS7BT.json","graph_json":"https://pith.science/api/pith-number/IESXHOVMCNGH4E3VVA7VCAS7BT/graph.json","events_json":"https://pith.science/api/pith-number/IESXHOVMCNGH4E3VVA7VCAS7BT/events.json","paper":"https://pith.science/paper/IESXHOVM"},"agent_actions":{"view_html":"https://pith.science/pith/IESXHOVMCNGH4E3VVA7VCAS7BT","download_json":"https://pith.science/pith/IESXHOVMCNGH4E3VVA7VCAS7BT.json","view_paper":"https://pith.science/paper/IESXHOVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2754&json=true","fetch_graph":"https://pith.science/api/pith-number/IESXHOVMCNGH4E3VVA7VCAS7BT/graph.json","fetch_events":"https://pith.science/api/pith-number/IESXHOVMCNGH4E3VVA7VCAS7BT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IESXHOVMCNGH4E3VVA7VCAS7BT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IESXHOVMCNGH4E3VVA7VCAS7BT/action/storage_attestation","attest_author":"https://pith.science/pith/IESXHOVMCNGH4E3VVA7VCAS7BT/action/author_attestation","sign_citation":"https://pith.science/pith/IESXHOVMCNGH4E3VVA7VCAS7BT/action/citation_signature","submit_replication":"https://pith.science/pith/IESXHOVMCNGH4E3VVA7VCAS7BT/action/replication_record"}},"created_at":"2026-05-18T02:21:41.902938+00:00","updated_at":"2026-05-18T02:21:41.902938+00:00"}