{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IBIZFTH4775TLF4EAJGCZDU2FZ","short_pith_number":"pith:IBIZFTH4","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"},"canonical_sha256":"405192ccfcfffb359784024c2c8e9a2e47ead5f937c304edd5e10cfda1dbec78","source":{"kind":"arxiv","id":"1201.0083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0083","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0083v1","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0083","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"IBIZFTH4775T","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IBIZFTH4775TLF4E","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IBIZFTH4","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IBIZFTH4775TLF4EAJGCZDU2FZ","target":"record","payload":{"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"},"canonical_sha256":"405192ccfcfffb359784024c2c8e9a2e47ead5f937c304edd5e10cfda1dbec78","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"},"source_kind":"arxiv","source_id":"1201.0083","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-18T04:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVduFAHXszQB/9aCl6wS2KT254FGFGwKF6CRCWpEMrGsIZXU8H4a0uqLj4tWEGrRovDOKGAuU6+nHJ1x+/hTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:51:16.219573Z"},"content_sha256":"3ff8434f7718d8f8430ab7207c2c1c8c151c315ed2c467fdec8885d6885a746c","schema_version":"1.0","event_id":"sha256:3ff8434f7718d8f8430ab7207c2c1c8c151c315ed2c467fdec8885d6885a746c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IBIZFTH4775TLF4EAJGCZDU2FZ","target":"graph","payload":{"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"},"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-18T04:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OC41gOAFOpHaWKWbKYO1OnYHmJOqsaDnQ+Tcc5lBg1AORgrm3ekBQB3+5gccfgHBk8vGKGivxuRvW+Ei/SVaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:51:16.219925Z"},"content_sha256":"1878a05d80cc11be1cc72ca0138ed3ce25c525d95db8a93e98173f34cb06fde6","schema_version":"1.0","event_id":"sha256:1878a05d80cc11be1cc72ca0138ed3ce25c525d95db8a93e98173f34cb06fde6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/bundle.json","state_url":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/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-23T21:51:16Z","links":{"resolver":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ","bundle":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/bundle.json","state":"https://pith.science/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBIZFTH4775TLF4EAJGCZDU2FZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IBIZFTH4775TLF4EAJGCZDU2FZ","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":"738aaa99d55743bfab2fb01f9efb87a08048cb133a26cbe479f69adea4a460a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-30T08:54:11Z","title_canon_sha256":"6b041065449b93db3fa0b2b06cf795a361586f9f88b6ca445a6ad9d08840ee7f"},"schema_version":"1.0","source":{"id":"1201.0083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0083","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0083v1","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0083","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"IBIZFTH4775T","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IBIZFTH4775TLF4E","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IBIZFTH4","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:1878a05d80cc11be1cc72ca0138ed3ce25c525d95db8a93e98173f34cb06fde6","target":"graph","created_at":"2026-05-18T04:05: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 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","authors_text":"Andreas Faller, Ludger R\\\"uschendorf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-30T08:54:11Z","title":"On approximative solutions of multistopping problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0083","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:3ff8434f7718d8f8430ab7207c2c1c8c151c315ed2c467fdec8885d6885a746c","target":"record","created_at":"2026-05-18T04:05: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":"738aaa99d55743bfab2fb01f9efb87a08048cb133a26cbe479f69adea4a460a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-30T08:54:11Z","title_canon_sha256":"6b041065449b93db3fa0b2b06cf795a361586f9f88b6ca445a6ad9d08840ee7f"},"schema_version":"1.0","source":{"id":"1201.0083","kind":"arxiv","version":1}},"canonical_sha256":"405192ccfcfffb359784024c2c8e9a2e47ead5f937c304edd5e10cfda1dbec78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"405192ccfcfffb359784024c2c8e9a2e47ead5f937c304edd5e10cfda1dbec78","first_computed_at":"2026-05-18T04:05:26.286941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:26.286941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ePyfv1yOF6haUDx+SbfNZx7O6jAzkq2nNnkniBilwP4yW2BdDXqdzF8wAo1sU8dbM6lPfK1L2vpS8nxLNaetDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:26.287488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ff8434f7718d8f8430ab7207c2c1c8c151c315ed2c467fdec8885d6885a746c","sha256:1878a05d80cc11be1cc72ca0138ed3ce25c525d95db8a93e98173f34cb06fde6"],"state_sha256":"4129d09349cca64f277b2d967979b8c93d0b8a6f87f1c92427e6c93876c2cf74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQxlblS7CshdeJcf1KP0VGe4m/gHWb7uau3hHeGNOYyYYKM93313YTjDb2gVEl4QYo3AwO7byeaowHIqzkMlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:51:16.222082Z","bundle_sha256":"f55110270913b1740da9761838a400dfbca41c4f3d5c118490146fc8c39a69b2"}}