{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MQATEGZBI3BQFQZVB4KIPFSZJH","short_pith_number":"pith:MQATEGZB","canonical_record":{"source":{"id":"2605.19760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T12:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"f4a4769bd2f05633b184e03aeccc7028298f09e69f283d1f3e31ffbf1f7ba128","abstract_canon_sha256":"4e3a58729baad37911675329b0fcaa864c79018d60d3175d4c1243529f5915d5"},"schema_version":"1.0"},"canonical_sha256":"6401321b2146c302c3350f1487965949c190b7b5edbd5e949374c188837126c5","source":{"kind":"arxiv","id":"2605.19760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19760","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19760v1","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19760","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"MQATEGZBI3BQ","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"pith_short_16","alias_value":"MQATEGZBI3BQFQZV","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"pith_short_8","alias_value":"MQATEGZB","created_at":"2026-05-20T01:06:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MQATEGZBI3BQFQZVB4KIPFSZJH","target":"record","payload":{"canonical_record":{"source":{"id":"2605.19760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T12:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"f4a4769bd2f05633b184e03aeccc7028298f09e69f283d1f3e31ffbf1f7ba128","abstract_canon_sha256":"4e3a58729baad37911675329b0fcaa864c79018d60d3175d4c1243529f5915d5"},"schema_version":"1.0"},"canonical_sha256":"6401321b2146c302c3350f1487965949c190b7b5edbd5e949374c188837126c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:06:12.438149Z","signature_b64":"/5YqoUuoILxB2rBsFs3D4YlRfdSOC2l4/NbcxN+dWUstun/cZkXAsbwmJrnf5mEh+FdZMMKNt/Z/2kJuY0eKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6401321b2146c302c3350f1487965949c190b7b5edbd5e949374c188837126c5","last_reissued_at":"2026-05-20T01:06:12.437567Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:06:12.437567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.19760","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-20T01:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0r7nIpWgJChKXoicCptCjY4oIeLxJZy6VsUM7KcuMqd+Xw++stteO4Cf4MrwPSMZn6LLyvclSSh3cRYMfc9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:19:16.632477Z"},"content_sha256":"475566f9dc13c6b26f59abb63e195fec8d75984d1efc1d19dac0a02323e04293","schema_version":"1.0","event_id":"sha256:475566f9dc13c6b26f59abb63e195fec8d75984d1efc1d19dac0a02323e04293"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MQATEGZBI3BQFQZVB4KIPFSZJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"DIGEP), Federico Della Croce (DIGEP), Olivier Ploton (LIFAT), Quentin Schau (LIFAT, Vincent t'Kindt (LIFAT)","submitted_at":"2026-05-19T12:36:50Z","abstract_excerpt":"This work addresses the uniform parallel machine scheduling problem within an optimistic bilevel optimization framework. The leader seeks to minimize the weighted number of tardy jobs, while the follower aims to minimize the total completion time across a set of uniform machines. The hierarchical decision-making process of the bilevel problem makes designing effective heuristics challenging. To tackle this, we exploit a property of the follower that enables the construction of optimal schedules. From this property, we derive an effective branching scheme that simultaneously accounts for both l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19760","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19760/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-20T01:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/aB4UBHef6EOj9SXQJ4mZt4PLiIXtQMcjCypp7hM12YLq7JC+OPSoPE5ZNvLBGXMzmTBRtOMt7R4z2YQD359CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:19:16.633114Z"},"content_sha256":"1dcbd9a39c8c284c510601b5c2d6fdb006d32596decbe490be406a64d6408272","schema_version":"1.0","event_id":"sha256:1dcbd9a39c8c284c510601b5c2d6fdb006d32596decbe490be406a64d6408272"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQATEGZBI3BQFQZVB4KIPFSZJH/bundle.json","state_url":"https://pith.science/pith/MQATEGZBI3BQFQZVB4KIPFSZJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQATEGZBI3BQFQZVB4KIPFSZJH/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-06-01T06:19:16Z","links":{"resolver":"https://pith.science/pith/MQATEGZBI3BQFQZVB4KIPFSZJH","bundle":"https://pith.science/pith/MQATEGZBI3BQFQZVB4KIPFSZJH/bundle.json","state":"https://pith.science/pith/MQATEGZBI3BQFQZVB4KIPFSZJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQATEGZBI3BQFQZVB4KIPFSZJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MQATEGZBI3BQFQZVB4KIPFSZJH","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":"4e3a58729baad37911675329b0fcaa864c79018d60d3175d4c1243529f5915d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T12:36:50Z","title_canon_sha256":"f4a4769bd2f05633b184e03aeccc7028298f09e69f283d1f3e31ffbf1f7ba128"},"schema_version":"1.0","source":{"id":"2605.19760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19760","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19760v1","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19760","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"MQATEGZBI3BQ","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"pith_short_16","alias_value":"MQATEGZBI3BQFQZV","created_at":"2026-05-20T01:06:12Z"},{"alias_kind":"pith_short_8","alias_value":"MQATEGZB","created_at":"2026-05-20T01:06:12Z"}],"graph_snapshots":[{"event_id":"sha256:1dcbd9a39c8c284c510601b5c2d6fdb006d32596decbe490be406a64d6408272","target":"graph","created_at":"2026-05-20T01:06:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.19760/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work addresses the uniform parallel machine scheduling problem within an optimistic bilevel optimization framework. The leader seeks to minimize the weighted number of tardy jobs, while the follower aims to minimize the total completion time across a set of uniform machines. The hierarchical decision-making process of the bilevel problem makes designing effective heuristics challenging. To tackle this, we exploit a property of the follower that enables the construction of optimal schedules. From this property, we derive an effective branching scheme that simultaneously accounts for both l","authors_text":"DIGEP), Federico Della Croce (DIGEP), Olivier Ploton (LIFAT), Quentin Schau (LIFAT, Vincent t'Kindt (LIFAT)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T12:36:50Z","title":"Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19760","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:475566f9dc13c6b26f59abb63e195fec8d75984d1efc1d19dac0a02323e04293","target":"record","created_at":"2026-05-20T01:06:12Z","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":"4e3a58729baad37911675329b0fcaa864c79018d60d3175d4c1243529f5915d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-19T12:36:50Z","title_canon_sha256":"f4a4769bd2f05633b184e03aeccc7028298f09e69f283d1f3e31ffbf1f7ba128"},"schema_version":"1.0","source":{"id":"2605.19760","kind":"arxiv","version":1}},"canonical_sha256":"6401321b2146c302c3350f1487965949c190b7b5edbd5e949374c188837126c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6401321b2146c302c3350f1487965949c190b7b5edbd5e949374c188837126c5","first_computed_at":"2026-05-20T01:06:12.437567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:06:12.437567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/5YqoUuoILxB2rBsFs3D4YlRfdSOC2l4/NbcxN+dWUstun/cZkXAsbwmJrnf5mEh+FdZMMKNt/Z/2kJuY0eKCA==","signature_status":"signed_v1","signed_at":"2026-05-20T01:06:12.438149Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:475566f9dc13c6b26f59abb63e195fec8d75984d1efc1d19dac0a02323e04293","sha256:1dcbd9a39c8c284c510601b5c2d6fdb006d32596decbe490be406a64d6408272"],"state_sha256":"058a63bf576beac2665ba70278fa248b082fd84597ea06d5d8418f6d5ee2867b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXdC1stM0WqgqtBvu1tICgD9Y5oVRDOWi8Qo0JEnZfZnWupmLFDawW1Cey1w1XgqQbELYUTrgtsy7pV1eYgLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:19:16.635730Z","bundle_sha256":"89d9467dd3af6273336b4f8eff4d0d385aae7582eab293dae2c7dbbb47cbc429"}}