{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:HUIH25V4B4GOAOR4VLJPNZIZKH","short_pith_number":"pith:HUIH25V4","schema_version":"1.0","canonical_sha256":"3d107d76bc0f0ce03a3caad2f6e51951c9782cdb79e5629e69517d8dec6520a2","source":{"kind":"arxiv","id":"0903.1095","version":2},"attestation_state":"computed","paper":{"title":"Decomposition, Reformulation, and Diving in University Course Timetabling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Andrew J. Parkes, Edmund K. Burke, Hana Rudova, Jakub Marecek","submitted_at":"2009-03-05T20:40:32Z","abstract_excerpt":"In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of resource. Often, each component is associated with different sets of soft constraints, and so with different measures of soft constraint violation. The goal is then to minimise a linear combination of such measures. This paper studies an approach to such problems, which can be thought of as multiphase exploitation of multiple objective-/value-restricted submodels. In this approach, only one computationally difficult "},"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":"0903.1095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-03-05T20:40:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e77d9bf4e37baed58aa0ea130061d82dee4457ce9e9f3c7e6395ba64b96f8424","abstract_canon_sha256":"88bb7449803577987f7a434865ca85244278f60a28a21939cf1ee8c7b957dfd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:38.133021Z","signature_b64":"0y5bEyD2rg5aQ005dNHcMCiZ0tZmwhDrGrloQpOIDSMEqTL1SqWGD+IdBcQGQA1rY0jDOItgJdF9WDR4OMPDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d107d76bc0f0ce03a3caad2f6e51951c9782cdb79e5629e69517d8dec6520a2","last_reissued_at":"2026-05-18T02:54:38.132500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:38.132500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition, Reformulation, and Diving in University Course Timetabling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Andrew J. Parkes, Edmund K. Burke, Hana Rudova, Jakub Marecek","submitted_at":"2009-03-05T20:40:32Z","abstract_excerpt":"In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of resource. Often, each component is associated with different sets of soft constraints, and so with different measures of soft constraint violation. The goal is then to minimise a linear combination of such measures. This paper studies an approach to such problems, which can be thought of as multiphase exploitation of multiple objective-/value-restricted submodels. In this approach, only one computationally difficult "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1095","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":"0903.1095","created_at":"2026-05-18T02:54:38.132573+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.1095v2","created_at":"2026-05-18T02:54:38.132573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1095","created_at":"2026-05-18T02:54:38.132573+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUIH25V4B4GO","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUIH25V4B4GOAOR4","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUIH25V4","created_at":"2026-05-18T12:25:59.703012+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/HUIH25V4B4GOAOR4VLJPNZIZKH","json":"https://pith.science/pith/HUIH25V4B4GOAOR4VLJPNZIZKH.json","graph_json":"https://pith.science/api/pith-number/HUIH25V4B4GOAOR4VLJPNZIZKH/graph.json","events_json":"https://pith.science/api/pith-number/HUIH25V4B4GOAOR4VLJPNZIZKH/events.json","paper":"https://pith.science/paper/HUIH25V4"},"agent_actions":{"view_html":"https://pith.science/pith/HUIH25V4B4GOAOR4VLJPNZIZKH","download_json":"https://pith.science/pith/HUIH25V4B4GOAOR4VLJPNZIZKH.json","view_paper":"https://pith.science/paper/HUIH25V4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.1095&json=true","fetch_graph":"https://pith.science/api/pith-number/HUIH25V4B4GOAOR4VLJPNZIZKH/graph.json","fetch_events":"https://pith.science/api/pith-number/HUIH25V4B4GOAOR4VLJPNZIZKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUIH25V4B4GOAOR4VLJPNZIZKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUIH25V4B4GOAOR4VLJPNZIZKH/action/storage_attestation","attest_author":"https://pith.science/pith/HUIH25V4B4GOAOR4VLJPNZIZKH/action/author_attestation","sign_citation":"https://pith.science/pith/HUIH25V4B4GOAOR4VLJPNZIZKH/action/citation_signature","submit_replication":"https://pith.science/pith/HUIH25V4B4GOAOR4VLJPNZIZKH/action/replication_record"}},"created_at":"2026-05-18T02:54:38.132573+00:00","updated_at":"2026-05-18T02:54:38.132573+00:00"}