{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DDCI7W4OMKSUEA4FUV3WKJOMGT","short_pith_number":"pith:DDCI7W4O","schema_version":"1.0","canonical_sha256":"18c48fdb8e62a5420385a5776525cc34f90c3736bfc9483287927b670feec15c","source":{"kind":"arxiv","id":"2404.07707","version":1},"attestation_state":"computed","paper":{"title":"Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shengwei Zhou, Xiaowei Wu","submitted_at":"2024-04-11T12:51:21Z","abstract_excerpt":"We consider the problem of allocating $m$ indivisible items to a set of $n$ heterogeneous agents, aiming at computing a proportional allocation by introducing subsidy (money). It has been shown by Wu et al. (WINE 2023) that when agents are unweighted a total subsidy of $n/4$ suffices (assuming that each item has value/cost at most $1$ to every agent) to ensure proportionality. When agents have general weights, they proposed an algorithm that guarantees a weighted proportional allocation requiring a total subsidy of $(n-1)/2$, by rounding the fractional bid-and-take algorithm. In this work, we "},"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":"2404.07707","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-04-11T12:51:21Z","cross_cats_sorted":[],"title_canon_sha256":"2d9be2ec73d1d7b983892a3f8c6a095a1a3de7649089308a63261e55d25c19a3","abstract_canon_sha256":"b5908fd9682afb98aec2b9202f0a237300380d397077ff6c580ad44d020fed10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:56.517452Z","signature_b64":"LqBclO6aqxsm8RKecIomyCYkVYG3Vu9PIzK7j6dqiDEWugzIiWL1GKuYRSzQVBm0ZTvbBDzN9j92nBpSQjl7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18c48fdb8e62a5420385a5776525cc34f90c3736bfc9483287927b670feec15c","last_reissued_at":"2026-07-05T08:06:56.516974Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:56.516974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shengwei Zhou, Xiaowei Wu","submitted_at":"2024-04-11T12:51:21Z","abstract_excerpt":"We consider the problem of allocating $m$ indivisible items to a set of $n$ heterogeneous agents, aiming at computing a proportional allocation by introducing subsidy (money). It has been shown by Wu et al. (WINE 2023) that when agents are unweighted a total subsidy of $n/4$ suffices (assuming that each item has value/cost at most $1$ to every agent) to ensure proportionality. When agents have general weights, they proposed an algorithm that guarantees a weighted proportional allocation requiring a total subsidy of $(n-1)/2$, by rounding the fractional bid-and-take algorithm. In this work, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07707","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.07707/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.07707","created_at":"2026-07-05T08:06:56.517034+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.07707v1","created_at":"2026-07-05T08:06:56.517034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07707","created_at":"2026-07-05T08:06:56.517034+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDCI7W4OMKSU","created_at":"2026-07-05T08:06:56.517034+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDCI7W4OMKSUEA4F","created_at":"2026-07-05T08:06:56.517034+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDCI7W4O","created_at":"2026-07-05T08:06:56.517034+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23251","citing_title":"Achieving Equitability with Subsidy","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDCI7W4OMKSUEA4FUV3WKJOMGT","json":"https://pith.science/pith/DDCI7W4OMKSUEA4FUV3WKJOMGT.json","graph_json":"https://pith.science/api/pith-number/DDCI7W4OMKSUEA4FUV3WKJOMGT/graph.json","events_json":"https://pith.science/api/pith-number/DDCI7W4OMKSUEA4FUV3WKJOMGT/events.json","paper":"https://pith.science/paper/DDCI7W4O"},"agent_actions":{"view_html":"https://pith.science/pith/DDCI7W4OMKSUEA4FUV3WKJOMGT","download_json":"https://pith.science/pith/DDCI7W4OMKSUEA4FUV3WKJOMGT.json","view_paper":"https://pith.science/paper/DDCI7W4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.07707&json=true","fetch_graph":"https://pith.science/api/pith-number/DDCI7W4OMKSUEA4FUV3WKJOMGT/graph.json","fetch_events":"https://pith.science/api/pith-number/DDCI7W4OMKSUEA4FUV3WKJOMGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDCI7W4OMKSUEA4FUV3WKJOMGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDCI7W4OMKSUEA4FUV3WKJOMGT/action/storage_attestation","attest_author":"https://pith.science/pith/DDCI7W4OMKSUEA4FUV3WKJOMGT/action/author_attestation","sign_citation":"https://pith.science/pith/DDCI7W4OMKSUEA4FUV3WKJOMGT/action/citation_signature","submit_replication":"https://pith.science/pith/DDCI7W4OMKSUEA4FUV3WKJOMGT/action/replication_record"}},"created_at":"2026-07-05T08:06:56.517034+00:00","updated_at":"2026-07-05T08:06:56.517034+00:00"}