{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4IKWHXK2WWI4R5RV5Q6QOOBD2H","short_pith_number":"pith:4IKWHXK2","canonical_record":{"source":{"id":"1202.1708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-08T14:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"d398c6b7fb818a5670f00383f95ae2e6d6305724f5c1e8f44d5f07bcde0fdd80","abstract_canon_sha256":"571dfd0a42a8f4a6b31913b9f3078de25896738fbcfed6e685ed6345a63286a3"},"schema_version":"1.0"},"canonical_sha256":"e21563dd5ab591c8f635ec3d073823d1e325c029501c2ee84997720f03af240f","source":{"kind":"arxiv","id":"1202.1708","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1708","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1708v2","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1708","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"4IKWHXK2WWI4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4IKWHXK2WWI4R5RV","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4IKWHXK2","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4IKWHXK2WWI4R5RV5Q6QOOBD2H","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-08T14:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"d398c6b7fb818a5670f00383f95ae2e6d6305724f5c1e8f44d5f07bcde0fdd80","abstract_canon_sha256":"571dfd0a42a8f4a6b31913b9f3078de25896738fbcfed6e685ed6345a63286a3"},"schema_version":"1.0"},"canonical_sha256":"e21563dd5ab591c8f635ec3d073823d1e325c029501c2ee84997720f03af240f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:41.866173Z","signature_b64":"HEI0z/s0zzSaFyWd5NjYzFwXVxD4KqeVlvXJLHh8o28qm4wM6zn8uVY4VX+4PviQHGsFiykJ6ioRT0CXsW7tDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e21563dd5ab591c8f635ec3d073823d1e325c029501c2ee84997720f03af240f","last_reissued_at":"2026-05-18T02:53:41.865357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:41.865357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1708","source_version":2,"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:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9XC+c4QWhXuz5579tpXLs76i9QGomeTkUQwxDdLE3ksyOrxiBcsgM3Kaoh0Hf22h2shPTKmeKgM0qvIi+llBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:40:34.095864Z"},"content_sha256":"f088de2a385171b20c12b7c33f1164d776f591740ce9d06e33bac53277f85a0c","schema_version":"1.0","event_id":"sha256:f088de2a385171b20c12b7c33f1164d776f591740ce9d06e33bac53277f85a0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4IKWHXK2WWI4R5RV5Q6QOOBD2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Boris Mitavskiy, Jun He","submitted_at":"2012-02-08T14:30:55Z","abstract_excerpt":"Nowadays hybrid evolutionary algorithms, i.e, heuristic search algorithms combining several mutation operators some of which are meant to implement stochastically a well known technique designed for the specific problem in question while some others playing the role of random search, have become rather popular for tackling various NP-hard optimization problems. While empirical studies demonstrate that hybrid evolutionary algorithms are frequently successful at finding solutions having fitness sufficiently close to the optimal, many fewer articles address the computational complexity in a mathe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1708","kind":"arxiv","version":2},"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:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IOg2NT5HXKd8J97fU27kC0ugSgXryvB9r/2vQJ7mDZjyCZyBVlJlQC7QNNZAvn2h/J9x6Vvjk+xg6CrHKuyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:40:34.096223Z"},"content_sha256":"cd9d0dc5b46c67ca2aa37870fe1879503dd88140c02c0b8c3e43037b118ec6bf","schema_version":"1.0","event_id":"sha256:cd9d0dc5b46c67ca2aa37870fe1879503dd88140c02c0b8c3e43037b118ec6bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IKWHXK2WWI4R5RV5Q6QOOBD2H/bundle.json","state_url":"https://pith.science/pith/4IKWHXK2WWI4R5RV5Q6QOOBD2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IKWHXK2WWI4R5RV5Q6QOOBD2H/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-26T02:40:34Z","links":{"resolver":"https://pith.science/pith/4IKWHXK2WWI4R5RV5Q6QOOBD2H","bundle":"https://pith.science/pith/4IKWHXK2WWI4R5RV5Q6QOOBD2H/bundle.json","state":"https://pith.science/pith/4IKWHXK2WWI4R5RV5Q6QOOBD2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IKWHXK2WWI4R5RV5Q6QOOBD2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4IKWHXK2WWI4R5RV5Q6QOOBD2H","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":"571dfd0a42a8f4a6b31913b9f3078de25896738fbcfed6e685ed6345a63286a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-08T14:30:55Z","title_canon_sha256":"d398c6b7fb818a5670f00383f95ae2e6d6305724f5c1e8f44d5f07bcde0fdd80"},"schema_version":"1.0","source":{"id":"1202.1708","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1708","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1708v2","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1708","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"4IKWHXK2WWI4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4IKWHXK2WWI4R5RV","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4IKWHXK2","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:cd9d0dc5b46c67ca2aa37870fe1879503dd88140c02c0b8c3e43037b118ec6bf","target":"graph","created_at":"2026-05-18T02:53:41Z","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":"Nowadays hybrid evolutionary algorithms, i.e, heuristic search algorithms combining several mutation operators some of which are meant to implement stochastically a well known technique designed for the specific problem in question while some others playing the role of random search, have become rather popular for tackling various NP-hard optimization problems. While empirical studies demonstrate that hybrid evolutionary algorithms are frequently successful at finding solutions having fitness sufficiently close to the optimal, many fewer articles address the computational complexity in a mathe","authors_text":"Boris Mitavskiy, Jun He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-08T14:30:55Z","title":"A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1708","kind":"arxiv","version":2},"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:f088de2a385171b20c12b7c33f1164d776f591740ce9d06e33bac53277f85a0c","target":"record","created_at":"2026-05-18T02:53:41Z","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":"571dfd0a42a8f4a6b31913b9f3078de25896738fbcfed6e685ed6345a63286a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-08T14:30:55Z","title_canon_sha256":"d398c6b7fb818a5670f00383f95ae2e6d6305724f5c1e8f44d5f07bcde0fdd80"},"schema_version":"1.0","source":{"id":"1202.1708","kind":"arxiv","version":2}},"canonical_sha256":"e21563dd5ab591c8f635ec3d073823d1e325c029501c2ee84997720f03af240f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e21563dd5ab591c8f635ec3d073823d1e325c029501c2ee84997720f03af240f","first_computed_at":"2026-05-18T02:53:41.865357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:41.865357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HEI0z/s0zzSaFyWd5NjYzFwXVxD4KqeVlvXJLHh8o28qm4wM6zn8uVY4VX+4PviQHGsFiykJ6ioRT0CXsW7tDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:41.866173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1708","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f088de2a385171b20c12b7c33f1164d776f591740ce9d06e33bac53277f85a0c","sha256:cd9d0dc5b46c67ca2aa37870fe1879503dd88140c02c0b8c3e43037b118ec6bf"],"state_sha256":"8b33cf6cc22a182510fd8f228dff05b7384ce3539bc201aa88b61d02430b104a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kbB/JLnVX+7K4oEmgHDUrRBwPydAK1D4sA4RynwoVpeer6eJJnEsVoPgEkqtn+R270aqORXtBhYAYsaIWTEcDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:40:34.099004Z","bundle_sha256":"cb996c8fbd8582a7962f58fe7737f695e3e7b7ce0795632a8d714b4002297b7a"}}