{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A4ED723MYM7S7JUVORQFR2LPHE","short_pith_number":"pith:A4ED723M","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"},"canonical_sha256":"07083feb6cc33f2fa695746058e96f3905890728dca64d340a901f4f451dd32f","source":{"kind":"arxiv","id":"1706.02202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02202","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02202v1","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02202","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"A4ED723MYM7S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A4ED723MYM7S7JUV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A4ED723M","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A4ED723MYM7S7JUVORQFR2LPHE","target":"record","payload":{"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"},"canonical_sha256":"07083feb6cc33f2fa695746058e96f3905890728dca64d340a901f4f451dd32f","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"},"source_kind":"arxiv","source_id":"1706.02202","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wi2/xHDHIOh2zY+agKEzNO76pCcy7JMKH3nMtYnaHKdFPM/Z8349OI0AZcEsMlZHqqBVL5pFJ5ngCg6hNazDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:43:14.394357Z"},"content_sha256":"83f3610a62011ff097377387be920ae05690ee530ab126a2df3e6232a8e77f13","schema_version":"1.0","event_id":"sha256:83f3610a62011ff097377387be920ae05690ee530ab126a2df3e6232a8e77f13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A4ED723MYM7S7JUVORQFR2LPHE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xM22/v77hM1uRCkHhU37LkiCUFiyIrTDAgA24b2VTBHfqaoQ5BrMrYyhXQA5tysQumn7H7dMsLBBzW6ux6kMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:43:14.395011Z"},"content_sha256":"521ed38b0d6d7e16a7738b93936b0eca9f93a1f93e4dd65546484f115ef26b18","schema_version":"1.0","event_id":"sha256:521ed38b0d6d7e16a7738b93936b0eca9f93a1f93e4dd65546484f115ef26b18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE/bundle.json","state_url":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4ED723MYM7S7JUVORQFR2LPHE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T00:43:14Z","links":{"resolver":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE","bundle":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE/bundle.json","state":"https://pith.science/pith/A4ED723MYM7S7JUVORQFR2LPHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4ED723MYM7S7JUVORQFR2LPHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A4ED723MYM7S7JUVORQFR2LPHE","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":"e51f66c79c42be67959a7137852e1359b780fd3b33cbfc3b506ea1725309f861","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-07T14:14:50Z","title_canon_sha256":"50c63886d9af0d1e1f70104ec053530241c572d94736177ff70405ce5e450538"},"schema_version":"1.0","source":{"id":"1706.02202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02202","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02202v1","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02202","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"A4ED723MYM7S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A4ED723MYM7S7JUV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A4ED723M","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:521ed38b0d6d7e16a7738b93936b0eca9f93a1f93e4dd65546484f115ef26b18","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":"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","authors_text":"Benoit Darties (Le2i, Gilles Simonin (MAORE), Jean-Claude K\\\"onig (MAORE), MAORE), Rodolphe Giroudeau (MAORE)","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-07T14:14:50Z","title":"Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02202","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:83f3610a62011ff097377387be920ae05690ee530ab126a2df3e6232a8e77f13","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":"e51f66c79c42be67959a7137852e1359b780fd3b33cbfc3b506ea1725309f861","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-07T14:14:50Z","title_canon_sha256":"50c63886d9af0d1e1f70104ec053530241c572d94736177ff70405ce5e450538"},"schema_version":"1.0","source":{"id":"1706.02202","kind":"arxiv","version":1}},"canonical_sha256":"07083feb6cc33f2fa695746058e96f3905890728dca64d340a901f4f451dd32f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07083feb6cc33f2fa695746058e96f3905890728dca64d340a901f4f451dd32f","first_computed_at":"2026-05-18T00:42:49.635636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:49.635636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cs2BHuthk29j5X9IzDMaC7buFs0tv6OLxMEWx3jEcjh0vh7jPVkviXVfvtd+sgEwpBwVlXZnigW6NzdgPfsYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:49.636443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83f3610a62011ff097377387be920ae05690ee530ab126a2df3e6232a8e77f13","sha256:521ed38b0d6d7e16a7738b93936b0eca9f93a1f93e4dd65546484f115ef26b18"],"state_sha256":"c575db82c04c9f19b376756039f722470e07423584a4a0651e364ff6c42a05e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLkStSc+Z6+wflj1Rg4BvrIsUj4WkiliABUNhJbHgaqBTRDjtRjF9PPO1pK/HIVMO5XqWdTER0w2zJiMuPXhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:43:14.399039Z","bundle_sha256":"e34d9ed24df78898a03aefbc344a7932205514ca051947817a501de882d46e9c"}}