{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JWT4TJQDUB4LX5AMECS5ZMBW4M","short_pith_number":"pith:JWT4TJQD","schema_version":"1.0","canonical_sha256":"4da7c9a603a078bbf40c20a5dcb036e305b506a63ced098a802d2c5b1d98e683","source":{"kind":"arxiv","id":"1904.11663","version":1},"attestation_state":"computed","paper":{"title":"Quantized VCG Mechanisms for Polymatroid Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hao Ge, Randall Berry","submitted_at":"2019-04-26T03:44:27Z","abstract_excerpt":"Many network resource allocation problems can be viewed as allocating a divisible resource, where the allocations are constrained to lie in a polymatroid. We consider market-based mechanisms for such problems. Though the Vickrey-Clarke-Groves (VCG) mechanism can provide the efficient allocation with strong incentive properties (namely dominant strategy incentive compatibility), its well-known high communication requirements can prevent it from being used. There have been a number of approaches for reducing the communication costs of VCG by weakening its incentive properties. Here, instead we t"},"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":"1904.11663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-26T03:44:27Z","cross_cats_sorted":[],"title_canon_sha256":"fa951026e31c96fc6a6d659f9cdddcd99bc1f9e32991ded3c670b6bb510fefd8","abstract_canon_sha256":"2d38985aa0f4064cb4db1b0222b6274ec79872d9f5a5098aace686df8858e3d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:43.083444Z","signature_b64":"x9wrVqzce8IRKFCsOqli6B4Cw/dc60MbgLU+XeKy+gsxzujgKCO3GLXj6NkGdAFrXMG9OXUzz53e/VB2CFovBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4da7c9a603a078bbf40c20a5dcb036e305b506a63ced098a802d2c5b1d98e683","last_reissued_at":"2026-05-17T23:47:43.082861Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:43.082861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantized VCG Mechanisms for Polymatroid Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hao Ge, Randall Berry","submitted_at":"2019-04-26T03:44:27Z","abstract_excerpt":"Many network resource allocation problems can be viewed as allocating a divisible resource, where the allocations are constrained to lie in a polymatroid. We consider market-based mechanisms for such problems. Though the Vickrey-Clarke-Groves (VCG) mechanism can provide the efficient allocation with strong incentive properties (namely dominant strategy incentive compatibility), its well-known high communication requirements can prevent it from being used. There have been a number of approaches for reducing the communication costs of VCG by weakening its incentive properties. Here, instead we t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11663","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":"1904.11663","created_at":"2026-05-17T23:47:43.082946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11663v1","created_at":"2026-05-17T23:47:43.082946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11663","created_at":"2026-05-17T23:47:43.082946+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWT4TJQDUB4L","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWT4TJQDUB4LX5AM","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWT4TJQD","created_at":"2026-05-18T12:33:21.387695+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/JWT4TJQDUB4LX5AMECS5ZMBW4M","json":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M.json","graph_json":"https://pith.science/api/pith-number/JWT4TJQDUB4LX5AMECS5ZMBW4M/graph.json","events_json":"https://pith.science/api/pith-number/JWT4TJQDUB4LX5AMECS5ZMBW4M/events.json","paper":"https://pith.science/paper/JWT4TJQD"},"agent_actions":{"view_html":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M","download_json":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M.json","view_paper":"https://pith.science/paper/JWT4TJQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11663&json=true","fetch_graph":"https://pith.science/api/pith-number/JWT4TJQDUB4LX5AMECS5ZMBW4M/graph.json","fetch_events":"https://pith.science/api/pith-number/JWT4TJQDUB4LX5AMECS5ZMBW4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/action/storage_attestation","attest_author":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/action/author_attestation","sign_citation":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/action/citation_signature","submit_replication":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/action/replication_record"}},"created_at":"2026-05-17T23:47:43.082946+00:00","updated_at":"2026-05-17T23:47:43.082946+00:00"}