{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EBOMQ6DGF4NM4JLGUNJJYPBWHZ","short_pith_number":"pith:EBOMQ6DG","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"},"canonical_sha256":"205cc878662f1ace2566a3529c3c363e7cae92a7f4aa4285ee491828dfd11804","source":{"kind":"arxiv","id":"1706.02200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02200","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02200v1","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02200","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"EBOMQ6DGF4NM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EBOMQ6DGF4NM4JLG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EBOMQ6DG","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EBOMQ6DGF4NM4JLGUNJJYPBWHZ","target":"record","payload":{"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"},"canonical_sha256":"205cc878662f1ace2566a3529c3c363e7cae92a7f4aa4285ee491828dfd11804","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"},"source_kind":"arxiv","source_id":"1706.02200","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":"WrfsmgNrR5DhxYCw1Ls7Mm0AUosWLPJE2DUnUgang7fRUOVRWmHNVjaLnlZM2Nn+0teQYClK0fFP5Qu9ZmsiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:08:00.978692Z"},"content_sha256":"aeed699524f40737d98d3ede4c786f3d393e398a82770ff150771c2a11cf641d","schema_version":"1.0","event_id":"sha256:aeed699524f40737d98d3ede4c786f3d393e398a82770ff150771c2a11cf641d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EBOMQ6DGF4NM4JLGUNJJYPBWHZ","target":"graph","payload":{"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"},"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":"Q1dXRQEMNGccIpwbrbUfjm6E4sg4qBLEApdgyNh8naJK7tDUC1XqfxiqNWkx7IHaJZtkxVyhSMU68GvZN/oeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:08:00.979418Z"},"content_sha256":"1247ddddbac21679733d368c57dce6471df86608be2fcd85c6ca6339b261f2c5","schema_version":"1.0","event_id":"sha256:1247ddddbac21679733d368c57dce6471df86608be2fcd85c6ca6339b261f2c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/bundle.json","state_url":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/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-10T21:08:00Z","links":{"resolver":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ","bundle":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/bundle.json","state":"https://pith.science/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBOMQ6DGF4NM4JLGUNJJYPBWHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EBOMQ6DGF4NM4JLGUNJJYPBWHZ","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":"3419dd0cf16643f02d83fe80580b9961523e59f4b54fede6a8de5aef32000524","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:14:28Z","title_canon_sha256":"c9e919aefdc23bfab6aeff727663105ea2dad2104a5381f6302d0d14567ef810"},"schema_version":"1.0","source":{"id":"1706.02200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02200","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02200v1","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02200","created_at":"2026-05-18T00:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"EBOMQ6DGF4NM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EBOMQ6DGF4NM4JLG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EBOMQ6DG","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:1247ddddbac21679733d368c57dce6471df86608be2fcd85c6ca6339b261f2c5","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":"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.","authors_text":"Benoit Darties (Le2i, Gilles Simonin, Jean-Claude K\\\"onig (MAORE), 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:14:28Z","title":"Bounds and approximation results for scheduling coupled-tasks with compatibility constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02200","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:aeed699524f40737d98d3ede4c786f3d393e398a82770ff150771c2a11cf641d","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":"3419dd0cf16643f02d83fe80580b9961523e59f4b54fede6a8de5aef32000524","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-07T14:14:28Z","title_canon_sha256":"c9e919aefdc23bfab6aeff727663105ea2dad2104a5381f6302d0d14567ef810"},"schema_version":"1.0","source":{"id":"1706.02200","kind":"arxiv","version":1}},"canonical_sha256":"205cc878662f1ace2566a3529c3c363e7cae92a7f4aa4285ee491828dfd11804","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"205cc878662f1ace2566a3529c3c363e7cae92a7f4aa4285ee491828dfd11804","first_computed_at":"2026-05-18T00:42:49.646114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:49.646114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1mAqFNXRXgUTyyWQ9PIyAS81joQmALA3YQsfdlAKZ6vQf1f3b7isixfX/iWZpFeeLJWI7NPu/1QCIv4lyjP2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:49.646887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aeed699524f40737d98d3ede4c786f3d393e398a82770ff150771c2a11cf641d","sha256:1247ddddbac21679733d368c57dce6471df86608be2fcd85c6ca6339b261f2c5"],"state_sha256":"3310847b89e211e9dcdaa3b386e0e156a4f60d01ad8ca79a9d23056867932541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8W4IYB7kKiIoHBilVW6vksFsF4oOTd6UeIxn0JKlVaPN1nfNpJiS63ZYffNJV1/zZa0vNwsV+gQnjzo+SwVIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:08:00.984470Z","bundle_sha256":"b3eae1aeaaa94efd00cf512cf177da21b52d309e6868d711eef62ce9de0bd137"}}