{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YS5VBW32EDLBYHOCKIJZFQICZS","short_pith_number":"pith:YS5VBW32","canonical_record":{"source":{"id":"1905.01670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-05T12:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"7a509a348ff914b73cbec767a1d00fe335f109dfbbded3b77f57d08f2caee192","abstract_canon_sha256":"bbdf1f8b794359ff698f5e9b697dd6beed50f79c0c01e3cc428ccd55972e02dd"},"schema_version":"1.0"},"canonical_sha256":"c4bb50db7a20d61c1dc2521392c102ccabc9bcff0918fddee67443f5d8870ea7","source":{"kind":"arxiv","id":"1905.01670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01670","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01670v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01670","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"YS5VBW32EDLB","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YS5VBW32EDLBYHOC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YS5VBW32","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YS5VBW32EDLBYHOCKIJZFQICZS","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-05T12:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"7a509a348ff914b73cbec767a1d00fe335f109dfbbded3b77f57d08f2caee192","abstract_canon_sha256":"bbdf1f8b794359ff698f5e9b697dd6beed50f79c0c01e3cc428ccd55972e02dd"},"schema_version":"1.0"},"canonical_sha256":"c4bb50db7a20d61c1dc2521392c102ccabc9bcff0918fddee67443f5d8870ea7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:57.818629Z","signature_b64":"AD2y6hiGk/tyuXADdcOTkTPcPllxEK2s6zMA66nr5y1fRdy0ySNoug0PTvTWco0Yqeuyy55tkI15q456U/WVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4bb50db7a20d61c1dc2521392c102ccabc9bcff0918fddee67443f5d8870ea7","last_reissued_at":"2026-05-17T23:46:57.817840Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:57.817840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01670","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:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/t1K+p/k+IYfGZ++Rk4DNam9qJZn3N/7TjogVwQmVNUK2mQ4C1OFEEcTD7Te8F19hczPRvM79VrGsAnimEADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:18:02.142435Z"},"content_sha256":"05bbecc3728270c41325c1aa932f994ab7035e3fce72f93390d9e853d50bbafb","schema_version":"1.0","event_id":"sha256:05bbecc3728270c41325c1aa932f994ab7035e3fce72f93390d9e853d50bbafb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YS5VBW32EDLBYHOCKIJZFQICZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Wei Zhu, Xiang Yan","submitted_at":"2019-05-05T12:27:30Z","abstract_excerpt":"The rapid growth of wireless and mobile Internet has led to wide applications of exchanging resources over network, in which how to fairly allocate resources has become a critical challenge. To motivate sharing, a BD Mechanism is proposed for resource allocation, which is based on a combinatorial structure called bottleneck decomposition. The mechanism has been shown with properties of fairness, economic efficiency [17], and truthfulness against two kinds of strategic behaviors [2,3]. Unfortunately, the crux on how to compute a bottleneck decomposition of any graph is remain untouched. In this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01670","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:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1FJmmnCpzAXqoqvIfD2MR+YT07OI3FAkVq+Xe0Bqr8T5eGLwx9QRXL4OVyEZkhxi4sPaTa05iKhVUi+2fNpMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:18:02.142799Z"},"content_sha256":"85d1f542afb8a08c27cf2ca9be1924dc91b13edb5551c2fd74fc70945ed7f9ec","schema_version":"1.0","event_id":"sha256:85d1f542afb8a08c27cf2ca9be1924dc91b13edb5551c2fd74fc70945ed7f9ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS/bundle.json","state_url":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YS5VBW32EDLBYHOCKIJZFQICZS/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-10T19:18:02Z","links":{"resolver":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS","bundle":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS/bundle.json","state":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YS5VBW32EDLBYHOCKIJZFQICZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YS5VBW32EDLBYHOCKIJZFQICZS","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":"bbdf1f8b794359ff698f5e9b697dd6beed50f79c0c01e3cc428ccd55972e02dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-05T12:27:30Z","title_canon_sha256":"7a509a348ff914b73cbec767a1d00fe335f109dfbbded3b77f57d08f2caee192"},"schema_version":"1.0","source":{"id":"1905.01670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01670","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01670v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01670","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"YS5VBW32EDLB","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YS5VBW32EDLBYHOC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YS5VBW32","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:85d1f542afb8a08c27cf2ca9be1924dc91b13edb5551c2fd74fc70945ed7f9ec","target":"graph","created_at":"2026-05-17T23:46:57Z","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":"The rapid growth of wireless and mobile Internet has led to wide applications of exchanging resources over network, in which how to fairly allocate resources has become a critical challenge. To motivate sharing, a BD Mechanism is proposed for resource allocation, which is based on a combinatorial structure called bottleneck decomposition. The mechanism has been shown with properties of fairness, economic efficiency [17], and truthfulness against two kinds of strategic behaviors [2,3]. Unfortunately, the crux on how to compute a bottleneck decomposition of any graph is remain untouched. In this","authors_text":"Wei Zhu, Xiang Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-05T12:27:30Z","title":"A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01670","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:05bbecc3728270c41325c1aa932f994ab7035e3fce72f93390d9e853d50bbafb","target":"record","created_at":"2026-05-17T23:46:57Z","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":"bbdf1f8b794359ff698f5e9b697dd6beed50f79c0c01e3cc428ccd55972e02dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-05T12:27:30Z","title_canon_sha256":"7a509a348ff914b73cbec767a1d00fe335f109dfbbded3b77f57d08f2caee192"},"schema_version":"1.0","source":{"id":"1905.01670","kind":"arxiv","version":1}},"canonical_sha256":"c4bb50db7a20d61c1dc2521392c102ccabc9bcff0918fddee67443f5d8870ea7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4bb50db7a20d61c1dc2521392c102ccabc9bcff0918fddee67443f5d8870ea7","first_computed_at":"2026-05-17T23:46:57.817840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:57.817840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AD2y6hiGk/tyuXADdcOTkTPcPllxEK2s6zMA66nr5y1fRdy0ySNoug0PTvTWco0Yqeuyy55tkI15q456U/WVDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:57.818629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05bbecc3728270c41325c1aa932f994ab7035e3fce72f93390d9e853d50bbafb","sha256:85d1f542afb8a08c27cf2ca9be1924dc91b13edb5551c2fd74fc70945ed7f9ec"],"state_sha256":"9285d01c5f8d26f2600607fd64a20d08067f2597d3e35cb51a724212ad92e182"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smUNYTTtb363KuREGD3Lh7LJGE91qCluewyxCgducNEpiCDlnFgQSXLBj/6/8aoClTi3Ki/EAkFvlkWf81OPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:18:02.144777Z","bundle_sha256":"6e40c5156d9303fd557fdc22c1a6824e2dab19b19931a9032c7fb2d54a5712a7"}}