{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2LPCBM3CKA7LDCN6SXF66CACKJ","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":"53336c59ae1e65f3bfa8909fb392e8c4cc6fd237d91b78e3bd3994bdc8184b29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-21T12:12:06Z","title_canon_sha256":"d1fcbfefc090d01ec7c730eba3421b04e3ade7b0f7484a9033e1689664c277e7"},"schema_version":"1.0","source":{"id":"1901.06899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06899","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06899v1","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06899","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"2LPCBM3CKA7L","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2LPCBM3CKA7LDCN6","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2LPCBM3C","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:bffb24a12a93738e404e5de6e352a000d2955d0bcbbb37c9df3318c96c65fda3","target":"graph","created_at":"2026-05-17T23:55:48Z","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 NP-hard problem of task scheduling with communication delays (P|prec,c_{ij}|C_{\\mathrm{max}}) is often tackled using approximate methods, but guarantees on the quality of these heuristic solutions are hard to come by. Optimal schedules are therefore invaluable for properly evaluating these heuristics, as well as being very useful for applications in time critical systems. Optimal solving using branch-and-bound algorithms like A* has been shown to be promising in the past, with a state-space model we refer to as exhaustive list scheduling (ELS). The obvious weakness of this model is that it","authors_text":"Michael Orr, Oliver Sinnen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-21T12:12:06Z","title":"Optimal Task Scheduling Benefits From a Duplicate-Free State-Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06899","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:1fef3134eb88c63d399c8ab0849006ad9d641197ff7300bf30c072f46a183519","target":"record","created_at":"2026-05-17T23:55:48Z","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":"53336c59ae1e65f3bfa8909fb392e8c4cc6fd237d91b78e3bd3994bdc8184b29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-21T12:12:06Z","title_canon_sha256":"d1fcbfefc090d01ec7c730eba3421b04e3ade7b0f7484a9033e1689664c277e7"},"schema_version":"1.0","source":{"id":"1901.06899","kind":"arxiv","version":1}},"canonical_sha256":"d2de20b362503eb189be95cbef08025258612142e0888747c04c2f6a9b43d310","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2de20b362503eb189be95cbef08025258612142e0888747c04c2f6a9b43d310","first_computed_at":"2026-05-17T23:55:48.753999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:48.753999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M+wCyM4uhX4AXq6knm95pBJKtdTekk/M1431QWEgh70pHV7J1t4HSYyG5mAqZ/NhYXgaN1bhQRsHeUfz2lxwAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:48.754598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fef3134eb88c63d399c8ab0849006ad9d641197ff7300bf30c072f46a183519","sha256:bffb24a12a93738e404e5de6e352a000d2955d0bcbbb37c9df3318c96c65fda3"],"state_sha256":"4e82ca7bbeba01256e0db75213ae9b98cbb59f8f0f3f54e9f9f618971e5094c5"}