{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LVXAZTKPBQOR3Z5RKIW7PN6ZNJ","short_pith_number":"pith:LVXAZTKP","schema_version":"1.0","canonical_sha256":"5d6e0ccd4f0c1d1de7b1522df7b7d96a45d32fef7bf9fd932970650d6f7ddbd6","source":{"kind":"arxiv","id":"2011.06726","version":1},"attestation_state":"computed","paper":{"title":"Secretaries with Advice","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Paul D\\\"utting, Renato Paes Leme, Sergei Vassilvitskii, Silvio Lattanzi","submitted_at":"2020-11-13T02:24:02Z","abstract_excerpt":"The secretary problem is probably the purest model of decision making under uncertainty. In this paper we ask which advice can we give the algorithm to improve its success probability?\n  We propose a general model that unifies a broad range of problems: from the classic secretary problem with no advice, to the variant where the quality of a secretary is drawn from a known distribution and the algorithm learns each candidate's quality on arrival, to more modern versions of advice in the form of samples, to an ML-inspired model where a classifier gives us noisy signal about whether or not the cu"},"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":"2011.06726","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-13T02:24:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3e76abdbc67ede8602a54e2d8a40eb9bd777e87e394be8c2193df1eb996c5c60","abstract_canon_sha256":"1037b19f2aca718f986a30e0336abbc96ad29a78f8ebeebfc3c3f37a58cf2203"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:24.523160Z","signature_b64":"m+PZEZlQSLQnG54BsrRTzIl8ThFdZrfwS0NBqLFF7uZrIjYIk5WOBVb4fhYwJ4QQfiymWgg8nP/TBMB+xSi4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d6e0ccd4f0c1d1de7b1522df7b7d96a45d32fef7bf9fd932970650d6f7ddbd6","last_reissued_at":"2026-07-05T01:51:24.522782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:24.522782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secretaries with Advice","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Paul D\\\"utting, Renato Paes Leme, Sergei Vassilvitskii, Silvio Lattanzi","submitted_at":"2020-11-13T02:24:02Z","abstract_excerpt":"The secretary problem is probably the purest model of decision making under uncertainty. In this paper we ask which advice can we give the algorithm to improve its success probability?\n  We propose a general model that unifies a broad range of problems: from the classic secretary problem with no advice, to the variant where the quality of a secretary is drawn from a known distribution and the algorithm learns each candidate's quality on arrival, to more modern versions of advice in the form of samples, to an ML-inspired model where a classifier gives us noisy signal about whether or not the cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06726","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/2011.06726/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.06726","created_at":"2026-07-05T01:51:24.522836+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.06726v1","created_at":"2026-07-05T01:51:24.522836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06726","created_at":"2026-07-05T01:51:24.522836+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVXAZTKPBQOR","created_at":"2026-07-05T01:51:24.522836+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVXAZTKPBQOR3Z5R","created_at":"2026-07-05T01:51:24.522836+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVXAZTKP","created_at":"2026-07-05T01:51:24.522836+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02894","citing_title":"How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ","json":"https://pith.science/pith/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ.json","graph_json":"https://pith.science/api/pith-number/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ/graph.json","events_json":"https://pith.science/api/pith-number/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ/events.json","paper":"https://pith.science/paper/LVXAZTKP"},"agent_actions":{"view_html":"https://pith.science/pith/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ","download_json":"https://pith.science/pith/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ.json","view_paper":"https://pith.science/paper/LVXAZTKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.06726&json=true","fetch_graph":"https://pith.science/api/pith-number/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ/action/storage_attestation","attest_author":"https://pith.science/pith/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ/action/author_attestation","sign_citation":"https://pith.science/pith/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ/action/citation_signature","submit_replication":"https://pith.science/pith/LVXAZTKPBQOR3Z5RKIW7PN6ZNJ/action/replication_record"}},"created_at":"2026-07-05T01:51:24.522836+00:00","updated_at":"2026-07-05T01:51:24.522836+00:00"}