{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I4FKBSVDPDHK3K3YT6SBW2TLRR","short_pith_number":"pith:I4FKBSVD","canonical_record":{"source":{"id":"1903.01885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-29T17:30:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4b794ae93cc0e59b7fcaf011c57747a5bdec20d7cf7074bc10b5126ccfdaf5e8","abstract_canon_sha256":"9ce7fa40df91ef80777e636a819e57c33c42d8eb72bd35a4fbcd6ec536a51e8b"},"schema_version":"1.0"},"canonical_sha256":"470aa0caa378ceadab789fa41b6a6b8c58efeeffff7867abf9c8899b8077c85a","source":{"kind":"arxiv","id":"1903.01885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01885","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01885v1","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01885","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"I4FKBSVDPDHK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I4FKBSVDPDHK3K3Y","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I4FKBSVD","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I4FKBSVDPDHK3K3YT6SBW2TLRR","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-29T17:30:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4b794ae93cc0e59b7fcaf011c57747a5bdec20d7cf7074bc10b5126ccfdaf5e8","abstract_canon_sha256":"9ce7fa40df91ef80777e636a819e57c33c42d8eb72bd35a4fbcd6ec536a51e8b"},"schema_version":"1.0"},"canonical_sha256":"470aa0caa378ceadab789fa41b6a6b8c58efeeffff7867abf9c8899b8077c85a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.508335Z","signature_b64":"gXpx5F5YjClbREc/m/E86aHh2Kfda9VjPeqEHUrQA8LR2syXkC+zvCXZD8YNqnfew/MEQJ9+3BLg/HVCS+dlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"470aa0caa378ceadab789fa41b6a6b8c58efeeffff7867abf9c8899b8077c85a","last_reissued_at":"2026-05-17T23:51:59.507853Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.507853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01885","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-17T23:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1jkcF4BlOC+APo3mULaRz+jkn75433vm7DnOzhJqB9XMVwfkC5nb+G2pAbLJlPUR6gIuYHOn8nHktZhCtLcyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:34:26.257062Z"},"content_sha256":"998c64dd8881b1fa52cab42ce6faee2e7f4831a0378478d413e8f8765a24de57","schema_version":"1.0","event_id":"sha256:998c64dd8881b1fa52cab42ce6faee2e7f4831a0378478d413e8f8765a24de57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I4FKBSVDPDHK3K3YT6SBW2TLRR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evolutionary framework for two-stage stochastic resource allocation problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Evandro C. Bracht, F\\'abio L. Usberti, M\\'ario C. San Felice, Pedro H. D. B. Hokama","submitted_at":"2018-11-29T17:30:38Z","abstract_excerpt":"Resource allocation problems are a family of problems in which resources must be selected to satisfy given demands. This paper focuses on the two-stage stochastic generalization of resource allocation problems where future demands are expressed in a finite number of possible scenarios. The goal is to select cost effective resources to be acquired in the present time (first stage), and to implement a complete solution for each scenario (second stage), while minimizing the total expected cost of the choices in both stages.\n  We propose an evolutionary framework for solving general two-stage stoc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01885","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-17T23:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x8unLndAq/b+KnOLaIcBvi9Ky9sMbZAnp/u0hpJlWb1zQhTstqrfjJo4AakvTYRBLPPich/qcLp65LKJW3xQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:34:26.257423Z"},"content_sha256":"01db802d4cd02d89b2ce94097ab85d26d0724f3ae235834e221a5bddb21e740b","schema_version":"1.0","event_id":"sha256:01db802d4cd02d89b2ce94097ab85d26d0724f3ae235834e221a5bddb21e740b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4FKBSVDPDHK3K3YT6SBW2TLRR/bundle.json","state_url":"https://pith.science/pith/I4FKBSVDPDHK3K3YT6SBW2TLRR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4FKBSVDPDHK3K3YT6SBW2TLRR/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-04T18:34:26Z","links":{"resolver":"https://pith.science/pith/I4FKBSVDPDHK3K3YT6SBW2TLRR","bundle":"https://pith.science/pith/I4FKBSVDPDHK3K3YT6SBW2TLRR/bundle.json","state":"https://pith.science/pith/I4FKBSVDPDHK3K3YT6SBW2TLRR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4FKBSVDPDHK3K3YT6SBW2TLRR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I4FKBSVDPDHK3K3YT6SBW2TLRR","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":"9ce7fa40df91ef80777e636a819e57c33c42d8eb72bd35a4fbcd6ec536a51e8b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-29T17:30:38Z","title_canon_sha256":"4b794ae93cc0e59b7fcaf011c57747a5bdec20d7cf7074bc10b5126ccfdaf5e8"},"schema_version":"1.0","source":{"id":"1903.01885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01885","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01885v1","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01885","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"I4FKBSVDPDHK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I4FKBSVDPDHK3K3Y","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I4FKBSVD","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:01db802d4cd02d89b2ce94097ab85d26d0724f3ae235834e221a5bddb21e740b","target":"graph","created_at":"2026-05-17T23:51:59Z","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":"Resource allocation problems are a family of problems in which resources must be selected to satisfy given demands. This paper focuses on the two-stage stochastic generalization of resource allocation problems where future demands are expressed in a finite number of possible scenarios. The goal is to select cost effective resources to be acquired in the present time (first stage), and to implement a complete solution for each scenario (second stage), while minimizing the total expected cost of the choices in both stages.\n  We propose an evolutionary framework for solving general two-stage stoc","authors_text":"Evandro C. Bracht, F\\'abio L. Usberti, M\\'ario C. San Felice, Pedro H. D. B. Hokama","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-29T17:30:38Z","title":"Evolutionary framework for two-stage stochastic resource allocation problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01885","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:998c64dd8881b1fa52cab42ce6faee2e7f4831a0378478d413e8f8765a24de57","target":"record","created_at":"2026-05-17T23:51:59Z","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":"9ce7fa40df91ef80777e636a819e57c33c42d8eb72bd35a4fbcd6ec536a51e8b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-29T17:30:38Z","title_canon_sha256":"4b794ae93cc0e59b7fcaf011c57747a5bdec20d7cf7074bc10b5126ccfdaf5e8"},"schema_version":"1.0","source":{"id":"1903.01885","kind":"arxiv","version":1}},"canonical_sha256":"470aa0caa378ceadab789fa41b6a6b8c58efeeffff7867abf9c8899b8077c85a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"470aa0caa378ceadab789fa41b6a6b8c58efeeffff7867abf9c8899b8077c85a","first_computed_at":"2026-05-17T23:51:59.507853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:59.507853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXpx5F5YjClbREc/m/E86aHh2Kfda9VjPeqEHUrQA8LR2syXkC+zvCXZD8YNqnfew/MEQJ9+3BLg/HVCS+dlDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:59.508335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:998c64dd8881b1fa52cab42ce6faee2e7f4831a0378478d413e8f8765a24de57","sha256:01db802d4cd02d89b2ce94097ab85d26d0724f3ae235834e221a5bddb21e740b"],"state_sha256":"62202219f184e3e01e669a58da571f72e959e13304832cd3ce4ad2f023a21efd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b0Awqmqhv9jZFhxJbUNem8ONuj5TD7vxyIrKlrikKiLtObAMdJT1ueGlsiPWb00/DJPE3ysihsWAgZbIlDkBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:34:26.259410Z","bundle_sha256":"c52340664ac86bc51259dd6d948f65cc9b7993ad491aee0b90c5e0536a2e9e48"}}