{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BUJLJ4FE4N6SZ5Q6F3IE7WEBO3","short_pith_number":"pith:BUJLJ4FE","canonical_record":{"source":{"id":"1708.04369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T00:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"221d93ff2302155eef5f2d5a3d64d4475c2f42c26c7c38c333c02d7ab39e4073","abstract_canon_sha256":"490c4de741f90e9a811bbd144f4b740a690759b6e8ed0436e412fa87721436fd"},"schema_version":"1.0"},"canonical_sha256":"0d12b4f0a4e37d2cf61e2ed04fd88176e6e84d55ede5130515c62764caaefb9a","source":{"kind":"arxiv","id":"1708.04369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04369","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04369v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04369","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"BUJLJ4FE4N6S","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BUJLJ4FE4N6SZ5Q6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BUJLJ4FE","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BUJLJ4FE4N6SZ5Q6F3IE7WEBO3","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T00:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"221d93ff2302155eef5f2d5a3d64d4475c2f42c26c7c38c333c02d7ab39e4073","abstract_canon_sha256":"490c4de741f90e9a811bbd144f4b740a690759b6e8ed0436e412fa87721436fd"},"schema_version":"1.0"},"canonical_sha256":"0d12b4f0a4e37d2cf61e2ed04fd88176e6e84d55ede5130515c62764caaefb9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.522420Z","signature_b64":"s/Rs7h2C6+MdLx0eTJGDbSd3XpasDSnEUS8a9Df3l5Ev7mQwi1zffsQHx7l9TufwcCnmZ4S90Sz20HC4OhayCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d12b4f0a4e37d2cf61e2ed04fd88176e6e84d55ede5130515c62764caaefb9a","last_reissued_at":"2026-05-18T00:37:59.521959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.521959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04369","source_version":1,"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:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQ5OzAVL2KiS1g3uc4xL6+H0Q16Q0onr7wSB9gCmemDr4mzpoUOkBk3Lpa8ViNkgCDvL9U9apGirKqJPdHFiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:19:19.118698Z"},"content_sha256":"53f6e32ba0a27a97c9babc3869142c9aea3baacb8ddd194da30352d78138214c","schema_version":"1.0","event_id":"sha256:53f6e32ba0a27a97c9babc3869142c9aea3baacb8ddd194da30352d78138214c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BUJLJ4FE4N6SZ5Q6F3IE7WEBO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quasi-PTAS for Scheduling with Precedences using LP Hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shashwat Garg","submitted_at":"2017-08-15T00:52:30Z","abstract_excerpt":"A central problem in scheduling is to schedule $n$ unit size jobs with precedence constraints on $m$ identical machines so as to minimize the makespan. For $m=3$, it is not even known if the problem is NP-hard and this is one of the last open problems from the book of Garey and Johnson.\n  We show that for fixed $m$ and $\\epsilon$, $(\\log n)^{O(1)}$ rounds of Sherali-Adams hierarchy applied to a natural LP of the problem provides a $(1+\\epsilon)$-approximation algorithm running in quasi-polynomial time. This improves over the recent result of Levey and Rothvoss, who used $r=(\\log n)^{O(\\log \\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04369","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"},"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:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxRNilE6KPeL//1B3O5TIFGRZlx4faN4hRyeKqGoMroSRPTv0BO1b6OCrTrbf1qAGD+lBygTfWnoKxopaq1mBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:19:19.119398Z"},"content_sha256":"453411167b2c3082c91acf5b4fc79db0ae2ec88f5b08a78bf22af87eed740295","schema_version":"1.0","event_id":"sha256:453411167b2c3082c91acf5b4fc79db0ae2ec88f5b08a78bf22af87eed740295"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/bundle.json","state_url":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/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-06-09T03:19:19Z","links":{"resolver":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3","bundle":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/bundle.json","state":"https://pith.science/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BUJLJ4FE4N6SZ5Q6F3IE7WEBO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BUJLJ4FE4N6SZ5Q6F3IE7WEBO3","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":"490c4de741f90e9a811bbd144f4b740a690759b6e8ed0436e412fa87721436fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T00:52:30Z","title_canon_sha256":"221d93ff2302155eef5f2d5a3d64d4475c2f42c26c7c38c333c02d7ab39e4073"},"schema_version":"1.0","source":{"id":"1708.04369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04369","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04369v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04369","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"BUJLJ4FE4N6S","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BUJLJ4FE4N6SZ5Q6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BUJLJ4FE","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:453411167b2c3082c91acf5b4fc79db0ae2ec88f5b08a78bf22af87eed740295","target":"graph","created_at":"2026-05-18T00:37:59Z","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":"A central problem in scheduling is to schedule $n$ unit size jobs with precedence constraints on $m$ identical machines so as to minimize the makespan. For $m=3$, it is not even known if the problem is NP-hard and this is one of the last open problems from the book of Garey and Johnson.\n  We show that for fixed $m$ and $\\epsilon$, $(\\log n)^{O(1)}$ rounds of Sherali-Adams hierarchy applied to a natural LP of the problem provides a $(1+\\epsilon)$-approximation algorithm running in quasi-polynomial time. This improves over the recent result of Levey and Rothvoss, who used $r=(\\log n)^{O(\\log \\lo","authors_text":"Shashwat Garg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T00:52:30Z","title":"Quasi-PTAS for Scheduling with Precedences using LP Hierarchies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04369","kind":"arxiv","version":1},"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:53f6e32ba0a27a97c9babc3869142c9aea3baacb8ddd194da30352d78138214c","target":"record","created_at":"2026-05-18T00:37:59Z","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":"490c4de741f90e9a811bbd144f4b740a690759b6e8ed0436e412fa87721436fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T00:52:30Z","title_canon_sha256":"221d93ff2302155eef5f2d5a3d64d4475c2f42c26c7c38c333c02d7ab39e4073"},"schema_version":"1.0","source":{"id":"1708.04369","kind":"arxiv","version":1}},"canonical_sha256":"0d12b4f0a4e37d2cf61e2ed04fd88176e6e84d55ede5130515c62764caaefb9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d12b4f0a4e37d2cf61e2ed04fd88176e6e84d55ede5130515c62764caaefb9a","first_computed_at":"2026-05-18T00:37:59.521959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:59.521959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s/Rs7h2C6+MdLx0eTJGDbSd3XpasDSnEUS8a9Df3l5Ev7mQwi1zffsQHx7l9TufwcCnmZ4S90Sz20HC4OhayCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:59.522420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53f6e32ba0a27a97c9babc3869142c9aea3baacb8ddd194da30352d78138214c","sha256:453411167b2c3082c91acf5b4fc79db0ae2ec88f5b08a78bf22af87eed740295"],"state_sha256":"162cfe47d5830b5a0ff91202383535a13c6a158ca7dd802bd57374e06a90ce4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v251WoonAGAZ25qCPADTZJd0O95oH73DTIZwKsR/7Ww8J8UIcTO+4Kj9wDyDkgLQGxirRKn+Nd/o7irhPiHXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:19:19.123797Z","bundle_sha256":"7162d8bc7b3779692fe20c0ce73bdc7f42f975b0e75b476eba8d155cfbee018b"}}