{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SSNNVHZH42IDNLP7DDAOOALYEK","short_pith_number":"pith:SSNNVHZH","canonical_record":{"source":{"id":"1510.04295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-14T20:20:08Z","cross_cats_sorted":["q-fin.MF"],"title_canon_sha256":"c6db901742bd8d5167ca7058d5003499dff8f09b6a43a500be8dec5570ce2beb","abstract_canon_sha256":"fe38f47ceb6b400ed326a323096dd16e08d15772507fabeb05dcec9e75bd418c"},"schema_version":"1.0"},"canonical_sha256":"949ada9f27e69036adff18c0e7017822870440c4a86bdb00007182392dd95f6a","source":{"kind":"arxiv","id":"1510.04295","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04295","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04295v1","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04295","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"SSNNVHZH42ID","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SSNNVHZH42IDNLP7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SSNNVHZH","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SSNNVHZH42IDNLP7DDAOOALYEK","target":"record","payload":{"canonical_record":{"source":{"id":"1510.04295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-14T20:20:08Z","cross_cats_sorted":["q-fin.MF"],"title_canon_sha256":"c6db901742bd8d5167ca7058d5003499dff8f09b6a43a500be8dec5570ce2beb","abstract_canon_sha256":"fe38f47ceb6b400ed326a323096dd16e08d15772507fabeb05dcec9e75bd418c"},"schema_version":"1.0"},"canonical_sha256":"949ada9f27e69036adff18c0e7017822870440c4a86bdb00007182392dd95f6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:07.576576Z","signature_b64":"Ut7JxH2cepCpoogyrkmbKtY2WJwNtah9pYOgmT5JDtsSwiD9am8VnD8LYhUxgiLqXntGeMgbkY/p9X6BuQq+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"949ada9f27e69036adff18c0e7017822870440c4a86bdb00007182392dd95f6a","last_reissued_at":"2026-05-18T01:30:07.576066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:07.576066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.04295","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-18T01:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgv6A8aU+vkCKKpKtt1tJ7+gEDIvhVto6vBMMFxh1P0Q8L+8R9RHmKGvblmv2MssLrL6rEaks1QLlg3FYF1YAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:31:58.151252Z"},"content_sha256":"a9dcc7180d84ef677989b4e47855c4b59cfc8f8e887d052735b0762a3418e418","schema_version":"1.0","event_id":"sha256:a9dcc7180d84ef677989b4e47855c4b59cfc8f8e887d052735b0762a3418e418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SSNNVHZH42IDNLP7DDAOOALYEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Lower Bounds for Optimal Tracking: a Linear Programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.MF"],"primary_cat":"math.PR","authors_text":"Jiatu Cai, Mathieu Rosenbaum, Peter Tankov","submitted_at":"2015-10-14T20:20:08Z","abstract_excerpt":"We consider the problem of tracking a target whose dynamics is modeled by a continuous It\\=o semi-martingale. The aim is to minimize both deviation from the target and tracking efforts. We establish the existence of asymptotic lower bounds for this problem, depending on the cost structure. These lower bounds can be related to the time-average control of Brownian motion, which is characterized as a deterministic linear programming problem. A comprehensive list of examples with explicit expressions for the lower bounds is provided."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04295","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-18T01:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aROun0ju0yG2cJIaeHlOQkW/ZQvab9ebnZs0JJAQWJXuQi/lnwXEHZKW48ELatEwtd2j/66t7c96n/iB5akaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:31:58.151946Z"},"content_sha256":"05cf045838a48e7a7ed7b5f0e61df0fe1c3cec5f00bca6a054493b7ae502220c","schema_version":"1.0","event_id":"sha256:05cf045838a48e7a7ed7b5f0e61df0fe1c3cec5f00bca6a054493b7ae502220c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSNNVHZH42IDNLP7DDAOOALYEK/bundle.json","state_url":"https://pith.science/pith/SSNNVHZH42IDNLP7DDAOOALYEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSNNVHZH42IDNLP7DDAOOALYEK/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-05-27T05:31:58Z","links":{"resolver":"https://pith.science/pith/SSNNVHZH42IDNLP7DDAOOALYEK","bundle":"https://pith.science/pith/SSNNVHZH42IDNLP7DDAOOALYEK/bundle.json","state":"https://pith.science/pith/SSNNVHZH42IDNLP7DDAOOALYEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSNNVHZH42IDNLP7DDAOOALYEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SSNNVHZH42IDNLP7DDAOOALYEK","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":"fe38f47ceb6b400ed326a323096dd16e08d15772507fabeb05dcec9e75bd418c","cross_cats_sorted":["q-fin.MF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-14T20:20:08Z","title_canon_sha256":"c6db901742bd8d5167ca7058d5003499dff8f09b6a43a500be8dec5570ce2beb"},"schema_version":"1.0","source":{"id":"1510.04295","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04295","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04295v1","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04295","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"SSNNVHZH42ID","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SSNNVHZH42IDNLP7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SSNNVHZH","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:05cf045838a48e7a7ed7b5f0e61df0fe1c3cec5f00bca6a054493b7ae502220c","target":"graph","created_at":"2026-05-18T01:30:07Z","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":"We consider the problem of tracking a target whose dynamics is modeled by a continuous It\\=o semi-martingale. The aim is to minimize both deviation from the target and tracking efforts. We establish the existence of asymptotic lower bounds for this problem, depending on the cost structure. These lower bounds can be related to the time-average control of Brownian motion, which is characterized as a deterministic linear programming problem. A comprehensive list of examples with explicit expressions for the lower bounds is provided.","authors_text":"Jiatu Cai, Mathieu Rosenbaum, Peter Tankov","cross_cats":["q-fin.MF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-14T20:20:08Z","title":"Asymptotic Lower Bounds for Optimal Tracking: a Linear Programming Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04295","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:a9dcc7180d84ef677989b4e47855c4b59cfc8f8e887d052735b0762a3418e418","target":"record","created_at":"2026-05-18T01:30:07Z","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":"fe38f47ceb6b400ed326a323096dd16e08d15772507fabeb05dcec9e75bd418c","cross_cats_sorted":["q-fin.MF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-14T20:20:08Z","title_canon_sha256":"c6db901742bd8d5167ca7058d5003499dff8f09b6a43a500be8dec5570ce2beb"},"schema_version":"1.0","source":{"id":"1510.04295","kind":"arxiv","version":1}},"canonical_sha256":"949ada9f27e69036adff18c0e7017822870440c4a86bdb00007182392dd95f6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"949ada9f27e69036adff18c0e7017822870440c4a86bdb00007182392dd95f6a","first_computed_at":"2026-05-18T01:30:07.576066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:07.576066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ut7JxH2cepCpoogyrkmbKtY2WJwNtah9pYOgmT5JDtsSwiD9am8VnD8LYhUxgiLqXntGeMgbkY/p9X6BuQq+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:07.576576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04295","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9dcc7180d84ef677989b4e47855c4b59cfc8f8e887d052735b0762a3418e418","sha256:05cf045838a48e7a7ed7b5f0e61df0fe1c3cec5f00bca6a054493b7ae502220c"],"state_sha256":"ca74a3db71027b497c80bc34cf30c102c49b3ad60a6a232cad30a2a2891b3760"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhMbzrPHzsMV9cIjFSd6VHIAJZ3MlCk+c4HJfsP196sdBoITC6/b7BKy/FDYsZRnx8O8h35J34p6vg6XAbonBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:31:58.155646Z","bundle_sha256":"ee97b10862249cfd629d7e200e9a3f6ec17474ddd389f04117a19422ac2fa449"}}