{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DMPMMOSCQELEZRYPANIOB2XO3X","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":"983fb735e32d08a5826b7900924128f03ab38c376829f3c2c32b61499abf1154","cross_cats_sorted":["math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2012-09-03T11:09:58Z","title_canon_sha256":"15c908a6001ccf7050f6178a12547063a1765fea7a3dc1401d887f69bb275de9"},"schema_version":"1.0","source":{"id":"1209.0305","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0305","created_at":"2026-05-18T03:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0305v2","created_at":"2026-05-18T03:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0305","created_at":"2026-05-18T03:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"DMPMMOSCQELE","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DMPMMOSCQELEZRYP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DMPMMOSC","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:708dcb432ec047944103afc5f53ee718cb03d4583b0a5b13db50f2f0c14558b8","target":"graph","created_at":"2026-05-18T03:21:33Z","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 investigate a new class of growth rate maximization problems based on impulse control strategies such that the average number of trades per time unit does not exceed a fixed level. Moreover, we include proportional transaction costs to make the portfolio problem more realistic. We provide a Verification Theorem to compute the optimal growth rate as well as an optimal trading strategy. Furthermore, we prove the existence of a constant boundary strategy which is optimal. At the end, we compare our approach to other discrete-time growth rate maximization problems in numerical exa","authors_text":"Marc Wittlinger, S\\\"oren Christensen","cross_cats":["math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2012-09-03T11:09:58Z","title":"Optimal relaxed portfolio strategies for growth rate maximization problems with transaction costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0305","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:3bf96464b659d9c39d4bb33fb4deee9adfcecc3c245e6eca2f441d6458e34d9f","target":"record","created_at":"2026-05-18T03:21:33Z","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":"983fb735e32d08a5826b7900924128f03ab38c376829f3c2c32b61499abf1154","cross_cats_sorted":["math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2012-09-03T11:09:58Z","title_canon_sha256":"15c908a6001ccf7050f6178a12547063a1765fea7a3dc1401d887f69bb275de9"},"schema_version":"1.0","source":{"id":"1209.0305","kind":"arxiv","version":2}},"canonical_sha256":"1b1ec63a4281164cc70f0350e0eaeeddca60c4eb4e7b23e5d049d9d95bfc1229","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b1ec63a4281164cc70f0350e0eaeeddca60c4eb4e7b23e5d049d9d95bfc1229","first_computed_at":"2026-05-18T03:21:33.677708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:33.677708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zlya6JsCDf4tdsjeoK0YW3zm04oEj5hxp2moD0mlxmHrG/grBVVuxG9i2OE936O5CWocYifDELRG3Bl2M2FHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:33.678288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0305","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bf96464b659d9c39d4bb33fb4deee9adfcecc3c245e6eca2f441d6458e34d9f","sha256:708dcb432ec047944103afc5f53ee718cb03d4583b0a5b13db50f2f0c14558b8"],"state_sha256":"93e79f8e1ff9a53506a8415e46b93a402bf04665bf3baa217832387176c6ffaa"}