{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WWITWCUGMZ37XNYUHIUV27JWMQ","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":"3b467f755bd0fa2097fd235e708bbf4cb9a3c42975fa95877aa4b1a416d5edc2","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-11T20:23:57Z","title_canon_sha256":"c21e1f30176cb2647803d1cd7c8304f0625f08c49e93bc3f466d6a20e5b1f2ab"},"schema_version":"1.0","source":{"id":"1810.05236","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05236","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05236v3","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05236","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"pith_short_12","alias_value":"WWITWCUGMZ37","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WWITWCUGMZ37XNYU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WWITWCUG","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:e2cc47229cce080dfb261272aecfb86f9ea8af97544c7c9c93ba46ac9052a33a","target":"graph","created_at":"2026-05-17T23:39:37Z","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 is a crucial matter in computer systems design space exploration because real-world applications often rely on a trade-off between several objectives. Derivatives are usually not available or impractical to compute and the feasibility of an experiment can not always be determined in advance. These problems are particularly difficult when the feasible region is relatively small, and it may be prohibitive to even find a feasible experiment, let alone an optimal one.\n  We introduce a new methodology and corresponding software framework, HyperMapper 2.0, which handles ","authors_text":"David Koeplinger, Kunle Olukotun, Luigi Nardi","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-11T20:23:57Z","title":"Practical Design Space Exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05236","kind":"arxiv","version":3},"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:49baabda517b7b3b1bfdbc4ca407c71104329884711393b35fe320e286bacdce","target":"record","created_at":"2026-05-17T23:39:37Z","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":"3b467f755bd0fa2097fd235e708bbf4cb9a3c42975fa95877aa4b1a416d5edc2","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-11T20:23:57Z","title_canon_sha256":"c21e1f30176cb2647803d1cd7c8304f0625f08c49e93bc3f466d6a20e5b1f2ab"},"schema_version":"1.0","source":{"id":"1810.05236","kind":"arxiv","version":3}},"canonical_sha256":"b5913b0a866677fbb7143a295d7d3664277522be0d9f5375bb414f49079c5091","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5913b0a866677fbb7143a295d7d3664277522be0d9f5375bb414f49079c5091","first_computed_at":"2026-05-17T23:39:37.069678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:37.069678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ULifCJSC7fnVW1irQMB4VRfsBMI6CCzpc+8dI8mQ0FcTUoAsKDZcWrS/mSPU+eS0fkEe3F+N4zJNHalVjqzAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:37.070184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05236","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49baabda517b7b3b1bfdbc4ca407c71104329884711393b35fe320e286bacdce","sha256:e2cc47229cce080dfb261272aecfb86f9ea8af97544c7c9c93ba46ac9052a33a"],"state_sha256":"56acb6cf7a6228e6fb87725e02f5d426834d5e9820e61551fb791ff4675de2a7"}