{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HKUXX6UY4D43OTXX4W4WT4E2NJ","short_pith_number":"pith:HKUXX6UY","canonical_record":{"source":{"id":"1811.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-16T13:18:57Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"d17d131ac288a87e4b4590ecd8b373ea47f683b1ea7d05116dbf702ca84a368f","abstract_canon_sha256":"dbb89af5ceeb5bcf3c100132ce713c215247d701c0c82c4e445061a757383fd4"},"schema_version":"1.0"},"canonical_sha256":"3aa97bfa98e0f9b74ef7e5b969f09a6a57737a9aaf173defc95c26163b0461b7","source":{"kind":"arxiv","id":"1811.07734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07734","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07734v1","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07734","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"HKUXX6UY4D43","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HKUXX6UY4D43OTXX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HKUXX6UY","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HKUXX6UY4D43OTXX4W4WT4E2NJ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-16T13:18:57Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"d17d131ac288a87e4b4590ecd8b373ea47f683b1ea7d05116dbf702ca84a368f","abstract_canon_sha256":"dbb89af5ceeb5bcf3c100132ce713c215247d701c0c82c4e445061a757383fd4"},"schema_version":"1.0"},"canonical_sha256":"3aa97bfa98e0f9b74ef7e5b969f09a6a57737a9aaf173defc95c26163b0461b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:23.580041Z","signature_b64":"pa+uP+FlitGF9pXnMRmOH8exF93fxRqadtPfzFBB6IoR3MjBXt1+GCj3KoDeWC/pEUghukDVGT+BdmJGT6t7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aa97bfa98e0f9b74ef7e5b969f09a6a57737a9aaf173defc95c26163b0461b7","last_reissued_at":"2026-05-18T00:00:23.579504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:23.579504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07734","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-18T00:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XB6p/4pVksAVdvpEr5iZkop4c3VphOQbi/90ot6G6mZdkEikuKEOscYJ+LR+JaF2c1pDSlJjPw8qi+sbs5zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:58:44.425423Z"},"content_sha256":"95c4beae93f9fced240e3d16f6da183d46f0d04a436835fb2c0b17fa99dcac99","schema_version":"1.0","event_id":"sha256:95c4beae93f9fced240e3d16f6da183d46f0d04a436835fb2c0b17fa99dcac99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HKUXX6UY4D43OTXX4W4WT4E2NJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average Point Pursuit using the Greedy Algorithm: Theory and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Andrey Bernstein, Niek J. Bouman","submitted_at":"2018-11-16T13:18:57Z","abstract_excerpt":"This paper considers a discrete-time decision problem wherein a decision maker has to track, on average, a sequence of inputs selected from a convex set $\\mathcal X \\subset \\mathbb{R}^d$ by choosing actions from a possibly non-convex feasible set $\\mathcal Y\\subset \\mathbb{R}^d$, where $\\mathcal X$ is in fact the convex hull of $\\mathcal Y$. We study some generalized variants of this problem, in which: (i) $\\mathcal X$ and $\\mathcal Y$ vary with time, and (ii) there might be a delay between them, in the sense that $\\mathcal X$ is the convex hull of the previous $\\mathcal Y$. We investigate the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07734","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-18T00:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+GXByiAmtpgC86ebScpO9iX3vF6GmvmS8Q64fUC7jQfT16g0yNI3Tg/oa9xC9LaZvGzmH5qB+CfeUyDPIqKNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:58:44.426145Z"},"content_sha256":"e52a907664a6ef44bd5c2e9c21f84bdb7824ecbb66353148d171248cad6cb390","schema_version":"1.0","event_id":"sha256:e52a907664a6ef44bd5c2e9c21f84bdb7824ecbb66353148d171248cad6cb390"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKUXX6UY4D43OTXX4W4WT4E2NJ/bundle.json","state_url":"https://pith.science/pith/HKUXX6UY4D43OTXX4W4WT4E2NJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKUXX6UY4D43OTXX4W4WT4E2NJ/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-09T12:58:44Z","links":{"resolver":"https://pith.science/pith/HKUXX6UY4D43OTXX4W4WT4E2NJ","bundle":"https://pith.science/pith/HKUXX6UY4D43OTXX4W4WT4E2NJ/bundle.json","state":"https://pith.science/pith/HKUXX6UY4D43OTXX4W4WT4E2NJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKUXX6UY4D43OTXX4W4WT4E2NJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HKUXX6UY4D43OTXX4W4WT4E2NJ","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":"dbb89af5ceeb5bcf3c100132ce713c215247d701c0c82c4e445061a757383fd4","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-16T13:18:57Z","title_canon_sha256":"d17d131ac288a87e4b4590ecd8b373ea47f683b1ea7d05116dbf702ca84a368f"},"schema_version":"1.0","source":{"id":"1811.07734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07734","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07734v1","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07734","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"HKUXX6UY4D43","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HKUXX6UY4D43OTXX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HKUXX6UY","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:e52a907664a6ef44bd5c2e9c21f84bdb7824ecbb66353148d171248cad6cb390","target":"graph","created_at":"2026-05-18T00:00:23Z","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":"This paper considers a discrete-time decision problem wherein a decision maker has to track, on average, a sequence of inputs selected from a convex set $\\mathcal X \\subset \\mathbb{R}^d$ by choosing actions from a possibly non-convex feasible set $\\mathcal Y\\subset \\mathbb{R}^d$, where $\\mathcal X$ is in fact the convex hull of $\\mathcal Y$. We study some generalized variants of this problem, in which: (i) $\\mathcal X$ and $\\mathcal Y$ vary with time, and (ii) there might be a delay between them, in the sense that $\\mathcal X$ is the convex hull of the previous $\\mathcal Y$. We investigate the","authors_text":"Andrey Bernstein, Niek J. Bouman","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-16T13:18:57Z","title":"Average Point Pursuit using the Greedy Algorithm: Theory and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07734","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:95c4beae93f9fced240e3d16f6da183d46f0d04a436835fb2c0b17fa99dcac99","target":"record","created_at":"2026-05-18T00:00:23Z","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":"dbb89af5ceeb5bcf3c100132ce713c215247d701c0c82c4e445061a757383fd4","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-16T13:18:57Z","title_canon_sha256":"d17d131ac288a87e4b4590ecd8b373ea47f683b1ea7d05116dbf702ca84a368f"},"schema_version":"1.0","source":{"id":"1811.07734","kind":"arxiv","version":1}},"canonical_sha256":"3aa97bfa98e0f9b74ef7e5b969f09a6a57737a9aaf173defc95c26163b0461b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3aa97bfa98e0f9b74ef7e5b969f09a6a57737a9aaf173defc95c26163b0461b7","first_computed_at":"2026-05-18T00:00:23.579504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:23.579504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pa+uP+FlitGF9pXnMRmOH8exF93fxRqadtPfzFBB6IoR3MjBXt1+GCj3KoDeWC/pEUghukDVGT+BdmJGT6t7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:23.580041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95c4beae93f9fced240e3d16f6da183d46f0d04a436835fb2c0b17fa99dcac99","sha256:e52a907664a6ef44bd5c2e9c21f84bdb7824ecbb66353148d171248cad6cb390"],"state_sha256":"4c5b0fca6763659024252ad9c1ba7ac6f9e2456a02f0184b5e2f26f02d008b87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UoE9/RUwno86s+EjSOHeEN6NxYOKiTc6vzsvCguKQxNVOyD22YfbmLdcuIC9NvTVvl4/kI6v0cQaNBTA5vGDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:58:44.430022Z","bundle_sha256":"c9227deb273932c3692ea6e97c868892eff3a12b2ff7d8e589d1400d97e7c4fe"}}