{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PLZCLP7QAFGLPIDEVE5LCNU6QW","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":"8f7a0489ef047cb91f14c9eaee865480aaef452145d8f83c391a3d40d76270d7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-31T15:42:55Z","title_canon_sha256":"f7a730fbbf0c23e2ad8bc360a79690eeef5b8317eec533f122abbc3e90f3bbe2"},"schema_version":"1.0","source":{"id":"1808.10813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10813","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10813v1","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10813","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"pith_short_12","alias_value":"PLZCLP7QAFGL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PLZCLP7QAFGLPIDE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PLZCLP7Q","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:3b6bdf64df853e9a8625d39119414436a58c747920cdf4db0917058122e47108","target":"graph","created_at":"2026-05-18T00:06:44Z","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":"Many optimization techniques evaluate solutions consecutively, where the next candidate for evaluation is determined by the results of previous evaluations. For example, these include iterative methods, \"black box\" optimization algorithms, simulated annealing, evolutionary algorithms and tabu search, to name a few. When solving an optimization problem, these algorithms evaluate a large number of solutions, which raises the following question: Is it possible to learn something about the optimum using these solutions? In this paper, we define this \"learning\" question in terms of a logistic regre","authors_text":"Hesam Shams, Oleg V. Shylo","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-31T15:42:55Z","title":"Boosting Binary Optimization via Binary Classification: A Case Study of Job Shop Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10813","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:ac66c271bc0ef45a35f1d60131aaf8eddc3628d0c4ccb098f0e15786627cd817","target":"record","created_at":"2026-05-18T00:06:44Z","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":"8f7a0489ef047cb91f14c9eaee865480aaef452145d8f83c391a3d40d76270d7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-31T15:42:55Z","title_canon_sha256":"f7a730fbbf0c23e2ad8bc360a79690eeef5b8317eec533f122abbc3e90f3bbe2"},"schema_version":"1.0","source":{"id":"1808.10813","kind":"arxiv","version":1}},"canonical_sha256":"7af225bff0014cb7a064a93ab1369e85be16d8549607b15272e9df62f7bcca04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7af225bff0014cb7a064a93ab1369e85be16d8549607b15272e9df62f7bcca04","first_computed_at":"2026-05-18T00:06:44.522601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:44.522601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m2AYYZRIYEg3NoU3c/+hNDezZqjLHA8mu2ei0hoGmgpU+asv0Nu+D4UlAr/jmg7lCh3oViIiQFFqxFJO3hByAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:44.522977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac66c271bc0ef45a35f1d60131aaf8eddc3628d0c4ccb098f0e15786627cd817","sha256:3b6bdf64df853e9a8625d39119414436a58c747920cdf4db0917058122e47108"],"state_sha256":"a52ea8457cfa6131d2e1e69506deb0bb9e4322165dcb091b8af3575ad2da92fc"}