{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3PK6CWEWF2OW3ZU4T6OYTTHXWJ","short_pith_number":"pith:3PK6CWEW","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"},"canonical_sha256":"dbd5e158962e9d6de69c9f9d89ccf7b25900a6448f018f15ba6226aebc5bf039","source":{"kind":"arxiv","id":"1307.0624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0624","created_at":"2026-05-18T03:19:25Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0624v1","created_at":"2026-05-18T03:19:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0624","created_at":"2026-05-18T03:19:25Z"},{"alias_kind":"pith_short_12","alias_value":"3PK6CWEWF2OW","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3PK6CWEWF2OW3ZU4","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3PK6CWEW","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3PK6CWEWF2OW3ZU4T6OYTTHXWJ","target":"record","payload":{"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"},"canonical_sha256":"dbd5e158962e9d6de69c9f9d89ccf7b25900a6448f018f15ba6226aebc5bf039","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"},"source_kind":"arxiv","source_id":"1307.0624","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-18T03:19:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qG9suEiGdqcSTxEa/TjWG4i5/qzirKZtEjiioopY18mtu6a15jm02kdAFCKu+FtBVtTY+GLqwai+JyeDLqUeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:50:47.797021Z"},"content_sha256":"070afecacad1652570c624750b703b654979429145f519769a6becdf4f5daa4d","schema_version":"1.0","event_id":"sha256:070afecacad1652570c624750b703b654979429145f519769a6becdf4f5daa4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3PK6CWEWF2OW3ZU4T6OYTTHXWJ","target":"graph","payload":{"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"},"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-18T03:19:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l5Y2fogsveMdTuiR0Pw27tDWqXcR2nHH+CfSywzCpOVOdFGyFSutQdJX4dnWsAKUGdQKEfOZCqmzJi62ASDGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:50:47.797709Z"},"content_sha256":"077794c9fb2191d73c4a39059df0dcbff3d481786fb459976910b14946686453","schema_version":"1.0","event_id":"sha256:077794c9fb2191d73c4a39059df0dcbff3d481786fb459976910b14946686453"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/bundle.json","state_url":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/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-05-27T02:50:47Z","links":{"resolver":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ","bundle":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/bundle.json","state":"https://pith.science/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PK6CWEWF2OW3ZU4T6OYTTHXWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3PK6CWEWF2OW3ZU4T6OYTTHXWJ","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":"863a17c6d5c13ce93e817f5dd020e124a0f946dcca6974ed0cbb50fed6f4052e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-02T08:36:04Z","title_canon_sha256":"18ccec028f7f5a766da648edadd2a8ad024927a11d158c1b7f2f290bdb43ff3b"},"schema_version":"1.0","source":{"id":"1307.0624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0624","created_at":"2026-05-18T03:19:25Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0624v1","created_at":"2026-05-18T03:19:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0624","created_at":"2026-05-18T03:19:25Z"},{"alias_kind":"pith_short_12","alias_value":"3PK6CWEWF2OW","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3PK6CWEWF2OW3ZU4","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3PK6CWEW","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:077794c9fb2191d73c4a39059df0dcbff3d481786fb459976910b14946686453","target":"graph","created_at":"2026-05-18T03:19:25Z","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":"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","authors_text":"Fei Chen, T-H. Hubert Chan","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-02T08:36:04Z","title":"A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0624","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:070afecacad1652570c624750b703b654979429145f519769a6becdf4f5daa4d","target":"record","created_at":"2026-05-18T03:19:25Z","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":"863a17c6d5c13ce93e817f5dd020e124a0f946dcca6974ed0cbb50fed6f4052e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-02T08:36:04Z","title_canon_sha256":"18ccec028f7f5a766da648edadd2a8ad024927a11d158c1b7f2f290bdb43ff3b"},"schema_version":"1.0","source":{"id":"1307.0624","kind":"arxiv","version":1}},"canonical_sha256":"dbd5e158962e9d6de69c9f9d89ccf7b25900a6448f018f15ba6226aebc5bf039","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbd5e158962e9d6de69c9f9d89ccf7b25900a6448f018f15ba6226aebc5bf039","first_computed_at":"2026-05-18T03:19:25.084701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:25.084701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1CpWpCuIh5PnWXcq0260RsjIxlgsynFF5fp9A9zBdhV3jrYr4cIAPhQrlGzVwDELPPDJPxdCm7TZ9VnGsVTDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:25.085471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:070afecacad1652570c624750b703b654979429145f519769a6becdf4f5daa4d","sha256:077794c9fb2191d73c4a39059df0dcbff3d481786fb459976910b14946686453"],"state_sha256":"8a13a237124e9f68302c98cd11110b68f41ca829c5aef4eec6161b6d48ff153e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yWhpS7enyiw8/ywbqwgOvIkR1erfDJRhqkb/bYLQAE7oGV4UotFGeqzdwxp6WknIeflI+aSvBVimpaaTN4NCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:50:47.801331Z","bundle_sha256":"e29b92f5f54c9c18284f4e85f04c8dfb2b5f63f86b137d0cfce31d8b5543d3d9"}}