{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PWD23IH2KLO3MKSIVTV2QP5FUJ","short_pith_number":"pith:PWD23IH2","schema_version":"1.0","canonical_sha256":"7d87ada0fa52ddb62a48aceba83fa5a269c4d3bd1ff60588bfb4de56e18b69df","source":{"kind":"arxiv","id":"1811.11578","version":1},"attestation_state":"computed","paper":{"title":"GOSPAL: An Efficient Strategy-Proof mechanism for Constrained Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Abhay Karandikar, Indu Yadav, Prasanna Chaporkar","submitted_at":"2018-11-28T14:04:47Z","abstract_excerpt":"We consider allocation of a resource to multiple interested users with a constraint that if the resource is allocated to user $i$ then it can not be allocated simultaneously to a predefined set of users $\\cS_i$ . This scenario arises in many practical systems that include wireless networks and constrained queuing systems. It is known that socially optimal strategy-proof mechanism is not only NP-hard, but it is also hard to approximate. This renders optimal policy hard to use in practice. Here, we propose a computationally efficient mechanism and prove it to be strategy proof. Using Monte Carlo"},"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":"1811.11578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-28T14:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"3c8346665ec228a96d3fd639310e1afef1ca23c43ffd5710b5cbcb03bd9356b8","abstract_canon_sha256":"be7d0fe359d40e56611e997a883c65fb8e35b8023dc2afccdafdc1d80d5a4cda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:40.671697Z","signature_b64":"dEFOHBX30h80uj2dV5M2hxFuTL0FNF077FStBwsJZm2wDQEfsLiQ6Ukljtn+gvVMPy/Hgrt08WFeuAJRXQK3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d87ada0fa52ddb62a48aceba83fa5a269c4d3bd1ff60588bfb4de56e18b69df","last_reissued_at":"2026-05-17T23:59:40.671014Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:40.671014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GOSPAL: An Efficient Strategy-Proof mechanism for Constrained Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Abhay Karandikar, Indu Yadav, Prasanna Chaporkar","submitted_at":"2018-11-28T14:04:47Z","abstract_excerpt":"We consider allocation of a resource to multiple interested users with a constraint that if the resource is allocated to user $i$ then it can not be allocated simultaneously to a predefined set of users $\\cS_i$ . This scenario arises in many practical systems that include wireless networks and constrained queuing systems. It is known that socially optimal strategy-proof mechanism is not only NP-hard, but it is also hard to approximate. This renders optimal policy hard to use in practice. Here, we propose a computationally efficient mechanism and prove it to be strategy proof. Using Monte Carlo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11578","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":"1811.11578","created_at":"2026-05-17T23:59:40.671121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11578v1","created_at":"2026-05-17T23:59:40.671121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11578","created_at":"2026-05-17T23:59:40.671121+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWD23IH2KLO3","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWD23IH2KLO3MKSI","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWD23IH2","created_at":"2026-05-18T12:32:46.962924+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/PWD23IH2KLO3MKSIVTV2QP5FUJ","json":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ.json","graph_json":"https://pith.science/api/pith-number/PWD23IH2KLO3MKSIVTV2QP5FUJ/graph.json","events_json":"https://pith.science/api/pith-number/PWD23IH2KLO3MKSIVTV2QP5FUJ/events.json","paper":"https://pith.science/paper/PWD23IH2"},"agent_actions":{"view_html":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ","download_json":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ.json","view_paper":"https://pith.science/paper/PWD23IH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11578&json=true","fetch_graph":"https://pith.science/api/pith-number/PWD23IH2KLO3MKSIVTV2QP5FUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PWD23IH2KLO3MKSIVTV2QP5FUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/action/storage_attestation","attest_author":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/action/author_attestation","sign_citation":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/action/citation_signature","submit_replication":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/action/replication_record"}},"created_at":"2026-05-17T23:59:40.671121+00:00","updated_at":"2026-05-17T23:59:40.671121+00:00"}