{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A4ED723MYM7S7JUVORQFR2LPHE","short_pith_number":"pith:A4ED723M","schema_version":"1.0","canonical_sha256":"07083feb6cc33f2fa695746058e96f3905890728dca64d340a901f4f451dd32f","source":{"kind":"arxiv","id":"1706.02202","version":1},"attestation_state":"computed","paper":{"title":"Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Benoit Darties (Le2i, Gilles Simonin (MAORE), Jean-Claude K\\\"onig (MAORE), MAORE), Rodolphe Giroudeau (MAORE)","submitted_at":"2017-06-07T14:14:50Z","abstract_excerpt":"The problem presented in this paper is a generalization of the usual coupled-tasks scheduling problem in presence of compatibility constraints. The reason behind this study is the data acquisition problem for a submarine torpedo. We investigate a particular configuration for coupled tasks (any task is divided into two sub-tasks separated by an idle time), in which the idle time of a coupled task is equal to the sum of durations of its two sub-tasks. We prove -completeness of the minimization of the schedule length, we show that finding a solution to our problem amounts to solving a graph probl"},"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.02202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-07T14:14:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"50c63886d9af0d1e1f70104ec053530241c572d94736177ff70405ce5e450538","abstract_canon_sha256":"e51f66c79c42be67959a7137852e1359b780fd3b33cbfc3b506ea1725309f861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:49.636443Z","signature_b64":"Cs2BHuthk29j5X9IzDMaC7buFs0tv6OLxMEWx3jEcjh0vh7jPVkviXVfvtd+sgEwpBwVlXZnigW6NzdgPfsYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07083feb6cc33f2fa695746058e96f3905890728dca64d340a901f4f451dd32f","last_reissued_at":"2026-05-18T00:42:49.635636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:49.635636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Benoit Darties (Le2i, Gilles Simonin (MAORE), Jean-Claude K\\\"onig (MAORE), MAORE), Rodolphe Giroudeau (MAORE)","submitted_at":"2017-06-07T14:14:50Z","abstract_excerpt":"The problem presented in this paper is a generalization of the usual coupled-tasks scheduling problem in presence of compatibility constraints. The reason behind this study is the data acquisition problem for a submarine torpedo. We investigate a particular configuration for coupled tasks (any task is divided into two sub-tasks separated by an idle time), in which the idle time of a coupled task is equal to the sum of durations of its two sub-tasks. We prove -completeness of the minimization of the schedule length, we show that finding a solution to our problem amounts to solving a graph probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02202","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.02202","created_at":"2026-05-18T00:42:49.635746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02202v1","created_at":"2026-05-18T00:42:49.635746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02202","created_at":"2026-05-18T00:42:49.635746+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4ED723MYM7S","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4ED723MYM7S7JUV","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4ED723M","created_at":"2026-05-18T12:31:05.417338+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/A4ED723MYM7S7JUVORQFR2LPHE","json":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE.json","graph_json":"https://pith.science/api/pith-number/A4ED723MYM7S7JUVORQFR2LPHE/graph.json","events_json":"https://pith.science/api/pith-number/A4ED723MYM7S7JUVORQFR2LPHE/events.json","paper":"https://pith.science/paper/A4ED723M"},"agent_actions":{"view_html":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE","download_json":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE.json","view_paper":"https://pith.science/paper/A4ED723M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02202&json=true","fetch_graph":"https://pith.science/api/pith-number/A4ED723MYM7S7JUVORQFR2LPHE/graph.json","fetch_events":"https://pith.science/api/pith-number/A4ED723MYM7S7JUVORQFR2LPHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE/action/storage_attestation","attest_author":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE/action/author_attestation","sign_citation":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE/action/citation_signature","submit_replication":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE/action/replication_record"}},"created_at":"2026-05-18T00:42:49.635746+00:00","updated_at":"2026-05-18T00:42:49.635746+00:00"}