{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RZ3P3S4ZBC7YXKHVFWGNO6YZBZ","short_pith_number":"pith:RZ3P3S4Z","schema_version":"1.0","canonical_sha256":"8e76fdcb9908bf8ba8f52d8cd77b190e707043e4dc809ba4b55d31a5cf01fdf4","source":{"kind":"arxiv","id":"1708.08831","version":1},"attestation_state":"computed","paper":{"title":"Learning in the Repeated Secretary Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Daniel G. Goldstein, James R. Wright, R. Preston McAfee, Siddharth Suri","submitted_at":"2017-08-29T15:41:41Z","abstract_excerpt":"In the classical secretary problem, one attempts to find the maximum of an unknown and unlearnable distribution through sequential search. In many real-world searches, however, distributions are not entirely unknown and can be learned through experience. To investigate learning in such a repeated secretary problem we conduct a large-scale behavioral experiment in which people search repeatedly from fixed distributions. In contrast to prior investigations that find no evidence for learning in the classical scenario, in the repeated setting we observe substantial learning resulting in near-optim"},"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":"1708.08831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-29T15:41:41Z","cross_cats_sorted":[],"title_canon_sha256":"190494f49a97dad2f4b30385754df0cceb0abbe078469e853209629f255dbf13","abstract_canon_sha256":"72552a9ee65079edb14e0f9a081caa62e520b5a66a6ebbf02cd8d4c0667e32f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:25.493900Z","signature_b64":"/Vz2bvS4Rm2QcxpYwVV1QFLhZVHbJ9HtxArOf6k32sflIqw9mInoMZ2IxvIvPE71e4D4ezcrXajxm+cokO1HCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e76fdcb9908bf8ba8f52d8cd77b190e707043e4dc809ba4b55d31a5cf01fdf4","last_reissued_at":"2026-05-18T00:36:25.493108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:25.493108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning in the Repeated Secretary Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Daniel G. Goldstein, James R. Wright, R. Preston McAfee, Siddharth Suri","submitted_at":"2017-08-29T15:41:41Z","abstract_excerpt":"In the classical secretary problem, one attempts to find the maximum of an unknown and unlearnable distribution through sequential search. In many real-world searches, however, distributions are not entirely unknown and can be learned through experience. To investigate learning in such a repeated secretary problem we conduct a large-scale behavioral experiment in which people search repeatedly from fixed distributions. In contrast to prior investigations that find no evidence for learning in the classical scenario, in the repeated setting we observe substantial learning resulting in near-optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08831","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":"1708.08831","created_at":"2026-05-18T00:36:25.493242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08831v1","created_at":"2026-05-18T00:36:25.493242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08831","created_at":"2026-05-18T00:36:25.493242+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZ3P3S4ZBC7Y","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZ3P3S4ZBC7YXKHV","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZ3P3S4Z","created_at":"2026-05-18T12:31:43.269735+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/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ","json":"https://pith.science/pith/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ.json","graph_json":"https://pith.science/api/pith-number/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ/graph.json","events_json":"https://pith.science/api/pith-number/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ/events.json","paper":"https://pith.science/paper/RZ3P3S4Z"},"agent_actions":{"view_html":"https://pith.science/pith/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ","download_json":"https://pith.science/pith/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ.json","view_paper":"https://pith.science/paper/RZ3P3S4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08831&json=true","fetch_graph":"https://pith.science/api/pith-number/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ/action/storage_attestation","attest_author":"https://pith.science/pith/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ/action/author_attestation","sign_citation":"https://pith.science/pith/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ/action/citation_signature","submit_replication":"https://pith.science/pith/RZ3P3S4ZBC7YXKHVFWGNO6YZBZ/action/replication_record"}},"created_at":"2026-05-18T00:36:25.493242+00:00","updated_at":"2026-05-18T00:36:25.493242+00:00"}