{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6OVMY7WGKL6D463P5CYC7KYOK7","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":"a2e8cd3e057525a4eb7735bcf811f8f8eb368a791367a06d4573eda068fed5f9","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-26T12:22:41Z","title_canon_sha256":"63b62eaa4d57cfe312b8c540d3769c02595cc67ecc5792096f1de7fdf5e6998b"},"schema_version":"1.0","source":{"id":"2105.12509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12509","created_at":"2026-07-05T02:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12509v1","created_at":"2026-07-05T02:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12509","created_at":"2026-07-05T02:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"6OVMY7WGKL6D","created_at":"2026-07-05T02:43:39Z"},{"alias_kind":"pith_short_16","alias_value":"6OVMY7WGKL6D463P","created_at":"2026-07-05T02:43:39Z"},{"alias_kind":"pith_short_8","alias_value":"6OVMY7WG","created_at":"2026-07-05T02:43:39Z"}],"graph_snapshots":[{"event_id":"sha256:4d5fe6a5bb48fdd7d0924447bc029b4499129a13399958b7ab814801595a9007","target":"graph","created_at":"2026-07-05T02:43:39Z","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/2105.12509/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The relaxation complexity $\\mathrm{rc}(X)$ of the set of integer points $X$ contained in a polyhedron is the smallest number of facets of any polyhedron $P$ such that the integer points in $P$ coincide with $X$. It is a useful tool to investigate the existence of compact linear descriptions of $X$. In this article, we derive tight and computable upper bounds on $\\mathrm{rc}_{\\mathbb{Q}}(X)$, a variant of $\\mathrm{rc}(X)$ in which the polyhedra $P$ are required to be rational, and we show that $\\mathrm{rc}(X)$ can be computed in polynomial time if $X$ is 2-dimensional. Further, we investigate c","authors_text":"Christopher Hojny, Gennadiy Averkov, Matthias Schymura","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-26T12:22:41Z","title":"Computational Aspects of Relaxation Complexity: Possibilities and Limitations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12509","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:bb22b996dc1df23aa59c3afb0c380dfda939c4a389ff2611c9efe1c12365d45f","target":"record","created_at":"2026-07-05T02:43:39Z","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":"a2e8cd3e057525a4eb7735bcf811f8f8eb368a791367a06d4573eda068fed5f9","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-26T12:22:41Z","title_canon_sha256":"63b62eaa4d57cfe312b8c540d3769c02595cc67ecc5792096f1de7fdf5e6998b"},"schema_version":"1.0","source":{"id":"2105.12509","kind":"arxiv","version":1}},"canonical_sha256":"f3aacc7ec652fc3e7b6fe8b02fab0e57c7b3add078fc60b815ab7f36070d2e2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3aacc7ec652fc3e7b6fe8b02fab0e57c7b3add078fc60b815ab7f36070d2e2b","first_computed_at":"2026-07-05T02:43:39.745300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:43:39.745300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ql1OP4RtssY7Sfq900ABanNwFktkHFBRQ9K3cMPXddPrgmDuVippuj41zXHrD3haKW9XzONVWV3Nd+ihzjlDDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:43:39.745747Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.12509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb22b996dc1df23aa59c3afb0c380dfda939c4a389ff2611c9efe1c12365d45f","sha256:4d5fe6a5bb48fdd7d0924447bc029b4499129a13399958b7ab814801595a9007"],"state_sha256":"25b64a1c218125330af21198c6a1994113125c94ba7687868369de4b61830a1e"}