{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SWY5QWE6XTV7UX6MS75HTKVOOB","short_pith_number":"pith:SWY5QWE6","canonical_record":{"source":{"id":"1302.3611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:17:23Z","cross_cats_sorted":[],"title_canon_sha256":"9f2af1dd35ef7d14617891d758e0bbc9622e9dc61ba357c5f6daaa586485dcf1","abstract_canon_sha256":"167729c3f7db9c9ae93edbaca508620dd50a1f1cc7be3329c473647a90d2fa7e"},"schema_version":"1.0"},"canonical_sha256":"95b1d8589ebcebfa5fcc97fa79aaae7052cb055db4b6e1db15b9bf03bad4255e","source":{"kind":"arxiv","id":"1302.3611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3611","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3611v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3611","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"SWY5QWE6XTV7","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SWY5QWE6XTV7UX6M","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SWY5QWE6","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SWY5QWE6XTV7UX6MS75HTKVOOB","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:17:23Z","cross_cats_sorted":[],"title_canon_sha256":"9f2af1dd35ef7d14617891d758e0bbc9622e9dc61ba357c5f6daaa586485dcf1","abstract_canon_sha256":"167729c3f7db9c9ae93edbaca508620dd50a1f1cc7be3329c473647a90d2fa7e"},"schema_version":"1.0"},"canonical_sha256":"95b1d8589ebcebfa5fcc97fa79aaae7052cb055db4b6e1db15b9bf03bad4255e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.416111Z","signature_b64":"lViPCVIVAuxw4psfkE9c3nmXt7GN4/yv7xbGmH9fCWCdBDorWB0MQA2LD17amSEfL92QnADT9Qcnt92h0EuNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95b1d8589ebcebfa5fcc97fa79aaae7052cb055db4b6e1db15b9bf03bad4255e","last_reissued_at":"2026-05-18T03:33:36.415269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.415269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3611","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-18T03:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5iSMfKMbmQV6HOocz5/r/jtZa3u+aQFmO5RIA3dPyvpvblM0c4sSIZsLkobollmVUohDuD0EbuXDTBne2sCnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:38:03.033454Z"},"content_sha256":"f2d907fc4651cea916d85b5438fa3a6eb9d02cce113d75c5d84e0922ea5e05c6","schema_version":"1.0","event_id":"sha256:f2d907fc4651cea916d85b5438fa3a6eb9d02cce113d75c5d84e0922ea5e05c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SWY5QWE6XTV7UX6MS75HTKVOOB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Factory Scheduling using Stochastic Dominance A*","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michael P. Wellman, Peter R. Wurman","submitted_at":"2013-02-13T14:17:23Z","abstract_excerpt":"We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs.  Because the costs of operators in the schedule are stochastic and sequence dependent, standard dynamic programming algorithms such as A* may fail to find the optimal schedule.  The SDA* (Stochastic Dominance A*) algorithm remedies this difficulty by relaxing the pruning condition.  We present an improved state-space search formulation for these problems and discuss the conditions under which stochastic scheduling problems can be solved o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3611","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-18T03:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5tw5fbruhaqvsEqS206MRg6mq55hoTs7Ii/rJHLeax2WcuQVvKcN15+V+q6SIW2KaokRUxLxAM/+NJTpOXOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:38:03.034196Z"},"content_sha256":"064ad1c51923ec1f881ad74ba530e62d0acd2059643c2d8028bfa8c7530d452c","schema_version":"1.0","event_id":"sha256:064ad1c51923ec1f881ad74ba530e62d0acd2059643c2d8028bfa8c7530d452c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWY5QWE6XTV7UX6MS75HTKVOOB/bundle.json","state_url":"https://pith.science/pith/SWY5QWE6XTV7UX6MS75HTKVOOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWY5QWE6XTV7UX6MS75HTKVOOB/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-09T21:38:03Z","links":{"resolver":"https://pith.science/pith/SWY5QWE6XTV7UX6MS75HTKVOOB","bundle":"https://pith.science/pith/SWY5QWE6XTV7UX6MS75HTKVOOB/bundle.json","state":"https://pith.science/pith/SWY5QWE6XTV7UX6MS75HTKVOOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWY5QWE6XTV7UX6MS75HTKVOOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SWY5QWE6XTV7UX6MS75HTKVOOB","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":"167729c3f7db9c9ae93edbaca508620dd50a1f1cc7be3329c473647a90d2fa7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:17:23Z","title_canon_sha256":"9f2af1dd35ef7d14617891d758e0bbc9622e9dc61ba357c5f6daaa586485dcf1"},"schema_version":"1.0","source":{"id":"1302.3611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3611","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3611v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3611","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"SWY5QWE6XTV7","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SWY5QWE6XTV7UX6M","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SWY5QWE6","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:064ad1c51923ec1f881ad74ba530e62d0acd2059643c2d8028bfa8c7530d452c","target":"graph","created_at":"2026-05-18T03:33:36Z","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":"We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs.  Because the costs of operators in the schedule are stochastic and sequence dependent, standard dynamic programming algorithms such as A* may fail to find the optimal schedule.  The SDA* (Stochastic Dominance A*) algorithm remedies this difficulty by relaxing the pruning condition.  We present an improved state-space search formulation for these problems and discuss the conditions under which stochastic scheduling problems can be solved o","authors_text":"Michael P. Wellman, Peter R. Wurman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:17:23Z","title":"Optimal Factory Scheduling using Stochastic Dominance A*"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3611","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:f2d907fc4651cea916d85b5438fa3a6eb9d02cce113d75c5d84e0922ea5e05c6","target":"record","created_at":"2026-05-18T03:33:36Z","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":"167729c3f7db9c9ae93edbaca508620dd50a1f1cc7be3329c473647a90d2fa7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:17:23Z","title_canon_sha256":"9f2af1dd35ef7d14617891d758e0bbc9622e9dc61ba357c5f6daaa586485dcf1"},"schema_version":"1.0","source":{"id":"1302.3611","kind":"arxiv","version":1}},"canonical_sha256":"95b1d8589ebcebfa5fcc97fa79aaae7052cb055db4b6e1db15b9bf03bad4255e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95b1d8589ebcebfa5fcc97fa79aaae7052cb055db4b6e1db15b9bf03bad4255e","first_computed_at":"2026-05-18T03:33:36.415269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.415269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lViPCVIVAuxw4psfkE9c3nmXt7GN4/yv7xbGmH9fCWCdBDorWB0MQA2LD17amSEfL92QnADT9Qcnt92h0EuNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.416111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2d907fc4651cea916d85b5438fa3a6eb9d02cce113d75c5d84e0922ea5e05c6","sha256:064ad1c51923ec1f881ad74ba530e62d0acd2059643c2d8028bfa8c7530d452c"],"state_sha256":"5908390ad8f607a97f5aa809705258946107215172586238bd6384b21b9b3a66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSCxko3oBqIWpoi+YxIFt/sb3pwDwRsws4cK2VZubgAmV08QM1DXllr328AfdizOWw/bdhVY7EZFm1iL0u3mDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T21:38:03.039122Z","bundle_sha256":"d7ab98b56d54c21176e87a956a1ce904a6bd0cfd4e1f86f5824ccae287ecf4dd"}}