{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UAZX32NJNO4KZXFVTN7Q3CP4I5","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":"9cb9545fc6f1be153ad082904e9d2a23d3289a6a715c933278ba907c89e954fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-14T12:52:53Z","title_canon_sha256":"fc172c62b1637884220343cee731a8144d63697a5a99a853747580dfeec1ad76"},"schema_version":"1.0","source":{"id":"1905.05568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05568","created_at":"2026-05-17T23:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05568v1","created_at":"2026-05-17T23:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05568","created_at":"2026-05-17T23:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"UAZX32NJNO4K","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UAZX32NJNO4KZXFV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UAZX32NJ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:732011d2cf9ef5d556c5c6d3608478080574b82528ca8c0a779286035633de36","target":"graph","created_at":"2026-05-17T23:46:14Z","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 of task scheduling with communication delays is strongly NP-hard. State-space search algorithms such as A* have been shown to be a promising approach to solving small to medium sized instances optimally. A recently proposed state-space model for task scheduling, known as Allocation-Ordering (AO), allows state-space search methods to be applied without the need for previously necessary duplicate avoidance mechanisms, and resulted in significantly improved A* performance. The property of a duplicate-free state space also holds particular promise for memory limited search algorithms, ","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-05-14T12:52:53Z","title":"Parallel and Memory-limited Algorithms for Optimal Task Scheduling Using a Duplicate-Free State-Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05568","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:a6ae70805ed696f28cf673ff988e5bc755c4b070a72d8f212c112318a7a59411","target":"record","created_at":"2026-05-17T23:46:14Z","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":"9cb9545fc6f1be153ad082904e9d2a23d3289a6a715c933278ba907c89e954fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-14T12:52:53Z","title_canon_sha256":"fc172c62b1637884220343cee731a8144d63697a5a99a853747580dfeec1ad76"},"schema_version":"1.0","source":{"id":"1905.05568","kind":"arxiv","version":1}},"canonical_sha256":"a0337de9a96bb8acdcb59b7f0d89fc4764759d4c79a2c8f85d25948f86ec7cb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0337de9a96bb8acdcb59b7f0d89fc4764759d4c79a2c8f85d25948f86ec7cb6","first_computed_at":"2026-05-17T23:46:14.188635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:14.188635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/VayvO/iSbKickbuSYPKrvJN9Uo0u+j1TD3jekAHfu1zmgDOVGd5QbKslpgKhYZAqMuEQmtTG6dSFexc6ojBDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:14.189270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6ae70805ed696f28cf673ff988e5bc755c4b070a72d8f212c112318a7a59411","sha256:732011d2cf9ef5d556c5c6d3608478080574b82528ca8c0a779286035633de36"],"state_sha256":"d216aa6515740d1994091ff161719087b4f3f5e2cb86504b7c83f600ccc5d8e8"}