{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E7IGU6Z46VLYKHBHZZAVWUZHY5","short_pith_number":"pith:E7IGU6Z4","canonical_record":{"source":{"id":"1812.05222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-13T01:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"fdc4cc37a81a7dbaf762f5e50dffbb4625366177402029bd18a67cfb36eb55ce","abstract_canon_sha256":"f12ca3df38cfde3a4dcf6ed22f8736480d9e6fe9ac8d16c5b2969c2f1daaa492"},"schema_version":"1.0"},"canonical_sha256":"27d06a7b3cf557851c27ce415b5327c744ed5633c51056615b394fcb228579b9","source":{"kind":"arxiv","id":"1812.05222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05222","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05222v1","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05222","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"E7IGU6Z46VLY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"E7IGU6Z46VLYKHBH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"E7IGU6Z4","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E7IGU6Z46VLYKHBHZZAVWUZHY5","target":"record","payload":{"canonical_record":{"source":{"id":"1812.05222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-13T01:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"fdc4cc37a81a7dbaf762f5e50dffbb4625366177402029bd18a67cfb36eb55ce","abstract_canon_sha256":"f12ca3df38cfde3a4dcf6ed22f8736480d9e6fe9ac8d16c5b2969c2f1daaa492"},"schema_version":"1.0"},"canonical_sha256":"27d06a7b3cf557851c27ce415b5327c744ed5633c51056615b394fcb228579b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:24.122870Z","signature_b64":"X0yPuEW44LzrlYv3ka1fLyQ7wGNPeOZpLGtsBBiSpU16k8mzhInsmzXvGZBmN+1W1oXCVoB7SdA+8RolazHKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d06a7b3cf557851c27ce415b5327c744ed5633c51056615b394fcb228579b9","last_reissued_at":"2026-05-17T23:58:24.122177Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:24.122177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.05222","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-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sg/FC9v8iee6yrlRf6o0BaO/RqVwoJpsM6YajwekQkwmN2dBLOjOKY/1+wWjN/vr3M8kL+ngwxC2pBO54GbKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:40:27.838813Z"},"content_sha256":"ca14bda43866375da493784abc8e218b6a3af3fbb08a932c52cea61b7ee4af78","schema_version":"1.0","event_id":"sha256:ca14bda43866375da493784abc8e218b6a3af3fbb08a932c52cea61b7ee4af78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E7IGU6Z46VLYKHBHZZAVWUZHY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bezier Simplex Fitting: Describing Pareto Fronts of Simplicial Problems with Small Samples in Multi-objective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akinori Tanaka, Akiyoshi Sannai, Kenichi Bannai, Ken Kobayashi, Masashi Sugiyama, Naoki Hamada","submitted_at":"2018-12-13T01:51:32Z","abstract_excerpt":"Multi-objective optimization problems require simultaneously optimizing two or more objective functions. Many studies have reported that the solution set of an M-objective optimization problem often forms an (M-1)-dimensional topological simplex (a curved line for M=2, a curved triangle for M=3, a curved tetrahedron for M=4, etc.). Since the dimensionality of the solution set increases as the number of objectives grows, an exponentially large sample size is needed to cover the solution set. To reduce the required sample size, this paper proposes a Bezier simplex model and its fitting algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05222","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-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZav2zvc4WfTHQNLeDoN/iLidKHlJRHmypme6HSg5hzWKdO/Ui8keh8UKdk0YjQ1H9eZif1J2x6glI1DfhPnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:40:27.839588Z"},"content_sha256":"30ac2f9ce5dceff6dffa94002afd1ab1faf1dab3442d4027d784a2d1f16fbad9","schema_version":"1.0","event_id":"sha256:30ac2f9ce5dceff6dffa94002afd1ab1faf1dab3442d4027d784a2d1f16fbad9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7IGU6Z46VLYKHBHZZAVWUZHY5/bundle.json","state_url":"https://pith.science/pith/E7IGU6Z46VLYKHBHZZAVWUZHY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7IGU6Z46VLYKHBHZZAVWUZHY5/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-09T01:40:27Z","links":{"resolver":"https://pith.science/pith/E7IGU6Z46VLYKHBHZZAVWUZHY5","bundle":"https://pith.science/pith/E7IGU6Z46VLYKHBHZZAVWUZHY5/bundle.json","state":"https://pith.science/pith/E7IGU6Z46VLYKHBHZZAVWUZHY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7IGU6Z46VLYKHBHZZAVWUZHY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E7IGU6Z46VLYKHBHZZAVWUZHY5","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":"f12ca3df38cfde3a4dcf6ed22f8736480d9e6fe9ac8d16c5b2969c2f1daaa492","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-13T01:51:32Z","title_canon_sha256":"fdc4cc37a81a7dbaf762f5e50dffbb4625366177402029bd18a67cfb36eb55ce"},"schema_version":"1.0","source":{"id":"1812.05222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05222","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05222v1","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05222","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"E7IGU6Z46VLY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"E7IGU6Z46VLYKHBH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"E7IGU6Z4","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:30ac2f9ce5dceff6dffa94002afd1ab1faf1dab3442d4027d784a2d1f16fbad9","target":"graph","created_at":"2026-05-17T23:58:24Z","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":"Multi-objective optimization problems require simultaneously optimizing two or more objective functions. Many studies have reported that the solution set of an M-objective optimization problem often forms an (M-1)-dimensional topological simplex (a curved line for M=2, a curved triangle for M=3, a curved tetrahedron for M=4, etc.). Since the dimensionality of the solution set increases as the number of objectives grows, an exponentially large sample size is needed to cover the solution set. To reduce the required sample size, this paper proposes a Bezier simplex model and its fitting algorithm","authors_text":"Akinori Tanaka, Akiyoshi Sannai, Kenichi Bannai, Ken Kobayashi, Masashi Sugiyama, Naoki Hamada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-13T01:51:32Z","title":"Bezier Simplex Fitting: Describing Pareto Fronts of Simplicial Problems with Small Samples in Multi-objective Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05222","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:ca14bda43866375da493784abc8e218b6a3af3fbb08a932c52cea61b7ee4af78","target":"record","created_at":"2026-05-17T23:58:24Z","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":"f12ca3df38cfde3a4dcf6ed22f8736480d9e6fe9ac8d16c5b2969c2f1daaa492","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-13T01:51:32Z","title_canon_sha256":"fdc4cc37a81a7dbaf762f5e50dffbb4625366177402029bd18a67cfb36eb55ce"},"schema_version":"1.0","source":{"id":"1812.05222","kind":"arxiv","version":1}},"canonical_sha256":"27d06a7b3cf557851c27ce415b5327c744ed5633c51056615b394fcb228579b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d06a7b3cf557851c27ce415b5327c744ed5633c51056615b394fcb228579b9","first_computed_at":"2026-05-17T23:58:24.122177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:24.122177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X0yPuEW44LzrlYv3ka1fLyQ7wGNPeOZpLGtsBBiSpU16k8mzhInsmzXvGZBmN+1W1oXCVoB7SdA+8RolazHKAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:24.122870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca14bda43866375da493784abc8e218b6a3af3fbb08a932c52cea61b7ee4af78","sha256:30ac2f9ce5dceff6dffa94002afd1ab1faf1dab3442d4027d784a2d1f16fbad9"],"state_sha256":"e1338b403abed1e3042f5c3d88ff63ada1c176d3a0cab34e13a6daa96c8a32cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GsnCeHAptGba9/C/uJa3GHhMKSm6Kg/vpgZdo1+YuNuTHyQgIve4hgagqwpQ7nRAGiRoE1gq0oOO5j0WjTBCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:40:27.843438Z","bundle_sha256":"e834a1a0c7f8bb9a3777eb374110471ead9c3045bb70c0d51447ccfa4756310e"}}