{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JVZYJJ3RRO67745RJYD4HT26B7","short_pith_number":"pith:JVZYJJ3R","schema_version":"1.0","canonical_sha256":"4d7384a7718bbdfff3b14e07c3cf5e0fe308ebff45ba4ba3bb2589cfcd4835e8","source":{"kind":"arxiv","id":"1809.05082","version":2},"attestation_state":"computed","paper":{"title":"Submodular Secretary Problem with Shortlists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cliff Stein, Mohammad Shadravan, Shipra Agrawal","submitted_at":"2018-09-13T17:43:01Z","abstract_excerpt":"In submodular $k$-secretary problem, the goal is to select $k$ items in a randomly ordered input so as to maximize the expected value of a given monotone submodular function on the set of selected items. In this paper, we introduce a relaxation of this problem, which we refer to as submodular $k$-secretary problem with shortlists. In the proposed problem setting, the algorithm is allowed to choose more than $k$ items as part of a shortlist. Then, after seeing the entire input, the algorithm can choose a subset of size $k$ from the bigger set of items in the shortlist. We are interested in unde"},"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":"1809.05082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-13T17:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"8336fe6180a82b8a69cebff7aa9e2cdf129d6817199bb5432c2178e04fa50956","abstract_canon_sha256":"dbdda06ba96aa00b7a07784dd5c34d278ffb3957db5645e8a8e299769203d9e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:36.763098Z","signature_b64":"a7ui+E/jkDeIkE257ARq17/YpJKcSjgj+0t104SGfdzxjvR3cI/jDNenBytdVuyG6XrcNZTNDPWd+ZUlWDOeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d7384a7718bbdfff3b14e07c3cf5e0fe308ebff45ba4ba3bb2589cfcd4835e8","last_reissued_at":"2026-05-18T00:05:36.762699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:36.762699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Secretary Problem with Shortlists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cliff Stein, Mohammad Shadravan, Shipra Agrawal","submitted_at":"2018-09-13T17:43:01Z","abstract_excerpt":"In submodular $k$-secretary problem, the goal is to select $k$ items in a randomly ordered input so as to maximize the expected value of a given monotone submodular function on the set of selected items. In this paper, we introduce a relaxation of this problem, which we refer to as submodular $k$-secretary problem with shortlists. In the proposed problem setting, the algorithm is allowed to choose more than $k$ items as part of a shortlist. Then, after seeing the entire input, the algorithm can choose a subset of size $k$ from the bigger set of items in the shortlist. We are interested in unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05082","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.05082","created_at":"2026-05-18T00:05:36.762757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05082v2","created_at":"2026-05-18T00:05:36.762757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05082","created_at":"2026-05-18T00:05:36.762757+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVZYJJ3RRO67","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVZYJJ3RRO67745R","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVZYJJ3R","created_at":"2026-05-18T12:32:33.847187+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/JVZYJJ3RRO67745RJYD4HT26B7","json":"https://pith.science/pith/JVZYJJ3RRO67745RJYD4HT26B7.json","graph_json":"https://pith.science/api/pith-number/JVZYJJ3RRO67745RJYD4HT26B7/graph.json","events_json":"https://pith.science/api/pith-number/JVZYJJ3RRO67745RJYD4HT26B7/events.json","paper":"https://pith.science/paper/JVZYJJ3R"},"agent_actions":{"view_html":"https://pith.science/pith/JVZYJJ3RRO67745RJYD4HT26B7","download_json":"https://pith.science/pith/JVZYJJ3RRO67745RJYD4HT26B7.json","view_paper":"https://pith.science/paper/JVZYJJ3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05082&json=true","fetch_graph":"https://pith.science/api/pith-number/JVZYJJ3RRO67745RJYD4HT26B7/graph.json","fetch_events":"https://pith.science/api/pith-number/JVZYJJ3RRO67745RJYD4HT26B7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVZYJJ3RRO67745RJYD4HT26B7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVZYJJ3RRO67745RJYD4HT26B7/action/storage_attestation","attest_author":"https://pith.science/pith/JVZYJJ3RRO67745RJYD4HT26B7/action/author_attestation","sign_citation":"https://pith.science/pith/JVZYJJ3RRO67745RJYD4HT26B7/action/citation_signature","submit_replication":"https://pith.science/pith/JVZYJJ3RRO67745RJYD4HT26B7/action/replication_record"}},"created_at":"2026-05-18T00:05:36.762757+00:00","updated_at":"2026-05-18T00:05:36.762757+00:00"}