{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LWMQ3N33ZKWIBPFZ2KGTLBKLMM","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":"66a2134e87aee8ceb02cd47822e214acd5344273d59605b94d55e4e12c918385","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-10T08:05:01Z","title_canon_sha256":"d349729649f8bf5aae5e1a36c8e4d3915a42cd7d587a8f7dbfd2b7d8eb31637b"},"schema_version":"1.0","source":{"id":"2203.05224","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.05224","created_at":"2026-07-05T04:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2203.05224v2","created_at":"2026-07-05T04:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05224","created_at":"2026-07-05T04:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"LWMQ3N33ZKWI","created_at":"2026-07-05T04:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"LWMQ3N33ZKWIBPFZ","created_at":"2026-07-05T04:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"LWMQ3N33","created_at":"2026-07-05T04:04:07Z"}],"graph_snapshots":[{"event_id":"sha256:46dd0a2cc170069d317c30a3fb494669a32b4401fe248528e21c90a3d293fc74","target":"graph","created_at":"2026-07-05T04:04:07Z","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/2203.05224/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The relaxation complexity rc(X) of the set of integer points X contained in a polyhedron is the minimal number of inequalities needed to formulate a linear optimization problem over X without using auxiliary variables. Besides its relevance in integer programming, this concept has interpretations in aspects of social choice, symmetric cryptanalysis, and machine learning.\n  We employ efficient mixed-integer programming techniques to compute a robust and numerically more practical variant of the relaxation complexity. Our proposed models require row or column generation techniques and can be enh","authors_text":"Christopher Hojny, Gennadiy Averkov, Matthias Schymura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-10T08:05:01Z","title":"Efficient MIP Techniques for Computing the Relaxation Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05224","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:1165a1efc37c635a35b5564a31c81128640a19ea32739a51503c1e421f4c6128","target":"record","created_at":"2026-07-05T04:04:07Z","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":"66a2134e87aee8ceb02cd47822e214acd5344273d59605b94d55e4e12c918385","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-10T08:05:01Z","title_canon_sha256":"d349729649f8bf5aae5e1a36c8e4d3915a42cd7d587a8f7dbfd2b7d8eb31637b"},"schema_version":"1.0","source":{"id":"2203.05224","kind":"arxiv","version":2}},"canonical_sha256":"5d990db77bcaac80bcb9d28d35854b63201c4d7d68fef74a3f504c8e03e3944d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d990db77bcaac80bcb9d28d35854b63201c4d7d68fef74a3f504c8e03e3944d","first_computed_at":"2026-07-05T04:04:07.054623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:04:07.054623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YbryTbYvQV4HV3PFUPTmOWXoZdrdbI5VOS21cDPiKILbTZaYJviGB3XUd/XSiF6YU4vOklMeKEDeTC6+3zB4Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:04:07.055028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.05224","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1165a1efc37c635a35b5564a31c81128640a19ea32739a51503c1e421f4c6128","sha256:46dd0a2cc170069d317c30a3fb494669a32b4401fe248528e21c90a3d293fc74"],"state_sha256":"4588aa35affe1a231dc43a2617bb82611c41f2b8bb8a65a71565e979d84a1adb"}