{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:W2RSYEGCHQAEL5TI5XFFJXI5P2","short_pith_number":"pith:W2RSYEGC","schema_version":"1.0","canonical_sha256":"b6a32c10c23c0045f668edca54dd1d7eb31b1d62bea2e004f5cb546290ad407d","source":{"kind":"arxiv","id":"2403.19074","version":1},"attestation_state":"computed","paper":{"title":"Cardinality Constraints in Single-Leader-Multi-Follower games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Lasluisa, David Salas, Didier Aussel","submitted_at":"2024-03-28T00:32:04Z","abstract_excerpt":"This work explores bilevel problems in the context of cardinality constraints. More specifically Single-Leader-Multi-Follower games (SLMFG) involving cardinality constraints are considered in two different configurations: one with the cardinality constraint at the leader's level and a mixed structure in which the cardinality constraint is split between leader and followers problem. We prove existence results in both cases and provided equivalent reformulations allowing the numerical treatment of these complex problems. The obtained results are illustrated thanks to an application to a facility"},"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":"2403.19074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-28T00:32:04Z","cross_cats_sorted":[],"title_canon_sha256":"01798411c91e6f335c51139c13ecc89f08a0d593b841cde5329ecbfaed4f7a59","abstract_canon_sha256":"e1db30f3eec496edbb044e9290ebc396fa65118d765068c3b543f0ea1888824e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:43.883254Z","signature_b64":"5VGPhyTP20/61Ihme5/mdPwZVvprbtsZPOIhySoBMVUFAhmTk9euSJHX20IvS+aJvOYbXGGlwMLVC8vFLNghBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6a32c10c23c0045f668edca54dd1d7eb31b1d62bea2e004f5cb546290ad407d","last_reissued_at":"2026-07-05T08:01:43.882686Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:43.882686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cardinality Constraints in Single-Leader-Multi-Follower games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Lasluisa, David Salas, Didier Aussel","submitted_at":"2024-03-28T00:32:04Z","abstract_excerpt":"This work explores bilevel problems in the context of cardinality constraints. More specifically Single-Leader-Multi-Follower games (SLMFG) involving cardinality constraints are considered in two different configurations: one with the cardinality constraint at the leader's level and a mixed structure in which the cardinality constraint is split between leader and followers problem. We prove existence results in both cases and provided equivalent reformulations allowing the numerical treatment of these complex problems. The obtained results are illustrated thanks to an application to a facility"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19074","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.19074/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.19074","created_at":"2026-07-05T08:01:43.882745+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.19074v1","created_at":"2026-07-05T08:01:43.882745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19074","created_at":"2026-07-05T08:01:43.882745+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2RSYEGCHQAE","created_at":"2026-07-05T08:01:43.882745+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2RSYEGCHQAEL5TI","created_at":"2026-07-05T08:01:43.882745+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2RSYEGC","created_at":"2026-07-05T08:01:43.882745+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.06482","citing_title":"A Cardinality-Constrained Approach to Combinatorial Bilevel Congestion Pricing","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W2RSYEGCHQAEL5TI5XFFJXI5P2","json":"https://pith.science/pith/W2RSYEGCHQAEL5TI5XFFJXI5P2.json","graph_json":"https://pith.science/api/pith-number/W2RSYEGCHQAEL5TI5XFFJXI5P2/graph.json","events_json":"https://pith.science/api/pith-number/W2RSYEGCHQAEL5TI5XFFJXI5P2/events.json","paper":"https://pith.science/paper/W2RSYEGC"},"agent_actions":{"view_html":"https://pith.science/pith/W2RSYEGCHQAEL5TI5XFFJXI5P2","download_json":"https://pith.science/pith/W2RSYEGCHQAEL5TI5XFFJXI5P2.json","view_paper":"https://pith.science/paper/W2RSYEGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.19074&json=true","fetch_graph":"https://pith.science/api/pith-number/W2RSYEGCHQAEL5TI5XFFJXI5P2/graph.json","fetch_events":"https://pith.science/api/pith-number/W2RSYEGCHQAEL5TI5XFFJXI5P2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2RSYEGCHQAEL5TI5XFFJXI5P2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2RSYEGCHQAEL5TI5XFFJXI5P2/action/storage_attestation","attest_author":"https://pith.science/pith/W2RSYEGCHQAEL5TI5XFFJXI5P2/action/author_attestation","sign_citation":"https://pith.science/pith/W2RSYEGCHQAEL5TI5XFFJXI5P2/action/citation_signature","submit_replication":"https://pith.science/pith/W2RSYEGCHQAEL5TI5XFFJXI5P2/action/replication_record"}},"created_at":"2026-07-05T08:01:43.882745+00:00","updated_at":"2026-07-05T08:01:43.882745+00:00"}