{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TV3KKE66AALBG75NQZRP5FTX3H","short_pith_number":"pith:TV3KKE66","schema_version":"1.0","canonical_sha256":"9d76a513de0016137fad8662fe9677d9f9964461019a1c7e9e1facc50f9beab5","source":{"kind":"arxiv","id":"1511.08644","version":1},"attestation_state":"computed","paper":{"title":"A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","submitted_at":"2015-11-27T12:22:38Z","abstract_excerpt":"The Min-sum single machine scheduling problem (denoted 1||sum f_j) generalizes a large number of sequencing problems. The first constant approximation guarantees have been obtained only recently and are based on natural time-indexed LP relaxations strengthened with the so called Knapsack-Cover inequalities (see Bansal and Pruhs, Cheung and Shmoys and the recent 4+\\epsilon-approximation by Mestre and Verschae). These relaxations have an integrality gap of 2, since the Min-knapsack problem is a special case. No APX-hardness result is known and it is still conceivable that there exists a PTAS. In"},"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":"1511.08644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-27T12:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"fbbe2e0a37c7d38d8d55e48954b7f16a34ba2e37f317596ecf140a0ceee24de9","abstract_canon_sha256":"c824b5f6b633761d840e1887ea12819020fb003e5ba45ba4a6470e38aa88c431"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:48.425171Z","signature_b64":"ad5qCzdOqtbmFodEmywpvOYnC/VB7EfeMCm4+l5cYLMohrichSZ27gE2fhtBJsFg3heRoNT81zYeLprxWwGUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d76a513de0016137fad8662fe9677d9f9964461019a1c7e9e1facc50f9beab5","last_reissued_at":"2026-05-18T01:25:48.424637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:48.424637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","submitted_at":"2015-11-27T12:22:38Z","abstract_excerpt":"The Min-sum single machine scheduling problem (denoted 1||sum f_j) generalizes a large number of sequencing problems. The first constant approximation guarantees have been obtained only recently and are based on natural time-indexed LP relaxations strengthened with the so called Knapsack-Cover inequalities (see Bansal and Pruhs, Cheung and Shmoys and the recent 4+\\epsilon-approximation by Mestre and Verschae). These relaxations have an integrality gap of 2, since the Min-knapsack problem is a special case. No APX-hardness result is known and it is still conceivable that there exists a PTAS. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08644","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":"1511.08644","created_at":"2026-05-18T01:25:48.424715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08644v1","created_at":"2026-05-18T01:25:48.424715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08644","created_at":"2026-05-18T01:25:48.424715+00:00"},{"alias_kind":"pith_short_12","alias_value":"TV3KKE66AALB","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TV3KKE66AALBG75N","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TV3KKE66","created_at":"2026-05-18T12:29:42.218222+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/TV3KKE66AALBG75NQZRP5FTX3H","json":"https://pith.science/pith/TV3KKE66AALBG75NQZRP5FTX3H.json","graph_json":"https://pith.science/api/pith-number/TV3KKE66AALBG75NQZRP5FTX3H/graph.json","events_json":"https://pith.science/api/pith-number/TV3KKE66AALBG75NQZRP5FTX3H/events.json","paper":"https://pith.science/paper/TV3KKE66"},"agent_actions":{"view_html":"https://pith.science/pith/TV3KKE66AALBG75NQZRP5FTX3H","download_json":"https://pith.science/pith/TV3KKE66AALBG75NQZRP5FTX3H.json","view_paper":"https://pith.science/paper/TV3KKE66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08644&json=true","fetch_graph":"https://pith.science/api/pith-number/TV3KKE66AALBG75NQZRP5FTX3H/graph.json","fetch_events":"https://pith.science/api/pith-number/TV3KKE66AALBG75NQZRP5FTX3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TV3KKE66AALBG75NQZRP5FTX3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TV3KKE66AALBG75NQZRP5FTX3H/action/storage_attestation","attest_author":"https://pith.science/pith/TV3KKE66AALBG75NQZRP5FTX3H/action/author_attestation","sign_citation":"https://pith.science/pith/TV3KKE66AALBG75NQZRP5FTX3H/action/citation_signature","submit_replication":"https://pith.science/pith/TV3KKE66AALBG75NQZRP5FTX3H/action/replication_record"}},"created_at":"2026-05-18T01:25:48.424715+00:00","updated_at":"2026-05-18T01:25:48.424715+00:00"}