{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DMPMMOSCQELEZRYPANIOB2XO3X","short_pith_number":"pith:DMPMMOSC","canonical_record":{"source":{"id":"1209.0305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2012-09-03T11:09:58Z","cross_cats_sorted":["math.OC","math.PR"],"title_canon_sha256":"15c908a6001ccf7050f6178a12547063a1765fea7a3dc1401d887f69bb275de9","abstract_canon_sha256":"983fb735e32d08a5826b7900924128f03ab38c376829f3c2c32b61499abf1154"},"schema_version":"1.0"},"canonical_sha256":"1b1ec63a4281164cc70f0350e0eaeeddca60c4eb4e7b23e5d049d9d95bfc1229","source":{"kind":"arxiv","id":"1209.0305","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DMPMMOSCQELEZRYPANIOB2XO3X","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2012-09-03T11:09:58Z","cross_cats_sorted":["math.OC","math.PR"],"title_canon_sha256":"15c908a6001ccf7050f6178a12547063a1765fea7a3dc1401d887f69bb275de9","abstract_canon_sha256":"983fb735e32d08a5826b7900924128f03ab38c376829f3c2c32b61499abf1154"},"schema_version":"1.0"},"canonical_sha256":"1b1ec63a4281164cc70f0350e0eaeeddca60c4eb4e7b23e5d049d9d95bfc1229","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:33.678288Z","signature_b64":"zlya6JsCDf4tdsjeoK0YW3zm04oEj5hxp2moD0mlxmHrG/grBVVuxG9i2OE936O5CWocYifDELRG3Bl2M2FHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b1ec63a4281164cc70f0350e0eaeeddca60c4eb4e7b23e5d049d9d95bfc1229","last_reissued_at":"2026-05-18T03:21:33.677708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:33.677708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0305","source_version":2,"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-18T03:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"by1y1ffjivS4rIOkbXZlppBDQ6jLV26P+cGEpA1DArtvlqzmtWL1gg8UnXNoNhfyhNjhZHzOUOPBvvmtAN3sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:25:53.384877Z"},"content_sha256":"3bf96464b659d9c39d4bb33fb4deee9adfcecc3c245e6eca2f441d6458e34d9f","schema_version":"1.0","event_id":"sha256:3bf96464b659d9c39d4bb33fb4deee9adfcecc3c245e6eca2f441d6458e34d9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DMPMMOSCQELEZRYPANIOB2XO3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal relaxed portfolio strategies for growth rate maximization problems with transaction costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.PR"],"primary_cat":"q-fin.PM","authors_text":"Marc Wittlinger, S\\\"oren Christensen","submitted_at":"2012-09-03T11:09:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0305","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"},"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-18T03:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6emKr8pogBL5e8wEw3Yf9aIfYujuTuzILaEsdWg0zy7pQO1sQBTzh+wFeNo0fiORrGJRNMqoiy2OsgNoGOHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:25:53.385449Z"},"content_sha256":"708dcb432ec047944103afc5f53ee718cb03d4583b0a5b13db50f2f0c14558b8","schema_version":"1.0","event_id":"sha256:708dcb432ec047944103afc5f53ee718cb03d4583b0a5b13db50f2f0c14558b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMPMMOSCQELEZRYPANIOB2XO3X/bundle.json","state_url":"https://pith.science/pith/DMPMMOSCQELEZRYPANIOB2XO3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMPMMOSCQELEZRYPANIOB2XO3X/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-07T14:25:53Z","links":{"resolver":"https://pith.science/pith/DMPMMOSCQELEZRYPANIOB2XO3X","bundle":"https://pith.science/pith/DMPMMOSCQELEZRYPANIOB2XO3X/bundle.json","state":"https://pith.science/pith/DMPMMOSCQELEZRYPANIOB2XO3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMPMMOSCQELEZRYPANIOB2XO3X/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSsT/TS/CUdGYvhCCUD7y9mnSHFftJspww5ApkvU3G7Ukz7QInwGwRZxVdrGilECPMuhG+Z17LWKcTWeVtwPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:25:53.388698Z","bundle_sha256":"5ab5d72efad86bed5836e98f2c6997e1db926301775a6f907404c8f5630943c1"}}