{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:W4P2ADL26MYDRP5ZK53423J5YQ","short_pith_number":"pith:W4P2ADL2","schema_version":"1.0","canonical_sha256":"b71fa00d7af33038bfb95777cd6d3dc40de86aa3471c56e6a1acd4729206dd99","source":{"kind":"arxiv","id":"1904.11213","version":2},"attestation_state":"computed","paper":{"title":"Asymptotics and Renewal Approximation in the Online Selection of Increasing Subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Alexander Gnedin, Amirlan Seksenbayev","submitted_at":"2019-04-25T08:47:58Z","abstract_excerpt":"We revisit the problem of maximising the expected length of increasing subsequence that can be selected from a marked Poisson process by an online strategy. Resorting to a natural size variable, the problem is represented in terms of a controlled partially deterministic Markov process with decreasing paths. Refining known estimates we obtain fairly complete asymptotic expansions for the moments, and using a renewal approximation give a novel proof of the central limit theorem for the length of selected subsequence under the optimal strategy."},"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":"1904.11213","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-25T08:47:58Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3ef0a7c706f56520ebc9cc84337b1ffee4cb32a358d8e8a9c6685df19c5b13d5","abstract_canon_sha256":"abe584ae7c3dbab91890b6bd8cf10a1a93afd00d3763c532e8fa6ef0a33c04e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:40.771765Z","signature_b64":"kuqEN/XIPJeJHzyOYVFXoAYBZsqtQp6wjzXUNSqMBQlwg/pCIV2DShw6Jdry21nbvdfsUGiGE+5GS1TKCdptCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b71fa00d7af33038bfb95777cd6d3dc40de86aa3471c56e6a1acd4729206dd99","last_reissued_at":"2026-05-17T23:46:40.770993Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:40.770993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotics and Renewal Approximation in the Online Selection of Increasing Subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Alexander Gnedin, Amirlan Seksenbayev","submitted_at":"2019-04-25T08:47:58Z","abstract_excerpt":"We revisit the problem of maximising the expected length of increasing subsequence that can be selected from a marked Poisson process by an online strategy. Resorting to a natural size variable, the problem is represented in terms of a controlled partially deterministic Markov process with decreasing paths. Refining known estimates we obtain fairly complete asymptotic expansions for the moments, and using a renewal approximation give a novel proof of the central limit theorem for the length of selected subsequence under the optimal strategy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11213","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":"1904.11213","created_at":"2026-05-17T23:46:40.771120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11213v2","created_at":"2026-05-17T23:46:40.771120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11213","created_at":"2026-05-17T23:46:40.771120+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4P2ADL26MYD","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4P2ADL26MYDRP5Z","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4P2ADL2","created_at":"2026-05-18T12:33:30.264802+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/W4P2ADL26MYDRP5ZK53423J5YQ","json":"https://pith.science/pith/W4P2ADL26MYDRP5ZK53423J5YQ.json","graph_json":"https://pith.science/api/pith-number/W4P2ADL26MYDRP5ZK53423J5YQ/graph.json","events_json":"https://pith.science/api/pith-number/W4P2ADL26MYDRP5ZK53423J5YQ/events.json","paper":"https://pith.science/paper/W4P2ADL2"},"agent_actions":{"view_html":"https://pith.science/pith/W4P2ADL26MYDRP5ZK53423J5YQ","download_json":"https://pith.science/pith/W4P2ADL26MYDRP5ZK53423J5YQ.json","view_paper":"https://pith.science/paper/W4P2ADL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11213&json=true","fetch_graph":"https://pith.science/api/pith-number/W4P2ADL26MYDRP5ZK53423J5YQ/graph.json","fetch_events":"https://pith.science/api/pith-number/W4P2ADL26MYDRP5ZK53423J5YQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4P2ADL26MYDRP5ZK53423J5YQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4P2ADL26MYDRP5ZK53423J5YQ/action/storage_attestation","attest_author":"https://pith.science/pith/W4P2ADL26MYDRP5ZK53423J5YQ/action/author_attestation","sign_citation":"https://pith.science/pith/W4P2ADL26MYDRP5ZK53423J5YQ/action/citation_signature","submit_replication":"https://pith.science/pith/W4P2ADL26MYDRP5ZK53423J5YQ/action/replication_record"}},"created_at":"2026-05-17T23:46:40.771120+00:00","updated_at":"2026-05-17T23:46:40.771120+00:00"}