{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JLNWOXVWKBSRVP5ML3L5NHNVX3","short_pith_number":"pith:JLNWOXVW","schema_version":"1.0","canonical_sha256":"4adb675eb650651abfac5ed7d69db5beea04226c709dd32b37473bdb2a435fd5","source":{"kind":"arxiv","id":"2202.01143","version":3},"attestation_state":"computed","paper":{"title":"Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Penny Haxell, Tibor Szab\\'o","submitted_at":"2022-02-02T17:11:21Z","abstract_excerpt":"In the max-min allocation problem a set $P$ of players are to be allocated disjoint subsets of a set $R$ of indivisible resources, such that the minimum utility among all players is maximized. We study the restricted variant, also known as the Santa Claus problem, where each resource has an intrinsic positive value, and each player covets a subset of the resources. Bez\\'akov\\'a and Dani showed that this problem is NP-hard to approximate within a factor less than $2$, consequently a great deal of work has focused on approximate solutions. The principal approach for obtaining approximation algor"},"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":"2202.01143","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-02T17:11:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0d09ec7cee7e85527bfa2d4cc5a414cd0602b26256ac2258348cf83b6790f66e","abstract_canon_sha256":"41f7bcc07cec4994bc54a3fc93a2d0f7ed73ae3eb1d68e4ce6d82221844c4fc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:38.126628Z","signature_b64":"U4iKEPA07K/rkERJ0mRE+7EwVeihMvvaHFL54ziE38aAtUKdhB9Ux5QuB5+E7wAW+90gOgwYakHUvBhz7rHkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4adb675eb650651abfac5ed7d69db5beea04226c709dd32b37473bdb2a435fd5","last_reissued_at":"2026-07-05T10:05:38.126189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:38.126189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Penny Haxell, Tibor Szab\\'o","submitted_at":"2022-02-02T17:11:21Z","abstract_excerpt":"In the max-min allocation problem a set $P$ of players are to be allocated disjoint subsets of a set $R$ of indivisible resources, such that the minimum utility among all players is maximized. We study the restricted variant, also known as the Santa Claus problem, where each resource has an intrinsic positive value, and each player covets a subset of the resources. Bez\\'akov\\'a and Dani showed that this problem is NP-hard to approximate within a factor less than $2$, consequently a great deal of work has focused on approximate solutions. The principal approach for obtaining approximation algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.01143","kind":"arxiv","version":3},"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/2202.01143/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":"2202.01143","created_at":"2026-07-05T10:05:38.126251+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.01143v3","created_at":"2026-07-05T10:05:38.126251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.01143","created_at":"2026-07-05T10:05:38.126251+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLNWOXVWKBSR","created_at":"2026-07-05T10:05:38.126251+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLNWOXVWKBSRVP5M","created_at":"2026-07-05T10:05:38.126251+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLNWOXVW","created_at":"2026-07-05T10:05:38.126251+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/JLNWOXVWKBSRVP5ML3L5NHNVX3","json":"https://pith.science/pith/JLNWOXVWKBSRVP5ML3L5NHNVX3.json","graph_json":"https://pith.science/api/pith-number/JLNWOXVWKBSRVP5ML3L5NHNVX3/graph.json","events_json":"https://pith.science/api/pith-number/JLNWOXVWKBSRVP5ML3L5NHNVX3/events.json","paper":"https://pith.science/paper/JLNWOXVW"},"agent_actions":{"view_html":"https://pith.science/pith/JLNWOXVWKBSRVP5ML3L5NHNVX3","download_json":"https://pith.science/pith/JLNWOXVWKBSRVP5ML3L5NHNVX3.json","view_paper":"https://pith.science/paper/JLNWOXVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.01143&json=true","fetch_graph":"https://pith.science/api/pith-number/JLNWOXVWKBSRVP5ML3L5NHNVX3/graph.json","fetch_events":"https://pith.science/api/pith-number/JLNWOXVWKBSRVP5ML3L5NHNVX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLNWOXVWKBSRVP5ML3L5NHNVX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLNWOXVWKBSRVP5ML3L5NHNVX3/action/storage_attestation","attest_author":"https://pith.science/pith/JLNWOXVWKBSRVP5ML3L5NHNVX3/action/author_attestation","sign_citation":"https://pith.science/pith/JLNWOXVWKBSRVP5ML3L5NHNVX3/action/citation_signature","submit_replication":"https://pith.science/pith/JLNWOXVWKBSRVP5ML3L5NHNVX3/action/replication_record"}},"created_at":"2026-07-05T10:05:38.126251+00:00","updated_at":"2026-07-05T10:05:38.126251+00:00"}