{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PWD23IH2KLO3MKSIVTV2QP5FUJ","short_pith_number":"pith:PWD23IH2","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"},"canonical_sha256":"7d87ada0fa52ddb62a48aceba83fa5a269c4d3bd1ff60588bfb4de56e18b69df","source":{"kind":"arxiv","id":"1811.11578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11578","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11578v1","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11578","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"PWD23IH2KLO3","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PWD23IH2KLO3MKSI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PWD23IH2","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PWD23IH2KLO3MKSIVTV2QP5FUJ","target":"record","payload":{"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"},"canonical_sha256":"7d87ada0fa52ddb62a48aceba83fa5a269c4d3bd1ff60588bfb4de56e18b69df","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"},"source_kind":"arxiv","source_id":"1811.11578","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-17T23:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5yo3lSoI9042W/tF6GQneUAIuB4sU61GUEeCdZI9skZFtRPdu5OoCmnL69l0WSe2oG4fIGXTuMSn2J9Er8WBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:14:34.073704Z"},"content_sha256":"cde28ecdd4113681af24b98b619d50619f427895396fb0fcfe07b5f1fb75f54c","schema_version":"1.0","event_id":"sha256:cde28ecdd4113681af24b98b619d50619f427895396fb0fcfe07b5f1fb75f54c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PWD23IH2KLO3MKSIVTV2QP5FUJ","target":"graph","payload":{"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"},"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-17T23:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blTeKONJuDeJMZkEv66ktQzix1JVzDBqpaWqw4nFVhuuLXj25FIC8JSZllidO+qNoaPLdopeyQbvP5921J4tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:14:34.074048Z"},"content_sha256":"d2b7b9a1beba60e299fe7d200e7aee5e156d7796a3f9b84067dca76564777fd5","schema_version":"1.0","event_id":"sha256:d2b7b9a1beba60e299fe7d200e7aee5e156d7796a3f9b84067dca76564777fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/bundle.json","state_url":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/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-03T22:14:34Z","links":{"resolver":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ","bundle":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/bundle.json","state":"https://pith.science/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWD23IH2KLO3MKSIVTV2QP5FUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PWD23IH2KLO3MKSIVTV2QP5FUJ","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":"be7d0fe359d40e56611e997a883c65fb8e35b8023dc2afccdafdc1d80d5a4cda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-28T14:04:47Z","title_canon_sha256":"3c8346665ec228a96d3fd639310e1afef1ca23c43ffd5710b5cbcb03bd9356b8"},"schema_version":"1.0","source":{"id":"1811.11578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11578","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11578v1","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11578","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"PWD23IH2KLO3","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PWD23IH2KLO3MKSI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PWD23IH2","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:d2b7b9a1beba60e299fe7d200e7aee5e156d7796a3f9b84067dca76564777fd5","target":"graph","created_at":"2026-05-17T23:59:40Z","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":"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","authors_text":"Abhay Karandikar, Indu Yadav, Prasanna Chaporkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-28T14:04:47Z","title":"GOSPAL: An Efficient Strategy-Proof mechanism for Constrained Resource Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11578","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:cde28ecdd4113681af24b98b619d50619f427895396fb0fcfe07b5f1fb75f54c","target":"record","created_at":"2026-05-17T23:59:40Z","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":"be7d0fe359d40e56611e997a883c65fb8e35b8023dc2afccdafdc1d80d5a4cda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-28T14:04:47Z","title_canon_sha256":"3c8346665ec228a96d3fd639310e1afef1ca23c43ffd5710b5cbcb03bd9356b8"},"schema_version":"1.0","source":{"id":"1811.11578","kind":"arxiv","version":1}},"canonical_sha256":"7d87ada0fa52ddb62a48aceba83fa5a269c4d3bd1ff60588bfb4de56e18b69df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d87ada0fa52ddb62a48aceba83fa5a269c4d3bd1ff60588bfb4de56e18b69df","first_computed_at":"2026-05-17T23:59:40.671014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:40.671014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dEFOHBX30h80uj2dV5M2hxFuTL0FNF077FStBwsJZm2wDQEfsLiQ6Ukljtn+gvVMPy/Hgrt08WFeuAJRXQK3BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:40.671697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cde28ecdd4113681af24b98b619d50619f427895396fb0fcfe07b5f1fb75f54c","sha256:d2b7b9a1beba60e299fe7d200e7aee5e156d7796a3f9b84067dca76564777fd5"],"state_sha256":"c7dbea8837ac3c950dd0dce862df4be6ed1c91112094c9408139d125e79d5cfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/NxpYNsNjZ3Z9rfAKEaxHruuWwOarp7zn+z7667YqedXkQnCGBQzuc9YNbHALVkWpjcRUhe7fGagcgYQ2YDuAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:14:34.076164Z","bundle_sha256":"0ab8d7e97b95c8766509115fd62672961b28312efbb69927667a8acbe31be3cb"}}