{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:74IMAZ6TIGXN2ETCC7ZS2NPYY5","short_pith_number":"pith:74IMAZ6T","schema_version":"1.0","canonical_sha256":"ff10c067d341aedd126217f32d35f8c76585e66ca6e748b9fce4e50a82018994","source":{"kind":"arxiv","id":"1307.6246","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.6246","created_at":"2026-05-18T03:17:43.917451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6246v1","created_at":"2026-05-18T03:17:43.917451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6246","created_at":"2026-05-18T03:17:43.917451+00:00"},{"alias_kind":"pith_short_12","alias_value":"74IMAZ6TIGXN","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"74IMAZ6TIGXN2ETC","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"74IMAZ6T","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5","json":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5.json","graph_json":"https://pith.science/api/pith-number/74IMAZ6TIGXN2ETCC7ZS2NPYY5/graph.json","events_json":"https://pith.science/api/pith-number/74IMAZ6TIGXN2ETCC7ZS2NPYY5/events.json","paper":"https://pith.science/paper/74IMAZ6T"},"agent_actions":{"view_html":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5","download_json":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5.json","view_paper":"https://pith.science/paper/74IMAZ6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6246&json=true","fetch_graph":"https://pith.science/api/pith-number/74IMAZ6TIGXN2ETCC7ZS2NPYY5/graph.json","fetch_events":"https://pith.science/api/pith-number/74IMAZ6TIGXN2ETCC7ZS2NPYY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/action/storage_attestation","attest_author":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/action/author_attestation","sign_citation":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/action/citation_signature","submit_replication":"https://pith.science/pith/74IMAZ6TIGXN2ETCC7ZS2NPYY5/action/replication_record"}},"created_at":"2026-05-18T03:17:43.917451+00:00","updated_at":"2026-05-18T03:17:43.917451+00:00"}