{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OXDTZVPQOQIPPDGXLRD65RNKMZ","short_pith_number":"pith:OXDTZVPQ","schema_version":"1.0","canonical_sha256":"75c73cd5f07410f78cd75c47eec5aa6648309733bf7d855d31a2c069154b9aad","source":{"kind":"arxiv","id":"1706.02214","version":1},"attestation_state":"computed","paper":{"title":"Some complexity and approximation results for coupled-tasks scheduling problem according to topology","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), Rodolphe Giroudeau (MAORE)","submitted_at":"2017-06-07T14:37:35Z","abstract_excerpt":"We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain,. . .). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters."},"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.02214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:37:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"263509330b44f77501febf4e63a095369576745ca8e7e686e65e961bb64705b0","abstract_canon_sha256":"9d368cb428c86aeecb1420401a2f4eec6f6c4b30cf6cc98f7e915f7e2b4ac007"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:49.581692Z","signature_b64":"P4Zrx01CDW9coNh+t3h1nkg9OV9VZp3+Xu4RwryjIeGYnHI70czHasqQ5Vrl2DYaYexgmeSkcwJCcbxX4WXhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75c73cd5f07410f78cd75c47eec5aa6648309733bf7d855d31a2c069154b9aad","last_reissued_at":"2026-05-18T00:42:49.580999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:49.580999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some complexity and approximation results for coupled-tasks scheduling problem according to topology","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), Rodolphe Giroudeau (MAORE)","submitted_at":"2017-06-07T14:37:35Z","abstract_excerpt":"We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain,. . .). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02214","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.02214","created_at":"2026-05-18T00:42:49.581110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02214v1","created_at":"2026-05-18T00:42:49.581110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02214","created_at":"2026-05-18T00:42:49.581110+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXDTZVPQOQIP","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXDTZVPQOQIPPDGX","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXDTZVPQ","created_at":"2026-05-18T12:31:34.259226+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/OXDTZVPQOQIPPDGXLRD65RNKMZ","json":"https://pith.science/pith/OXDTZVPQOQIPPDGXLRD65RNKMZ.json","graph_json":"https://pith.science/api/pith-number/OXDTZVPQOQIPPDGXLRD65RNKMZ/graph.json","events_json":"https://pith.science/api/pith-number/OXDTZVPQOQIPPDGXLRD65RNKMZ/events.json","paper":"https://pith.science/paper/OXDTZVPQ"},"agent_actions":{"view_html":"https://pith.science/pith/OXDTZVPQOQIPPDGXLRD65RNKMZ","download_json":"https://pith.science/pith/OXDTZVPQOQIPPDGXLRD65RNKMZ.json","view_paper":"https://pith.science/paper/OXDTZVPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02214&json=true","fetch_graph":"https://pith.science/api/pith-number/OXDTZVPQOQIPPDGXLRD65RNKMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OXDTZVPQOQIPPDGXLRD65RNKMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXDTZVPQOQIPPDGXLRD65RNKMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXDTZVPQOQIPPDGXLRD65RNKMZ/action/storage_attestation","attest_author":"https://pith.science/pith/OXDTZVPQOQIPPDGXLRD65RNKMZ/action/author_attestation","sign_citation":"https://pith.science/pith/OXDTZVPQOQIPPDGXLRD65RNKMZ/action/citation_signature","submit_replication":"https://pith.science/pith/OXDTZVPQOQIPPDGXLRD65RNKMZ/action/replication_record"}},"created_at":"2026-05-18T00:42:49.581110+00:00","updated_at":"2026-05-18T00:42:49.581110+00:00"}