{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HE6BSIJMXZZA5VB3FC75JRERAT","short_pith_number":"pith:HE6BSIJM","canonical_record":{"source":{"id":"1409.7186","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-25T08:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"c20a17039a5955266e3cf9571e55fb3b64de7fe84dddde6244141084f4b885d0","abstract_canon_sha256":"e4468f86bd1192006938450e608a97ebf0f3f8cfc82d39ed106ac00184c4958f"},"schema_version":"1.0"},"canonical_sha256":"393c19212cbe720ed43b28bfd4c49104d064beeab4c1eac17175c8aec5e30f69","source":{"kind":"arxiv","id":"1409.7186","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7186","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7186v2","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7186","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"HE6BSIJMXZZA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HE6BSIJMXZZA5VB3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HE6BSIJM","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HE6BSIJMXZZA5VB3FC75JRERAT","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7186","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-25T08:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"c20a17039a5955266e3cf9571e55fb3b64de7fe84dddde6244141084f4b885d0","abstract_canon_sha256":"e4468f86bd1192006938450e608a97ebf0f3f8cfc82d39ed106ac00184c4958f"},"schema_version":"1.0"},"canonical_sha256":"393c19212cbe720ed43b28bfd4c49104d064beeab4c1eac17175c8aec5e30f69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:11.367801Z","signature_b64":"D0BVOqeNYHBYSLT6Cl5ClEhjo/9bmcW8NTyWAcgAdPzGIdr9wpNuoEbX6OOKJjem++1U6Xf3GCYPc/FUy52UAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"393c19212cbe720ed43b28bfd4c49104d064beeab4c1eac17175c8aec5e30f69","last_reissued_at":"2026-05-18T01:37:11.367140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:11.367140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7186","source_version":2,"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-18T01:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dY0t+p7nRX9uTgNCDN4ilT0DEN7WPfLE4uA8o5AqemnG7tpBK7FUxVlpXJkimmTWwX6Wu9meZ97LYj/fnPilBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:23:33.732924Z"},"content_sha256":"17fc4d7e439187bc68e6ec4b0cfc1234c08ad5a04224054ab66de98f8df45a46","schema_version":"1.0","event_id":"sha256:17fc4d7e439187bc68e6ec4b0cfc1234c08ad5a04224054ab66de98f8df45a46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HE6BSIJMXZZA5VB3FC75JRERAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrea Schaerf, Luca Di Gaspero, Ruggero Bellio, Sara Ceschia, Tommaso Urli","submitted_at":"2014-09-25T08:53:04Z","abstract_excerpt":"We consider the university course timetabling problem, which is one of the most studied problems in educational timetabling. In particular, we focus our attention on the formulation known as the curriculum-based course timetabling problem, which has been tackled by many researchers and for which there are many available benchmarks.\n  The contribution of this paper is twofold. First, we propose an effective and robust single-stage simulated annealing method for solving the problem. Secondly, we design and apply an extensive and statistically-principled methodology for the parameter tuning proce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7186","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"},"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-18T01:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMBUMdeK8eFMaYS6+ZVn0Jgo9dnFpoWtfzJXw1xOJ2VljOpjtud2sUf46Yl20W9x/KOu5sSGv2GAWcVzwYOYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:23:33.733686Z"},"content_sha256":"edb2ffac083df4e79f272de2456f36fa034bfe3f5ab37fb6e95bcdcaa05013d5","schema_version":"1.0","event_id":"sha256:edb2ffac083df4e79f272de2456f36fa034bfe3f5ab37fb6e95bcdcaa05013d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HE6BSIJMXZZA5VB3FC75JRERAT/bundle.json","state_url":"https://pith.science/pith/HE6BSIJMXZZA5VB3FC75JRERAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HE6BSIJMXZZA5VB3FC75JRERAT/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-31T11:23:33Z","links":{"resolver":"https://pith.science/pith/HE6BSIJMXZZA5VB3FC75JRERAT","bundle":"https://pith.science/pith/HE6BSIJMXZZA5VB3FC75JRERAT/bundle.json","state":"https://pith.science/pith/HE6BSIJMXZZA5VB3FC75JRERAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HE6BSIJMXZZA5VB3FC75JRERAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HE6BSIJMXZZA5VB3FC75JRERAT","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":"e4468f86bd1192006938450e608a97ebf0f3f8cfc82d39ed106ac00184c4958f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-25T08:53:04Z","title_canon_sha256":"c20a17039a5955266e3cf9571e55fb3b64de7fe84dddde6244141084f4b885d0"},"schema_version":"1.0","source":{"id":"1409.7186","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7186","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7186v2","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7186","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"HE6BSIJMXZZA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HE6BSIJMXZZA5VB3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HE6BSIJM","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:edb2ffac083df4e79f272de2456f36fa034bfe3f5ab37fb6e95bcdcaa05013d5","target":"graph","created_at":"2026-05-18T01:37:11Z","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":"We consider the university course timetabling problem, which is one of the most studied problems in educational timetabling. In particular, we focus our attention on the formulation known as the curriculum-based course timetabling problem, which has been tackled by many researchers and for which there are many available benchmarks.\n  The contribution of this paper is twofold. First, we propose an effective and robust single-stage simulated annealing method for solving the problem. Secondly, we design and apply an extensive and statistically-principled methodology for the parameter tuning proce","authors_text":"Andrea Schaerf, Luca Di Gaspero, Ruggero Bellio, Sara Ceschia, Tommaso Urli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-25T08:53:04Z","title":"Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7186","kind":"arxiv","version":2},"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:17fc4d7e439187bc68e6ec4b0cfc1234c08ad5a04224054ab66de98f8df45a46","target":"record","created_at":"2026-05-18T01:37:11Z","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":"e4468f86bd1192006938450e608a97ebf0f3f8cfc82d39ed106ac00184c4958f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-25T08:53:04Z","title_canon_sha256":"c20a17039a5955266e3cf9571e55fb3b64de7fe84dddde6244141084f4b885d0"},"schema_version":"1.0","source":{"id":"1409.7186","kind":"arxiv","version":2}},"canonical_sha256":"393c19212cbe720ed43b28bfd4c49104d064beeab4c1eac17175c8aec5e30f69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"393c19212cbe720ed43b28bfd4c49104d064beeab4c1eac17175c8aec5e30f69","first_computed_at":"2026-05-18T01:37:11.367140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:11.367140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D0BVOqeNYHBYSLT6Cl5ClEhjo/9bmcW8NTyWAcgAdPzGIdr9wpNuoEbX6OOKJjem++1U6Xf3GCYPc/FUy52UAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:11.367801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7186","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17fc4d7e439187bc68e6ec4b0cfc1234c08ad5a04224054ab66de98f8df45a46","sha256:edb2ffac083df4e79f272de2456f36fa034bfe3f5ab37fb6e95bcdcaa05013d5"],"state_sha256":"77723799f54d9bb0180658fcc16e5bdbb2e234dc020a8d5ce0945f5ed29c7885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19pyZek8LTQLJ6dYv86eJP+8zuDTyfuYLW6993SUAJ6swivWeWTJxOUFAPILdGbXoXUhK+dsznNT0N+Go13DCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:23:33.737293Z","bundle_sha256":"300026d4d98526f15100b2c2e28b49e5d6bfd22be322f1ae2292b7158e3a062f"}}