{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QNDSP6KKTPYH5X76RTR4HMMM52","short_pith_number":"pith:QNDSP6KK","canonical_record":{"source":{"id":"1009.0347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-09-02T08:03:47Z","cross_cats_sorted":[],"title_canon_sha256":"8c03e16ba9af210a0c57aa37cfb94e964d0f4dabbdb5fb16f19fabcb45a25d00","abstract_canon_sha256":"99ed96cdc7ff2982aa2d00df36008fb1c564c5248827e441ba0917797e07b666"},"schema_version":"1.0"},"canonical_sha256":"834727f94a9bf07edffe8ce3c3b18ceea2bb7c50d533fbb5fc833e5ba3372e73","source":{"kind":"arxiv","id":"1009.0347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0347","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0347v1","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0347","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"QNDSP6KKTPYH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QNDSP6KKTPYH5X76","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QNDSP6KK","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QNDSP6KKTPYH5X76RTR4HMMM52","target":"record","payload":{"canonical_record":{"source":{"id":"1009.0347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-09-02T08:03:47Z","cross_cats_sorted":[],"title_canon_sha256":"8c03e16ba9af210a0c57aa37cfb94e964d0f4dabbdb5fb16f19fabcb45a25d00","abstract_canon_sha256":"99ed96cdc7ff2982aa2d00df36008fb1c564c5248827e441ba0917797e07b666"},"schema_version":"1.0"},"canonical_sha256":"834727f94a9bf07edffe8ce3c3b18ceea2bb7c50d533fbb5fc833e5ba3372e73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:26.897230Z","signature_b64":"sneHptb/2Eo0dvggF55iL6B67C51JTMwvBiE/orztEZeSDqjKd6MRcNK9q2anKz1Z/MJorFABp2+9nx+P72uBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"834727f94a9bf07edffe8ce3c3b18ceea2bb7c50d533fbb5fc833e5ba3372e73","last_reissued_at":"2026-05-18T04:41:26.896658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:26.896658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.0347","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-18T04:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6SySjwGFqzH+P0BXVcdmqOQYKvHPnNubgoEnVSuCwmedQkisQdoggE85syTUv/RxiIfN+Of/i/nW4cu5oyRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:37:02.454828Z"},"content_sha256":"b8e20ee85ed5fd55ad064ee4a6b7a1e4d1bd2082f22ec928698a3a9863054747","schema_version":"1.0","event_id":"sha256:b8e20ee85ed5fd55ad064ee4a6b7a1e4d1bd2082f22ec928698a3a9863054747"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QNDSP6KKTPYH5X76RTR4HMMM52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andreas Schutt, Mark G. Wallace, Peter J. Stuckey, Thibaut Feydy","submitted_at":"2010-09-02T08:03:47Z","abstract_excerpt":"The technical report presents a generic exact solution approach for minimizing the project duration of the resource-constrained project scheduling problem with generalized precedences (Rcpsp/max). The approach uses lazy clause generation, i.e., a hybrid of finite domain and Boolean satisfiability solving, in order to apply nogood learning and conflict-driven search on the solution generation. Our experiments show the benefit of lazy clause generation for finding an optimal solutions and proving its optimality in comparison to other state-of-the-art exact and non-exact methods. The method is hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0347","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-18T04:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rf21CC/RO9+UJyDEvr/EhzBeeuJ7Kn7pXm2CZOKcU3B5aAyn2QkJ+YocTCZHYyrgUxaHuTLYyBMWLYco28dpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:37:02.455258Z"},"content_sha256":"5e65e9c6da95047c635edb6dbd0b046a697b7ea375a9eb18ca6ab0f406bf24f3","schema_version":"1.0","event_id":"sha256:5e65e9c6da95047c635edb6dbd0b046a697b7ea375a9eb18ca6ab0f406bf24f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52/bundle.json","state_url":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNDSP6KKTPYH5X76RTR4HMMM52/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-05-26T02:37:02Z","links":{"resolver":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52","bundle":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52/bundle.json","state":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNDSP6KKTPYH5X76RTR4HMMM52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QNDSP6KKTPYH5X76RTR4HMMM52","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":"99ed96cdc7ff2982aa2d00df36008fb1c564c5248827e441ba0917797e07b666","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-09-02T08:03:47Z","title_canon_sha256":"8c03e16ba9af210a0c57aa37cfb94e964d0f4dabbdb5fb16f19fabcb45a25d00"},"schema_version":"1.0","source":{"id":"1009.0347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0347","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0347v1","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0347","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"QNDSP6KKTPYH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QNDSP6KKTPYH5X76","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QNDSP6KK","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:5e65e9c6da95047c635edb6dbd0b046a697b7ea375a9eb18ca6ab0f406bf24f3","target":"graph","created_at":"2026-05-18T04:41:26Z","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 technical report presents a generic exact solution approach for minimizing the project duration of the resource-constrained project scheduling problem with generalized precedences (Rcpsp/max). The approach uses lazy clause generation, i.e., a hybrid of finite domain and Boolean satisfiability solving, in order to apply nogood learning and conflict-driven search on the solution generation. Our experiments show the benefit of lazy clause generation for finding an optimal solutions and proving its optimality in comparison to other state-of-the-art exact and non-exact methods. The method is hi","authors_text":"Andreas Schutt, Mark G. Wallace, Peter J. Stuckey, Thibaut Feydy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-09-02T08:03:47Z","title":"Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0347","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:b8e20ee85ed5fd55ad064ee4a6b7a1e4d1bd2082f22ec928698a3a9863054747","target":"record","created_at":"2026-05-18T04:41:26Z","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":"99ed96cdc7ff2982aa2d00df36008fb1c564c5248827e441ba0917797e07b666","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-09-02T08:03:47Z","title_canon_sha256":"8c03e16ba9af210a0c57aa37cfb94e964d0f4dabbdb5fb16f19fabcb45a25d00"},"schema_version":"1.0","source":{"id":"1009.0347","kind":"arxiv","version":1}},"canonical_sha256":"834727f94a9bf07edffe8ce3c3b18ceea2bb7c50d533fbb5fc833e5ba3372e73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"834727f94a9bf07edffe8ce3c3b18ceea2bb7c50d533fbb5fc833e5ba3372e73","first_computed_at":"2026-05-18T04:41:26.896658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:26.896658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sneHptb/2Eo0dvggF55iL6B67C51JTMwvBiE/orztEZeSDqjKd6MRcNK9q2anKz1Z/MJorFABp2+9nx+P72uBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:26.897230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.0347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8e20ee85ed5fd55ad064ee4a6b7a1e4d1bd2082f22ec928698a3a9863054747","sha256:5e65e9c6da95047c635edb6dbd0b046a697b7ea375a9eb18ca6ab0f406bf24f3"],"state_sha256":"3d55637fbe3e0561e7dc3f7937ee7dfeb54aaf885d2492687c5ed397c6597272"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ya65QCHjJYuIMX5Nd/JL6XQa2VndYMoNODg8SmSYwdNRGf7ZxBCjpng7CmLfofZ8sOv2Q1zHMWDDerH49T4RAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:37:02.458092Z","bundle_sha256":"8a7550538f0be596dd20936536d31f2d1e9100dcb4c57278e1ed9b11589eeafe"}}