{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OXDTZVPQOQIPPDGXLRD65RNKMZ","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":"9d368cb428c86aeecb1420401a2f4eec6f6c4b30cf6cc98f7e915f7e2b4ac007","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:37:35Z","title_canon_sha256":"263509330b44f77501febf4e63a095369576745ca8e7e686e65e961bb64705b0"},"schema_version":"1.0","source":{"id":"1706.02214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02214","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02214v1","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02214","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"OXDTZVPQOQIP","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OXDTZVPQOQIPPDGX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OXDTZVPQ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:4b4d79d55c0c0773d0463c55f6c90336ac2f748f3a6100a7ee38f95d715d0566","target":"graph","created_at":"2026-05-18T00:42:49Z","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 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.","authors_text":"Benoit Darties (Le2i), Gilles Simonin, Jean-Claude K\\\"onig (MAORE), Rodolphe Giroudeau (MAORE)","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:37:35Z","title":"Some complexity and approximation results for coupled-tasks scheduling problem according to topology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02214","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:254b2ab067f66f817a197872c7d4c848688de4e65689f643f1d2c83eb779a706","target":"record","created_at":"2026-05-18T00:42:49Z","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":"9d368cb428c86aeecb1420401a2f4eec6f6c4b30cf6cc98f7e915f7e2b4ac007","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:37:35Z","title_canon_sha256":"263509330b44f77501febf4e63a095369576745ca8e7e686e65e961bb64705b0"},"schema_version":"1.0","source":{"id":"1706.02214","kind":"arxiv","version":1}},"canonical_sha256":"75c73cd5f07410f78cd75c47eec5aa6648309733bf7d855d31a2c069154b9aad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75c73cd5f07410f78cd75c47eec5aa6648309733bf7d855d31a2c069154b9aad","first_computed_at":"2026-05-18T00:42:49.580999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:49.580999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P4Zrx01CDW9coNh+t3h1nkg9OV9VZp3+Xu4RwryjIeGYnHI70czHasqQ5Vrl2DYaYexgmeSkcwJCcbxX4WXhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:49.581692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:254b2ab067f66f817a197872c7d4c848688de4e65689f643f1d2c83eb779a706","sha256:4b4d79d55c0c0773d0463c55f6c90336ac2f748f3a6100a7ee38f95d715d0566"],"state_sha256":"cdfea1c7e83f891ddc8479c1baf1e77df3951a1b785c33d3de666cd52e2a8d00"}