{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KUG3I5YZ4DYCCNBZILERC43OP2","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":"cdfdacb91b831b10dd90f07d55bd8a48607a03b73aef409e5506b97368cdce14","cross_cats_sorted":["cs.AI","cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-07T13:57:18Z","title_canon_sha256":"219dddaadc509a07d40aab17c02450caba7fd22b42efa5abffd8c6d8ce7ae888"},"schema_version":"1.0","source":{"id":"1207.1794","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1794","created_at":"2026-05-18T03:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1794v1","created_at":"2026-05-18T03:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1794","created_at":"2026-05-18T03:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"KUG3I5YZ4DYC","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KUG3I5YZ4DYCCNBZ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KUG3I5YZ","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:7cb958153e7bca9bcd3a0f6939e2adf9f4b8def428e97daa98de27ad97185faa","target":"graph","created_at":"2026-05-18T03:51:34Z","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":"Combinatorial optimization is widely applied in a number of areas nowadays. Unfortunately, many combinatorial optimization problems are NP-hard which usually means that they are unsolvable in practice. However, it is often unnecessary to have an exact solution. In this case one may use heuristic approach to obtain a near-optimal solution in some reasonable time.\n  We focus on two combinatorial optimization problems, namely the Generalized Traveling Salesman Problem and the Multidimensional Assignment Problem. The first problem is an important generalization of the Traveling Salesman Problem; t","authors_text":"Daniel Karapetyan","cross_cats":["cs.AI","cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-07T13:57:18Z","title":"Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1794","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:ae853ba0b93705559640d298a10d475280b3e97101a6e4d4497c26fc4f0079fa","target":"record","created_at":"2026-05-18T03:51:34Z","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":"cdfdacb91b831b10dd90f07d55bd8a48607a03b73aef409e5506b97368cdce14","cross_cats_sorted":["cs.AI","cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-07T13:57:18Z","title_canon_sha256":"219dddaadc509a07d40aab17c02450caba7fd22b42efa5abffd8c6d8ce7ae888"},"schema_version":"1.0","source":{"id":"1207.1794","kind":"arxiv","version":1}},"canonical_sha256":"550db47719e0f021343942c911736e7ea38c69add322517348d582d20557071c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"550db47719e0f021343942c911736e7ea38c69add322517348d582d20557071c","first_computed_at":"2026-05-18T03:51:34.671476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:34.671476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MKS3sjX5miVJv84hFDq2nyqwf2Wl1PwU6VypbnPcfFE12EGE83kNHedSNISbmqJzhm9RAi7ExNWLbJpqb2KPCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:34.672323Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1794","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae853ba0b93705559640d298a10d475280b3e97101a6e4d4497c26fc4f0079fa","sha256:7cb958153e7bca9bcd3a0f6939e2adf9f4b8def428e97daa98de27ad97185faa"],"state_sha256":"36267a0bbb36dc13b9da4d5a3a68a45863c93c54d52b087c76cff6f0f532e155"}