{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GJKRRENAEMAYSOO6BGRU57SK6B","short_pith_number":"pith:GJKRRENA","schema_version":"1.0","canonical_sha256":"32551891a023018939de09a34efe4af045e10e18229751a97db1c7c84b7b89c9","source":{"kind":"arxiv","id":"1503.02240","version":1},"attestation_state":"computed","paper":{"title":"A General Mechanism Design Methodology for Social Utility Maximization with Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Abhinav Sinha, Achilleas Anastasopoulos","submitted_at":"2015-03-08T02:52:37Z","abstract_excerpt":"Social utility maximization refers to the process of allocating resources in such a way that the sum of agents' utilities is maximized under the system constraints. Such allocation arises in several problems in the general area of communications, including unicast (and multicast multi-rate) service on the Internet, as well as in applications with (local) public goods, such as power allocation in wireless networks, spectrum allocation, etc. Mechanisms that implement such allocations in Nash equilibrium have also been studied but either they do not possess full implementation property, or are gi"},"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":"1503.02240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-03-08T02:52:37Z","cross_cats_sorted":[],"title_canon_sha256":"f4c375f8ac51f5fd696f63cd5803cb1aef9e9135ac5cab32913c065770cbfd8c","abstract_canon_sha256":"031847f73276b0b1115042358168a3e24ebd4f37cc2ff05a48c9be92448962ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:25.503023Z","signature_b64":"osGRtzlCPj89KuFhDWVrSlIHev9F5w/ZCqCr6R2VkWbTcGIERZJSPw3/AUMkSfordoMn1egtxVKdLRkHN5m8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32551891a023018939de09a34efe4af045e10e18229751a97db1c7c84b7b89c9","last_reissued_at":"2026-05-18T02:25:25.502647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:25.502647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Mechanism Design Methodology for Social Utility Maximization with Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Abhinav Sinha, Achilleas Anastasopoulos","submitted_at":"2015-03-08T02:52:37Z","abstract_excerpt":"Social utility maximization refers to the process of allocating resources in such a way that the sum of agents' utilities is maximized under the system constraints. Such allocation arises in several problems in the general area of communications, including unicast (and multicast multi-rate) service on the Internet, as well as in applications with (local) public goods, such as power allocation in wireless networks, spectrum allocation, etc. Mechanisms that implement such allocations in Nash equilibrium have also been studied but either they do not possess full implementation property, or are gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02240","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":"1503.02240","created_at":"2026-05-18T02:25:25.502705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02240v1","created_at":"2026-05-18T02:25:25.502705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02240","created_at":"2026-05-18T02:25:25.502705+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJKRRENAEMAY","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJKRRENAEMAYSOO6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJKRRENA","created_at":"2026-05-18T12:29:22.688609+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/GJKRRENAEMAYSOO6BGRU57SK6B","json":"https://pith.science/pith/GJKRRENAEMAYSOO6BGRU57SK6B.json","graph_json":"https://pith.science/api/pith-number/GJKRRENAEMAYSOO6BGRU57SK6B/graph.json","events_json":"https://pith.science/api/pith-number/GJKRRENAEMAYSOO6BGRU57SK6B/events.json","paper":"https://pith.science/paper/GJKRRENA"},"agent_actions":{"view_html":"https://pith.science/pith/GJKRRENAEMAYSOO6BGRU57SK6B","download_json":"https://pith.science/pith/GJKRRENAEMAYSOO6BGRU57SK6B.json","view_paper":"https://pith.science/paper/GJKRRENA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02240&json=true","fetch_graph":"https://pith.science/api/pith-number/GJKRRENAEMAYSOO6BGRU57SK6B/graph.json","fetch_events":"https://pith.science/api/pith-number/GJKRRENAEMAYSOO6BGRU57SK6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJKRRENAEMAYSOO6BGRU57SK6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJKRRENAEMAYSOO6BGRU57SK6B/action/storage_attestation","attest_author":"https://pith.science/pith/GJKRRENAEMAYSOO6BGRU57SK6B/action/author_attestation","sign_citation":"https://pith.science/pith/GJKRRENAEMAYSOO6BGRU57SK6B/action/citation_signature","submit_replication":"https://pith.science/pith/GJKRRENAEMAYSOO6BGRU57SK6B/action/replication_record"}},"created_at":"2026-05-18T02:25:25.502705+00:00","updated_at":"2026-05-18T02:25:25.502705+00:00"}