{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LKPLXWUQIWPYNMJZSXXSKHMYFY","short_pith_number":"pith:LKPLXWUQ","canonical_record":{"source":{"id":"1707.08776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T08:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"3b1830c1837b08cd83ff49aefc7c8f2c534d9b1eaf6edb5ac9b16767e186aa68","abstract_canon_sha256":"da1e03e1f9cac9faa174ac7bd3d12abb27bb6670033b78fbc94f1c15a4ac3b45"},"schema_version":"1.0"},"canonical_sha256":"5a9ebbda90459f86b13995ef251d982e1976a6593db90567051d11a480c55e17","source":{"kind":"arxiv","id":"1707.08776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08776","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08776v1","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08776","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"LKPLXWUQIWPY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKPLXWUQIWPYNMJZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKPLXWUQ","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LKPLXWUQIWPYNMJZSXXSKHMYFY","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T08:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"3b1830c1837b08cd83ff49aefc7c8f2c534d9b1eaf6edb5ac9b16767e186aa68","abstract_canon_sha256":"da1e03e1f9cac9faa174ac7bd3d12abb27bb6670033b78fbc94f1c15a4ac3b45"},"schema_version":"1.0"},"canonical_sha256":"5a9ebbda90459f86b13995ef251d982e1976a6593db90567051d11a480c55e17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:19.492453Z","signature_b64":"1J2jl1LxW0I4iboQesfNvsRqGvQkCCMm+wNjV/BWbwpnX7vD5YdYKeoU3YYF6o3Mh68ae4hz4TzSm+rE5z5tAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a9ebbda90459f86b13995ef251d982e1976a6593db90567051d11a480c55e17","last_reissued_at":"2026-05-18T00:39:19.491752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:19.491752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08776","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-18T00:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JZ+L7TNsdV9821TfRjBjoAhJyJLQbjtwxfYEwS0O6e9Y+QO6bs9OjXbypyKOr45Am6LDr5zPuWDp79rYiChiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:21:58.241710Z"},"content_sha256":"ebc15374f019d85e57762ae5e7deac730964e11f5feecc35d14663e0efabe942","schema_version":"1.0","event_id":"sha256:ebc15374f019d85e57762ae5e7deac730964e11f5feecc35d14663e0efabe942"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LKPLXWUQIWPYNMJZSXXSKHMYFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Evolutionary Stochastic-Local-Search Framework for One-Dimensional Cutting-Stock Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Georgios C. Chasparis, Michael Rossbory, Verena Haunschmid","submitted_at":"2017-07-27T08:31:17Z","abstract_excerpt":"We introduce an evolutionary stochastic-local-search (SLS) algorithm for addressing a generalized version of the so-called 1/V/D/R cutting-stock problem. Cutting-stock problems are encountered often in industrial environments and the ability to address them efficiently usually results in large economic benefits. Traditionally linear-programming-based techniques have been utilized to address such problems, however their flexibility might be limited when nonlinear constraints and objective functions are introduced. To this end, this paper proposes an evolutionary SLS algorithm for addressing one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08776","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-18T00:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBo59roM6MLdx/cZd2TUSgQboowBhXjf6SP6xa+N/qq03KGPDGSR/iSvo7KhyMG/FpNsYlAa1Bt5zoKVe73gAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:21:58.242394Z"},"content_sha256":"2f28135826931e97963c5ba4d98053afdd0812a4c40715ccb4db66b0ee639ad1","schema_version":"1.0","event_id":"sha256:2f28135826931e97963c5ba4d98053afdd0812a4c40715ccb4db66b0ee639ad1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKPLXWUQIWPYNMJZSXXSKHMYFY/bundle.json","state_url":"https://pith.science/pith/LKPLXWUQIWPYNMJZSXXSKHMYFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKPLXWUQIWPYNMJZSXXSKHMYFY/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-06-10T16:21:58Z","links":{"resolver":"https://pith.science/pith/LKPLXWUQIWPYNMJZSXXSKHMYFY","bundle":"https://pith.science/pith/LKPLXWUQIWPYNMJZSXXSKHMYFY/bundle.json","state":"https://pith.science/pith/LKPLXWUQIWPYNMJZSXXSKHMYFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKPLXWUQIWPYNMJZSXXSKHMYFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LKPLXWUQIWPYNMJZSXXSKHMYFY","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":"da1e03e1f9cac9faa174ac7bd3d12abb27bb6670033b78fbc94f1c15a4ac3b45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T08:31:17Z","title_canon_sha256":"3b1830c1837b08cd83ff49aefc7c8f2c534d9b1eaf6edb5ac9b16767e186aa68"},"schema_version":"1.0","source":{"id":"1707.08776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08776","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08776v1","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08776","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"LKPLXWUQIWPY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKPLXWUQIWPYNMJZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKPLXWUQ","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:2f28135826931e97963c5ba4d98053afdd0812a4c40715ccb4db66b0ee639ad1","target":"graph","created_at":"2026-05-18T00:39:19Z","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":"We introduce an evolutionary stochastic-local-search (SLS) algorithm for addressing a generalized version of the so-called 1/V/D/R cutting-stock problem. Cutting-stock problems are encountered often in industrial environments and the ability to address them efficiently usually results in large economic benefits. Traditionally linear-programming-based techniques have been utilized to address such problems, however their flexibility might be limited when nonlinear constraints and objective functions are introduced. To this end, this paper proposes an evolutionary SLS algorithm for addressing one","authors_text":"Georgios C. Chasparis, Michael Rossbory, Verena Haunschmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T08:31:17Z","title":"An Evolutionary Stochastic-Local-Search Framework for One-Dimensional Cutting-Stock Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08776","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:ebc15374f019d85e57762ae5e7deac730964e11f5feecc35d14663e0efabe942","target":"record","created_at":"2026-05-18T00:39:19Z","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":"da1e03e1f9cac9faa174ac7bd3d12abb27bb6670033b78fbc94f1c15a4ac3b45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T08:31:17Z","title_canon_sha256":"3b1830c1837b08cd83ff49aefc7c8f2c534d9b1eaf6edb5ac9b16767e186aa68"},"schema_version":"1.0","source":{"id":"1707.08776","kind":"arxiv","version":1}},"canonical_sha256":"5a9ebbda90459f86b13995ef251d982e1976a6593db90567051d11a480c55e17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a9ebbda90459f86b13995ef251d982e1976a6593db90567051d11a480c55e17","first_computed_at":"2026-05-18T00:39:19.491752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:19.491752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1J2jl1LxW0I4iboQesfNvsRqGvQkCCMm+wNjV/BWbwpnX7vD5YdYKeoU3YYF6o3Mh68ae4hz4TzSm+rE5z5tAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:19.492453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebc15374f019d85e57762ae5e7deac730964e11f5feecc35d14663e0efabe942","sha256:2f28135826931e97963c5ba4d98053afdd0812a4c40715ccb4db66b0ee639ad1"],"state_sha256":"2a971e8bc17e89d343be1645724ab09883d645968d3fd0258e0a8636f90576d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2u2ZJtt+77SEWPrdfvA3q9V2m+yZOgo7bsPDPRuRlGWt9MVOL9CXNxP65YfF+Wg6Wsqlh8pB0PR1s0bUehQ6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:21:58.246483Z","bundle_sha256":"83bdd25e2f210d0583cbd4759ff1650b07022ce0362bac72c97e90b7623fb900"}}