{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EG3KTBN57AID6VIGPCRVVDGDNH","short_pith_number":"pith:EG3KTBN5","schema_version":"1.0","canonical_sha256":"21b6a985bdf8103f550678a35a8cc369e620c090578110fb08bf8d8d2673ec23","source":{"kind":"arxiv","id":"1503.01327","version":2},"attestation_state":"computed","paper":{"title":"Estimating the Probability of Meeting a Deadline in Hierarchical Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gera Weiss, Liat Cohen, Solomon Eyal Shimony","submitted_at":"2015-03-04T14:56:55Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1503.01327","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-03-04T14:56:55Z","cross_cats_sorted":[],"title_canon_sha256":"ba8b421e4c6176c343ebbc9c18ada3cd561061e4074bbd85db77e575f8c52839","abstract_canon_sha256":"95c8d5f22d7bbae39a43ce201f960789ba17f95f6746badd58791b592f4f57da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:22.618531Z","signature_b64":"GrHNtHlLhX0zqe7X2CPqcvTATWIuUSX4eYL5P8y63Ov3SgXwg94yA8HFqMPkX4s+jH2t9abymQvtU07b7TPHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b6a985bdf8103f550678a35a8cc369e620c090578110fb08bf8d8d2673ec23","last_reissued_at":"2026-05-18T00:27:22.618013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:22.618013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating the Probability of Meeting a Deadline in Hierarchical Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gera Weiss, Liat Cohen, Solomon Eyal Shimony","submitted_at":"2015-03-04T14:56:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01327","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.01327","created_at":"2026-05-18T00:27:22.618097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01327v2","created_at":"2026-05-18T00:27:22.618097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01327","created_at":"2026-05-18T00:27:22.618097+00:00"},{"alias_kind":"pith_short_12","alias_value":"EG3KTBN57AID","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EG3KTBN57AID6VIG","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EG3KTBN5","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EG3KTBN57AID6VIGPCRVVDGDNH","json":"https://pith.science/pith/EG3KTBN57AID6VIGPCRVVDGDNH.json","graph_json":"https://pith.science/api/pith-number/EG3KTBN57AID6VIGPCRVVDGDNH/graph.json","events_json":"https://pith.science/api/pith-number/EG3KTBN57AID6VIGPCRVVDGDNH/events.json","paper":"https://pith.science/paper/EG3KTBN5"},"agent_actions":{"view_html":"https://pith.science/pith/EG3KTBN57AID6VIGPCRVVDGDNH","download_json":"https://pith.science/pith/EG3KTBN57AID6VIGPCRVVDGDNH.json","view_paper":"https://pith.science/paper/EG3KTBN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01327&json=true","fetch_graph":"https://pith.science/api/pith-number/EG3KTBN57AID6VIGPCRVVDGDNH/graph.json","fetch_events":"https://pith.science/api/pith-number/EG3KTBN57AID6VIGPCRVVDGDNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EG3KTBN57AID6VIGPCRVVDGDNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EG3KTBN57AID6VIGPCRVVDGDNH/action/storage_attestation","attest_author":"https://pith.science/pith/EG3KTBN57AID6VIGPCRVVDGDNH/action/author_attestation","sign_citation":"https://pith.science/pith/EG3KTBN57AID6VIGPCRVVDGDNH/action/citation_signature","submit_replication":"https://pith.science/pith/EG3KTBN57AID6VIGPCRVVDGDNH/action/replication_record"}},"created_at":"2026-05-18T00:27:22.618097+00:00","updated_at":"2026-05-18T00:27:22.618097+00:00"}