{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:65ZORH5ASUGIBJA7TFFKPYUV3B","short_pith_number":"pith:65ZORH5A","canonical_record":{"source":{"id":"1207.0369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-07-02T13:14:14Z","cross_cats_sorted":[],"title_canon_sha256":"8194f4373c1a57aecaa6a460b6bbfe36e75cdca21e83cd3faec7b5d159745770","abstract_canon_sha256":"a29bff65fe6032f3cd648f61d979de6783a1c27d65f49409898c240b46000fb1"},"schema_version":"1.0"},"canonical_sha256":"f772e89fa0950c80a41f994aa7e295d87d5b43b882f64325bf232af7e321dc6e","source":{"kind":"arxiv","id":"1207.0369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0369","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0369v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0369","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"65ZORH5ASUGI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"65ZORH5ASUGIBJA7","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"65ZORH5A","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:65ZORH5ASUGIBJA7TFFKPYUV3B","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-07-02T13:14:14Z","cross_cats_sorted":[],"title_canon_sha256":"8194f4373c1a57aecaa6a460b6bbfe36e75cdca21e83cd3faec7b5d159745770","abstract_canon_sha256":"a29bff65fe6032f3cd648f61d979de6783a1c27d65f49409898c240b46000fb1"},"schema_version":"1.0"},"canonical_sha256":"f772e89fa0950c80a41f994aa7e295d87d5b43b882f64325bf232af7e321dc6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.602882Z","signature_b64":"zro5q8dlnRhpjao9ePUehWXPazyYnE6W/4PnNC9gDCuSgoPbJ0aNPza8h7eN3okKj351UvPg09LWALVzwFE7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f772e89fa0950c80a41f994aa7e295d87d5b43b882f64325bf232af7e321dc6e","last_reissued_at":"2026-05-18T02:21:08.602477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.602477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0369","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:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqTQkKkeSKQ1tbFcICDcE7WHK36QCUuoVjRsvyreKIUUhlFtQT1W4XrkjIkenW603+Eo9taACGyOorDzRfvqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:46:38.608904Z"},"content_sha256":"d81ef681003958269fca4ccb47f5fa8a5ba1b119f30536506f8c63b22d3821a8","schema_version":"1.0","event_id":"sha256:d81ef681003958269fca4ccb47f5fa8a5ba1b119f30536506f8c63b22d3821a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:65ZORH5ASUGIBJA7TFFKPYUV3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More Effective Crossover Operators for the All-Pairs Shortest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr, Daniel Johannsen, Frank Neumann, Madeleine Theile, Timo K\\\"otzing","submitted_at":"2012-07-02T13:14:14Z","abstract_excerpt":"The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorithm. Recently, the analysis of this algorithm was refined and it was shown to have an expected optimization time (w.r.t. the number of fitness evaluations) of $\\Theta(n^{3.25}(\\log n)^{0.25})$.\n  In contrast to this simple algorithm, evolutionary algorithms used in practice usually employ refined recombination strategies in order to avoid the creation of infeasible offspring. We study extensions of the basic algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0369","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:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHAcyfXah3IiKd75TW28CNXMl1TCRKYnzcZFe1sk00+d3P1ktFjazQc3gFd4BIUga+EW6MZR5Sx6LkuIrRRCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:46:38.609592Z"},"content_sha256":"a789ffeb7353757d8370a2097aaa4d397f538930b42fc554de52540ceb5fd64b","schema_version":"1.0","event_id":"sha256:a789ffeb7353757d8370a2097aaa4d397f538930b42fc554de52540ceb5fd64b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65ZORH5ASUGIBJA7TFFKPYUV3B/bundle.json","state_url":"https://pith.science/pith/65ZORH5ASUGIBJA7TFFKPYUV3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65ZORH5ASUGIBJA7TFFKPYUV3B/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-29T23:46:38Z","links":{"resolver":"https://pith.science/pith/65ZORH5ASUGIBJA7TFFKPYUV3B","bundle":"https://pith.science/pith/65ZORH5ASUGIBJA7TFFKPYUV3B/bundle.json","state":"https://pith.science/pith/65ZORH5ASUGIBJA7TFFKPYUV3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65ZORH5ASUGIBJA7TFFKPYUV3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:65ZORH5ASUGIBJA7TFFKPYUV3B","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":"a29bff65fe6032f3cd648f61d979de6783a1c27d65f49409898c240b46000fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-07-02T13:14:14Z","title_canon_sha256":"8194f4373c1a57aecaa6a460b6bbfe36e75cdca21e83cd3faec7b5d159745770"},"schema_version":"1.0","source":{"id":"1207.0369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0369","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0369v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0369","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"65ZORH5ASUGI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"65ZORH5ASUGIBJA7","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"65ZORH5A","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:a789ffeb7353757d8370a2097aaa4d397f538930b42fc554de52540ceb5fd64b","target":"graph","created_at":"2026-05-18T02:21:08Z","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":"The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorithm. Recently, the analysis of this algorithm was refined and it was shown to have an expected optimization time (w.r.t. the number of fitness evaluations) of $\\Theta(n^{3.25}(\\log n)^{0.25})$.\n  In contrast to this simple algorithm, evolutionary algorithms used in practice usually employ refined recombination strategies in order to avoid the creation of infeasible offspring. We study extensions of the basic algorithm","authors_text":"Benjamin Doerr, Daniel Johannsen, Frank Neumann, Madeleine Theile, Timo K\\\"otzing","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-07-02T13:14:14Z","title":"More Effective Crossover Operators for the All-Pairs Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0369","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:d81ef681003958269fca4ccb47f5fa8a5ba1b119f30536506f8c63b22d3821a8","target":"record","created_at":"2026-05-18T02:21:08Z","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":"a29bff65fe6032f3cd648f61d979de6783a1c27d65f49409898c240b46000fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-07-02T13:14:14Z","title_canon_sha256":"8194f4373c1a57aecaa6a460b6bbfe36e75cdca21e83cd3faec7b5d159745770"},"schema_version":"1.0","source":{"id":"1207.0369","kind":"arxiv","version":1}},"canonical_sha256":"f772e89fa0950c80a41f994aa7e295d87d5b43b882f64325bf232af7e321dc6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f772e89fa0950c80a41f994aa7e295d87d5b43b882f64325bf232af7e321dc6e","first_computed_at":"2026-05-18T02:21:08.602477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:08.602477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zro5q8dlnRhpjao9ePUehWXPazyYnE6W/4PnNC9gDCuSgoPbJ0aNPza8h7eN3okKj351UvPg09LWALVzwFE7Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:08.602882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d81ef681003958269fca4ccb47f5fa8a5ba1b119f30536506f8c63b22d3821a8","sha256:a789ffeb7353757d8370a2097aaa4d397f538930b42fc554de52540ceb5fd64b"],"state_sha256":"7e5a540a68c7e1b10d87c51e58da7881204591ff6818b39bdea388956bcfb811"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHTq/1Bs/8FbXS52IckArh/je8mGXu3Vq5HKa8t0T7YJ2CV6MPh/I//JNgXGxpjGjw96hvPwlA42gmQFu3bgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:46:38.613887Z","bundle_sha256":"cf7c94aba082e5645c08b8551290e28c6b66178106ff90b07d5a024e6dade889"}}