{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VLN5AB2LWOFE6IUPX6D7APKIBC","short_pith_number":"pith:VLN5AB2L","canonical_record":{"source":{"id":"1512.02996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-09T19:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"7a9bbf124f36b34b74921e24a14dd249b6b7e8db233fe47c44dd3123b6c33141","abstract_canon_sha256":"115c9a47a9a8a0334b8871b8cff771d47421d97590df08e0f78ca990af1539e2"},"schema_version":"1.0"},"canonical_sha256":"aadbd0074bb38a4f228fbf87f03d4808a3cdb0757f77f5bf390223121659e2c9","source":{"kind":"arxiv","id":"1512.02996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02996","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02996v1","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02996","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"VLN5AB2LWOFE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VLN5AB2LWOFE6IUP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VLN5AB2L","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VLN5AB2LWOFE6IUPX6D7APKIBC","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-09T19:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"7a9bbf124f36b34b74921e24a14dd249b6b7e8db233fe47c44dd3123b6c33141","abstract_canon_sha256":"115c9a47a9a8a0334b8871b8cff771d47421d97590df08e0f78ca990af1539e2"},"schema_version":"1.0"},"canonical_sha256":"aadbd0074bb38a4f228fbf87f03d4808a3cdb0757f77f5bf390223121659e2c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:39.075405Z","signature_b64":"z2MhzMwkFybnQDNYuMME15P6iAoCedoCgcdtwwXPKnCj0yXDCYwGqobnDtMK9acKkkPJ0p/eUlzIcCGp2fQoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aadbd0074bb38a4f228fbf87f03d4808a3cdb0757f77f5bf390223121659e2c9","last_reissued_at":"2026-05-18T01:24:39.075029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:39.075029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02996","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8N63xtn3Zs/rI3J86bpN5Fhzo+ub1osfYTafTKRhY4+0byo9cneDDbsofoL7T6XdUwYNVkf9+QOz2i6cDSqiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:36:35.162102Z"},"content_sha256":"0b4c6edd2a525a3b1bd857e219e412147df00dec838cc83507521d19b28c1fba","schema_version":"1.0","event_id":"sha256:0b4c6edd2a525a3b1bd857e219e412147df00dec838cc83507521d19b28c1fba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VLN5AB2LWOFE6IUPX6D7APKIBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The \"Thirty-seven Percent Rule\" and the Secretary Problem with Relative Ranks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"B\\'ela Bajnok, Svetoslav Semov","submitted_at":"2015-12-09T19:04:47Z","abstract_excerpt":"We revisit the problem of selecting an item from $n$ choices that appear before us in random sequential order so as to minimize the expected rank of the item selected. In particular, we examine the stopping rule where we reject the first $k$ items and then select the first subsequent item that ranks lower than the $l$-th lowest-ranked item among the first $k$. We prove that the optimal rule has $k \\sim n/{\\mathrm e}$, as in the classical secretary problem where our sole objective is to select the item of lowest rank; however, with the optimally chosen $l$, here we can get the expected rank of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02996","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"daWUGjElnkG3E4ipKAmntDC50slovbv0JafQUyPQPiqttmwHwjJqAXqf3bT8qDbgoq7kMs2cQYfEMgLgMfc9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:36:35.163012Z"},"content_sha256":"8f28022cac564da10be3479db8d2c8cd4d61a27807ec28064dfe48ef657a57ac","schema_version":"1.0","event_id":"sha256:8f28022cac564da10be3479db8d2c8cd4d61a27807ec28064dfe48ef657a57ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLN5AB2LWOFE6IUPX6D7APKIBC/bundle.json","state_url":"https://pith.science/pith/VLN5AB2LWOFE6IUPX6D7APKIBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLN5AB2LWOFE6IUPX6D7APKIBC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T05:36:35Z","links":{"resolver":"https://pith.science/pith/VLN5AB2LWOFE6IUPX6D7APKIBC","bundle":"https://pith.science/pith/VLN5AB2LWOFE6IUPX6D7APKIBC/bundle.json","state":"https://pith.science/pith/VLN5AB2LWOFE6IUPX6D7APKIBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLN5AB2LWOFE6IUPX6D7APKIBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VLN5AB2LWOFE6IUPX6D7APKIBC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"115c9a47a9a8a0334b8871b8cff771d47421d97590df08e0f78ca990af1539e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-09T19:04:47Z","title_canon_sha256":"7a9bbf124f36b34b74921e24a14dd249b6b7e8db233fe47c44dd3123b6c33141"},"schema_version":"1.0","source":{"id":"1512.02996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02996","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02996v1","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02996","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"VLN5AB2LWOFE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VLN5AB2LWOFE6IUP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VLN5AB2L","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:8f28022cac564da10be3479db8d2c8cd4d61a27807ec28064dfe48ef657a57ac","target":"graph","created_at":"2026-05-18T01:24:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We revisit the problem of selecting an item from $n$ choices that appear before us in random sequential order so as to minimize the expected rank of the item selected. In particular, we examine the stopping rule where we reject the first $k$ items and then select the first subsequent item that ranks lower than the $l$-th lowest-ranked item among the first $k$. We prove that the optimal rule has $k \\sim n/{\\mathrm e}$, as in the classical secretary problem where our sole objective is to select the item of lowest rank; however, with the optimally chosen $l$, here we can get the expected rank of ","authors_text":"B\\'ela Bajnok, Svetoslav Semov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-09T19:04:47Z","title":"The \"Thirty-seven Percent Rule\" and the Secretary Problem with Relative Ranks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02996","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0b4c6edd2a525a3b1bd857e219e412147df00dec838cc83507521d19b28c1fba","target":"record","created_at":"2026-05-18T01:24:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"115c9a47a9a8a0334b8871b8cff771d47421d97590df08e0f78ca990af1539e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-09T19:04:47Z","title_canon_sha256":"7a9bbf124f36b34b74921e24a14dd249b6b7e8db233fe47c44dd3123b6c33141"},"schema_version":"1.0","source":{"id":"1512.02996","kind":"arxiv","version":1}},"canonical_sha256":"aadbd0074bb38a4f228fbf87f03d4808a3cdb0757f77f5bf390223121659e2c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aadbd0074bb38a4f228fbf87f03d4808a3cdb0757f77f5bf390223121659e2c9","first_computed_at":"2026-05-18T01:24:39.075029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:39.075029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z2MhzMwkFybnQDNYuMME15P6iAoCedoCgcdtwwXPKnCj0yXDCYwGqobnDtMK9acKkkPJ0p/eUlzIcCGp2fQoBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:39.075405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b4c6edd2a525a3b1bd857e219e412147df00dec838cc83507521d19b28c1fba","sha256:8f28022cac564da10be3479db8d2c8cd4d61a27807ec28064dfe48ef657a57ac"],"state_sha256":"d5dfb70fde2b15cc3c08154593c329c19df46010a87ccb52fb0417b5ba390a2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/H4Wpl3n6Y/PswIbS0nyv8v1O/RpvF+ZiVVEx27udQDGrG1i25CdNw6rJZCq2XlIjOyJK4Ou3L9Ri7Jp0iB6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:36:35.165676Z","bundle_sha256":"700c0959e68dae0068eaa449c4934e616f34e1e879d9a8bb37a3590d52122a75"}}