{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3PK6CWEWF2OW3ZU4T6OYTTHXWJ","short_pith_number":"pith:3PK6CWEW","schema_version":"1.0","canonical_sha256":"dbd5e158962e9d6de69c9f9d89ccf7b25900a6448f018f15ba6226aebc5bf039","source":{"kind":"arxiv","id":"1307.0624","version":1},"attestation_state":"computed","paper":{"title":"A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Fei Chen, T-H. Hubert Chan","submitted_at":"2013-07-02T08:36:04Z","abstract_excerpt":"The J-choice K-best secretary problem, also known as the (J,K)-secretary problem, is a generalization of the classical secretary problem. An algorithm for the (J,K)-secretary problem is allowed to make J choices and the payoff to be maximized is the expected number of items chosen among the K best items.\n  Previous works analyzed the case when the total number n of items is finite, and considered what happens when n grows. However, for general J and K, the optimal solution for finite n is difficult to analyze. Instead, we prove a formal connection between the finite model and the infinite mode"},"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":"1307.0624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-02T08:36:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"18ccec028f7f5a766da648edadd2a8ad024927a11d158c1b7f2f290bdb43ff3b","abstract_canon_sha256":"863a17c6d5c13ce93e817f5dd020e124a0f946dcca6974ed0cbb50fed6f4052e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:25.085471Z","signature_b64":"1CpWpCuIh5PnWXcq0260RsjIxlgsynFF5fp9A9zBdhV3jrYr4cIAPhQrlGzVwDELPPDJPxdCm7TZ9VnGsVTDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbd5e158962e9d6de69c9f9d89ccf7b25900a6448f018f15ba6226aebc5bf039","last_reissued_at":"2026-05-18T03:19:25.084701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:25.084701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Fei Chen, T-H. Hubert Chan","submitted_at":"2013-07-02T08:36:04Z","abstract_excerpt":"The J-choice K-best secretary problem, also known as the (J,K)-secretary problem, is a generalization of the classical secretary problem. An algorithm for the (J,K)-secretary problem is allowed to make J choices and the payoff to be maximized is the expected number of items chosen among the K best items.\n  Previous works analyzed the case when the total number n of items is finite, and considered what happens when n grows. However, for general J and K, the optimal solution for finite n is difficult to analyze. Instead, we prove a formal connection between the finite model and the infinite mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0624","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":"1307.0624","created_at":"2026-05-18T03:19:25.084843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.0624v1","created_at":"2026-05-18T03:19:25.084843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0624","created_at":"2026-05-18T03:19:25.084843+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PK6CWEWF2OW","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PK6CWEWF2OW3ZU4","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PK6CWEW","created_at":"2026-05-18T12:27:32.513160+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/3PK6CWEWF2OW3ZU4T6OYTTHXWJ","json":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ.json","graph_json":"https://pith.science/api/pith-number/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/graph.json","events_json":"https://pith.science/api/pith-number/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/events.json","paper":"https://pith.science/paper/3PK6CWEW"},"agent_actions":{"view_html":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ","download_json":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ.json","view_paper":"https://pith.science/paper/3PK6CWEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.0624&json=true","fetch_graph":"https://pith.science/api/pith-number/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/action/storage_attestation","attest_author":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/action/author_attestation","sign_citation":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/action/citation_signature","submit_replication":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/action/replication_record"}},"created_at":"2026-05-18T03:19:25.084843+00:00","updated_at":"2026-05-18T03:19:25.084843+00:00"}