{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JWT4TJQDUB4LX5AMECS5ZMBW4M","short_pith_number":"pith:JWT4TJQD","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"},"canonical_sha256":"4da7c9a603a078bbf40c20a5dcb036e305b506a63ced098a802d2c5b1d98e683","source":{"kind":"arxiv","id":"1904.11663","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11663","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11663v1","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11663","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"JWT4TJQDUB4L","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JWT4TJQDUB4LX5AM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JWT4TJQD","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JWT4TJQDUB4LX5AMECS5ZMBW4M","target":"record","payload":{"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"},"canonical_sha256":"4da7c9a603a078bbf40c20a5dcb036e305b506a63ced098a802d2c5b1d98e683","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"},"source_kind":"arxiv","source_id":"1904.11663","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:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NU5XZQkKKw4oI67ptSSgEjkGMbq+SRn0e4QWfZQSaUhvZFggeaOGGn/8PKef0+y5PcNBOaZ5uWDDbWOWxYwrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:36:17.296249Z"},"content_sha256":"f2ae4ce6a67328f6b6d954e5a98735352caa4fd9b0311bb8de34333ba6ecb058","schema_version":"1.0","event_id":"sha256:f2ae4ce6a67328f6b6d954e5a98735352caa4fd9b0311bb8de34333ba6ecb058"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JWT4TJQDUB4LX5AMECS5ZMBW4M","target":"graph","payload":{"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"},"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:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QS0+vuiA9w7xrfb5nJwF/EqL/EIsTxj5DCASl/NZX/lWXgrixmKTVVJI2b/7f4iMX7i96QPsx2TinIZKDPHWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:36:17.296905Z"},"content_sha256":"503bbfe7e8ff629230f78328fd4a47d0beaf2b9e86d5667280e2621a8be8009d","schema_version":"1.0","event_id":"sha256:503bbfe7e8ff629230f78328fd4a47d0beaf2b9e86d5667280e2621a8be8009d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/bundle.json","state_url":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/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-05-30T07:36:17Z","links":{"resolver":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M","bundle":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/bundle.json","state":"https://pith.science/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWT4TJQDUB4LX5AMECS5ZMBW4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JWT4TJQDUB4LX5AMECS5ZMBW4M","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":"2d38985aa0f4064cb4db1b0222b6274ec79872d9f5a5098aace686df8858e3d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-26T03:44:27Z","title_canon_sha256":"fa951026e31c96fc6a6d659f9cdddcd99bc1f9e32991ded3c670b6bb510fefd8"},"schema_version":"1.0","source":{"id":"1904.11663","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11663","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11663v1","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11663","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"JWT4TJQDUB4L","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JWT4TJQDUB4LX5AM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JWT4TJQD","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:503bbfe7e8ff629230f78328fd4a47d0beaf2b9e86d5667280e2621a8be8009d","target":"graph","created_at":"2026-05-17T23:47:43Z","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":"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","authors_text":"Hao Ge, Randall Berry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-26T03:44:27Z","title":"Quantized VCG Mechanisms for Polymatroid Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11663","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:f2ae4ce6a67328f6b6d954e5a98735352caa4fd9b0311bb8de34333ba6ecb058","target":"record","created_at":"2026-05-17T23:47:43Z","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":"2d38985aa0f4064cb4db1b0222b6274ec79872d9f5a5098aace686df8858e3d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-26T03:44:27Z","title_canon_sha256":"fa951026e31c96fc6a6d659f9cdddcd99bc1f9e32991ded3c670b6bb510fefd8"},"schema_version":"1.0","source":{"id":"1904.11663","kind":"arxiv","version":1}},"canonical_sha256":"4da7c9a603a078bbf40c20a5dcb036e305b506a63ced098a802d2c5b1d98e683","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4da7c9a603a078bbf40c20a5dcb036e305b506a63ced098a802d2c5b1d98e683","first_computed_at":"2026-05-17T23:47:43.082861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:43.082861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x9wrVqzce8IRKFCsOqli6B4Cw/dc60MbgLU+XeKy+gsxzujgKCO3GLXj6NkGdAFrXMG9OXUzz53e/VB2CFovBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:43.083444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11663","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2ae4ce6a67328f6b6d954e5a98735352caa4fd9b0311bb8de34333ba6ecb058","sha256:503bbfe7e8ff629230f78328fd4a47d0beaf2b9e86d5667280e2621a8be8009d"],"state_sha256":"f1a543f6e03fe586c01edc50e182422f47798d70065105d97424c49595495a87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wjh8fKFrngBhUdVtedfHYHh9GJM9/cINOq66pIZt+hOJhuLdLHar6CjhdLThZAxcrA4CJr6eHCUdc0Rx4I4aAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:36:17.300764Z","bundle_sha256":"e874a567225551601e96c7bc48ba0bd5147f04710839c42629cd6391a55f0da4"}}