{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TRXG5UWYEXWQ6BJHMPCOCCQD37","short_pith_number":"pith:TRXG5UWY","schema_version":"1.0","canonical_sha256":"9c6e6ed2d825ed0f052763c4e10a03dfebd03944ceccf5c67090f9e9ffdfa808","source":{"kind":"arxiv","id":"1208.3015","version":2},"attestation_state":"computed","paper":{"title":"Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andreas Schutt, Peter J. Stuckey, Thibaut Feydy","submitted_at":"2012-08-15T02:17:55Z","abstract_excerpt":"Cumulative resource constraints can model scarce resources in scheduling problems or a dimension in packing and cutting problems. In order to efficiently solve such problems with a constraint programming solver, it is important to have strong and fast propagators for cumulative resource constraints. One such propagator is the recently developed time-table-edge-finding propagator, which considers the current resource profile during the edge-finding propagation. Recently, lazy clause generation solvers, i.e. constraint programming solvers incorporating nogood learning, have proved to be excellen"},"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":"1208.3015","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-08-15T02:17:55Z","cross_cats_sorted":[],"title_canon_sha256":"5271b00b8a9409bc87c57c7c67a7b36037aeeb58e366204426d0a86f5786f8d7","abstract_canon_sha256":"fb943e02ccb07b2d0df464c1f704abc8a78642ea9e6cd836caaf6416e1923a48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:54.989855Z","signature_b64":"12D++bobO7vO3ypqDAmhnnM5fybxgFYQp556DvU4zZwB8Vfux08IpDwRoCpmQKVBEXlTTO/ZeUhno0HioM+6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6e6ed2d825ed0f052763c4e10a03dfebd03944ceccf5c67090f9e9ffdfa808","last_reissued_at":"2026-05-18T03:45:54.989323Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:54.989323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andreas Schutt, Peter J. Stuckey, Thibaut Feydy","submitted_at":"2012-08-15T02:17:55Z","abstract_excerpt":"Cumulative resource constraints can model scarce resources in scheduling problems or a dimension in packing and cutting problems. In order to efficiently solve such problems with a constraint programming solver, it is important to have strong and fast propagators for cumulative resource constraints. One such propagator is the recently developed time-table-edge-finding propagator, which considers the current resource profile during the edge-finding propagation. Recently, lazy clause generation solvers, i.e. constraint programming solvers incorporating nogood learning, have proved to be excellen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3015","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":"1208.3015","created_at":"2026-05-18T03:45:54.989407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3015v2","created_at":"2026-05-18T03:45:54.989407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3015","created_at":"2026-05-18T03:45:54.989407+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRXG5UWYEXWQ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRXG5UWYEXWQ6BJH","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRXG5UWY","created_at":"2026-05-18T12:27:23.164592+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/TRXG5UWYEXWQ6BJHMPCOCCQD37","json":"https://pith.science/pith/TRXG5UWYEXWQ6BJHMPCOCCQD37.json","graph_json":"https://pith.science/api/pith-number/TRXG5UWYEXWQ6BJHMPCOCCQD37/graph.json","events_json":"https://pith.science/api/pith-number/TRXG5UWYEXWQ6BJHMPCOCCQD37/events.json","paper":"https://pith.science/paper/TRXG5UWY"},"agent_actions":{"view_html":"https://pith.science/pith/TRXG5UWYEXWQ6BJHMPCOCCQD37","download_json":"https://pith.science/pith/TRXG5UWYEXWQ6BJHMPCOCCQD37.json","view_paper":"https://pith.science/paper/TRXG5UWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3015&json=true","fetch_graph":"https://pith.science/api/pith-number/TRXG5UWYEXWQ6BJHMPCOCCQD37/graph.json","fetch_events":"https://pith.science/api/pith-number/TRXG5UWYEXWQ6BJHMPCOCCQD37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRXG5UWYEXWQ6BJHMPCOCCQD37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRXG5UWYEXWQ6BJHMPCOCCQD37/action/storage_attestation","attest_author":"https://pith.science/pith/TRXG5UWYEXWQ6BJHMPCOCCQD37/action/author_attestation","sign_citation":"https://pith.science/pith/TRXG5UWYEXWQ6BJHMPCOCCQD37/action/citation_signature","submit_replication":"https://pith.science/pith/TRXG5UWYEXWQ6BJHMPCOCCQD37/action/replication_record"}},"created_at":"2026-05-18T03:45:54.989407+00:00","updated_at":"2026-05-18T03:45:54.989407+00:00"}