{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EG3KTBN57AID6VIGPCRVVDGDNH","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":"95c8d5f22d7bbae39a43ce201f960789ba17f95f6746badd58791b592f4f57da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-03-04T14:56:55Z","title_canon_sha256":"ba8b421e4c6176c343ebbc9c18ada3cd561061e4074bbd85db77e575f8c52839"},"schema_version":"1.0","source":{"id":"1503.01327","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01327","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01327v2","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01327","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"EG3KTBN57AID","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EG3KTBN57AID6VIG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EG3KTBN5","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:3d3c5b8b6f583729ed303eb8a0e9e6081008fa2b570461d3a9dcc9e603744dc5","target":"graph","created_at":"2026-05-18T00:27:22Z","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":"Given a hierarchical plan (or schedule) with uncertain task times, we propose a deterministic polynomial (time and memory) algorithm for estimating the probability that its meets a deadline, or, alternately, that its {\\em makespan} is less than a given duration. Approximation is needed as it is known that this problem is NP-hard even for sequential plans (just, a sum of random variables). In addition, we show two new complexity results: (1) Counting the number of events that do not cross deadline is \\#P-hard; (2)~Computing the expected makespan of a hierarchical plan is NP-hard. For the propos","authors_text":"Gera Weiss, Liat Cohen, Solomon Eyal Shimony","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-03-04T14:56:55Z","title":"Estimating the Probability of Meeting a Deadline in Hierarchical Plans"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01327","kind":"arxiv","version":2},"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:cb7f84c7d3374b42a0e3da662a910a9cb7d191a491a3601f4f469de372b2d199","target":"record","created_at":"2026-05-18T00:27:22Z","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":"95c8d5f22d7bbae39a43ce201f960789ba17f95f6746badd58791b592f4f57da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-03-04T14:56:55Z","title_canon_sha256":"ba8b421e4c6176c343ebbc9c18ada3cd561061e4074bbd85db77e575f8c52839"},"schema_version":"1.0","source":{"id":"1503.01327","kind":"arxiv","version":2}},"canonical_sha256":"21b6a985bdf8103f550678a35a8cc369e620c090578110fb08bf8d8d2673ec23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21b6a985bdf8103f550678a35a8cc369e620c090578110fb08bf8d8d2673ec23","first_computed_at":"2026-05-18T00:27:22.618013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:22.618013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GrHNtHlLhX0zqe7X2CPqcvTATWIuUSX4eYL5P8y63Ov3SgXwg94yA8HFqMPkX4s+jH2t9abymQvtU07b7TPHBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:22.618531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01327","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb7f84c7d3374b42a0e3da662a910a9cb7d191a491a3601f4f469de372b2d199","sha256:3d3c5b8b6f583729ed303eb8a0e9e6081008fa2b570461d3a9dcc9e603744dc5"],"state_sha256":"2ae5f8c63c6e09f5c32512006d5341b18ea98b586c7206a757ab4b1517c2958d"}