{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NFP6OQ4H3APR5V6NMU4OR5VUN7","short_pith_number":"pith:NFP6OQ4H","schema_version":"1.0","canonical_sha256":"695fe74387d81f1ed7cd6538e8f6b46fd6852ee26c648bbdcec8e5a74b4de02f","source":{"kind":"arxiv","id":"1808.10209","version":1},"attestation_state":"computed","paper":{"title":"Leadership in Singleton Congestion Games: What is Hard and What is Easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Matteo Castiglioni, Nicola Gatti, Stefano Coniglio","submitted_at":"2018-08-30T10:17:47Z","abstract_excerpt":"We study the problem of computing Stackelberg equilibria Stackelberg games whose underlying structure is in congestion games, focusing on the case where each player can choose a single resource (a.k.a. singleton congestion games) and one of them acts as leader. In particular, we address the cases where the players either have the same action spaces (i.e., the set of resources they can choose is the same for all of them) or different ones, and where their costs are either monotonic functions of the resource congestion or not. We show that, in the case where the players have different action spa"},"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":"1808.10209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-30T10:17:47Z","cross_cats_sorted":[],"title_canon_sha256":"6f753f27e6e0abcc6d7a07128f1740084ecffa504a4f4f7f16409e5bed690afb","abstract_canon_sha256":"7c003e6e490869b68929e63499f663080620a3ba716e2d66f714e3fee4ff24b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:49.529548Z","signature_b64":"btwnEnWPx93AED563oNVzlSLBxJmmixynYL/6CpIj9BVmA3UyMvpstZBH0MoDtkGJhItbn6x85bN0DEqru/PCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"695fe74387d81f1ed7cd6538e8f6b46fd6852ee26c648bbdcec8e5a74b4de02f","last_reissued_at":"2026-05-18T00:06:49.528880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:49.528880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leadership in Singleton Congestion Games: What is Hard and What is Easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Matteo Castiglioni, Nicola Gatti, Stefano Coniglio","submitted_at":"2018-08-30T10:17:47Z","abstract_excerpt":"We study the problem of computing Stackelberg equilibria Stackelberg games whose underlying structure is in congestion games, focusing on the case where each player can choose a single resource (a.k.a. singleton congestion games) and one of them acts as leader. In particular, we address the cases where the players either have the same action spaces (i.e., the set of resources they can choose is the same for all of them) or different ones, and where their costs are either monotonic functions of the resource congestion or not. We show that, in the case where the players have different action spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10209","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":"1808.10209","created_at":"2026-05-18T00:06:49.528980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10209v1","created_at":"2026-05-18T00:06:49.528980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10209","created_at":"2026-05-18T00:06:49.528980+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFP6OQ4H3APR","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFP6OQ4H3APR5V6N","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFP6OQ4H","created_at":"2026-05-18T12:32:40.477152+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/NFP6OQ4H3APR5V6NMU4OR5VUN7","json":"https://pith.science/pith/NFP6OQ4H3APR5V6NMU4OR5VUN7.json","graph_json":"https://pith.science/api/pith-number/NFP6OQ4H3APR5V6NMU4OR5VUN7/graph.json","events_json":"https://pith.science/api/pith-number/NFP6OQ4H3APR5V6NMU4OR5VUN7/events.json","paper":"https://pith.science/paper/NFP6OQ4H"},"agent_actions":{"view_html":"https://pith.science/pith/NFP6OQ4H3APR5V6NMU4OR5VUN7","download_json":"https://pith.science/pith/NFP6OQ4H3APR5V6NMU4OR5VUN7.json","view_paper":"https://pith.science/paper/NFP6OQ4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10209&json=true","fetch_graph":"https://pith.science/api/pith-number/NFP6OQ4H3APR5V6NMU4OR5VUN7/graph.json","fetch_events":"https://pith.science/api/pith-number/NFP6OQ4H3APR5V6NMU4OR5VUN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFP6OQ4H3APR5V6NMU4OR5VUN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFP6OQ4H3APR5V6NMU4OR5VUN7/action/storage_attestation","attest_author":"https://pith.science/pith/NFP6OQ4H3APR5V6NMU4OR5VUN7/action/author_attestation","sign_citation":"https://pith.science/pith/NFP6OQ4H3APR5V6NMU4OR5VUN7/action/citation_signature","submit_replication":"https://pith.science/pith/NFP6OQ4H3APR5V6NMU4OR5VUN7/action/replication_record"}},"created_at":"2026-05-18T00:06:49.528980+00:00","updated_at":"2026-05-18T00:06:49.528980+00:00"}