{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CE5Z7SWEI7GESNBKVGCSEHW34V","short_pith_number":"pith:CE5Z7SWE","canonical_record":{"source":{"id":"1808.09672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T08:03:40Z","cross_cats_sorted":[],"title_canon_sha256":"89d354dd8d8d5baeb11c9283bb5713775847a22f7137c672608187af0a4c267f","abstract_canon_sha256":"b17e0be5d505279a143c071f43e858c3ec05a7d9aaf700643eb892671aa09e4a"},"schema_version":"1.0"},"canonical_sha256":"113b9fcac447cc49342aa985221edbe558040e8d65c83ccf8e2cf95c60c91313","source":{"kind":"arxiv","id":"1808.09672","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09672","created_at":"2026-05-17T23:55:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09672v2","created_at":"2026-05-17T23:55:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09672","created_at":"2026-05-17T23:55:55Z"},{"alias_kind":"pith_short_12","alias_value":"CE5Z7SWEI7GE","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CE5Z7SWEI7GESNBK","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CE5Z7SWE","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CE5Z7SWEI7GESNBKVGCSEHW34V","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T08:03:40Z","cross_cats_sorted":[],"title_canon_sha256":"89d354dd8d8d5baeb11c9283bb5713775847a22f7137c672608187af0a4c267f","abstract_canon_sha256":"b17e0be5d505279a143c071f43e858c3ec05a7d9aaf700643eb892671aa09e4a"},"schema_version":"1.0"},"canonical_sha256":"113b9fcac447cc49342aa985221edbe558040e8d65c83ccf8e2cf95c60c91313","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:55.388787Z","signature_b64":"q7ZkBYZRX+omPZ67cABv8wN1T2Gx9QG+T4Nwe4YEUj8x8fbH9jud+7H93NvYKG1tV2heeNW16e4fC977nrIyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"113b9fcac447cc49342aa985221edbe558040e8d65c83ccf8e2cf95c60c91313","last_reissued_at":"2026-05-17T23:55:55.388099Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:55.388099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09672","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-17T23:55:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUPcsOAEjfRa1oeaCWZMCikd6o1M0KKG1yjw20ZqEZ5AzSRf8QkF87X/zIBDaOif+WX4CvKd+LQwFWVcleRRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:03:24.494336Z"},"content_sha256":"eb92916a88edb21b5439ec91a77af13662059432aaf0e490280f597abdce7226","schema_version":"1.0","event_id":"sha256:eb92916a88edb21b5439ec91a77af13662059432aaf0e490280f597abdce7226"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CE5Z7SWEI7GESNBKVGCSEHW34V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the minimum number of facets of a 2-neighborly polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandr Maksimenko","submitted_at":"2018-08-29T08:03:40Z","abstract_excerpt":"Let $\\mu_{\\text{2n}}(d,v)$ (respectively, $\\mu^{\\text{s}}_{\\text{2n}}(d,v)$) be the minimal number of facets of a (simplicial) 2-neighborly $d$-polytope with $v$ vertices, $v > d \\ge 4$. It is known that $\\mu_{\\text{2n}}(4,v) = v (v-3)/2$, $\\mu_{\\text{2n}}(d, d+2) = d+5$, $\\mu_{\\text{2n}}(d,d+3) = d+7$ for $d \\ge 5$, and $\\mu_{\\text{2n}}(d,d+4) \\in [d+5, d+8]$ for $d \\ge 6$. We show that $\\mu_{\\text{2n}}(5, v) = \\Omega(v^{4/3})$, $\\mu_{\\text{2n}}(6, v) \\ge v$, and the equality $\\mu_{\\text{2n}}(6, v) = v$ holds only for a simplex and for a dual 2-neighborly 6-polytope (if it exists) with $v \\ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09672","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-17T23:55:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKGQt8YyKtJq99bE9JMvLhoUPf9w5lbULwGOZ+dWCe9keydBMwKqIuxC0ExKDD2rpYebWSVi57QmTDKxxoEqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:03:24.494705Z"},"content_sha256":"e873f241b0c96f575f903d640cfeba95ef69ebed429249ac7d298e3ce4ca0266","schema_version":"1.0","event_id":"sha256:e873f241b0c96f575f903d640cfeba95ef69ebed429249ac7d298e3ce4ca0266"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CE5Z7SWEI7GESNBKVGCSEHW34V/bundle.json","state_url":"https://pith.science/pith/CE5Z7SWEI7GESNBKVGCSEHW34V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CE5Z7SWEI7GESNBKVGCSEHW34V/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-28T05:03:24Z","links":{"resolver":"https://pith.science/pith/CE5Z7SWEI7GESNBKVGCSEHW34V","bundle":"https://pith.science/pith/CE5Z7SWEI7GESNBKVGCSEHW34V/bundle.json","state":"https://pith.science/pith/CE5Z7SWEI7GESNBKVGCSEHW34V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CE5Z7SWEI7GESNBKVGCSEHW34V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CE5Z7SWEI7GESNBKVGCSEHW34V","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":"b17e0be5d505279a143c071f43e858c3ec05a7d9aaf700643eb892671aa09e4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T08:03:40Z","title_canon_sha256":"89d354dd8d8d5baeb11c9283bb5713775847a22f7137c672608187af0a4c267f"},"schema_version":"1.0","source":{"id":"1808.09672","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09672","created_at":"2026-05-17T23:55:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09672v2","created_at":"2026-05-17T23:55:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09672","created_at":"2026-05-17T23:55:55Z"},{"alias_kind":"pith_short_12","alias_value":"CE5Z7SWEI7GE","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CE5Z7SWEI7GESNBK","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CE5Z7SWE","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:e873f241b0c96f575f903d640cfeba95ef69ebed429249ac7d298e3ce4ca0266","target":"graph","created_at":"2026-05-17T23:55:55Z","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":"Let $\\mu_{\\text{2n}}(d,v)$ (respectively, $\\mu^{\\text{s}}_{\\text{2n}}(d,v)$) be the minimal number of facets of a (simplicial) 2-neighborly $d$-polytope with $v$ vertices, $v > d \\ge 4$. It is known that $\\mu_{\\text{2n}}(4,v) = v (v-3)/2$, $\\mu_{\\text{2n}}(d, d+2) = d+5$, $\\mu_{\\text{2n}}(d,d+3) = d+7$ for $d \\ge 5$, and $\\mu_{\\text{2n}}(d,d+4) \\in [d+5, d+8]$ for $d \\ge 6$. We show that $\\mu_{\\text{2n}}(5, v) = \\Omega(v^{4/3})$, $\\mu_{\\text{2n}}(6, v) \\ge v$, and the equality $\\mu_{\\text{2n}}(6, v) = v$ holds only for a simplex and for a dual 2-neighborly 6-polytope (if it exists) with $v \\ge","authors_text":"Aleksandr Maksimenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T08:03:40Z","title":"On the minimum number of facets of a 2-neighborly polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09672","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:eb92916a88edb21b5439ec91a77af13662059432aaf0e490280f597abdce7226","target":"record","created_at":"2026-05-17T23:55:55Z","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":"b17e0be5d505279a143c071f43e858c3ec05a7d9aaf700643eb892671aa09e4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T08:03:40Z","title_canon_sha256":"89d354dd8d8d5baeb11c9283bb5713775847a22f7137c672608187af0a4c267f"},"schema_version":"1.0","source":{"id":"1808.09672","kind":"arxiv","version":2}},"canonical_sha256":"113b9fcac447cc49342aa985221edbe558040e8d65c83ccf8e2cf95c60c91313","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"113b9fcac447cc49342aa985221edbe558040e8d65c83ccf8e2cf95c60c91313","first_computed_at":"2026-05-17T23:55:55.388099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:55.388099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q7ZkBYZRX+omPZ67cABv8wN1T2Gx9QG+T4Nwe4YEUj8x8fbH9jud+7H93NvYKG1tV2heeNW16e4fC977nrIyCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:55.388787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09672","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb92916a88edb21b5439ec91a77af13662059432aaf0e490280f597abdce7226","sha256:e873f241b0c96f575f903d640cfeba95ef69ebed429249ac7d298e3ce4ca0266"],"state_sha256":"f3273847a7f195af80d222549481db29b23da0f99e9f83ba2a0096b99c096d76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ER4LNp+hR6mbNB944gzmR8Gbt0QSbipLON6uXbrkpq8bjPJCAc4AWPuNZG1k/4KrzumIH5fZ+LkNxVAP/fHWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:03:24.496662Z","bundle_sha256":"df6e4852625ec8fc2e76a7101017d5b1d286dc86a40d3188ff1e9f9246882e80"}}