{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4CHBKOTF34AW3AIM45EO3XN33V","short_pith_number":"pith:4CHBKOTF","schema_version":"1.0","canonical_sha256":"e08e153a65df016d810ce748edddbbdd5dfadb27673821dc3f9f145ee7b9e616","source":{"kind":"arxiv","id":"1507.06199","version":1},"attestation_state":"computed","paper":{"title":"Building a Good Team: Secretary Problems and the Supermodular Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Rani Izsak","submitted_at":"2015-07-22T14:15:10Z","abstract_excerpt":"In the Secretary Problem, one has to hire the best among n candidates. The candidates are interviewed, one at a time, at a random order, and one has to decide on the spot, whether to hire a candidate or continue interviewing. It is well known that the best candidate can be hired with a probability of 1/e (Dynkin, 1963). Recent works extend this problem to settings in which multiple candidates can be hired, subject to some constraint. Here, one wishes to hire a set of candidates maximizing a given set function.\n  Almost all extensions considered in the literature assume the objective set functi"},"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":"1507.06199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T14:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"c42e52b7267ffa7d1d6d05ed28fe77c973557227061bcf490a84a6709016d7f3","abstract_canon_sha256":"d9ee600fea08b91f8133f25ac09e36318ccaebe60416b85a8118ac042d69cd08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:26.401458Z","signature_b64":"9m9HO04lFbq7GivurrTyiGChijIJ03dnA5yv3dqeKr0oW9OUEbaxjcWB9DimNUhBpMbw4h+Hc3cDlTdX9VToCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e08e153a65df016d810ce748edddbbdd5dfadb27673821dc3f9f145ee7b9e616","last_reissued_at":"2026-05-18T01:36:26.400984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:26.400984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Building a Good Team: Secretary Problems and the Supermodular Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Rani Izsak","submitted_at":"2015-07-22T14:15:10Z","abstract_excerpt":"In the Secretary Problem, one has to hire the best among n candidates. The candidates are interviewed, one at a time, at a random order, and one has to decide on the spot, whether to hire a candidate or continue interviewing. It is well known that the best candidate can be hired with a probability of 1/e (Dynkin, 1963). Recent works extend this problem to settings in which multiple candidates can be hired, subject to some constraint. Here, one wishes to hire a set of candidates maximizing a given set function.\n  Almost all extensions considered in the literature assume the objective set functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06199","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":"1507.06199","created_at":"2026-05-18T01:36:26.401059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06199v1","created_at":"2026-05-18T01:36:26.401059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06199","created_at":"2026-05-18T01:36:26.401059+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CHBKOTF34AW","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CHBKOTF34AW3AIM","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CHBKOTF","created_at":"2026-05-18T12:29:05.191682+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/4CHBKOTF34AW3AIM45EO3XN33V","json":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V.json","graph_json":"https://pith.science/api/pith-number/4CHBKOTF34AW3AIM45EO3XN33V/graph.json","events_json":"https://pith.science/api/pith-number/4CHBKOTF34AW3AIM45EO3XN33V/events.json","paper":"https://pith.science/paper/4CHBKOTF"},"agent_actions":{"view_html":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V","download_json":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V.json","view_paper":"https://pith.science/paper/4CHBKOTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06199&json=true","fetch_graph":"https://pith.science/api/pith-number/4CHBKOTF34AW3AIM45EO3XN33V/graph.json","fetch_events":"https://pith.science/api/pith-number/4CHBKOTF34AW3AIM45EO3XN33V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V/action/storage_attestation","attest_author":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V/action/author_attestation","sign_citation":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V/action/citation_signature","submit_replication":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V/action/replication_record"}},"created_at":"2026-05-18T01:36:26.401059+00:00","updated_at":"2026-05-18T01:36:26.401059+00:00"}