{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6OVMY7WGKL6D463P5CYC7KYOK7","short_pith_number":"pith:6OVMY7WG","canonical_record":{"source":{"id":"2105.12509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-26T12:22:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"63b62eaa4d57cfe312b8c540d3769c02595cc67ecc5792096f1de7fdf5e6998b","abstract_canon_sha256":"a2e8cd3e057525a4eb7735bcf811f8f8eb368a791367a06d4573eda068fed5f9"},"schema_version":"1.0"},"canonical_sha256":"f3aacc7ec652fc3e7b6fe8b02fab0e57c7b3add078fc60b815ab7f36070d2e2b","source":{"kind":"arxiv","id":"2105.12509","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6OVMY7WGKL6D463P5CYC7KYOK7","target":"record","payload":{"canonical_record":{"source":{"id":"2105.12509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-26T12:22:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"63b62eaa4d57cfe312b8c540d3769c02595cc67ecc5792096f1de7fdf5e6998b","abstract_canon_sha256":"a2e8cd3e057525a4eb7735bcf811f8f8eb368a791367a06d4573eda068fed5f9"},"schema_version":"1.0"},"canonical_sha256":"f3aacc7ec652fc3e7b6fe8b02fab0e57c7b3add078fc60b815ab7f36070d2e2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:39.745747Z","signature_b64":"Ql1OP4RtssY7Sfq900ABanNwFktkHFBRQ9K3cMPXddPrgmDuVippuj41zXHrD3haKW9XzONVWV3Nd+ihzjlDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3aacc7ec652fc3e7b6fe8b02fab0e57c7b3add078fc60b815ab7f36070d2e2b","last_reissued_at":"2026-07-05T02:43:39.745300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:39.745300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.12509","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-07-05T02:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITEa6y9cyFtGyku2TO/udtMbbWae5zh47FTfqm2oenPXxOxDtRaV7/vH827ILKi51HV9lLDk+SPz0nX7ktb6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T18:49:58.125410Z"},"content_sha256":"bb22b996dc1df23aa59c3afb0c380dfda939c4a389ff2611c9efe1c12365d45f","schema_version":"1.0","event_id":"sha256:bb22b996dc1df23aa59c3afb0c380dfda939c4a389ff2611c9efe1c12365d45f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6OVMY7WGKL6D463P5CYC7KYOK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Aspects of Relaxation Complexity: Possibilities and Limitations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Christopher Hojny, Gennadiy Averkov, Matthias Schymura","submitted_at":"2021-05-26T12:22:41Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12509","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/2105.12509/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-07-05T02:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQDkZiVl9NHdc3Gan26CwQg3TE1RmGgtmgkHaWYiE6+3St89EKeb8iBLHkPNvmCrtCzSoxIQVShJo0l+AP9MDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T18:49:58.126391Z"},"content_sha256":"4d5fe6a5bb48fdd7d0924447bc029b4499129a13399958b7ab814801595a9007","schema_version":"1.0","event_id":"sha256:4d5fe6a5bb48fdd7d0924447bc029b4499129a13399958b7ab814801595a9007"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OVMY7WGKL6D463P5CYC7KYOK7/bundle.json","state_url":"https://pith.science/pith/6OVMY7WGKL6D463P5CYC7KYOK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OVMY7WGKL6D463P5CYC7KYOK7/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-08-22T18:49:58Z","links":{"resolver":"https://pith.science/pith/6OVMY7WGKL6D463P5CYC7KYOK7","bundle":"https://pith.science/pith/6OVMY7WGKL6D463P5CYC7KYOK7/bundle.json","state":"https://pith.science/pith/6OVMY7WGKL6D463P5CYC7KYOK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OVMY7WGKL6D463P5CYC7KYOK7/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSfpwy5igjdAH3wmmEKViVs+a1bYZYHdA+Tc8H/c2+YrCtta3mODVmHGJjCLhb4PX6mD2BvG8JiBZnsa41GjDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T18:49:58.134341Z","bundle_sha256":"864a9ec27183314afbe50feee26a80cdbd71c6096e75ff3d5f126311da60a2c9"}}