{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C7V3KNOBUS7LI4SFSAIXCFPQYF","short_pith_number":"pith:C7V3KNOB","schema_version":"1.0","canonical_sha256":"17ebb535c1a4beb4724590117115f0c16f9d34d301065944c8a26e1997182dc2","source":{"kind":"arxiv","id":"1706.10114","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Polytopes in $LI(2)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Komei Fukuda, May Szedlak","submitted_at":"2017-06-30T10:51:58Z","abstract_excerpt":"In this paper we consider polytopes given by systems of $n$ inequalities in $d$ variables, where every inequality has at most two variables with nonzero coefficient. We denote this family by $LI(2)$. We show that despite of the easy algebraic structure, polytopes in $LI(2)$ can have high complexity. We construct a polytope in $LI(2)$, whose number of vertices is almost the number of vertices of the dual cyclic polytope, the difference is a multiplicative factor of depending on $d$ and in particular independent of $n$. Moreover we show that the dual cyclic polytope can not be realized in $LI(2)"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.10114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-30T10:51:58Z","cross_cats_sorted":[],"title_canon_sha256":"5cfa50dce43a81a8877dff8164140c26209552b80f324c65b0daf75e8eb6f13e","abstract_canon_sha256":"a2f90d4949008a9db717e20fd2722a75baf2f940f142d850b0dc87dc0533913c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:09.437235Z","signature_b64":"wYhL65VteVbgo/8t+nnm6qtulKeW2S4xwEnFMAe6G9pupMQuv/fCx1XV3ZXDvH9b9gafFhQW/+v5z2XY9SM9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17ebb535c1a4beb4724590117115f0c16f9d34d301065944c8a26e1997182dc2","last_reissued_at":"2026-05-18T00:41:09.436645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:09.436645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Polytopes in $LI(2)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Komei Fukuda, May Szedlak","submitted_at":"2017-06-30T10:51:58Z","abstract_excerpt":"In this paper we consider polytopes given by systems of $n$ inequalities in $d$ variables, where every inequality has at most two variables with nonzero coefficient. We denote this family by $LI(2)$. We show that despite of the easy algebraic structure, polytopes in $LI(2)$ can have high complexity. We construct a polytope in $LI(2)$, whose number of vertices is almost the number of vertices of the dual cyclic polytope, the difference is a multiplicative factor of depending on $d$ and in particular independent of $n$. Moreover we show that the dual cyclic polytope can not be realized in $LI(2)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10114","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.10114","created_at":"2026-05-18T00:41:09.436747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.10114v1","created_at":"2026-05-18T00:41:09.436747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10114","created_at":"2026-05-18T00:41:09.436747+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7V3KNOBUS7L","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7V3KNOBUS7LI4SF","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7V3KNOB","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C7V3KNOBUS7LI4SFSAIXCFPQYF","json":"https://pith.science/pith/C7V3KNOBUS7LI4SFSAIXCFPQYF.json","graph_json":"https://pith.science/api/pith-number/C7V3KNOBUS7LI4SFSAIXCFPQYF/graph.json","events_json":"https://pith.science/api/pith-number/C7V3KNOBUS7LI4SFSAIXCFPQYF/events.json","paper":"https://pith.science/paper/C7V3KNOB"},"agent_actions":{"view_html":"https://pith.science/pith/C7V3KNOBUS7LI4SFSAIXCFPQYF","download_json":"https://pith.science/pith/C7V3KNOBUS7LI4SFSAIXCFPQYF.json","view_paper":"https://pith.science/paper/C7V3KNOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.10114&json=true","fetch_graph":"https://pith.science/api/pith-number/C7V3KNOBUS7LI4SFSAIXCFPQYF/graph.json","fetch_events":"https://pith.science/api/pith-number/C7V3KNOBUS7LI4SFSAIXCFPQYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7V3KNOBUS7LI4SFSAIXCFPQYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7V3KNOBUS7LI4SFSAIXCFPQYF/action/storage_attestation","attest_author":"https://pith.science/pith/C7V3KNOBUS7LI4SFSAIXCFPQYF/action/author_attestation","sign_citation":"https://pith.science/pith/C7V3KNOBUS7LI4SFSAIXCFPQYF/action/citation_signature","submit_replication":"https://pith.science/pith/C7V3KNOBUS7LI4SFSAIXCFPQYF/action/replication_record"}},"created_at":"2026-05-18T00:41:09.436747+00:00","updated_at":"2026-05-18T00:41:09.436747+00:00"}