{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FYATBQNVVOUNJW3HO4NQ5MFALB","short_pith_number":"pith:FYATBQNV","schema_version":"1.0","canonical_sha256":"2e0130c1b5aba8d4db67771b0eb0a05876285554c89cf3ccc21ec818f408d08b","source":{"kind":"arxiv","id":"1502.02155","version":1},"attestation_state":"computed","paper":{"title":"Secretary Problems with Non-Uniform Arrival Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Rad Niazadeh, Robert Kleinberg, Thomas Kesselheim","submitted_at":"2015-02-07T16:04:14Z","abstract_excerpt":"For many online problems, it is known that the uniform arrival order enables the design of algorithms with much better performance guarantees than under worst-case. The quintessential example is the secretary problem. If the sequence of elements is presented in uniformly random order there is an algorithm that picks the maximum value with probability 1/e, whereas no non-trivial performance guarantee is possible if the elements arrive in worst-case order. This work initiates an investigation into relaxations of the random-ordering hypothesis in online algorithms, by focusing on the secretary pr"},"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":"1502.02155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T16:04:14Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"6ffae2d6544978148a603aef2d2f697cce751053ef03dfe65b8a18a7fbdc0f3f","abstract_canon_sha256":"2b9470685eb7c8b0ad2738e2434a5c208c90f31fa8b21c16ecad247864f45208"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:43.481048Z","signature_b64":"wntzMhCVtB5XwuVRP86KAhGFm0IKr3a+eZAGiQdc26aR7DNC1kpHJtBC/SMAg0hHyy/t3RLuSMfTeT8hewsTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e0130c1b5aba8d4db67771b0eb0a05876285554c89cf3ccc21ec818f408d08b","last_reissued_at":"2026-05-18T02:27:43.480522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:43.480522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secretary Problems with Non-Uniform Arrival Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Rad Niazadeh, Robert Kleinberg, Thomas Kesselheim","submitted_at":"2015-02-07T16:04:14Z","abstract_excerpt":"For many online problems, it is known that the uniform arrival order enables the design of algorithms with much better performance guarantees than under worst-case. The quintessential example is the secretary problem. If the sequence of elements is presented in uniformly random order there is an algorithm that picks the maximum value with probability 1/e, whereas no non-trivial performance guarantee is possible if the elements arrive in worst-case order. This work initiates an investigation into relaxations of the random-ordering hypothesis in online algorithms, by focusing on the secretary pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02155","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":"1502.02155","created_at":"2026-05-18T02:27:43.480607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02155v1","created_at":"2026-05-18T02:27:43.480607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02155","created_at":"2026-05-18T02:27:43.480607+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYATBQNVVOUN","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYATBQNVVOUNJW3H","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYATBQNV","created_at":"2026-05-18T12:29:22.688609+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/FYATBQNVVOUNJW3HO4NQ5MFALB","json":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB.json","graph_json":"https://pith.science/api/pith-number/FYATBQNVVOUNJW3HO4NQ5MFALB/graph.json","events_json":"https://pith.science/api/pith-number/FYATBQNVVOUNJW3HO4NQ5MFALB/events.json","paper":"https://pith.science/paper/FYATBQNV"},"agent_actions":{"view_html":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB","download_json":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB.json","view_paper":"https://pith.science/paper/FYATBQNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02155&json=true","fetch_graph":"https://pith.science/api/pith-number/FYATBQNVVOUNJW3HO4NQ5MFALB/graph.json","fetch_events":"https://pith.science/api/pith-number/FYATBQNVVOUNJW3HO4NQ5MFALB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/action/storage_attestation","attest_author":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/action/author_attestation","sign_citation":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/action/citation_signature","submit_replication":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/action/replication_record"}},"created_at":"2026-05-18T02:27:43.480607+00:00","updated_at":"2026-05-18T02:27:43.480607+00:00"}