{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YS5VBW32EDLBYHOCKIJZFQICZS","short_pith_number":"pith:YS5VBW32","schema_version":"1.0","canonical_sha256":"c4bb50db7a20d61c1dc2521392c102ccabc9bcff0918fddee67443f5d8870ea7","source":{"kind":"arxiv","id":"1905.01670","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.01670","created_at":"2026-05-17T23:46:57.817983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01670v1","created_at":"2026-05-17T23:46:57.817983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01670","created_at":"2026-05-17T23:46:57.817983+00:00"},{"alias_kind":"pith_short_12","alias_value":"YS5VBW32EDLB","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YS5VBW32EDLBYHOC","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YS5VBW32","created_at":"2026-05-18T12:33:33.725879+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/YS5VBW32EDLBYHOCKIJZFQICZS","json":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS.json","graph_json":"https://pith.science/api/pith-number/YS5VBW32EDLBYHOCKIJZFQICZS/graph.json","events_json":"https://pith.science/api/pith-number/YS5VBW32EDLBYHOCKIJZFQICZS/events.json","paper":"https://pith.science/paper/YS5VBW32"},"agent_actions":{"view_html":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS","download_json":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS.json","view_paper":"https://pith.science/paper/YS5VBW32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01670&json=true","fetch_graph":"https://pith.science/api/pith-number/YS5VBW32EDLBYHOCKIJZFQICZS/graph.json","fetch_events":"https://pith.science/api/pith-number/YS5VBW32EDLBYHOCKIJZFQICZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS/action/storage_attestation","attest_author":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS/action/author_attestation","sign_citation":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS/action/citation_signature","submit_replication":"https://pith.science/pith/YS5VBW32EDLBYHOCKIJZFQICZS/action/replication_record"}},"created_at":"2026-05-17T23:46:57.817983+00:00","updated_at":"2026-05-17T23:46:57.817983+00:00"}