{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XLHCLXW45MMQHTG6KMVBML6EFW","short_pith_number":"pith:XLHCLXW4","schema_version":"1.0","canonical_sha256":"bace25dedceb1903ccde532a162fc42d84389fe8ca5dd68189061af5fc625fd4","source":{"kind":"arxiv","id":"1503.01253","version":2},"attestation_state":"computed","paper":{"title":"Impulse control and expected suprema","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Paavo Salminen, S\\\"oren Christensen","submitted_at":"2015-03-04T08:39:56Z","abstract_excerpt":"We consider a class of impulse control problems for general underlying strong Markov processes on the real line, which allows for an explicit solution. The optimal impulse times are shown to be of threshold type and the optimal threshold is characterized as a solution of a (typically nonlinear) equation. The main ingredient we use is a representation result for excessive functions in terms of expected suprema."},"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":"1503.01253","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-04T08:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"954d0c688f7d40480d80becc63b5c3fce1b17559ff7f1aa7c292827997e565bc","abstract_canon_sha256":"bac19cf109d039ad28cb925284902dd1ff1bc48587d572625dfa9e639849786d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:52.052024Z","signature_b64":"UgaOKvHvW+2BI4lqoLfFtZ7EZVf65JsjX8vEN/y4AsafPFNqmFworEgoHon9TZ5cj7ljk01ugfmfMlTmetorDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bace25dedceb1903ccde532a162fc42d84389fe8ca5dd68189061af5fc625fd4","last_reissued_at":"2026-05-18T00:40:52.051327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:52.051327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Impulse control and expected suprema","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Paavo Salminen, S\\\"oren Christensen","submitted_at":"2015-03-04T08:39:56Z","abstract_excerpt":"We consider a class of impulse control problems for general underlying strong Markov processes on the real line, which allows for an explicit solution. The optimal impulse times are shown to be of threshold type and the optimal threshold is characterized as a solution of a (typically nonlinear) equation. The main ingredient we use is a representation result for excessive functions in terms of expected suprema."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01253","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":"1503.01253","created_at":"2026-05-18T00:40:52.051435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01253v2","created_at":"2026-05-18T00:40:52.051435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01253","created_at":"2026-05-18T00:40:52.051435+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLHCLXW45MMQ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLHCLXW45MMQHTG6","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLHCLXW4","created_at":"2026-05-18T12:29:50.041715+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/XLHCLXW45MMQHTG6KMVBML6EFW","json":"https://pith.science/pith/XLHCLXW45MMQHTG6KMVBML6EFW.json","graph_json":"https://pith.science/api/pith-number/XLHCLXW45MMQHTG6KMVBML6EFW/graph.json","events_json":"https://pith.science/api/pith-number/XLHCLXW45MMQHTG6KMVBML6EFW/events.json","paper":"https://pith.science/paper/XLHCLXW4"},"agent_actions":{"view_html":"https://pith.science/pith/XLHCLXW45MMQHTG6KMVBML6EFW","download_json":"https://pith.science/pith/XLHCLXW45MMQHTG6KMVBML6EFW.json","view_paper":"https://pith.science/paper/XLHCLXW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01253&json=true","fetch_graph":"https://pith.science/api/pith-number/XLHCLXW45MMQHTG6KMVBML6EFW/graph.json","fetch_events":"https://pith.science/api/pith-number/XLHCLXW45MMQHTG6KMVBML6EFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLHCLXW45MMQHTG6KMVBML6EFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLHCLXW45MMQHTG6KMVBML6EFW/action/storage_attestation","attest_author":"https://pith.science/pith/XLHCLXW45MMQHTG6KMVBML6EFW/action/author_attestation","sign_citation":"https://pith.science/pith/XLHCLXW45MMQHTG6KMVBML6EFW/action/citation_signature","submit_replication":"https://pith.science/pith/XLHCLXW45MMQHTG6KMVBML6EFW/action/replication_record"}},"created_at":"2026-05-18T00:40:52.051435+00:00","updated_at":"2026-05-18T00:40:52.051435+00:00"}