{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FTAX2GKSALAYLWB6FF7U7RQJIP","short_pith_number":"pith:FTAX2GKS","canonical_record":{"source":{"id":"1108.0342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-01T15:44:21Z","cross_cats_sorted":[],"title_canon_sha256":"e4362a2912912b2e64bcf4e19f421d5e14e43f9cb78b912f4c21a0d3fc5fbcf5","abstract_canon_sha256":"3b383c4a3208ae1050fa8c7b5309cf808d762343a4349ae0466c82a77dadb674"},"schema_version":"1.0"},"canonical_sha256":"2cc17d195202c185d83e297f4fc60943e2d2c727a1f12086b33407914c30b47d","source":{"kind":"arxiv","id":"1108.0342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0342","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0342v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0342","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"FTAX2GKSALAY","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTAX2GKSALAYLWB6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTAX2GKS","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FTAX2GKSALAYLWB6FF7U7RQJIP","target":"record","payload":{"canonical_record":{"source":{"id":"1108.0342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-01T15:44:21Z","cross_cats_sorted":[],"title_canon_sha256":"e4362a2912912b2e64bcf4e19f421d5e14e43f9cb78b912f4c21a0d3fc5fbcf5","abstract_canon_sha256":"3b383c4a3208ae1050fa8c7b5309cf808d762343a4349ae0466c82a77dadb674"},"schema_version":"1.0"},"canonical_sha256":"2cc17d195202c185d83e297f4fc60943e2d2c727a1f12086b33407914c30b47d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.511917Z","signature_b64":"PxSh5A8ioYmeqBC408CiV13lJJnvQBl0n0ImLY1K7Zd1uHjnQXDlhpeKupQdnUn4XCg38oz/PJ1lC1rz6nv+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc17d195202c185d83e297f4fc60943e2d2c727a1f12086b33407914c30b47d","last_reissued_at":"2026-05-18T02:21:42.511352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.511352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.0342","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-18T02:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISCi3qCzF88Jzl0/jhbRUFkwTwdi4c580RZ9Hvrh2POEsgYn7PkjcE/VxaZhENVaxFr4c7p1MioeviE7PA0NBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:08:23.085706Z"},"content_sha256":"92afa54c390974e930fa8f33b8fe5d715602d822366ab04e0c20fb0d2538c6ea","schema_version":"1.0","event_id":"sha256:92afa54c390974e930fa8f33b8fe5d715602d822366ab04e0c20fb0d2538c6ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FTAX2GKSALAYLWB6FF7U7RQJIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Black-Box Complexities of Combinatorial Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Carola Winzen, Johannes Lengler, Timo K\\\"otzing","submitted_at":"2011-08-01T15:44:21Z","abstract_excerpt":"Black-box complexity is a complexity theoretic measure for how difficult a problem is to be optimized by a general purpose optimization algorithm. It is thus one of the few means trying to understand which problems are tractable for genetic algorithms and other randomized search heuristics.\n  Most previous work on black-box complexity is on artificial test functions. In this paper, we move a step forward and give a detailed analysis for the two combinatorial problems minimum spanning tree and single-source shortest paths. Besides giving interesting bounds for their black-box complexities, our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0342","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-18T02:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uHAbFVhQPsFs2Cm4rqSOHoV0XbBU5E4Fny8osndubhw9pkvEIaey635XO5Ynh42lbGSsFnOrw8CNWEyzaS99AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:08:23.086056Z"},"content_sha256":"49ec1b818d9242ebb74f35a725577e88f56cf8743327801ba27390e1bcb6b27a","schema_version":"1.0","event_id":"sha256:49ec1b818d9242ebb74f35a725577e88f56cf8743327801ba27390e1bcb6b27a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTAX2GKSALAYLWB6FF7U7RQJIP/bundle.json","state_url":"https://pith.science/pith/FTAX2GKSALAYLWB6FF7U7RQJIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTAX2GKSALAYLWB6FF7U7RQJIP/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-21T03:08:23Z","links":{"resolver":"https://pith.science/pith/FTAX2GKSALAYLWB6FF7U7RQJIP","bundle":"https://pith.science/pith/FTAX2GKSALAYLWB6FF7U7RQJIP/bundle.json","state":"https://pith.science/pith/FTAX2GKSALAYLWB6FF7U7RQJIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTAX2GKSALAYLWB6FF7U7RQJIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FTAX2GKSALAYLWB6FF7U7RQJIP","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":"3b383c4a3208ae1050fa8c7b5309cf808d762343a4349ae0466c82a77dadb674","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-01T15:44:21Z","title_canon_sha256":"e4362a2912912b2e64bcf4e19f421d5e14e43f9cb78b912f4c21a0d3fc5fbcf5"},"schema_version":"1.0","source":{"id":"1108.0342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0342","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0342v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0342","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"FTAX2GKSALAY","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTAX2GKSALAYLWB6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTAX2GKS","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:49ec1b818d9242ebb74f35a725577e88f56cf8743327801ba27390e1bcb6b27a","target":"graph","created_at":"2026-05-18T02:21:42Z","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":"Black-box complexity is a complexity theoretic measure for how difficult a problem is to be optimized by a general purpose optimization algorithm. It is thus one of the few means trying to understand which problems are tractable for genetic algorithms and other randomized search heuristics.\n  Most previous work on black-box complexity is on artificial test functions. In this paper, we move a step forward and give a detailed analysis for the two combinatorial problems minimum spanning tree and single-source shortest paths. Besides giving interesting bounds for their black-box complexities, our ","authors_text":"Benjamin Doerr, Carola Winzen, Johannes Lengler, Timo K\\\"otzing","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-01T15:44:21Z","title":"Black-Box Complexities of Combinatorial Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0342","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:92afa54c390974e930fa8f33b8fe5d715602d822366ab04e0c20fb0d2538c6ea","target":"record","created_at":"2026-05-18T02:21:42Z","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":"3b383c4a3208ae1050fa8c7b5309cf808d762343a4349ae0466c82a77dadb674","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-08-01T15:44:21Z","title_canon_sha256":"e4362a2912912b2e64bcf4e19f421d5e14e43f9cb78b912f4c21a0d3fc5fbcf5"},"schema_version":"1.0","source":{"id":"1108.0342","kind":"arxiv","version":1}},"canonical_sha256":"2cc17d195202c185d83e297f4fc60943e2d2c727a1f12086b33407914c30b47d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cc17d195202c185d83e297f4fc60943e2d2c727a1f12086b33407914c30b47d","first_computed_at":"2026-05-18T02:21:42.511352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:42.511352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PxSh5A8ioYmeqBC408CiV13lJJnvQBl0n0ImLY1K7Zd1uHjnQXDlhpeKupQdnUn4XCg38oz/PJ1lC1rz6nv+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:42.511917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92afa54c390974e930fa8f33b8fe5d715602d822366ab04e0c20fb0d2538c6ea","sha256:49ec1b818d9242ebb74f35a725577e88f56cf8743327801ba27390e1bcb6b27a"],"state_sha256":"9c653be63a52bfd087c80787a18862d8817a49677b25f7b22cab939aedc31e43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+kCoNzirgs00ePdo/c9vEC8C8+x3yekNIeRxRhz2qxQ3yE7fS89VZdIi51qxtAlanS1BvD+ewC0i7UpcC0ayDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T03:08:23.088013Z","bundle_sha256":"f82af8b9fb9683c65251d5663264bdbb8138ec9ce5fcc61c22376cdf2398a4d7"}}