{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IBIZFTH4775TLF4EAJGCZDU2FZ","short_pith_number":"pith:IBIZFTH4","schema_version":"1.0","canonical_sha256":"405192ccfcfffb359784024c2c8e9a2e47ead5f937c304edd5e10cfda1dbec78","source":{"kind":"arxiv","id":"1201.0083","version":1},"attestation_state":"computed","paper":{"title":"On approximative solutions of multistopping problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andreas Faller, Ludger R\\\"uschendorf","submitted_at":"2011-12-30T08:54:11Z","abstract_excerpt":"In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed to be independent not to be identically distributed. The basic assumption is convergence of a related imbedded point process to a continuous time Poisson process in the plane, which serves as a limiting model for the stopping problem. The optimal $m$-stopping curves for this limiting model are determined by differential equations of first order. A general a"},"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":"1201.0083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-30T08:54:11Z","cross_cats_sorted":[],"title_canon_sha256":"6b041065449b93db3fa0b2b06cf795a361586f9f88b6ca445a6ad9d08840ee7f","abstract_canon_sha256":"738aaa99d55743bfab2fb01f9efb87a08048cb133a26cbe479f69adea4a460a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:26.287488Z","signature_b64":"ePyfv1yOF6haUDx+SbfNZx7O6jAzkq2nNnkniBilwP4yW2BdDXqdzF8wAo1sU8dbM6lPfK1L2vpS8nxLNaetDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"405192ccfcfffb359784024c2c8e9a2e47ead5f937c304edd5e10cfda1dbec78","last_reissued_at":"2026-05-18T04:05:26.286941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:26.286941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On approximative solutions of multistopping problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andreas Faller, Ludger R\\\"uschendorf","submitted_at":"2011-12-30T08:54:11Z","abstract_excerpt":"In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed to be independent not to be identically distributed. The basic assumption is convergence of a related imbedded point process to a continuous time Poisson process in the plane, which serves as a limiting model for the stopping problem. The optimal $m$-stopping curves for this limiting model are determined by differential equations of first order. A general a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0083","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":"1201.0083","created_at":"2026-05-18T04:05:26.287026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0083v1","created_at":"2026-05-18T04:05:26.287026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0083","created_at":"2026-05-18T04:05:26.287026+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBIZFTH4775T","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBIZFTH4775TLF4E","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBIZFTH4","created_at":"2026-05-18T12:26:30.835961+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/IBIZFTH4775TLF4EAJGCZDU2FZ","json":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ.json","graph_json":"https://pith.science/api/pith-number/IBIZFTH4775TLF4EAJGCZDU2FZ/graph.json","events_json":"https://pith.science/api/pith-number/IBIZFTH4775TLF4EAJGCZDU2FZ/events.json","paper":"https://pith.science/paper/IBIZFTH4"},"agent_actions":{"view_html":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ","download_json":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ.json","view_paper":"https://pith.science/paper/IBIZFTH4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0083&json=true","fetch_graph":"https://pith.science/api/pith-number/IBIZFTH4775TLF4EAJGCZDU2FZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IBIZFTH4775TLF4EAJGCZDU2FZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/action/storage_attestation","attest_author":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/action/author_attestation","sign_citation":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/action/citation_signature","submit_replication":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/action/replication_record"}},"created_at":"2026-05-18T04:05:26.287026+00:00","updated_at":"2026-05-18T04:05:26.287026+00:00"}