{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GH2KP4EHJKSM4W7O6P3RCFIXOK","short_pith_number":"pith:GH2KP4EH","canonical_record":{"source":{"id":"1502.03699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-02-12T15:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"54f5e20b8cf9c6dea2626d5239e4d9bd7a13addc2caae8c28834cff605766986","abstract_canon_sha256":"08513ce2e4aa631e72d567f16d625cf0580b0d16a5fc47bc1710ace6e587c46d"},"schema_version":"1.0"},"canonical_sha256":"31f4a7f0874aa4ce5beef3f711151772b9c46a7146347bec15a94b129f6cfb5f","source":{"kind":"arxiv","id":"1502.03699","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03699","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03699v1","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03699","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"GH2KP4EHJKSM","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GH2KP4EHJKSM4W7O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GH2KP4EH","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GH2KP4EHJKSM4W7O6P3RCFIXOK","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-02-12T15:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"54f5e20b8cf9c6dea2626d5239e4d9bd7a13addc2caae8c28834cff605766986","abstract_canon_sha256":"08513ce2e4aa631e72d567f16d625cf0580b0d16a5fc47bc1710ace6e587c46d"},"schema_version":"1.0"},"canonical_sha256":"31f4a7f0874aa4ce5beef3f711151772b9c46a7146347bec15a94b129f6cfb5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:17.004829Z","signature_b64":"GRff1tZj78eQLW83bYhKJpclt/6X8zAYcZAHvHE1XWMiT6Tiy+MEMpPFtpVPEagHmxwpVfafX1lA02O1Mu0cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31f4a7f0874aa4ce5beef3f711151772b9c46a7146347bec15a94b129f6cfb5f","last_reissued_at":"2026-05-18T02:27:17.004127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:17.004127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03699","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:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GaYx9vFpb0RpBWCFtOfJs9mk7q3eJ1C0F0NsBhzGjUFoUaOgG5P37TZouoqTR/iek1P83Ewfu5cKFjCYVw/yAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:09:07.781408Z"},"content_sha256":"3c8dbc8bba135939b31da5b31db621c7284e9d05f848e99fe7e0bf7524ba86d6","schema_version":"1.0","event_id":"sha256:3c8dbc8bba135939b31da5b31db621c7284e9d05f848e99fe7e0bf7524ba86d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GH2KP4EHJKSM4W7O6P3RCFIXOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Solution Quality of a Multiobjective Optimization-based Evolutionary Algorithm for Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jun He, Yong Wang, Yuren Zhou","submitted_at":"2015-02-12T15:24:19Z","abstract_excerpt":"Multi-objective optimisation is regarded as one of the most promising ways for dealing with constrained optimisation problems in evolutionary optimisation. This paper presents a theoretical investigation of a multi-objective optimisation evolutionary algorithm for solving the 0-1 knapsack problem. Two initialisation methods are considered in the algorithm: local search initialisation and greedy search initialisation. Then the solution quality of the algorithm is analysed in terms of the approximation ratio."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03699","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:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OYRiCGmjur0usxnzmTwUwiRrl2fxoTq3rsxFv9INf6ZDXYVllWPS9Rpy2kyUoVyQrRfsOi/s8NDp9M4M3zuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:09:07.781999Z"},"content_sha256":"563fec38880e3b614540c8274a7699ecf0a16786e6897d8cce09f6a61674cbc0","schema_version":"1.0","event_id":"sha256:563fec38880e3b614540c8274a7699ecf0a16786e6897d8cce09f6a61674cbc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GH2KP4EHJKSM4W7O6P3RCFIXOK/bundle.json","state_url":"https://pith.science/pith/GH2KP4EHJKSM4W7O6P3RCFIXOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GH2KP4EHJKSM4W7O6P3RCFIXOK/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-25T15:09:07Z","links":{"resolver":"https://pith.science/pith/GH2KP4EHJKSM4W7O6P3RCFIXOK","bundle":"https://pith.science/pith/GH2KP4EHJKSM4W7O6P3RCFIXOK/bundle.json","state":"https://pith.science/pith/GH2KP4EHJKSM4W7O6P3RCFIXOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GH2KP4EHJKSM4W7O6P3RCFIXOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GH2KP4EHJKSM4W7O6P3RCFIXOK","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":"08513ce2e4aa631e72d567f16d625cf0580b0d16a5fc47bc1710ace6e587c46d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-02-12T15:24:19Z","title_canon_sha256":"54f5e20b8cf9c6dea2626d5239e4d9bd7a13addc2caae8c28834cff605766986"},"schema_version":"1.0","source":{"id":"1502.03699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03699","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03699v1","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03699","created_at":"2026-05-18T02:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"GH2KP4EHJKSM","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GH2KP4EHJKSM4W7O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GH2KP4EH","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:563fec38880e3b614540c8274a7699ecf0a16786e6897d8cce09f6a61674cbc0","target":"graph","created_at":"2026-05-18T02:27:17Z","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 optimisation is regarded as one of the most promising ways for dealing with constrained optimisation problems in evolutionary optimisation. This paper presents a theoretical investigation of a multi-objective optimisation evolutionary algorithm for solving the 0-1 knapsack problem. Two initialisation methods are considered in the algorithm: local search initialisation and greedy search initialisation. Then the solution quality of the algorithm is analysed in terms of the approximation ratio.","authors_text":"Jun He, Yong Wang, Yuren Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-02-12T15:24:19Z","title":"Analysis of Solution Quality of a Multiobjective Optimization-based Evolutionary Algorithm for Knapsack Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03699","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:3c8dbc8bba135939b31da5b31db621c7284e9d05f848e99fe7e0bf7524ba86d6","target":"record","created_at":"2026-05-18T02:27:17Z","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":"08513ce2e4aa631e72d567f16d625cf0580b0d16a5fc47bc1710ace6e587c46d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-02-12T15:24:19Z","title_canon_sha256":"54f5e20b8cf9c6dea2626d5239e4d9bd7a13addc2caae8c28834cff605766986"},"schema_version":"1.0","source":{"id":"1502.03699","kind":"arxiv","version":1}},"canonical_sha256":"31f4a7f0874aa4ce5beef3f711151772b9c46a7146347bec15a94b129f6cfb5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31f4a7f0874aa4ce5beef3f711151772b9c46a7146347bec15a94b129f6cfb5f","first_computed_at":"2026-05-18T02:27:17.004127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:17.004127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRff1tZj78eQLW83bYhKJpclt/6X8zAYcZAHvHE1XWMiT6Tiy+MEMpPFtpVPEagHmxwpVfafX1lA02O1Mu0cAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:17.004829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c8dbc8bba135939b31da5b31db621c7284e9d05f848e99fe7e0bf7524ba86d6","sha256:563fec38880e3b614540c8274a7699ecf0a16786e6897d8cce09f6a61674cbc0"],"state_sha256":"a96539625447fcf65f34a099e4585b11a5393c0f97b258415453a59257a75141"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXxINg8KgKt3ygYh9YmavqSy+DXjpxrKvBPy/ipMlj5Lky+0HXPJxiPlV7dNLpEMn/kOBULB5M/HS2abSkUlCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:09:07.784711Z","bundle_sha256":"1cbbb93758760b102035231044764f41294da850f92519c089c7bb1346748fa0"}}