{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W2SMENGM2OUE5QZKBCNI46KQLS","short_pith_number":"pith:W2SMENGM","canonical_record":{"source":{"id":"1609.00462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-02T04:03:22Z","cross_cats_sorted":[],"title_canon_sha256":"30970619044d0d33a13154cc1f2511d29a940f9b6580ec5dc0b3b8fd4c2fdd96","abstract_canon_sha256":"013df67f1bb4500b954cc500f180ae0152280d5e3bc70efc4c8ea4db61f0af35"},"schema_version":"1.0"},"canonical_sha256":"b6a4c234ccd3a84ec32a089a8e79505c91dd54daae392338386edc6e7799cd74","source":{"kind":"arxiv","id":"1609.00462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00462","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00462v1","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00462","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"W2SMENGM2OUE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W2SMENGM2OUE5QZK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W2SMENGM","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W2SMENGM2OUE5QZKBCNI46KQLS","target":"record","payload":{"canonical_record":{"source":{"id":"1609.00462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-02T04:03:22Z","cross_cats_sorted":[],"title_canon_sha256":"30970619044d0d33a13154cc1f2511d29a940f9b6580ec5dc0b3b8fd4c2fdd96","abstract_canon_sha256":"013df67f1bb4500b954cc500f180ae0152280d5e3bc70efc4c8ea4db61f0af35"},"schema_version":"1.0"},"canonical_sha256":"b6a4c234ccd3a84ec32a089a8e79505c91dd54daae392338386edc6e7799cd74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:23.873249Z","signature_b64":"KZgfhkqo0xOnj5qZLqogpSsWIAzvY+mobpnGxEDeCOUxHeT8yR6zSYp+2uqEy6h4ClKVudZKSWHOrKtqzBjbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6a4c234ccd3a84ec32a089a8e79505c91dd54daae392338386edc6e7799cd74","last_reissued_at":"2026-05-18T01:06:23.872890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:23.872890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.00462","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:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2x9II2MOVROLUZKP33i6R1eD3KO+MRC78KvmG+YJsAP6UM4ExgM14PyUWk55BxECZ5ndhz4lDW8YOLBsctMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:46:54.959744Z"},"content_sha256":"a03635a73efe0a3aacd7edb8d2160f4b7388654939f217855162598b1650f141","schema_version":"1.0","event_id":"sha256:a03635a73efe0a3aacd7edb8d2160f4b7388654939f217855162598b1650f141"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W2SMENGM2OUE5QZKBCNI46KQLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A case study of algorithm selection for the traveling thief problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Frank Hutter, Marius Lindauer, Markus Wagner, Mustafa Misir, Samadhi Nallaperuma","submitted_at":"2016-09-02T04:03:22Z","abstract_excerpt":"Many real-world problems are composed of several interacting components. In order to facilitate research on such interactions, the Traveling Thief Problem (TTP) was created in 2013 as the combination of two well-understood combinatorial optimization problems.\n  With this article, we contribute in four ways. First, we create a comprehensive dataset that comprises the performance data of 21 TTP algorithms on the full original set of 9720 TTP instances. Second, we define 55 characteristics for all TPP instances that can be used to select the best algorithm on a per-instance basis. Third, we use t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00462","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:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8jMhvpY903gPkyOKyMVWzm8LSnLMYENz8PNvt+Ra70db7AMA8dTt+RBmExwavdPA5D84IlEqEwE1drUcRJ7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:46:54.960125Z"},"content_sha256":"9531b67825459d5d5643190637d69cb56395e600c492041350724226d99e50f3","schema_version":"1.0","event_id":"sha256:9531b67825459d5d5643190637d69cb56395e600c492041350724226d99e50f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2SMENGM2OUE5QZKBCNI46KQLS/bundle.json","state_url":"https://pith.science/pith/W2SMENGM2OUE5QZKBCNI46KQLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2SMENGM2OUE5QZKBCNI46KQLS/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-30T08:46:54Z","links":{"resolver":"https://pith.science/pith/W2SMENGM2OUE5QZKBCNI46KQLS","bundle":"https://pith.science/pith/W2SMENGM2OUE5QZKBCNI46KQLS/bundle.json","state":"https://pith.science/pith/W2SMENGM2OUE5QZKBCNI46KQLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2SMENGM2OUE5QZKBCNI46KQLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W2SMENGM2OUE5QZKBCNI46KQLS","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":"013df67f1bb4500b954cc500f180ae0152280d5e3bc70efc4c8ea4db61f0af35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-02T04:03:22Z","title_canon_sha256":"30970619044d0d33a13154cc1f2511d29a940f9b6580ec5dc0b3b8fd4c2fdd96"},"schema_version":"1.0","source":{"id":"1609.00462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00462","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00462v1","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00462","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"W2SMENGM2OUE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W2SMENGM2OUE5QZK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W2SMENGM","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:9531b67825459d5d5643190637d69cb56395e600c492041350724226d99e50f3","target":"graph","created_at":"2026-05-18T01:06: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":"Many real-world problems are composed of several interacting components. In order to facilitate research on such interactions, the Traveling Thief Problem (TTP) was created in 2013 as the combination of two well-understood combinatorial optimization problems.\n  With this article, we contribute in four ways. First, we create a comprehensive dataset that comprises the performance data of 21 TTP algorithms on the full original set of 9720 TTP instances. Second, we define 55 characteristics for all TPP instances that can be used to select the best algorithm on a per-instance basis. Third, we use t","authors_text":"Frank Hutter, Marius Lindauer, Markus Wagner, Mustafa Misir, Samadhi Nallaperuma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-02T04:03:22Z","title":"A case study of algorithm selection for the traveling thief problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00462","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:a03635a73efe0a3aacd7edb8d2160f4b7388654939f217855162598b1650f141","target":"record","created_at":"2026-05-18T01:06: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":"013df67f1bb4500b954cc500f180ae0152280d5e3bc70efc4c8ea4db61f0af35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-02T04:03:22Z","title_canon_sha256":"30970619044d0d33a13154cc1f2511d29a940f9b6580ec5dc0b3b8fd4c2fdd96"},"schema_version":"1.0","source":{"id":"1609.00462","kind":"arxiv","version":1}},"canonical_sha256":"b6a4c234ccd3a84ec32a089a8e79505c91dd54daae392338386edc6e7799cd74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6a4c234ccd3a84ec32a089a8e79505c91dd54daae392338386edc6e7799cd74","first_computed_at":"2026-05-18T01:06:23.872890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:23.872890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KZgfhkqo0xOnj5qZLqogpSsWIAzvY+mobpnGxEDeCOUxHeT8yR6zSYp+2uqEy6h4ClKVudZKSWHOrKtqzBjbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:23.873249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a03635a73efe0a3aacd7edb8d2160f4b7388654939f217855162598b1650f141","sha256:9531b67825459d5d5643190637d69cb56395e600c492041350724226d99e50f3"],"state_sha256":"050320e01c8d8f371637cd5a919663205f2938e3d987463671ea787ecf41d33e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yuTG/kkQ/c/kISnOqBZoa+UrIv5V9wqIF7kbj/WXRRUbKTiV50SeOCLVl/exlUUyVUe3mgK0l7Myryz6UZqDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:46:54.962385Z","bundle_sha256":"feabca0218ff468c1579804882fe4f4627d45d88e6c224f8e56bebafe67ece14"}}