{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3SEPLUB6PGMMZ5GBANMDTOV4M5","short_pith_number":"pith:3SEPLUB6","schema_version":"1.0","canonical_sha256":"dc88f5d03e7998ccf4c1035839babc676ff6136f7e611bac122404eac32a2311","source":{"kind":"arxiv","id":"1009.4529","version":1},"attestation_state":"computed","paper":{"title":"A PTAS for Scheduling with Tree Assignment Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ulrich M. Schwarz","submitted_at":"2010-09-23T07:12:49Z","abstract_excerpt":"Scheduling with assignment restrictions is an important special case of scheduling unrelated machines which has attracted much attention in the recent past. While a lower bound on approximability of 3/2 is known for its most general setting, subclasses of the problem admit polynomial-time approximation schemes. This note provides a PTAS for tree-like hierarchical structures, improving on a recent 4/3-approximation by Huo and Leung."},"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":"1009.4529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-23T07:12:49Z","cross_cats_sorted":[],"title_canon_sha256":"245a4cf796fd56634d9c383fb160854841fc7cc7e1f76122aaa8f0cdd91572f6","abstract_canon_sha256":"0411a4e0acfc45db161ba310b9cdd0f494e87870478f6ae3819cf7a366233b49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:30.216967Z","signature_b64":"SGJ5ekr2QKMdMn0JdsPpWq0hUMTbzciNXUb701w3wRtY+p/pJ39SoZheaFndkEWO8AywhnrSDHfYoBSMgRzmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc88f5d03e7998ccf4c1035839babc676ff6136f7e611bac122404eac32a2311","last_reissued_at":"2026-05-18T04:40:30.216248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:30.216248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A PTAS for Scheduling with Tree Assignment Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ulrich M. Schwarz","submitted_at":"2010-09-23T07:12:49Z","abstract_excerpt":"Scheduling with assignment restrictions is an important special case of scheduling unrelated machines which has attracted much attention in the recent past. While a lower bound on approximability of 3/2 is known for its most general setting, subclasses of the problem admit polynomial-time approximation schemes. This note provides a PTAS for tree-like hierarchical structures, improving on a recent 4/3-approximation by Huo and Leung."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4529","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":"1009.4529","created_at":"2026-05-18T04:40:30.216379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4529v1","created_at":"2026-05-18T04:40:30.216379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4529","created_at":"2026-05-18T04:40:30.216379+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SEPLUB6PGMM","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SEPLUB6PGMMZ5GB","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SEPLUB6","created_at":"2026-05-18T12:26:03.138858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03526","citing_title":"Inapproximability Results for Scheduling with Interval and Resource Restrictions","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3SEPLUB6PGMMZ5GBANMDTOV4M5","json":"https://pith.science/pith/3SEPLUB6PGMMZ5GBANMDTOV4M5.json","graph_json":"https://pith.science/api/pith-number/3SEPLUB6PGMMZ5GBANMDTOV4M5/graph.json","events_json":"https://pith.science/api/pith-number/3SEPLUB6PGMMZ5GBANMDTOV4M5/events.json","paper":"https://pith.science/paper/3SEPLUB6"},"agent_actions":{"view_html":"https://pith.science/pith/3SEPLUB6PGMMZ5GBANMDTOV4M5","download_json":"https://pith.science/pith/3SEPLUB6PGMMZ5GBANMDTOV4M5.json","view_paper":"https://pith.science/paper/3SEPLUB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4529&json=true","fetch_graph":"https://pith.science/api/pith-number/3SEPLUB6PGMMZ5GBANMDTOV4M5/graph.json","fetch_events":"https://pith.science/api/pith-number/3SEPLUB6PGMMZ5GBANMDTOV4M5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SEPLUB6PGMMZ5GBANMDTOV4M5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SEPLUB6PGMMZ5GBANMDTOV4M5/action/storage_attestation","attest_author":"https://pith.science/pith/3SEPLUB6PGMMZ5GBANMDTOV4M5/action/author_attestation","sign_citation":"https://pith.science/pith/3SEPLUB6PGMMZ5GBANMDTOV4M5/action/citation_signature","submit_replication":"https://pith.science/pith/3SEPLUB6PGMMZ5GBANMDTOV4M5/action/replication_record"}},"created_at":"2026-05-18T04:40:30.216379+00:00","updated_at":"2026-05-18T04:40:30.216379+00:00"}