{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QMRHEYEGQ6YGFEFVTF6I67DXCF","short_pith_number":"pith:QMRHEYEG","canonical_record":{"source":{"id":"1104.2644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-04-13T23:24:49Z","cross_cats_sorted":[],"title_canon_sha256":"04eb3bf21d44b37a1f585c508219920fdb3a0073e7125dc6c574daa12881b9c5","abstract_canon_sha256":"08ab159d8d6d7d7ab558399924f81cab4552a71bc1c3014a09881f73da7fe866"},"schema_version":"1.0"},"canonical_sha256":"832272608687b06290b5997c8f7c77115c274d80d59a100327987f82ea9c5e23","source":{"kind":"arxiv","id":"1104.2644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2644","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2644v1","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2644","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"QMRHEYEGQ6YG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QMRHEYEGQ6YGFEFV","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QMRHEYEG","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QMRHEYEGQ6YGFEFVTF6I67DXCF","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-04-13T23:24:49Z","cross_cats_sorted":[],"title_canon_sha256":"04eb3bf21d44b37a1f585c508219920fdb3a0073e7125dc6c574daa12881b9c5","abstract_canon_sha256":"08ab159d8d6d7d7ab558399924f81cab4552a71bc1c3014a09881f73da7fe866"},"schema_version":"1.0"},"canonical_sha256":"832272608687b06290b5997c8f7c77115c274d80d59a100327987f82ea9c5e23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:27.142484Z","signature_b64":"sl9aC/vifwSJESlPA3ihqkNsnXsYKdRywrWBlwjodKMf5V1OvIc2nMBOnby5fFaSFzwUQiUi5u0qeHYpQ7WwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"832272608687b06290b5997c8f7c77115c274d80d59a100327987f82ea9c5e23","last_reissued_at":"2026-05-18T04:24:27.141899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:27.141899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2644","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-18T04:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAJCAgh/ysXsjHWQ5q+e7Gx89JbGV1V/QAeVC/iLdYCYGE41Xfu9wC0OjPPhUtz8sIogRVwEnm2hR53VTY0lDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:05:23.048194Z"},"content_sha256":"3f85a0135264f77810c9f5b6cffd6b14fba9c7402bc0fee5ed93733317fae8ab","schema_version":"1.0","event_id":"sha256:3f85a0135264f77810c9f5b6cffd6b14fba9c7402bc0fee5ed93733317fae8ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QMRHEYEGQ6YGFEFVTF6I67DXCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Idealized Dynamic Population Sizing for Uniformly Scaled Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Fernando G. Lobo","submitted_at":"2011-04-13T23:24:49Z","abstract_excerpt":"This paper explores an idealized dynamic population sizing strategy for solving additive decomposable problems of uniform scale. The method is designed on top of the foundations of existing population sizing theory for this class of problems, and is carefully compared with an optimal fixed population sized genetic algorithm. The resulting strategy should be close to a lower bound in terms of what can be achieved, performance-wise, by self-adjusting population sizing algorithms for this class of problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2644","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-18T04:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LveFdRQxst2ZDZmhUx97PQanpBrP3SWXgQoQpY9FuEoPQPqFCryENkZLYZlOKypenA4PeyysXQ7Fu1biTsezCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:05:23.048547Z"},"content_sha256":"0944d4b33d1edc105548039081c2338177a175e96d2e08b4a70a6dcfd1ed3b47","schema_version":"1.0","event_id":"sha256:0944d4b33d1edc105548039081c2338177a175e96d2e08b4a70a6dcfd1ed3b47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMRHEYEGQ6YGFEFVTF6I67DXCF/bundle.json","state_url":"https://pith.science/pith/QMRHEYEGQ6YGFEFVTF6I67DXCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMRHEYEGQ6YGFEFVTF6I67DXCF/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-26T15:05:23Z","links":{"resolver":"https://pith.science/pith/QMRHEYEGQ6YGFEFVTF6I67DXCF","bundle":"https://pith.science/pith/QMRHEYEGQ6YGFEFVTF6I67DXCF/bundle.json","state":"https://pith.science/pith/QMRHEYEGQ6YGFEFVTF6I67DXCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMRHEYEGQ6YGFEFVTF6I67DXCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QMRHEYEGQ6YGFEFVTF6I67DXCF","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":"08ab159d8d6d7d7ab558399924f81cab4552a71bc1c3014a09881f73da7fe866","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-04-13T23:24:49Z","title_canon_sha256":"04eb3bf21d44b37a1f585c508219920fdb3a0073e7125dc6c574daa12881b9c5"},"schema_version":"1.0","source":{"id":"1104.2644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2644","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2644v1","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2644","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"QMRHEYEGQ6YG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QMRHEYEGQ6YGFEFV","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QMRHEYEG","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:0944d4b33d1edc105548039081c2338177a175e96d2e08b4a70a6dcfd1ed3b47","target":"graph","created_at":"2026-05-18T04:24:27Z","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":"This paper explores an idealized dynamic population sizing strategy for solving additive decomposable problems of uniform scale. The method is designed on top of the foundations of existing population sizing theory for this class of problems, and is carefully compared with an optimal fixed population sized genetic algorithm. The resulting strategy should be close to a lower bound in terms of what can be achieved, performance-wise, by self-adjusting population sizing algorithms for this class of problems.","authors_text":"Fernando G. Lobo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-04-13T23:24:49Z","title":"Idealized Dynamic Population Sizing for Uniformly Scaled Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2644","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:3f85a0135264f77810c9f5b6cffd6b14fba9c7402bc0fee5ed93733317fae8ab","target":"record","created_at":"2026-05-18T04:24:27Z","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":"08ab159d8d6d7d7ab558399924f81cab4552a71bc1c3014a09881f73da7fe866","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-04-13T23:24:49Z","title_canon_sha256":"04eb3bf21d44b37a1f585c508219920fdb3a0073e7125dc6c574daa12881b9c5"},"schema_version":"1.0","source":{"id":"1104.2644","kind":"arxiv","version":1}},"canonical_sha256":"832272608687b06290b5997c8f7c77115c274d80d59a100327987f82ea9c5e23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"832272608687b06290b5997c8f7c77115c274d80d59a100327987f82ea9c5e23","first_computed_at":"2026-05-18T04:24:27.141899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:27.141899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sl9aC/vifwSJESlPA3ihqkNsnXsYKdRywrWBlwjodKMf5V1OvIc2nMBOnby5fFaSFzwUQiUi5u0qeHYpQ7WwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:27.142484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f85a0135264f77810c9f5b6cffd6b14fba9c7402bc0fee5ed93733317fae8ab","sha256:0944d4b33d1edc105548039081c2338177a175e96d2e08b4a70a6dcfd1ed3b47"],"state_sha256":"8913ac90e3b3ece047bdcd63be1761ffd70387376f7b71e729783fba8917519f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQzAci5qnQIch2BwRdbYnUv9LxyDJSz5t21KxN96qEOgy+/R4jImSpM53AkCGllHy+A3TnW41vBhJClUBEZrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:05:23.050517Z","bundle_sha256":"8c856e8e079428b437f1ff7886fa607da97056ada320a7bb7007927a5d507854"}}