{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QWMTVDCVPGNIV3FF57QI57HV3C","short_pith_number":"pith:QWMTVDCV","schema_version":"1.0","canonical_sha256":"85993a8c55799a8aeca5efe08efcf5d8b65bbff7778dbf87ed50657f4fed464e","source":{"kind":"arxiv","id":"1706.07604","version":1},"attestation_state":"computed","paper":{"title":"A $(2 + \\epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Liya Yang, Ren\\'e Sitters","submitted_at":"2017-06-23T09:12:01Z","abstract_excerpt":"We give a $(2 + \\epsilon)$-approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture made in [18]"},"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":"1706.07604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-23T09:12:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5247e4e127e0a7028a9182a04791b03f3e8c5ac6743d60b8a70305e53c7e94fc","abstract_canon_sha256":"a8e12c017e59e19c42937ece0ad5cb2d4c622ce81f11d2b249b30291b6c23eea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:48.659682Z","signature_b64":"eH+tg90I1+G6DnYJZqUn5+WsSxgSAeqtNLSDwa0sRcYLpUjHgBy79SAyZ3ziGgUBj7p4kxHuTRkVCEcvbuzxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85993a8c55799a8aeca5efe08efcf5d8b65bbff7778dbf87ed50657f4fed464e","last_reissued_at":"2026-05-18T00:41:48.659091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:48.659091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $(2 + \\epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Liya Yang, Ren\\'e Sitters","submitted_at":"2017-06-23T09:12:01Z","abstract_excerpt":"We give a $(2 + \\epsilon)$-approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture made in [18]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07604","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":"1706.07604","created_at":"2026-05-18T00:41:48.659189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07604v1","created_at":"2026-05-18T00:41:48.659189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07604","created_at":"2026-05-18T00:41:48.659189+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWMTVDCVPGNI","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWMTVDCVPGNIV3FF","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWMTVDCV","created_at":"2026-05-18T12:31:39.905425+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/QWMTVDCVPGNIV3FF57QI57HV3C","json":"https://pith.science/pith/QWMTVDCVPGNIV3FF57QI57HV3C.json","graph_json":"https://pith.science/api/pith-number/QWMTVDCVPGNIV3FF57QI57HV3C/graph.json","events_json":"https://pith.science/api/pith-number/QWMTVDCVPGNIV3FF57QI57HV3C/events.json","paper":"https://pith.science/paper/QWMTVDCV"},"agent_actions":{"view_html":"https://pith.science/pith/QWMTVDCVPGNIV3FF57QI57HV3C","download_json":"https://pith.science/pith/QWMTVDCVPGNIV3FF57QI57HV3C.json","view_paper":"https://pith.science/paper/QWMTVDCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07604&json=true","fetch_graph":"https://pith.science/api/pith-number/QWMTVDCVPGNIV3FF57QI57HV3C/graph.json","fetch_events":"https://pith.science/api/pith-number/QWMTVDCVPGNIV3FF57QI57HV3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWMTVDCVPGNIV3FF57QI57HV3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWMTVDCVPGNIV3FF57QI57HV3C/action/storage_attestation","attest_author":"https://pith.science/pith/QWMTVDCVPGNIV3FF57QI57HV3C/action/author_attestation","sign_citation":"https://pith.science/pith/QWMTVDCVPGNIV3FF57QI57HV3C/action/citation_signature","submit_replication":"https://pith.science/pith/QWMTVDCVPGNIV3FF57QI57HV3C/action/replication_record"}},"created_at":"2026-05-18T00:41:48.659189+00:00","updated_at":"2026-05-18T00:41:48.659189+00:00"}