{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:74IMAZ6TIGXN2ETCC7ZS2NPYY5","short_pith_number":"pith:74IMAZ6T","canonical_record":{"source":{"id":"1307.6246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-23T21:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"142a9c9e03568bc87228e32e5c3d06a8346d0ff7665eef37e821cb3d5c44ae77","abstract_canon_sha256":"5dc355b2b48d7ac25f287efa9b03ba058e9b7f1bd5bf59a5f689065550b70cb9"},"schema_version":"1.0"},"canonical_sha256":"ff10c067d341aedd126217f32d35f8c76585e66ca6e748b9fce4e50a82018994","source":{"kind":"arxiv","id":"1307.6246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6246","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6246v1","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6246","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"74IMAZ6TIGXN","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"74IMAZ6TIGXN2ETC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"74IMAZ6T","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:74IMAZ6TIGXN2ETCC7ZS2NPYY5","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-23T21:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"142a9c9e03568bc87228e32e5c3d06a8346d0ff7665eef37e821cb3d5c44ae77","abstract_canon_sha256":"5dc355b2b48d7ac25f287efa9b03ba058e9b7f1bd5bf59a5f689065550b70cb9"},"schema_version":"1.0"},"canonical_sha256":"ff10c067d341aedd126217f32d35f8c76585e66ca6e748b9fce4e50a82018994","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:43.918034Z","signature_b64":"Y6a0QETsKcTP4bXygreux9DS2wpr1uB1V+U2G2LEPT9HPVkqo65S38xnWiQ34LR45Je421bMYACBpEj9QqPNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff10c067d341aedd126217f32d35f8c76585e66ca6e748b9fce4e50a82018994","last_reissued_at":"2026-05-18T03:17:43.917363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:43.917363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6246","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-18T03:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZFldn0iy236e6m2SNeC5KNhMw0UOByRlRJCy/fK3JqYqzy9v7Cgt7So704q7lar9yMRALPJONi1icNcfv7DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:23:46.658546Z"},"content_sha256":"f3ac88e7dccaee50e856175767c34841ec21e57eba5535170f4eb1bfff681c46","schema_version":"1.0","event_id":"sha256:f3ac88e7dccaee50e856175767c34841ec21e57eba5535170f4eb1bfff681c46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:74IMAZ6TIGXN2ETCC7ZS2NPYY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Optimal Strategies in a Multi-Period Multi-Leader-Follower Stackelberg Game Using an Evolutionary Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ankur Sinha, Anton Frantsev, Kalyanmoy Deb, Pekka Malo","submitted_at":"2013-07-23T21:15:06Z","abstract_excerpt":"Stackelberg games are a classic example of bilevel optimization problems, which are often encountered in game theory and economics. These are complex problems with a hierarchical structure, where one optimization task is nested within the other. Despite a number of studies on handling bilevel optimization problems, these problems still remain a challenging territory, and existing methodologies are able to handle only simple problems with few variables under assumptions of continuity and differentiability. In this paper, we consider a special case of a multi-period multi-leader-follower Stackel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6246","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-18T03:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ae+cCUO7ehjcwddSNLVgWj9dL3HuB9k2r5ky/Qy3UmhSr52l327HcxUPp7mtrJtDuzkFCIND+A6QzwH6pV2ACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:23:46.659120Z"},"content_sha256":"f94f97d871bd529134f47b13ffc91aa46c4828d655cf0cf3dc5b0e7e99423d1e","schema_version":"1.0","event_id":"sha256:f94f97d871bd529134f47b13ffc91aa46c4828d655cf0cf3dc5b0e7e99423d1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/bundle.json","state_url":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/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-08T10:23:46Z","links":{"resolver":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5","bundle":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/bundle.json","state":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:74IMAZ6TIGXN2ETCC7ZS2NPYY5","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":"5dc355b2b48d7ac25f287efa9b03ba058e9b7f1bd5bf59a5f689065550b70cb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-23T21:15:06Z","title_canon_sha256":"142a9c9e03568bc87228e32e5c3d06a8346d0ff7665eef37e821cb3d5c44ae77"},"schema_version":"1.0","source":{"id":"1307.6246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6246","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6246v1","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6246","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"74IMAZ6TIGXN","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"74IMAZ6TIGXN2ETC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"74IMAZ6T","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:f94f97d871bd529134f47b13ffc91aa46c4828d655cf0cf3dc5b0e7e99423d1e","target":"graph","created_at":"2026-05-18T03:17:43Z","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":"Stackelberg games are a classic example of bilevel optimization problems, which are often encountered in game theory and economics. These are complex problems with a hierarchical structure, where one optimization task is nested within the other. Despite a number of studies on handling bilevel optimization problems, these problems still remain a challenging territory, and existing methodologies are able to handle only simple problems with few variables under assumptions of continuity and differentiability. In this paper, we consider a special case of a multi-period multi-leader-follower Stackel","authors_text":"Ankur Sinha, Anton Frantsev, Kalyanmoy Deb, Pekka Malo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-23T21:15:06Z","title":"Finding Optimal Strategies in a Multi-Period Multi-Leader-Follower Stackelberg Game Using an Evolutionary Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6246","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:f3ac88e7dccaee50e856175767c34841ec21e57eba5535170f4eb1bfff681c46","target":"record","created_at":"2026-05-18T03:17:43Z","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":"5dc355b2b48d7ac25f287efa9b03ba058e9b7f1bd5bf59a5f689065550b70cb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-23T21:15:06Z","title_canon_sha256":"142a9c9e03568bc87228e32e5c3d06a8346d0ff7665eef37e821cb3d5c44ae77"},"schema_version":"1.0","source":{"id":"1307.6246","kind":"arxiv","version":1}},"canonical_sha256":"ff10c067d341aedd126217f32d35f8c76585e66ca6e748b9fce4e50a82018994","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff10c067d341aedd126217f32d35f8c76585e66ca6e748b9fce4e50a82018994","first_computed_at":"2026-05-18T03:17:43.917363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:43.917363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y6a0QETsKcTP4bXygreux9DS2wpr1uB1V+U2G2LEPT9HPVkqo65S38xnWiQ34LR45Je421bMYACBpEj9QqPNDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:43.918034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3ac88e7dccaee50e856175767c34841ec21e57eba5535170f4eb1bfff681c46","sha256:f94f97d871bd529134f47b13ffc91aa46c4828d655cf0cf3dc5b0e7e99423d1e"],"state_sha256":"e244d854077c89d82c92a24d81046986f4d84e07ae2359930d9191f92a19960a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pem/ab4Co7hjBMBBjzNMimiQ3wx4vXwK9vGcMdupXpaJ4qEj7B2aQ/t2PS3wElIkbQgtLYuTASnMnggdwaO6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:23:46.662399Z","bundle_sha256":"a139322bfbb10837580a8b6187537ab83cc528f26cc5dc24b5dc0b587efc3474"}}