{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QNDSP6KKTPYH5X76RTR4HMMM52","short_pith_number":"pith:QNDSP6KK","schema_version":"1.0","canonical_sha256":"834727f94a9bf07edffe8ce3c3b18ceea2bb7c50d533fbb5fc833e5ba3372e73","source":{"kind":"arxiv","id":"1009.0347","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.0347","created_at":"2026-05-18T04:41:26.896778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.0347v1","created_at":"2026-05-18T04:41:26.896778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0347","created_at":"2026-05-18T04:41:26.896778+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNDSP6KKTPYH","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNDSP6KKTPYH5X76","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNDSP6KK","created_at":"2026-05-18T12:26:12.377268+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/QNDSP6KKTPYH5X76RTR4HMMM52","json":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52.json","graph_json":"https://pith.science/api/pith-number/QNDSP6KKTPYH5X76RTR4HMMM52/graph.json","events_json":"https://pith.science/api/pith-number/QNDSP6KKTPYH5X76RTR4HMMM52/events.json","paper":"https://pith.science/paper/QNDSP6KK"},"agent_actions":{"view_html":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52","download_json":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52.json","view_paper":"https://pith.science/paper/QNDSP6KK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.0347&json=true","fetch_graph":"https://pith.science/api/pith-number/QNDSP6KKTPYH5X76RTR4HMMM52/graph.json","fetch_events":"https://pith.science/api/pith-number/QNDSP6KKTPYH5X76RTR4HMMM52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52/action/storage_attestation","attest_author":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52/action/author_attestation","sign_citation":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52/action/citation_signature","submit_replication":"https://pith.science/pith/QNDSP6KKTPYH5X76RTR4HMMM52/action/replication_record"}},"created_at":"2026-05-18T04:41:26.896778+00:00","updated_at":"2026-05-18T04:41:26.896778+00:00"}