{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GSEKNZODXAJV7GS7TRGU4WUTOA","short_pith_number":"pith:GSEKNZOD","canonical_record":{"source":{"id":"1804.10902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T10:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"c1f098a991a08e642b544f060b642dde66122087926a4b7d7dc1a165bfe7574a","abstract_canon_sha256":"dab1d83854bce6d9fd4bc0ae5d9184ac63f5029a22de6a2b9e0d56c337058b3d"},"schema_version":"1.0"},"canonical_sha256":"3488a6e5c3b8135f9a5f9c4d4e5a93702bb19509751dce43d898f3e56a6719fe","source":{"kind":"arxiv","id":"1804.10902","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10902","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10902v2","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10902","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"GSEKNZODXAJV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GSEKNZODXAJV7GS7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GSEKNZOD","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GSEKNZODXAJV7GS7TRGU4WUTOA","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T10:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"c1f098a991a08e642b544f060b642dde66122087926a4b7d7dc1a165bfe7574a","abstract_canon_sha256":"dab1d83854bce6d9fd4bc0ae5d9184ac63f5029a22de6a2b9e0d56c337058b3d"},"schema_version":"1.0"},"canonical_sha256":"3488a6e5c3b8135f9a5f9c4d4e5a93702bb19509751dce43d898f3e56a6719fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:35.773358Z","signature_b64":"Zl0VRFUgoecR2ZcSCwIQ/b5W01rVFJxtgzZ52Yd7Vn/vzMh/A6l+4eDYyW7DYYzKhkGP8KltBO2SlqlUY8AUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3488a6e5c3b8135f9a5f9c4d4e5a93702bb19509751dce43d898f3e56a6719fe","last_reissued_at":"2026-05-18T00:08:35.772744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:35.772744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10902","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-18T00:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CnQuGZpGQLvClHHWyIAVVMwGaLWF09ZpW8CBlQf+02qny8sF2mjyrNHEmj4tlSb4GY9e20h7GFBLzin5IVmUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:19:10.708085Z"},"content_sha256":"a2b5fdfab5017ae145858d1e81e61716c42fbb4c658f300bdd9cc267eaf755fc","schema_version":"1.0","event_id":"sha256:a2b5fdfab5017ae145858d1e81e61716c42fbb4c658f300bdd9cc267eaf755fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GSEKNZODXAJV7GS7TRGU4WUTOA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Restricted Max-Min Fair Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Siu-Wing Cheng, Yuchen Mao","submitted_at":"2018-04-29T10:22:39Z","abstract_excerpt":"The restricted max-min fair allocation problem seeks an allocation of resources to players that maximizes the minimum total value obtained by any player. It is NP-hard to approximate the problem to a ratio less than 2. Comparing the current best algorithm for estimating the optimal value with the current best for constructing an allocation, there is quite a gap between the ratios that can be achieved in polynomial time: roughly 4 for estimation and roughly $6 + 2\\sqrt{10}$ for construction. We propose an algorithm that constructs an allocation with value within a factor of $6 + \\delta$ from th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10902","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-18T00:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Juxt7tseOTz2bOgRlxOxqCiYnmm+sX5kpfQs1jxNIopF7yoHctlgtim+BGRFYoYtItKLdo7jf2U+EsPCwTbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:19:10.708674Z"},"content_sha256":"b039f296ddcb1b001eff819bb86b70ecad1e1892f9444e40d6b7c235afab8120","schema_version":"1.0","event_id":"sha256:b039f296ddcb1b001eff819bb86b70ecad1e1892f9444e40d6b7c235afab8120"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/bundle.json","state_url":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/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-07-01T07:19:10Z","links":{"resolver":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA","bundle":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/bundle.json","state":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GSEKNZODXAJV7GS7TRGU4WUTOA","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":"dab1d83854bce6d9fd4bc0ae5d9184ac63f5029a22de6a2b9e0d56c337058b3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T10:22:39Z","title_canon_sha256":"c1f098a991a08e642b544f060b642dde66122087926a4b7d7dc1a165bfe7574a"},"schema_version":"1.0","source":{"id":"1804.10902","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10902","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10902v2","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10902","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"GSEKNZODXAJV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GSEKNZODXAJV7GS7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GSEKNZOD","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:b039f296ddcb1b001eff819bb86b70ecad1e1892f9444e40d6b7c235afab8120","target":"graph","created_at":"2026-05-18T00:08:35Z","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 restricted max-min fair allocation problem seeks an allocation of resources to players that maximizes the minimum total value obtained by any player. It is NP-hard to approximate the problem to a ratio less than 2. Comparing the current best algorithm for estimating the optimal value with the current best for constructing an allocation, there is quite a gap between the ratios that can be achieved in polynomial time: roughly 4 for estimation and roughly $6 + 2\\sqrt{10}$ for construction. We propose an algorithm that constructs an allocation with value within a factor of $6 + \\delta$ from th","authors_text":"Siu-Wing Cheng, Yuchen Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T10:22:39Z","title":"Restricted Max-Min Fair Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10902","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:a2b5fdfab5017ae145858d1e81e61716c42fbb4c658f300bdd9cc267eaf755fc","target":"record","created_at":"2026-05-18T00:08:35Z","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":"dab1d83854bce6d9fd4bc0ae5d9184ac63f5029a22de6a2b9e0d56c337058b3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T10:22:39Z","title_canon_sha256":"c1f098a991a08e642b544f060b642dde66122087926a4b7d7dc1a165bfe7574a"},"schema_version":"1.0","source":{"id":"1804.10902","kind":"arxiv","version":2}},"canonical_sha256":"3488a6e5c3b8135f9a5f9c4d4e5a93702bb19509751dce43d898f3e56a6719fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3488a6e5c3b8135f9a5f9c4d4e5a93702bb19509751dce43d898f3e56a6719fe","first_computed_at":"2026-05-18T00:08:35.772744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:35.772744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zl0VRFUgoecR2ZcSCwIQ/b5W01rVFJxtgzZ52Yd7Vn/vzMh/A6l+4eDYyW7DYYzKhkGP8KltBO2SlqlUY8AUCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:35.773358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10902","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2b5fdfab5017ae145858d1e81e61716c42fbb4c658f300bdd9cc267eaf755fc","sha256:b039f296ddcb1b001eff819bb86b70ecad1e1892f9444e40d6b7c235afab8120"],"state_sha256":"d7dc5f1f45b756ffb295e0bce88ddabda9d586cdab4ab5a353a21fae1636ca3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hMeu89sh8H74doVy/lWBAFdSNv+8CvHmDmwzuJ6S/qDrpGq0tFoXBBREKGCEvsqr9CD+GfjoAgAlp9eiuikqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T07:19:10.711253Z","bundle_sha256":"31805afaf32ae603e1a86181f673e1fc231cf3ec3f3ce28137492bf4eca93f5f"}}