{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CQ5I7ACJRJ6RHFCX5MTDRFHJBX","short_pith_number":"pith:CQ5I7ACJ","canonical_record":{"source":{"id":"1401.4595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:04:55Z","cross_cats_sorted":[],"title_canon_sha256":"b68f1eba0dde24f516583b4e9796a2abb4d677680b9366e67f36420e08c25e45","abstract_canon_sha256":"304833a6c44afdb511e74f26f3e8913166d2b1ab96a18e71ab5c24e5b8284d67"},"schema_version":"1.0"},"canonical_sha256":"143a8f80498a7d139457eb263894e90dcd62071023ad32be779543f6c38a1db6","source":{"kind":"arxiv","id":"1401.4595","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4595","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4595v1","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4595","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"CQ5I7ACJRJ6R","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CQ5I7ACJRJ6RHFCX","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CQ5I7ACJ","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CQ5I7ACJRJ6RHFCX5MTDRFHJBX","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:04:55Z","cross_cats_sorted":[],"title_canon_sha256":"b68f1eba0dde24f516583b4e9796a2abb4d677680b9366e67f36420e08c25e45","abstract_canon_sha256":"304833a6c44afdb511e74f26f3e8913166d2b1ab96a18e71ab5c24e5b8284d67"},"schema_version":"1.0"},"canonical_sha256":"143a8f80498a7d139457eb263894e90dcd62071023ad32be779543f6c38a1db6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:45.334926Z","signature_b64":"00DMmM2qMnzyQqrXJ2UjZCVDcaeBwcSk+fpOIQ3hY9QZREVopXa2VP4CqGYmLibgpHu0vk4wtVztjnnM0KT2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"143a8f80498a7d139457eb263894e90dcd62071023ad32be779543f6c38a1db6","last_reissued_at":"2026-05-18T03:01:45.334180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:45.334180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4595","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:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brTbsm+PTRdGe+CYqbkSXyydYgcIQRpLgtMhU7GCeBU9rApCneSiRfNPiJlxWtxFm+c25oDfSBGuavypihTZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:40:02.981786Z"},"content_sha256":"327fbcf7f651639f6515c85403371ea756a451b8e065c7a9fca2f7e70ec5999f","schema_version":"1.0","event_id":"sha256:327fbcf7f651639f6515c85403371ea756a451b8e065c7a9fca2f7e70ec5999f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CQ5I7ACJRJ6RHFCX5MTDRFHJBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Local Search for Solving RCPSP/max with Durational Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fei Xiao, Hoong Chuin LAU, Na Fu, Pradeep R. Varakantham","submitted_at":"2014-01-18T21:04:55Z","abstract_excerpt":"Scheduling problems in manufacturing, logistics and project management have frequently been modeled using the framework of Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max). Due to the importance of these problems, providing scalable solution schedules for RCPSP/max problems is a topic of extensive research. However, all existing methods for solving RCPSP/max assume that durations of activities are known with certainty, an assumption that does not hold in real world scheduling problems where unexpected external events such as manpower availability,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4595","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:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HmYNela52ZcFcU1ANvzBYvc7kTdD3oQc2f5Bowg9R050/THmmEty4/qfXKblf/H+nuUHNnS45WiCsu9Z0mKFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:40:02.982115Z"},"content_sha256":"24b61e64e1e0d9d5f8d9675030dadde93cc3cf20dd82e445bfd581d1585cbe85","schema_version":"1.0","event_id":"sha256:24b61e64e1e0d9d5f8d9675030dadde93cc3cf20dd82e445bfd581d1585cbe85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQ5I7ACJRJ6RHFCX5MTDRFHJBX/bundle.json","state_url":"https://pith.science/pith/CQ5I7ACJRJ6RHFCX5MTDRFHJBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQ5I7ACJRJ6RHFCX5MTDRFHJBX/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-27T02:40:02Z","links":{"resolver":"https://pith.science/pith/CQ5I7ACJRJ6RHFCX5MTDRFHJBX","bundle":"https://pith.science/pith/CQ5I7ACJRJ6RHFCX5MTDRFHJBX/bundle.json","state":"https://pith.science/pith/CQ5I7ACJRJ6RHFCX5MTDRFHJBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQ5I7ACJRJ6RHFCX5MTDRFHJBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CQ5I7ACJRJ6RHFCX5MTDRFHJBX","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":"304833a6c44afdb511e74f26f3e8913166d2b1ab96a18e71ab5c24e5b8284d67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:04:55Z","title_canon_sha256":"b68f1eba0dde24f516583b4e9796a2abb4d677680b9366e67f36420e08c25e45"},"schema_version":"1.0","source":{"id":"1401.4595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4595","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4595v1","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4595","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"CQ5I7ACJRJ6R","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CQ5I7ACJRJ6RHFCX","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CQ5I7ACJ","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:24b61e64e1e0d9d5f8d9675030dadde93cc3cf20dd82e445bfd581d1585cbe85","target":"graph","created_at":"2026-05-18T03:01:45Z","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":"Scheduling problems in manufacturing, logistics and project management have frequently been modeled using the framework of Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max). Due to the importance of these problems, providing scalable solution schedules for RCPSP/max problems is a topic of extensive research. However, all existing methods for solving RCPSP/max assume that durations of activities are known with certainty, an assumption that does not hold in real world scheduling problems where unexpected external events such as manpower availability,","authors_text":"Fei Xiao, Hoong Chuin LAU, Na Fu, Pradeep R. Varakantham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:04:55Z","title":"Robust Local Search for Solving RCPSP/max with Durational Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4595","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:327fbcf7f651639f6515c85403371ea756a451b8e065c7a9fca2f7e70ec5999f","target":"record","created_at":"2026-05-18T03:01:45Z","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":"304833a6c44afdb511e74f26f3e8913166d2b1ab96a18e71ab5c24e5b8284d67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:04:55Z","title_canon_sha256":"b68f1eba0dde24f516583b4e9796a2abb4d677680b9366e67f36420e08c25e45"},"schema_version":"1.0","source":{"id":"1401.4595","kind":"arxiv","version":1}},"canonical_sha256":"143a8f80498a7d139457eb263894e90dcd62071023ad32be779543f6c38a1db6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"143a8f80498a7d139457eb263894e90dcd62071023ad32be779543f6c38a1db6","first_computed_at":"2026-05-18T03:01:45.334180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:45.334180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"00DMmM2qMnzyQqrXJ2UjZCVDcaeBwcSk+fpOIQ3hY9QZREVopXa2VP4CqGYmLibgpHu0vk4wtVztjnnM0KT2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:45.334926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4595","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:327fbcf7f651639f6515c85403371ea756a451b8e065c7a9fca2f7e70ec5999f","sha256:24b61e64e1e0d9d5f8d9675030dadde93cc3cf20dd82e445bfd581d1585cbe85"],"state_sha256":"5ab5b4baa6561c603491769c2fa7872688ffccdb1c251c3a60689b3c0b618979"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGLcjvx2i8upM9jqvA9TJ8hAF0oW0PpIHUtA4EEc1SXbqLI6+NPxcT8jaH9aLU1xhVU/a6AdpNMP/TWMLisRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:40:02.983997Z","bundle_sha256":"9e7c6fed1b4fd0062ff47519ee836239dd813e3cd23ed451de0770da582f1411"}}