{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WPFRML32D2WD5PPQBAP2Z5WFCN","short_pith_number":"pith:WPFRML32","canonical_record":{"source":{"id":"1904.03322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-06T00:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"8d07d4453d5ae59cbf8b424e7b04ae1043de0badd3326542d63e1479120c4a9a","abstract_canon_sha256":"1c03aa9bcfe0d664f034b12c63f3afa34bd5dcf62893f15f20a72313a89c295c"},"schema_version":"1.0"},"canonical_sha256":"b3cb162f7a1eac3ebdf0081facf6c51366c95574b6927023b790f2562368d5ca","source":{"kind":"arxiv","id":"1904.03322","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03322","created_at":"2026-05-17T23:46:52Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03322v2","created_at":"2026-05-17T23:46:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03322","created_at":"2026-05-17T23:46:52Z"},{"alias_kind":"pith_short_12","alias_value":"WPFRML32D2WD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WPFRML32D2WD5PPQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WPFRML32","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WPFRML32D2WD5PPQBAP2Z5WFCN","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-06T00:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"8d07d4453d5ae59cbf8b424e7b04ae1043de0badd3326542d63e1479120c4a9a","abstract_canon_sha256":"1c03aa9bcfe0d664f034b12c63f3afa34bd5dcf62893f15f20a72313a89c295c"},"schema_version":"1.0"},"canonical_sha256":"b3cb162f7a1eac3ebdf0081facf6c51366c95574b6927023b790f2562368d5ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:52.457672Z","signature_b64":"SmrTPZvncQDSa1q+eTnLQMp7Xg5Mfs2bsaArJKy0vBcMzwQkHLgygU6Kv1Fux5K7sK675E96gpdAlB9UVPI2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3cb162f7a1eac3ebdf0081facf6c51366c95574b6927023b790f2562368d5ca","last_reissued_at":"2026-05-17T23:46:52.457095Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:52.457095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03322","source_version":2,"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:46:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WRvjYVXWrLBWHbZ7MXLkeuBC92SPcbgge8fWkK9oy9Zl3uJS0B+71HCMbKoe2zUlpixSZ7qnVCqjj/uVFPrTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T10:42:45.956268Z"},"content_sha256":"a6f5c84c4d68f321627ceeaf7201bf0fba832329d9fd61ee8da3212507476304","schema_version":"1.0","event_id":"sha256:a6f5c84c4d68f321627ceeaf7201bf0fba832329d9fd61ee8da3212507476304"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WPFRML32D2WD5PPQBAP2Z5WFCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Nash Equilibria for Bandwidth Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Benjamin Plaut","submitted_at":"2019-04-06T00:16:03Z","abstract_excerpt":"In bandwidth allocation, competing agents wish to transmit data along paths of links in a network, and each agent's utility is equal to the minimum bandwidth she receives among all links in her desired path. Recent market mechanisms for this problem have either focused on only Nash welfare, or ignored strategic behavior. We propose a nonlinear variant of the classic trading post mechanism, and show that for almost the entire family of CES welfare functions (which includes maxmin welfare, Nash welfare, and utilitarian welfare), every Nash equilibrium of our mechanism is optimal. We also prove t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03322","kind":"arxiv","version":2},"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:46:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n1PaB0ewVq/8sN5iskuqULnJl5L552gD47+E0sBMRhcRHJ8f+F0sCL7HEdbpVJg94j5A0/+u0x+lr2waV/9RCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T10:42:45.956628Z"},"content_sha256":"77557efc03274bdbe5468dec44686f43bb2b85ee72872276d610ab0d0e39eb50","schema_version":"1.0","event_id":"sha256:77557efc03274bdbe5468dec44686f43bb2b85ee72872276d610ab0d0e39eb50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPFRML32D2WD5PPQBAP2Z5WFCN/bundle.json","state_url":"https://pith.science/pith/WPFRML32D2WD5PPQBAP2Z5WFCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPFRML32D2WD5PPQBAP2Z5WFCN/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-29T10:42:45Z","links":{"resolver":"https://pith.science/pith/WPFRML32D2WD5PPQBAP2Z5WFCN","bundle":"https://pith.science/pith/WPFRML32D2WD5PPQBAP2Z5WFCN/bundle.json","state":"https://pith.science/pith/WPFRML32D2WD5PPQBAP2Z5WFCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPFRML32D2WD5PPQBAP2Z5WFCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WPFRML32D2WD5PPQBAP2Z5WFCN","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":"1c03aa9bcfe0d664f034b12c63f3afa34bd5dcf62893f15f20a72313a89c295c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-06T00:16:03Z","title_canon_sha256":"8d07d4453d5ae59cbf8b424e7b04ae1043de0badd3326542d63e1479120c4a9a"},"schema_version":"1.0","source":{"id":"1904.03322","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03322","created_at":"2026-05-17T23:46:52Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03322v2","created_at":"2026-05-17T23:46:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03322","created_at":"2026-05-17T23:46:52Z"},{"alias_kind":"pith_short_12","alias_value":"WPFRML32D2WD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WPFRML32D2WD5PPQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WPFRML32","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:77557efc03274bdbe5468dec44686f43bb2b85ee72872276d610ab0d0e39eb50","target":"graph","created_at":"2026-05-17T23:46:52Z","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":"In bandwidth allocation, competing agents wish to transmit data along paths of links in a network, and each agent's utility is equal to the minimum bandwidth she receives among all links in her desired path. Recent market mechanisms for this problem have either focused on only Nash welfare, or ignored strategic behavior. We propose a nonlinear variant of the classic trading post mechanism, and show that for almost the entire family of CES welfare functions (which includes maxmin welfare, Nash welfare, and utilitarian welfare), every Nash equilibrium of our mechanism is optimal. We also prove t","authors_text":"Benjamin Plaut","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-06T00:16:03Z","title":"Optimal Nash Equilibria for Bandwidth Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03322","kind":"arxiv","version":2},"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:a6f5c84c4d68f321627ceeaf7201bf0fba832329d9fd61ee8da3212507476304","target":"record","created_at":"2026-05-17T23:46:52Z","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":"1c03aa9bcfe0d664f034b12c63f3afa34bd5dcf62893f15f20a72313a89c295c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-06T00:16:03Z","title_canon_sha256":"8d07d4453d5ae59cbf8b424e7b04ae1043de0badd3326542d63e1479120c4a9a"},"schema_version":"1.0","source":{"id":"1904.03322","kind":"arxiv","version":2}},"canonical_sha256":"b3cb162f7a1eac3ebdf0081facf6c51366c95574b6927023b790f2562368d5ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3cb162f7a1eac3ebdf0081facf6c51366c95574b6927023b790f2562368d5ca","first_computed_at":"2026-05-17T23:46:52.457095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:52.457095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SmrTPZvncQDSa1q+eTnLQMp7Xg5Mfs2bsaArJKy0vBcMzwQkHLgygU6Kv1Fux5K7sK675E96gpdAlB9UVPI2BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:52.457672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03322","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6f5c84c4d68f321627ceeaf7201bf0fba832329d9fd61ee8da3212507476304","sha256:77557efc03274bdbe5468dec44686f43bb2b85ee72872276d610ab0d0e39eb50"],"state_sha256":"d91c677efc328d7de1e591a12dfb419127c67dd1c38ff218b3ec642e3e61f910"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tm2wbgXMrx+fnEUMdwzRU8oEzINlT4zTToKtg+b40WQjEn9iaEMC1IkptqvxJxmIHE5Tmmsh3c19hk9f5NppAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T10:42:45.958589Z","bundle_sha256":"fab908daa2e83679a876bd5f352c03d64e309315b6a10e8ec5177de9fad25078"}}