{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AAJ2RNI4UOCTWJE54BOIRXLCUV","short_pith_number":"pith:AAJ2RNI4","canonical_record":{"source":{"id":"1506.04474","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T04:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"a33b22083212de454f52d5d51df9ef220bf52721abe61de2357f42ae90af1786","abstract_canon_sha256":"90fbef3ad9eaa94da5d3621cdae2292b8d759f1ffc3bce5cd205bf0b3819a9c1"},"schema_version":"1.0"},"canonical_sha256":"0013a8b51ca3853b249de05c88dd62a54c89a34564be2aa8229541f69d7d5984","source":{"kind":"arxiv","id":"1506.04474","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04474","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04474v6","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04474","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"AAJ2RNI4UOCT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AAJ2RNI4UOCTWJE5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AAJ2RNI4","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AAJ2RNI4UOCTWJE54BOIRXLCUV","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04474","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T04:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"a33b22083212de454f52d5d51df9ef220bf52721abe61de2357f42ae90af1786","abstract_canon_sha256":"90fbef3ad9eaa94da5d3621cdae2292b8d759f1ffc3bce5cd205bf0b3819a9c1"},"schema_version":"1.0"},"canonical_sha256":"0013a8b51ca3853b249de05c88dd62a54c89a34564be2aa8229541f69d7d5984","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:02.761753Z","signature_b64":"CUbCBOuzowr+6NfcrzPZA2z37GT7+Fs3A9vkxbd1lsi3cq3xYre4j61D7Z3dP1HV4jHOR8TemqJUgC7bugp0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0013a8b51ca3853b249de05c88dd62a54c89a34564be2aa8229541f69d7d5984","last_reissued_at":"2026-05-18T01:16:02.761064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:02.761064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04474","source_version":6,"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:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HatPnEC8f2aUoFS8qX4+dlO4an270MioSatVT4MNzipR/rEVN8KDBWOMOGES0E6z2AOKiU2xi9VQJbDjPzGZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:35:31.815201Z"},"content_sha256":"88f801e9a81cad435d84789ace2e002d40bc06b06f2eabea7e82743b5bae561c","schema_version":"1.0","event_id":"sha256:88f801e9a81cad435d84789ace2e002d40bc06b06f2eabea7e82743b5bae561c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AAJ2RNI4UOCTWJE54BOIRXLCUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Online Algorithms for the Multi-Objective Time Series Search Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shun Hasegawa, Toshiya Itoh","submitted_at":"2015-06-15T04:14:31Z","abstract_excerpt":"Tiedemann, et al. [Proc. of WALCOM, LNCS 8973, 2015, pp.210-221] defined multi-objective online problems (as an online version of multi-objective optimization problems) and the competitive analysis for multi-objective online problems and showed that (1) with respect to the worst component competitive analysis, the online algorithm RPP-HIGH is best possible for the multi-objective time series search~problem; (2) with respect to the arithmetic mean component competitive analysis, the online algorithm RPP-MULT is best possible for the bi-objective time series search problem; (3) with respect to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04474","kind":"arxiv","version":6},"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:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gp403/wU1OttQrR5RIN/3ZEGGkfeSwfQt1vWPHDaWkoIioBTnYY3R947xjaT3vNAhDNWX/SPLNMGBFe+mFzzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:35:31.815873Z"},"content_sha256":"6313c5f56230aa35718eb25d9367cb68c98aed7906319331358b81f2cf44ce7e","schema_version":"1.0","event_id":"sha256:6313c5f56230aa35718eb25d9367cb68c98aed7906319331358b81f2cf44ce7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAJ2RNI4UOCTWJE54BOIRXLCUV/bundle.json","state_url":"https://pith.science/pith/AAJ2RNI4UOCTWJE54BOIRXLCUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAJ2RNI4UOCTWJE54BOIRXLCUV/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-31T01:35:31Z","links":{"resolver":"https://pith.science/pith/AAJ2RNI4UOCTWJE54BOIRXLCUV","bundle":"https://pith.science/pith/AAJ2RNI4UOCTWJE54BOIRXLCUV/bundle.json","state":"https://pith.science/pith/AAJ2RNI4UOCTWJE54BOIRXLCUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAJ2RNI4UOCTWJE54BOIRXLCUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AAJ2RNI4UOCTWJE54BOIRXLCUV","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":"90fbef3ad9eaa94da5d3621cdae2292b8d759f1ffc3bce5cd205bf0b3819a9c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T04:14:31Z","title_canon_sha256":"a33b22083212de454f52d5d51df9ef220bf52721abe61de2357f42ae90af1786"},"schema_version":"1.0","source":{"id":"1506.04474","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04474","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04474v6","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04474","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"AAJ2RNI4UOCT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AAJ2RNI4UOCTWJE5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AAJ2RNI4","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:6313c5f56230aa35718eb25d9367cb68c98aed7906319331358b81f2cf44ce7e","target":"graph","created_at":"2026-05-18T01:16:02Z","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":"Tiedemann, et al. [Proc. of WALCOM, LNCS 8973, 2015, pp.210-221] defined multi-objective online problems (as an online version of multi-objective optimization problems) and the competitive analysis for multi-objective online problems and showed that (1) with respect to the worst component competitive analysis, the online algorithm RPP-HIGH is best possible for the multi-objective time series search~problem; (2) with respect to the arithmetic mean component competitive analysis, the online algorithm RPP-MULT is best possible for the bi-objective time series search problem; (3) with respect to t","authors_text":"Shun Hasegawa, Toshiya Itoh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T04:14:31Z","title":"Optimal Online Algorithms for the Multi-Objective Time Series Search Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04474","kind":"arxiv","version":6},"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:88f801e9a81cad435d84789ace2e002d40bc06b06f2eabea7e82743b5bae561c","target":"record","created_at":"2026-05-18T01:16:02Z","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":"90fbef3ad9eaa94da5d3621cdae2292b8d759f1ffc3bce5cd205bf0b3819a9c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T04:14:31Z","title_canon_sha256":"a33b22083212de454f52d5d51df9ef220bf52721abe61de2357f42ae90af1786"},"schema_version":"1.0","source":{"id":"1506.04474","kind":"arxiv","version":6}},"canonical_sha256":"0013a8b51ca3853b249de05c88dd62a54c89a34564be2aa8229541f69d7d5984","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0013a8b51ca3853b249de05c88dd62a54c89a34564be2aa8229541f69d7d5984","first_computed_at":"2026-05-18T01:16:02.761064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:02.761064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CUbCBOuzowr+6NfcrzPZA2z37GT7+Fs3A9vkxbd1lsi3cq3xYre4j61D7Z3dP1HV4jHOR8TemqJUgC7bugp0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:02.761753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04474","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88f801e9a81cad435d84789ace2e002d40bc06b06f2eabea7e82743b5bae561c","sha256:6313c5f56230aa35718eb25d9367cb68c98aed7906319331358b81f2cf44ce7e"],"state_sha256":"cd8594b810036de4fc009160761f07a25b10dbf4871ad493f7f6795f4f95b185"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqEPihVY0A5hnkT5TybH7nJOU4NhnUFXZmQsKC+0JghJ00TIKJjJgJehK8jE+xBarI2et0J8EKmXHC58olzkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:35:31.819935Z","bundle_sha256":"c7214ae37221d5b9c28e53044738aeeb39816ad1df802a0950aea0960246d9e7"}}