{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EBOMQ6DGF4NM4JLGUNJJYPBWHZ","short_pith_number":"pith:EBOMQ6DG","schema_version":"1.0","canonical_sha256":"205cc878662f1ace2566a3529c3c363e7cae92a7f4aa4285ee491828dfd11804","source":{"kind":"arxiv","id":"1706.02200","version":1},"attestation_state":"computed","paper":{"title":"Bounds and approximation results for scheduling coupled-tasks with compatibility constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Benoit Darties (Le2i, Gilles Simonin, Jean-Claude K\\\"onig (MAORE), MAORE), Rodolphe Giroudeau (MAORE)","submitted_at":"2017-06-07T14:14:28Z","abstract_excerpt":"This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints  according to classical complexity hypothesis  ($\\mathcal{P} \\neq \\mathcal{NP}$, $\\mathcal{ETH}$). Moreover, we develop  an efficient polynomial-time approximation algorithm for the specific case for which the topology describing the compatibility constraints is a quasi split-graph."},"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.02200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:14:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c9e919aefdc23bfab6aeff727663105ea2dad2104a5381f6302d0d14567ef810","abstract_canon_sha256":"3419dd0cf16643f02d83fe80580b9961523e59f4b54fede6a8de5aef32000524"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:49.646887Z","signature_b64":"1mAqFNXRXgUTyyWQ9PIyAS81joQmALA3YQsfdlAKZ6vQf1f3b7isixfX/iWZpFeeLJWI7NPu/1QCIv4lyjP2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"205cc878662f1ace2566a3529c3c363e7cae92a7f4aa4285ee491828dfd11804","last_reissued_at":"2026-05-18T00:42:49.646114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:49.646114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds and approximation results for scheduling coupled-tasks with compatibility constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Benoit Darties (Le2i, Gilles Simonin, Jean-Claude K\\\"onig (MAORE), MAORE), Rodolphe Giroudeau (MAORE)","submitted_at":"2017-06-07T14:14:28Z","abstract_excerpt":"This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints  according to classical complexity hypothesis  ($\\mathcal{P} \\neq \\mathcal{NP}$, $\\mathcal{ETH}$). Moreover, we develop  an efficient polynomial-time approximation algorithm for the specific case for which the topology describing the compatibility constraints is a quasi split-graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02200","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.02200","created_at":"2026-05-18T00:42:49.646245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02200v1","created_at":"2026-05-18T00:42:49.646245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02200","created_at":"2026-05-18T00:42:49.646245+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBOMQ6DGF4NM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBOMQ6DGF4NM4JLG","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBOMQ6DG","created_at":"2026-05-18T12:31:12.930513+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/EBOMQ6DGF4NM4JLGUNJJYPBWHZ","json":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ.json","graph_json":"https://pith.science/api/pith-number/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/graph.json","events_json":"https://pith.science/api/pith-number/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/events.json","paper":"https://pith.science/paper/EBOMQ6DG"},"agent_actions":{"view_html":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ","download_json":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ.json","view_paper":"https://pith.science/paper/EBOMQ6DG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02200&json=true","fetch_graph":"https://pith.science/api/pith-number/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/action/storage_attestation","attest_author":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/action/author_attestation","sign_citation":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/action/citation_signature","submit_replication":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/action/replication_record"}},"created_at":"2026-05-18T00:42:49.646245+00:00","updated_at":"2026-05-18T00:42:49.646245+00:00"}