{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HOZZM4326D7JS6GMELONEAYABK","short_pith_number":"pith:HOZZM432","canonical_record":{"source":{"id":"1408.6750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-28T15:27:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"085de5e32cf473c8961561399add5516900ad2cbf5ce6f05a6e571f0bc3aa9a2","abstract_canon_sha256":"4c9d7b76c45f5d6f08e616b9e71d0e491abaf6024ec976eb6581faa4f1c49acb"},"schema_version":"1.0"},"canonical_sha256":"3bb396737af0fe9978cc22dcd203000a932142e6833e9c52e928dd4dc49a0561","source":{"kind":"arxiv","id":"1408.6750","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6750","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6750v2","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6750","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"HOZZM4326D7J","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HOZZM4326D7JS6GM","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HOZZM432","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HOZZM4326D7JS6GMELONEAYABK","target":"record","payload":{"canonical_record":{"source":{"id":"1408.6750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-28T15:27:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"085de5e32cf473c8961561399add5516900ad2cbf5ce6f05a6e571f0bc3aa9a2","abstract_canon_sha256":"4c9d7b76c45f5d6f08e616b9e71d0e491abaf6024ec976eb6581faa4f1c49acb"},"schema_version":"1.0"},"canonical_sha256":"3bb396737af0fe9978cc22dcd203000a932142e6833e9c52e928dd4dc49a0561","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:15.339410Z","signature_b64":"8M0hbXqWQtXqKEtVfXtHzQYGYx1xakwzEuxxuYMnvV/6CPaItyxuBzqIB8piuzid0aVL5w8sxZIaqZRnvEJ6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bb396737af0fe9978cc22dcd203000a932142e6833e9c52e928dd4dc49a0561","last_reissued_at":"2026-05-18T01:10:15.338988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:15.338988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.6750","source_version":2,"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:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9MZO/zsZ38bonRHxf0/9bqnJ4kIGAL8KLx+UaUu8MbUkeIn/JPZr+Qa+VylhVekfEGMObUn4UTA19S3ee/WDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:17:53.900517Z"},"content_sha256":"0273295ab4e4902dd6dd92167a23712687fb3cd95109b5dd5602616e7edb9be4","schema_version":"1.0","event_id":"sha256:0273295ab4e4902dd6dd92167a23712687fb3cd95109b5dd5602616e7edb9be4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HOZZM4326D7JS6GMELONEAYABK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Online Selection of a Monotone Subsequence: a Central Limit Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Alessandro Arlotto, J. Michael Steele, Vinh V. Nguyen","submitted_at":"2014-08-28T15:27:37Z","abstract_excerpt":"Consider a sequence of $n$ independent random variables with a common continuous distribution $F$, and consider the task of choosing an increasing subsequence where the observations are revealed sequentially and where an observation must be accepted or rejected when it is first revealed. There is a unique selection policy $\\pi_n^*$ that is optimal in the sense that it maximizes the expected value of $L_n(\\pi_n^*)$, the number of selected observations. We investigate the distribution of $L_n(\\pi_n^*)$; in particular, we obtain a central limit theorem for $L_n(\\pi_n^*)$ and a detailed understand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6750","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"},"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:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gp0sPrciCX40D01iOiqgt4eCElF1rgf+duqvkT6fNtYWQU0pPQUJzPSwq1+dCmBWyTm7hhDLVCLtawmQaW4zDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:17:53.901388Z"},"content_sha256":"fe0cc1262f3f9f064c0fe445936ee7760099afeabaf64bff3d6d2b9d0229c99d","schema_version":"1.0","event_id":"sha256:fe0cc1262f3f9f064c0fe445936ee7760099afeabaf64bff3d6d2b9d0229c99d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOZZM4326D7JS6GMELONEAYABK/bundle.json","state_url":"https://pith.science/pith/HOZZM4326D7JS6GMELONEAYABK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOZZM4326D7JS6GMELONEAYABK/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-31T10:17:53Z","links":{"resolver":"https://pith.science/pith/HOZZM4326D7JS6GMELONEAYABK","bundle":"https://pith.science/pith/HOZZM4326D7JS6GMELONEAYABK/bundle.json","state":"https://pith.science/pith/HOZZM4326D7JS6GMELONEAYABK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOZZM4326D7JS6GMELONEAYABK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HOZZM4326D7JS6GMELONEAYABK","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":"4c9d7b76c45f5d6f08e616b9e71d0e491abaf6024ec976eb6581faa4f1c49acb","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-28T15:27:37Z","title_canon_sha256":"085de5e32cf473c8961561399add5516900ad2cbf5ce6f05a6e571f0bc3aa9a2"},"schema_version":"1.0","source":{"id":"1408.6750","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6750","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6750v2","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6750","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"HOZZM4326D7J","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HOZZM4326D7JS6GM","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HOZZM432","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:fe0cc1262f3f9f064c0fe445936ee7760099afeabaf64bff3d6d2b9d0229c99d","target":"graph","created_at":"2026-05-18T01:10:15Z","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":"Consider a sequence of $n$ independent random variables with a common continuous distribution $F$, and consider the task of choosing an increasing subsequence where the observations are revealed sequentially and where an observation must be accepted or rejected when it is first revealed. There is a unique selection policy $\\pi_n^*$ that is optimal in the sense that it maximizes the expected value of $L_n(\\pi_n^*)$, the number of selected observations. We investigate the distribution of $L_n(\\pi_n^*)$; in particular, we obtain a central limit theorem for $L_n(\\pi_n^*)$ and a detailed understand","authors_text":"Alessandro Arlotto, J. Michael Steele, Vinh V. Nguyen","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-28T15:27:37Z","title":"Optimal Online Selection of a Monotone Subsequence: a Central Limit Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6750","kind":"arxiv","version":2},"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:0273295ab4e4902dd6dd92167a23712687fb3cd95109b5dd5602616e7edb9be4","target":"record","created_at":"2026-05-18T01:10:15Z","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":"4c9d7b76c45f5d6f08e616b9e71d0e491abaf6024ec976eb6581faa4f1c49acb","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-28T15:27:37Z","title_canon_sha256":"085de5e32cf473c8961561399add5516900ad2cbf5ce6f05a6e571f0bc3aa9a2"},"schema_version":"1.0","source":{"id":"1408.6750","kind":"arxiv","version":2}},"canonical_sha256":"3bb396737af0fe9978cc22dcd203000a932142e6833e9c52e928dd4dc49a0561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bb396737af0fe9978cc22dcd203000a932142e6833e9c52e928dd4dc49a0561","first_computed_at":"2026-05-18T01:10:15.338988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:15.338988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8M0hbXqWQtXqKEtVfXtHzQYGYx1xakwzEuxxuYMnvV/6CPaItyxuBzqIB8piuzid0aVL5w8sxZIaqZRnvEJ6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:15.339410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.6750","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0273295ab4e4902dd6dd92167a23712687fb3cd95109b5dd5602616e7edb9be4","sha256:fe0cc1262f3f9f064c0fe445936ee7760099afeabaf64bff3d6d2b9d0229c99d"],"state_sha256":"8a92382c0c16934df9bf2bd9e556ab3c048f4f540f7fa2ba0fee2e4a7b64d439"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yIQEqefBkrTuMbKG4ANVFDktKQLjohebUz9y+64HzMClKnlZzn8eDHKOpMlzgrpbkQvCRM9BaT0mlSjuv7ZbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:17:53.905914Z","bundle_sha256":"8d67a07ecfe6f4d5607ebcf2181ca0e264d951cc701e3ab4a154ab08b039f1cf"}}