{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RITFH5FSZ2IZZONFXLWLKEG2ZO","short_pith_number":"pith:RITFH5FS","canonical_record":{"source":{"id":"1507.01906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T18:04:24Z","cross_cats_sorted":[],"title_canon_sha256":"c6de87fad6130e5a4b01552fd7ee37c1286da01ce9fd0d8542bcc230118cceb9","abstract_canon_sha256":"e46fc007954d33659bfa03ea825132bf55f9341ce9a343a5562605c21ed4a617"},"schema_version":"1.0"},"canonical_sha256":"8a2653f4b2ce919cb9a5baecb510dacba571823cefdcd553fa3eb3165a5ea711","source":{"kind":"arxiv","id":"1507.01906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01906","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01906v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01906","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"RITFH5FSZ2IZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RITFH5FSZ2IZZONF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RITFH5FS","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RITFH5FSZ2IZZONFXLWLKEG2ZO","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T18:04:24Z","cross_cats_sorted":[],"title_canon_sha256":"c6de87fad6130e5a4b01552fd7ee37c1286da01ce9fd0d8542bcc230118cceb9","abstract_canon_sha256":"e46fc007954d33659bfa03ea825132bf55f9341ce9a343a5562605c21ed4a617"},"schema_version":"1.0"},"canonical_sha256":"8a2653f4b2ce919cb9a5baecb510dacba571823cefdcd553fa3eb3165a5ea711","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:12.072872Z","signature_b64":"FBauJQ4GNmX5UkqhcdSBteN/ZUGSegWO+H2LDaBqd0Sg9E/8x9OLsA2WNZ2W8aXBHjXeXx/+vptUCMrWS71eBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a2653f4b2ce919cb9a5baecb510dacba571823cefdcd553fa3eb3165a5ea711","last_reissued_at":"2026-05-18T01:37:12.072100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:12.072100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01906","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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8VCP/Lq7e29tL/tpXxBQ5rbpRXeKmmXgXPq/0rvaRM49VYVLOJs4U6SNAPWi3pejeyq1ssW1sxIa0rN7utOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T05:02:35.144456Z"},"content_sha256":"12a5d66f839a073d529c987ed9ca7147cff6f8b9ca8bd5ddbbee25f6c190f0e9","schema_version":"1.0","event_id":"sha256:12a5d66f839a073d529c987ed9ca7147cff6f8b9ca8bd5ddbbee25f6c190f0e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RITFH5FSZ2IZZONFXLWLKEG2ZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Tight Lower Bounds for Scheduling Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abbas Bazzi, Ashkan Norouzi-Fard","submitted_at":"2015-07-07T18:04:24Z","abstract_excerpt":"We show a close connection between structural hardness for $k$-partite graphs and tight inapproximability results for scheduling problems with precedence constraints. Assuming a natural but nontrivial generalisation of the bipartite structural hardness result of Bansal and Khot, we obtain a hardness of $2-\\epsilon$ for the problem of minimising the makespan for scheduling precedence-constrained jobs with preemption on identical parallel machines. This matches the best approximation guarantee for this problem. Assuming the same hypothesis, we also obtain a super constant inapproximability resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01906","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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PataSLP0Q/TvZERYi92ZaLXjGGcE0IYNEiG9RsPWcjW7VgWH0DKhP7nzxAdwhsTpBs72hFMtQnawFWFL8WToDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T05:02:35.145159Z"},"content_sha256":"fb75c011246eb54b9a2c4289b871bab5bef76f1cdc30a59fb23f33df77f8dd79","schema_version":"1.0","event_id":"sha256:fb75c011246eb54b9a2c4289b871bab5bef76f1cdc30a59fb23f33df77f8dd79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RITFH5FSZ2IZZONFXLWLKEG2ZO/bundle.json","state_url":"https://pith.science/pith/RITFH5FSZ2IZZONFXLWLKEG2ZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RITFH5FSZ2IZZONFXLWLKEG2ZO/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-05-24T05:02:35Z","links":{"resolver":"https://pith.science/pith/RITFH5FSZ2IZZONFXLWLKEG2ZO","bundle":"https://pith.science/pith/RITFH5FSZ2IZZONFXLWLKEG2ZO/bundle.json","state":"https://pith.science/pith/RITFH5FSZ2IZZONFXLWLKEG2ZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RITFH5FSZ2IZZONFXLWLKEG2ZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RITFH5FSZ2IZZONFXLWLKEG2ZO","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":"e46fc007954d33659bfa03ea825132bf55f9341ce9a343a5562605c21ed4a617","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T18:04:24Z","title_canon_sha256":"c6de87fad6130e5a4b01552fd7ee37c1286da01ce9fd0d8542bcc230118cceb9"},"schema_version":"1.0","source":{"id":"1507.01906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01906","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01906v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01906","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"RITFH5FSZ2IZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RITFH5FSZ2IZZONF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RITFH5FS","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:fb75c011246eb54b9a2c4289b871bab5bef76f1cdc30a59fb23f33df77f8dd79","target":"graph","created_at":"2026-05-18T01:37:12Z","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":"We show a close connection between structural hardness for $k$-partite graphs and tight inapproximability results for scheduling problems with precedence constraints. Assuming a natural but nontrivial generalisation of the bipartite structural hardness result of Bansal and Khot, we obtain a hardness of $2-\\epsilon$ for the problem of minimising the makespan for scheduling precedence-constrained jobs with preemption on identical parallel machines. This matches the best approximation guarantee for this problem. Assuming the same hypothesis, we also obtain a super constant inapproximability resul","authors_text":"Abbas Bazzi, Ashkan Norouzi-Fard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T18:04:24Z","title":"Towards Tight Lower Bounds for Scheduling Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01906","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:12a5d66f839a073d529c987ed9ca7147cff6f8b9ca8bd5ddbbee25f6c190f0e9","target":"record","created_at":"2026-05-18T01:37:12Z","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":"e46fc007954d33659bfa03ea825132bf55f9341ce9a343a5562605c21ed4a617","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T18:04:24Z","title_canon_sha256":"c6de87fad6130e5a4b01552fd7ee37c1286da01ce9fd0d8542bcc230118cceb9"},"schema_version":"1.0","source":{"id":"1507.01906","kind":"arxiv","version":1}},"canonical_sha256":"8a2653f4b2ce919cb9a5baecb510dacba571823cefdcd553fa3eb3165a5ea711","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a2653f4b2ce919cb9a5baecb510dacba571823cefdcd553fa3eb3165a5ea711","first_computed_at":"2026-05-18T01:37:12.072100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:12.072100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FBauJQ4GNmX5UkqhcdSBteN/ZUGSegWO+H2LDaBqd0Sg9E/8x9OLsA2WNZ2W8aXBHjXeXx/+vptUCMrWS71eBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:12.072872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12a5d66f839a073d529c987ed9ca7147cff6f8b9ca8bd5ddbbee25f6c190f0e9","sha256:fb75c011246eb54b9a2c4289b871bab5bef76f1cdc30a59fb23f33df77f8dd79"],"state_sha256":"e9404aa314d1b6124c578c06de94a91f728498ec75f7efb26791ddbaa8b7c2b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekAz0IMGRGeXTrK5r+A9CEwhFWQDfNnqa7xF830Dj9cWN3Xa94qdgD8HqL971RLiUdfK/6WRNmpTMgJy+shADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T05:02:35.148205Z","bundle_sha256":"59e64c09748f91420973f70bea76a382817f658ac73c1c5fa009e1daa5f0cfed"}}