{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HWD7FSZR3B27XNASTAKYQCFEJV","short_pith_number":"pith:HWD7FSZR","schema_version":"1.0","canonical_sha256":"3d87f2cb31d875fbb41298158808a44d64a4b81a264178706037c986947923d7","source":{"kind":"arxiv","id":"1404.0614","version":2},"attestation_state":"computed","paper":{"title":"The secretary returns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shai Vardi","submitted_at":"2014-04-02T17:00:12Z","abstract_excerpt":"In the online random-arrival model, an algorithm receives a sequence of n requests that arrive in a random order. The algorithm is expected to make an irrevocable decision with regard to each request based only on the observed history. We consider the following natural extension of this model: each request arrives k times, and the arrival order is a random permutation of the kn arrivals; the algorithm is expected to make a decision regarding each request only upon its last arrival. We focus primarily on the case when k=2, which can also be interpreted as each request arriving at, and departing"},"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":"1404.0614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-02T17:00:12Z","cross_cats_sorted":[],"title_canon_sha256":"44df970f6edfef49d3a5f8841ae9b2e080b974fd6fb3a8d7cef68e008a3f4692","abstract_canon_sha256":"cc521985dcb7ce8a8b7bca8b70afc4b371a4cdf25f4b4f4a268801e99cd24650"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:17.124021Z","signature_b64":"7we4lrd+Xb70PyK9AC+GmgqV1Mp905YuyMwmml6+VFCYWYwyslWbHn7Qfdk/WLtpLUvx44glB/P5RcW+XMffBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d87f2cb31d875fbb41298158808a44d64a4b81a264178706037c986947923d7","last_reissued_at":"2026-05-18T02:48:17.123628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:17.123628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The secretary returns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shai Vardi","submitted_at":"2014-04-02T17:00:12Z","abstract_excerpt":"In the online random-arrival model, an algorithm receives a sequence of n requests that arrive in a random order. The algorithm is expected to make an irrevocable decision with regard to each request based only on the observed history. We consider the following natural extension of this model: each request arrives k times, and the arrival order is a random permutation of the kn arrivals; the algorithm is expected to make a decision regarding each request only upon its last arrival. We focus primarily on the case when k=2, which can also be interpreted as each request arriving at, and departing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0614","kind":"arxiv","version":2},"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":"1404.0614","created_at":"2026-05-18T02:48:17.123685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0614v2","created_at":"2026-05-18T02:48:17.123685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0614","created_at":"2026-05-18T02:48:17.123685+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWD7FSZR3B27","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWD7FSZR3B27XNAS","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWD7FSZR","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.08593","citing_title":"Some variations of the secretary problem","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HWD7FSZR3B27XNASTAKYQCFEJV","json":"https://pith.science/pith/HWD7FSZR3B27XNASTAKYQCFEJV.json","graph_json":"https://pith.science/api/pith-number/HWD7FSZR3B27XNASTAKYQCFEJV/graph.json","events_json":"https://pith.science/api/pith-number/HWD7FSZR3B27XNASTAKYQCFEJV/events.json","paper":"https://pith.science/paper/HWD7FSZR"},"agent_actions":{"view_html":"https://pith.science/pith/HWD7FSZR3B27XNASTAKYQCFEJV","download_json":"https://pith.science/pith/HWD7FSZR3B27XNASTAKYQCFEJV.json","view_paper":"https://pith.science/paper/HWD7FSZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0614&json=true","fetch_graph":"https://pith.science/api/pith-number/HWD7FSZR3B27XNASTAKYQCFEJV/graph.json","fetch_events":"https://pith.science/api/pith-number/HWD7FSZR3B27XNASTAKYQCFEJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWD7FSZR3B27XNASTAKYQCFEJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWD7FSZR3B27XNASTAKYQCFEJV/action/storage_attestation","attest_author":"https://pith.science/pith/HWD7FSZR3B27XNASTAKYQCFEJV/action/author_attestation","sign_citation":"https://pith.science/pith/HWD7FSZR3B27XNASTAKYQCFEJV/action/citation_signature","submit_replication":"https://pith.science/pith/HWD7FSZR3B27XNASTAKYQCFEJV/action/replication_record"}},"created_at":"2026-05-18T02:48:17.123685+00:00","updated_at":"2026-05-18T02:48:17.123685+00:00"}