{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2XEBBAFNJ4SEHOO4REB4HAPCVV","short_pith_number":"pith:2XEBBAFN","schema_version":"1.0","canonical_sha256":"d5c81080ad4f2443b9dc8903c381e2ad56d69f5c1d9d3bd147c54ec35213af76","source":{"kind":"arxiv","id":"1801.08808","version":1},"attestation_state":"computed","paper":{"title":"Learning Optimal Redistribution Mechanisms through Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"C V Jawahar, P Manisha, Sujit Gujar","submitted_at":"2018-01-26T13:55:26Z","abstract_excerpt":"We consider a setting where $p$ public resources are to be allocated among $n$ competing and strategic agents so as to maximize social welfare (the objects should be allocated to those who value them the most). This is called allocative efficiency (AE). We need the agents to report their valuations for obtaining these resources, truthfully referred to as dominant strategy incentive compatibility (DSIC). We use auction-based mechanisms to achieve AE and DSIC yet budget balance cannot be ensured, due to Green-Laffont Impossibility Theorem. That is, the net transfer of money cannot be zero. This "},"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":"1801.08808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-01-26T13:55:26Z","cross_cats_sorted":[],"title_canon_sha256":"d3a6279e718e8bf2ac08ed9be514877e7ae8bce9b67f7cbfc8a7ee086c832ea1","abstract_canon_sha256":"e6118fbfaf0065102123b04c84bea0e6ff5537d1f756d9a5bd3906652562a9c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.981011Z","signature_b64":"Bu5oEaBkyWPqAVfJdGk4zXSDXhiyjoLw/iety1lJGht083PQ6EBeBe36Hynjcsg/LwNHmo2R76UCMC8qixjSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5c81080ad4f2443b9dc8903c381e2ad56d69f5c1d9d3bd147c54ec35213af76","last_reissued_at":"2026-05-18T00:25:02.980582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.980582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Optimal Redistribution Mechanisms through Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"C V Jawahar, P Manisha, Sujit Gujar","submitted_at":"2018-01-26T13:55:26Z","abstract_excerpt":"We consider a setting where $p$ public resources are to be allocated among $n$ competing and strategic agents so as to maximize social welfare (the objects should be allocated to those who value them the most). This is called allocative efficiency (AE). We need the agents to report their valuations for obtaining these resources, truthfully referred to as dominant strategy incentive compatibility (DSIC). We use auction-based mechanisms to achieve AE and DSIC yet budget balance cannot be ensured, due to Green-Laffont Impossibility Theorem. That is, the net transfer of money cannot be zero. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08808","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":"1801.08808","created_at":"2026-05-18T00:25:02.980647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08808v1","created_at":"2026-05-18T00:25:02.980647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08808","created_at":"2026-05-18T00:25:02.980647+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XEBBAFNJ4SE","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XEBBAFNJ4SEHOO4","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XEBBAFN","created_at":"2026-05-18T12:32:02.567920+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/2XEBBAFNJ4SEHOO4REB4HAPCVV","json":"https://pith.science/pith/2XEBBAFNJ4SEHOO4REB4HAPCVV.json","graph_json":"https://pith.science/api/pith-number/2XEBBAFNJ4SEHOO4REB4HAPCVV/graph.json","events_json":"https://pith.science/api/pith-number/2XEBBAFNJ4SEHOO4REB4HAPCVV/events.json","paper":"https://pith.science/paper/2XEBBAFN"},"agent_actions":{"view_html":"https://pith.science/pith/2XEBBAFNJ4SEHOO4REB4HAPCVV","download_json":"https://pith.science/pith/2XEBBAFNJ4SEHOO4REB4HAPCVV.json","view_paper":"https://pith.science/paper/2XEBBAFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08808&json=true","fetch_graph":"https://pith.science/api/pith-number/2XEBBAFNJ4SEHOO4REB4HAPCVV/graph.json","fetch_events":"https://pith.science/api/pith-number/2XEBBAFNJ4SEHOO4REB4HAPCVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XEBBAFNJ4SEHOO4REB4HAPCVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XEBBAFNJ4SEHOO4REB4HAPCVV/action/storage_attestation","attest_author":"https://pith.science/pith/2XEBBAFNJ4SEHOO4REB4HAPCVV/action/author_attestation","sign_citation":"https://pith.science/pith/2XEBBAFNJ4SEHOO4REB4HAPCVV/action/citation_signature","submit_replication":"https://pith.science/pith/2XEBBAFNJ4SEHOO4REB4HAPCVV/action/replication_record"}},"created_at":"2026-05-18T00:25:02.980647+00:00","updated_at":"2026-05-18T00:25:02.980647+00:00"}