{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4GCEZALGEFBWGKYQK2HQ6NCUJI","short_pith_number":"pith:4GCEZALG","canonical_record":{"source":{"id":"1404.0868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-03T11:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"d5369078401e4967813d7fe4091c8125376863a39dd1798f41759d6edeca9987","abstract_canon_sha256":"24ef1fa060781547de018522aa98771786cbf3245d5b65f46001178b0e48e932"},"schema_version":"1.0"},"canonical_sha256":"e1844c81662143632b10568f0f34544a298f8977edf3af86bb9188489daa6f12","source":{"kind":"arxiv","id":"1404.0868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0868","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0868v1","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0868","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"4GCEZALGEFBW","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4GCEZALGEFBWGKYQ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4GCEZALG","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4GCEZALGEFBWGKYQK2HQ6NCUJI","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-03T11:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"d5369078401e4967813d7fe4091c8125376863a39dd1798f41759d6edeca9987","abstract_canon_sha256":"24ef1fa060781547de018522aa98771786cbf3245d5b65f46001178b0e48e932"},"schema_version":"1.0"},"canonical_sha256":"e1844c81662143632b10568f0f34544a298f8977edf3af86bb9188489daa6f12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:55.169249Z","signature_b64":"atwTci5ePsoc+9nOgiCx5q7v6+uXnuQxYH71jam86iM8SZFZYNmyzMyraI17IaUvHRGlS8NUQJZ2t1Kg6vW3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1844c81662143632b10568f0f34544a298f8977edf3af86bb9188489daa6f12","last_reissued_at":"2026-05-18T02:54:55.168754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:55.168754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0868","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:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+hd97+YstQT2ljWh1OfElD4RyXrkcnRJn9RUx0UVLwnwYouzoH9CXFTkQex3AAdTJ8qs+t6MwUZsSbBSnCrPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:32:39.562050Z"},"content_sha256":"90d721e332b81a3a8727e0f58bba3b760ba30e915a9a91f66786d35ea5cbe3fd","schema_version":"1.0","event_id":"sha256:90d721e332b81a3a8727e0f58bba3b760ba30e915a9a91f66786d35ea5cbe3fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4GCEZALGEFBWGKYQK2HQ6NCUJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Feidun He, Hongbin Dong, Jun He","submitted_at":"2014-04-03T11:46:42Z","abstract_excerpt":"The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time. On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly. A naturally arising question is whether genetic algorithms are able to find solutions as good as approximation algorithms do. This paper presents a novel multi-objective optimisation genetic algorithm for solving the 0-1 knapsack problem. Experiment results show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0868","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:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDrjCOPPyxUaXHBQfBNPSp/B2eZUU8hM85AJsx46l+ydblFdW3VXZ5pozzkEOTG4oNfpG+o0MMLg3MJDiDLVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:32:39.562433Z"},"content_sha256":"2c96f44e3671cf2b6813b360565fa04282d1501ac965e8e552de6eb2c1941349","schema_version":"1.0","event_id":"sha256:2c96f44e3671cf2b6813b360565fa04282d1501ac965e8e552de6eb2c1941349"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GCEZALGEFBWGKYQK2HQ6NCUJI/bundle.json","state_url":"https://pith.science/pith/4GCEZALGEFBWGKYQK2HQ6NCUJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GCEZALGEFBWGKYQK2HQ6NCUJI/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-31T04:32:39Z","links":{"resolver":"https://pith.science/pith/4GCEZALGEFBWGKYQK2HQ6NCUJI","bundle":"https://pith.science/pith/4GCEZALGEFBWGKYQK2HQ6NCUJI/bundle.json","state":"https://pith.science/pith/4GCEZALGEFBWGKYQK2HQ6NCUJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GCEZALGEFBWGKYQK2HQ6NCUJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4GCEZALGEFBWGKYQK2HQ6NCUJI","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":"24ef1fa060781547de018522aa98771786cbf3245d5b65f46001178b0e48e932","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-03T11:46:42Z","title_canon_sha256":"d5369078401e4967813d7fe4091c8125376863a39dd1798f41759d6edeca9987"},"schema_version":"1.0","source":{"id":"1404.0868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0868","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0868v1","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0868","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"4GCEZALGEFBW","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4GCEZALGEFBWGKYQ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4GCEZALG","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:2c96f44e3671cf2b6813b360565fa04282d1501ac965e8e552de6eb2c1941349","target":"graph","created_at":"2026-05-18T02:54:55Z","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 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time. On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly. A naturally arising question is whether genetic algorithms are able to find solutions as good as approximation algorithms do. This paper presents a novel multi-objective optimisation genetic algorithm for solving the 0-1 knapsack problem. Experiment results show t","authors_text":"Feidun He, Hongbin Dong, Jun He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-03T11:46:42Z","title":"A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0868","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:90d721e332b81a3a8727e0f58bba3b760ba30e915a9a91f66786d35ea5cbe3fd","target":"record","created_at":"2026-05-18T02:54:55Z","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":"24ef1fa060781547de018522aa98771786cbf3245d5b65f46001178b0e48e932","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-03T11:46:42Z","title_canon_sha256":"d5369078401e4967813d7fe4091c8125376863a39dd1798f41759d6edeca9987"},"schema_version":"1.0","source":{"id":"1404.0868","kind":"arxiv","version":1}},"canonical_sha256":"e1844c81662143632b10568f0f34544a298f8977edf3af86bb9188489daa6f12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1844c81662143632b10568f0f34544a298f8977edf3af86bb9188489daa6f12","first_computed_at":"2026-05-18T02:54:55.168754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:55.168754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"atwTci5ePsoc+9nOgiCx5q7v6+uXnuQxYH71jam86iM8SZFZYNmyzMyraI17IaUvHRGlS8NUQJZ2t1Kg6vW3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:55.169249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90d721e332b81a3a8727e0f58bba3b760ba30e915a9a91f66786d35ea5cbe3fd","sha256:2c96f44e3671cf2b6813b360565fa04282d1501ac965e8e552de6eb2c1941349"],"state_sha256":"ee2a4ae7905cc49e3ccf3bd0ebc2f4de7b23f3f573dd303940e775a5fb63aeef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbsIJThi9oKYaBxSENx2xRJTMWuD40GNnSZ4SJK8/i7auqqAcIxwyVYV6l5oHmaCFMXmQxWbZc0KohV1OKEwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:32:39.564695Z","bundle_sha256":"8b356aae17b476d9430b764a02946ddf5b41871895daddce199443f894faea13"}}