{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IGA3XXMSVCW46J7UMVTAQU27CS","short_pith_number":"pith:IGA3XXMS","schema_version":"1.0","canonical_sha256":"4181bbdd92a8adcf27f4656608535f149e029bcd61eea337b091457bb3a5a4e5","source":{"kind":"arxiv","id":"1702.03187","version":2},"attestation_state":"computed","paper":{"title":"On 2-level polytopes arising in combinatorial settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Alfonso Cevallos, Manuel Aprile, Yuri Faenza","submitted_at":"2017-02-10T14:37:00Z","abstract_excerpt":"2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level polytopes arising in combinatorial settings. Our first contribution is proving that v(P)*f(P) is upper bounded by d*2^(d+1), for a large collection of families of such polytopes P. Here v(P) (resp. f(P)) is the number of vertices (resp. facets) of P, and d is its dimension. Whether this holds for all 2-level polytopes was asked in [Bohn et al., ESA 2015], a"},"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":"1702.03187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-10T14:37:00Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6335550e98c105bfe21b2f3777e1c41503f92309db48a9fd431908e0bb284a75","abstract_canon_sha256":"2eb2937510bde32803fc530439c2ef7138ec20893f7bdcfc2f799d410c45798c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:02.437745Z","signature_b64":"z0J9/YfO7hC5YWtLV6P8wm1DVeEoadhoY4ysF9xqFcnMRPW8oyk+/sevbiUzkfEm2RK8YVFQG++PKDxZxSy3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4181bbdd92a8adcf27f4656608535f149e029bcd61eea337b091457bb3a5a4e5","last_reissued_at":"2026-05-18T00:28:02.436926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:02.436926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On 2-level polytopes arising in combinatorial settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Alfonso Cevallos, Manuel Aprile, Yuri Faenza","submitted_at":"2017-02-10T14:37:00Z","abstract_excerpt":"2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level polytopes arising in combinatorial settings. Our first contribution is proving that v(P)*f(P) is upper bounded by d*2^(d+1), for a large collection of families of such polytopes P. Here v(P) (resp. f(P)) is the number of vertices (resp. facets) of P, and d is its dimension. Whether this holds for all 2-level polytopes was asked in [Bohn et al., ESA 2015], a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03187","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03187","created_at":"2026-05-18T00:28:02.437023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03187v2","created_at":"2026-05-18T00:28:02.437023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03187","created_at":"2026-05-18T00:28:02.437023+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGA3XXMSVCW4","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGA3XXMSVCW46J7U","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGA3XXMS","created_at":"2026-05-18T12:31:21.493067+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/IGA3XXMSVCW46J7UMVTAQU27CS","json":"https://pith.science/pith/IGA3XXMSVCW46J7UMVTAQU27CS.json","graph_json":"https://pith.science/api/pith-number/IGA3XXMSVCW46J7UMVTAQU27CS/graph.json","events_json":"https://pith.science/api/pith-number/IGA3XXMSVCW46J7UMVTAQU27CS/events.json","paper":"https://pith.science/paper/IGA3XXMS"},"agent_actions":{"view_html":"https://pith.science/pith/IGA3XXMSVCW46J7UMVTAQU27CS","download_json":"https://pith.science/pith/IGA3XXMSVCW46J7UMVTAQU27CS.json","view_paper":"https://pith.science/paper/IGA3XXMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03187&json=true","fetch_graph":"https://pith.science/api/pith-number/IGA3XXMSVCW46J7UMVTAQU27CS/graph.json","fetch_events":"https://pith.science/api/pith-number/IGA3XXMSVCW46J7UMVTAQU27CS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGA3XXMSVCW46J7UMVTAQU27CS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGA3XXMSVCW46J7UMVTAQU27CS/action/storage_attestation","attest_author":"https://pith.science/pith/IGA3XXMSVCW46J7UMVTAQU27CS/action/author_attestation","sign_citation":"https://pith.science/pith/IGA3XXMSVCW46J7UMVTAQU27CS/action/citation_signature","submit_replication":"https://pith.science/pith/IGA3XXMSVCW46J7UMVTAQU27CS/action/replication_record"}},"created_at":"2026-05-18T00:28:02.437023+00:00","updated_at":"2026-05-18T00:28:02.437023+00:00"}