{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:U7UCUIJGCZ4DELWRWKYJQP6SXW","short_pith_number":"pith:U7UCUIJG","canonical_record":{"source":{"id":"0907.1298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-07T20:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"452109f3cf2767538c4f9b4dfefbd71c7b95e71d739f83ff52237bb4167a8447","abstract_canon_sha256":"1b8c2b4d6d6b645258aec2bebbea9bbe661091b293410cc30587f1edf77d5346"},"schema_version":"1.0"},"canonical_sha256":"a7e82a21261678322ed1b2b0983fd2bdb39e6dd924cd6a23de6ca3b8e2179f8c","source":{"kind":"arxiv","id":"0907.1298","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.1298","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"0907.1298v2","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.1298","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"U7UCUIJGCZ4D","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"U7UCUIJGCZ4DELWR","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"U7UCUIJG","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:U7UCUIJGCZ4DELWRWKYJQP6SXW","target":"record","payload":{"canonical_record":{"source":{"id":"0907.1298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-07T20:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"452109f3cf2767538c4f9b4dfefbd71c7b95e71d739f83ff52237bb4167a8447","abstract_canon_sha256":"1b8c2b4d6d6b645258aec2bebbea9bbe661091b293410cc30587f1edf77d5346"},"schema_version":"1.0"},"canonical_sha256":"a7e82a21261678322ed1b2b0983fd2bdb39e6dd924cd6a23de6ca3b8e2179f8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:41.063664Z","signature_b64":"SONFOlbznHcvlxxR6zA2xN3+27BGwpQniXlBfafTgqnYtEjHgSyXGN+vvmAeO1PwzEGIot2J962s9AOSP/+PAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7e82a21261678322ed1b2b0983fd2bdb39e6dd924cd6a23de6ca3b8e2179f8c","last_reissued_at":"2026-05-18T00:53:41.063198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:41.063198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0907.1298","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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KeWV7/K12/BFU5fN4uDjn5OFcoUYtoadpW9oS4TAVPyTMtf1cxLlGolwJv6IH+YhcqUFXZAJTCK0PN57ykXaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:33:46.564969Z"},"content_sha256":"c5fa1c2415b6171babb8fb7c1d166e37083c52392c6ff5be3d99d5b2deecc6b7","schema_version":"1.0","event_id":"sha256:c5fa1c2415b6171babb8fb7c1d166e37083c52392c6ff5be3d99d5b2deecc6b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:U7UCUIJGCZ4DELWRWKYJQP6SXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A parametric integer programming algorithm for bilevel mixed integer programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christopher Thomas Ryan, Matthias K\\\"oppe, Maurice Queyranne","submitted_at":"2009-07-07T20:51:23Z","abstract_excerpt":"We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader's variables are continuous, our algorithm also detects whether the infimum cost fails to be attained, a difficulty that has been identified but not directly addressed in the literature. In this case it yields a ``better than fully polynomial time'' approximation scheme with running time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.1298","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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IyOVt81YdOgfCjhCmpH6jBrFDSluxwLLNaPHVeTMXpRAQSlffE91qf29RhGkj2OdM/35stl4N8hEbQ8lxDDhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:33:46.565336Z"},"content_sha256":"e45a885887425e42770fa0e479ae6a6778dfa4d1a2ae4fba55d2ac5dcdd82854","schema_version":"1.0","event_id":"sha256:e45a885887425e42770fa0e479ae6a6778dfa4d1a2ae4fba55d2ac5dcdd82854"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7UCUIJGCZ4DELWRWKYJQP6SXW/bundle.json","state_url":"https://pith.science/pith/U7UCUIJGCZ4DELWRWKYJQP6SXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7UCUIJGCZ4DELWRWKYJQP6SXW/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-09T12:33:46Z","links":{"resolver":"https://pith.science/pith/U7UCUIJGCZ4DELWRWKYJQP6SXW","bundle":"https://pith.science/pith/U7UCUIJGCZ4DELWRWKYJQP6SXW/bundle.json","state":"https://pith.science/pith/U7UCUIJGCZ4DELWRWKYJQP6SXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7UCUIJGCZ4DELWRWKYJQP6SXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:U7UCUIJGCZ4DELWRWKYJQP6SXW","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":"1b8c2b4d6d6b645258aec2bebbea9bbe661091b293410cc30587f1edf77d5346","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-07T20:51:23Z","title_canon_sha256":"452109f3cf2767538c4f9b4dfefbd71c7b95e71d739f83ff52237bb4167a8447"},"schema_version":"1.0","source":{"id":"0907.1298","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.1298","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"0907.1298v2","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.1298","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"U7UCUIJGCZ4D","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"U7UCUIJGCZ4DELWR","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"U7UCUIJG","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:e45a885887425e42770fa0e479ae6a6778dfa4d1a2ae4fba55d2ac5dcdd82854","target":"graph","created_at":"2026-05-18T00:53:41Z","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 discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader's variables are continuous, our algorithm also detects whether the infimum cost fails to be attained, a difficulty that has been identified but not directly addressed in the literature. In this case it yields a ``better than fully polynomial time'' approximation scheme with running time","authors_text":"Christopher Thomas Ryan, Matthias K\\\"oppe, Maurice Queyranne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-07T20:51:23Z","title":"A parametric integer programming algorithm for bilevel mixed integer programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.1298","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:c5fa1c2415b6171babb8fb7c1d166e37083c52392c6ff5be3d99d5b2deecc6b7","target":"record","created_at":"2026-05-18T00:53:41Z","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":"1b8c2b4d6d6b645258aec2bebbea9bbe661091b293410cc30587f1edf77d5346","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-07T20:51:23Z","title_canon_sha256":"452109f3cf2767538c4f9b4dfefbd71c7b95e71d739f83ff52237bb4167a8447"},"schema_version":"1.0","source":{"id":"0907.1298","kind":"arxiv","version":2}},"canonical_sha256":"a7e82a21261678322ed1b2b0983fd2bdb39e6dd924cd6a23de6ca3b8e2179f8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7e82a21261678322ed1b2b0983fd2bdb39e6dd924cd6a23de6ca3b8e2179f8c","first_computed_at":"2026-05-18T00:53:41.063198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:41.063198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SONFOlbznHcvlxxR6zA2xN3+27BGwpQniXlBfafTgqnYtEjHgSyXGN+vvmAeO1PwzEGIot2J962s9AOSP/+PAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:41.063664Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.1298","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5fa1c2415b6171babb8fb7c1d166e37083c52392c6ff5be3d99d5b2deecc6b7","sha256:e45a885887425e42770fa0e479ae6a6778dfa4d1a2ae4fba55d2ac5dcdd82854"],"state_sha256":"8b0043ddc061cba1c66d1f208f88ddc93f9f08d9fa2c5238002ecdfb21334821"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJU1r5oQs11UmPQTVUtBFAsM9ljfQmVaSPTHM5zxvWGB/S/LqGDUPqc87W1u8OEtxtMC/RwSYsFDz8islJlnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:33:46.567488Z","bundle_sha256":"6e66a732dee83929d095b2b2be3b25f50e0ef9732e4a90c133a72780159defd5"}}