{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IDXGPWQ5CONYVJBJMOJ5LICJUZ","short_pith_number":"pith:IDXGPWQ5","canonical_record":{"source":{"id":"1703.01943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-06T16:05:05Z","cross_cats_sorted":["cs.CG","cs.DM","math.OC"],"title_canon_sha256":"7f735159ebb568e96692ddbf967fe9dd83d5f43f9cfd4f547578731d6394e19d","abstract_canon_sha256":"a597f12ed45bef62d368fc7014ec0c9db0cb38aa9c13e915d6735c4d6d30ac68"},"schema_version":"1.0"},"canonical_sha256":"40ee67da1d139b8aa4296393d5a049a65a4d915d39b9308e960587b099070fae","source":{"kind":"arxiv","id":"1703.01943","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01943","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01943v2","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01943","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"pith_short_12","alias_value":"IDXGPWQ5CONY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IDXGPWQ5CONYVJBJ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IDXGPWQ5","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IDXGPWQ5CONYVJBJMOJ5LICJUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-06T16:05:05Z","cross_cats_sorted":["cs.CG","cs.DM","math.OC"],"title_canon_sha256":"7f735159ebb568e96692ddbf967fe9dd83d5f43f9cfd4f547578731d6394e19d","abstract_canon_sha256":"a597f12ed45bef62d368fc7014ec0c9db0cb38aa9c13e915d6735c4d6d30ac68"},"schema_version":"1.0"},"canonical_sha256":"40ee67da1d139b8aa4296393d5a049a65a4d915d39b9308e960587b099070fae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:33.262058Z","signature_b64":"y/rzfRA/uK3fb5snfHERIitOZpQaPXshkQpkZxAOAEa9OLzV1M4IWT25VwZ8xQ4GFq+phvPcgaYKI3HN+0p7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40ee67da1d139b8aa4296393d5a049a65a4d915d39b9308e960587b099070fae","last_reissued_at":"2026-05-18T00:47:33.261514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:33.261514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01943","source_version":2,"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-05-18T00:47:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BH6CIAENB1m6MmfAu81p+wH/naGmCoUtlS4oNx+XyJZ1/w0CtRLSN/lweDKXZLY8x8dcstHgmwXbWwT9HeYuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T05:28:27.888542Z"},"content_sha256":"164f428f569aef879ddc0bb549b80b4b1cbc675a62b4e5d2586a81c7e5db5d3f","schema_version":"1.0","event_id":"sha256:164f428f569aef879ddc0bb549b80b4b1cbc675a62b4e5d2586a81c7e5db5d3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IDXGPWQ5CONYVJBJMOJ5LICJUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumeration of $2$-level polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Adam Bohn, Kanstantsin Pashkovich, Marco Macchia, Samuel Fiorini, Vissarion Fisikopoulos, Yuri Faenza","submitted_at":"2017-03-06T16:05:05Z","abstract_excerpt":"A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by questions in combinatorial optimization and communication complexity, among others. In this paper, we present the first algorithm for enumerating all combinatorial types of $2$-level polytopes of a given dimension $d$, and provide complete experimental results for $d \\leqslant 7$. Our approach is inductive: for each fixed $(d-1)$-dimensional $2$-level polytop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01943","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"},"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-05-18T00:47:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ooXi6IC1/kgJDTo6bLPUwnNvk8igyaqDMj4mE3wEjoo7OryuO0G3OP1EFxMQ2qAlXXApCKjuyc9WAeX6UJXYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T05:28:27.889147Z"},"content_sha256":"d259b1dc97e372282fde76d89551d02e36b05f1ed18624eb6ad6977dc4341187","schema_version":"1.0","event_id":"sha256:d259b1dc97e372282fde76d89551d02e36b05f1ed18624eb6ad6977dc4341187"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDXGPWQ5CONYVJBJMOJ5LICJUZ/bundle.json","state_url":"https://pith.science/pith/IDXGPWQ5CONYVJBJMOJ5LICJUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDXGPWQ5CONYVJBJMOJ5LICJUZ/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-05-24T05:28:27Z","links":{"resolver":"https://pith.science/pith/IDXGPWQ5CONYVJBJMOJ5LICJUZ","bundle":"https://pith.science/pith/IDXGPWQ5CONYVJBJMOJ5LICJUZ/bundle.json","state":"https://pith.science/pith/IDXGPWQ5CONYVJBJMOJ5LICJUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDXGPWQ5CONYVJBJMOJ5LICJUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IDXGPWQ5CONYVJBJMOJ5LICJUZ","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":"a597f12ed45bef62d368fc7014ec0c9db0cb38aa9c13e915d6735c4d6d30ac68","cross_cats_sorted":["cs.CG","cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-06T16:05:05Z","title_canon_sha256":"7f735159ebb568e96692ddbf967fe9dd83d5f43f9cfd4f547578731d6394e19d"},"schema_version":"1.0","source":{"id":"1703.01943","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01943","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01943v2","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01943","created_at":"2026-05-18T00:47:33Z"},{"alias_kind":"pith_short_12","alias_value":"IDXGPWQ5CONY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IDXGPWQ5CONYVJBJ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IDXGPWQ5","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:d259b1dc97e372282fde76d89551d02e36b05f1ed18624eb6ad6977dc4341187","target":"graph","created_at":"2026-05-18T00:47:33Z","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"},"paper":{"abstract_excerpt":"A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by questions in combinatorial optimization and communication complexity, among others. In this paper, we present the first algorithm for enumerating all combinatorial types of $2$-level polytopes of a given dimension $d$, and provide complete experimental results for $d \\leqslant 7$. Our approach is inductive: for each fixed $(d-1)$-dimensional $2$-level polytop","authors_text":"Adam Bohn, Kanstantsin Pashkovich, Marco Macchia, Samuel Fiorini, Vissarion Fisikopoulos, Yuri Faenza","cross_cats":["cs.CG","cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-06T16:05:05Z","title":"Enumeration of $2$-level polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01943","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:164f428f569aef879ddc0bb549b80b4b1cbc675a62b4e5d2586a81c7e5db5d3f","target":"record","created_at":"2026-05-18T00:47:33Z","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":"a597f12ed45bef62d368fc7014ec0c9db0cb38aa9c13e915d6735c4d6d30ac68","cross_cats_sorted":["cs.CG","cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-06T16:05:05Z","title_canon_sha256":"7f735159ebb568e96692ddbf967fe9dd83d5f43f9cfd4f547578731d6394e19d"},"schema_version":"1.0","source":{"id":"1703.01943","kind":"arxiv","version":2}},"canonical_sha256":"40ee67da1d139b8aa4296393d5a049a65a4d915d39b9308e960587b099070fae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40ee67da1d139b8aa4296393d5a049a65a4d915d39b9308e960587b099070fae","first_computed_at":"2026-05-18T00:47:33.261514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:33.261514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y/rzfRA/uK3fb5snfHERIitOZpQaPXshkQpkZxAOAEa9OLzV1M4IWT25VwZ8xQ4GFq+phvPcgaYKI3HN+0p7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:33.262058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01943","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:164f428f569aef879ddc0bb549b80b4b1cbc675a62b4e5d2586a81c7e5db5d3f","sha256:d259b1dc97e372282fde76d89551d02e36b05f1ed18624eb6ad6977dc4341187"],"state_sha256":"4003555a69497f01f43df4e5f45beb819af3a3a0346a7772cf8865dd25761d6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQ9KnbIfZPWE1EsElr+ahGP7uJCu9UtpDKRG2VRBQIuvdqkYRofRrsy5BtUV6D8VZsgBFAoVtMbhdIbVQ5HdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T05:28:27.892686Z","bundle_sha256":"8ba57ccf41e960d462814c4e859f6a2c9437b1a61ad388a488e0e6be3bc867a5"}}