{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4CHBKOTF34AW3AIM45EO3XN33V","short_pith_number":"pith:4CHBKOTF","canonical_record":{"source":{"id":"1507.06199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T14:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"c42e52b7267ffa7d1d6d05ed28fe77c973557227061bcf490a84a6709016d7f3","abstract_canon_sha256":"d9ee600fea08b91f8133f25ac09e36318ccaebe60416b85a8118ac042d69cd08"},"schema_version":"1.0"},"canonical_sha256":"e08e153a65df016d810ce748edddbbdd5dfadb27673821dc3f9f145ee7b9e616","source":{"kind":"arxiv","id":"1507.06199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06199","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06199v1","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06199","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"pith_short_12","alias_value":"4CHBKOTF34AW","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4CHBKOTF34AW3AIM","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4CHBKOTF","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4CHBKOTF34AW3AIM45EO3XN33V","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T14:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"c42e52b7267ffa7d1d6d05ed28fe77c973557227061bcf490a84a6709016d7f3","abstract_canon_sha256":"d9ee600fea08b91f8133f25ac09e36318ccaebe60416b85a8118ac042d69cd08"},"schema_version":"1.0"},"canonical_sha256":"e08e153a65df016d810ce748edddbbdd5dfadb27673821dc3f9f145ee7b9e616","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:26.401458Z","signature_b64":"9m9HO04lFbq7GivurrTyiGChijIJ03dnA5yv3dqeKr0oW9OUEbaxjcWB9DimNUhBpMbw4h+Hc3cDlTdX9VToCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e08e153a65df016d810ce748edddbbdd5dfadb27673821dc3f9f145ee7b9e616","last_reissued_at":"2026-05-18T01:36:26.400984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:26.400984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06199","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:36:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NTihJeGl9q405ng5olNUEQEp9TkSo+U2JBiVwudjWyo917OJ0jPsqS2sX1ed97VLbZmeN0HfWeZvE0KuKvBuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:32:55.959223Z"},"content_sha256":"05fb7a302ce6ace9455b95ca57a53b894e693d16044e1a72248845dd6bc8f971","schema_version":"1.0","event_id":"sha256:05fb7a302ce6ace9455b95ca57a53b894e693d16044e1a72248845dd6bc8f971"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4CHBKOTF34AW3AIM45EO3XN33V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Building a Good Team: Secretary Problems and the Supermodular Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Rani Izsak","submitted_at":"2015-07-22T14:15:10Z","abstract_excerpt":"In the Secretary Problem, one has to hire the best among n candidates. The candidates are interviewed, one at a time, at a random order, and one has to decide on the spot, whether to hire a candidate or continue interviewing. It is well known that the best candidate can be hired with a probability of 1/e (Dynkin, 1963). Recent works extend this problem to settings in which multiple candidates can be hired, subject to some constraint. Here, one wishes to hire a set of candidates maximizing a given set function.\n  Almost all extensions considered in the literature assume the objective set functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06199","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:36:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rJEnO8+jei0ClHihIaougmpmpWnFV+YIcFFFDeQAnAHrW+mVSz76Qamb4aGsAFF8Vl7gNa30rB8PeC+Ph+MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:32:55.959562Z"},"content_sha256":"9dcf38829f8fd46071af8d9591b6c8eb70d33856ff69bba53e126efaec7c18eb","schema_version":"1.0","event_id":"sha256:9dcf38829f8fd46071af8d9591b6c8eb70d33856ff69bba53e126efaec7c18eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V/bundle.json","state_url":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CHBKOTF34AW3AIM45EO3XN33V/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-24T20:32:55Z","links":{"resolver":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V","bundle":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V/bundle.json","state":"https://pith.science/pith/4CHBKOTF34AW3AIM45EO3XN33V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CHBKOTF34AW3AIM45EO3XN33V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4CHBKOTF34AW3AIM45EO3XN33V","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":"d9ee600fea08b91f8133f25ac09e36318ccaebe60416b85a8118ac042d69cd08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T14:15:10Z","title_canon_sha256":"c42e52b7267ffa7d1d6d05ed28fe77c973557227061bcf490a84a6709016d7f3"},"schema_version":"1.0","source":{"id":"1507.06199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06199","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06199v1","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06199","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"pith_short_12","alias_value":"4CHBKOTF34AW","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4CHBKOTF34AW3AIM","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4CHBKOTF","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:9dcf38829f8fd46071af8d9591b6c8eb70d33856ff69bba53e126efaec7c18eb","target":"graph","created_at":"2026-05-18T01:36:26Z","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":"In the Secretary Problem, one has to hire the best among n candidates. The candidates are interviewed, one at a time, at a random order, and one has to decide on the spot, whether to hire a candidate or continue interviewing. It is well known that the best candidate can be hired with a probability of 1/e (Dynkin, 1963). Recent works extend this problem to settings in which multiple candidates can be hired, subject to some constraint. Here, one wishes to hire a set of candidates maximizing a given set function.\n  Almost all extensions considered in the literature assume the objective set functi","authors_text":"Moran Feldman, Rani Izsak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T14:15:10Z","title":"Building a Good Team: Secretary Problems and the Supermodular Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06199","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:05fb7a302ce6ace9455b95ca57a53b894e693d16044e1a72248845dd6bc8f971","target":"record","created_at":"2026-05-18T01:36:26Z","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":"d9ee600fea08b91f8133f25ac09e36318ccaebe60416b85a8118ac042d69cd08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T14:15:10Z","title_canon_sha256":"c42e52b7267ffa7d1d6d05ed28fe77c973557227061bcf490a84a6709016d7f3"},"schema_version":"1.0","source":{"id":"1507.06199","kind":"arxiv","version":1}},"canonical_sha256":"e08e153a65df016d810ce748edddbbdd5dfadb27673821dc3f9f145ee7b9e616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e08e153a65df016d810ce748edddbbdd5dfadb27673821dc3f9f145ee7b9e616","first_computed_at":"2026-05-18T01:36:26.400984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:26.400984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9m9HO04lFbq7GivurrTyiGChijIJ03dnA5yv3dqeKr0oW9OUEbaxjcWB9DimNUhBpMbw4h+Hc3cDlTdX9VToCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:26.401458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05fb7a302ce6ace9455b95ca57a53b894e693d16044e1a72248845dd6bc8f971","sha256:9dcf38829f8fd46071af8d9591b6c8eb70d33856ff69bba53e126efaec7c18eb"],"state_sha256":"6509e7a2ebba1614af52de75775212d846a0cb08074bd69270616aa3cc3447e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAEZY5LAV/64+BbEmGLCcFiYZY+vfMphRdB4TALabEywxI/M77I/PpntaF1DISYDw+nYhruSFigXgfGez37WCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:32:55.961336Z","bundle_sha256":"82847c917f1aa79ffd1e78edfae4a4137be4a33a6ee288a0417b71761ae8527f"}}