{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XY6UTDJFUMD4VBLYAYIR4KR2P7","short_pith_number":"pith:XY6UTDJF","schema_version":"1.0","canonical_sha256":"be3d498d25a307ca857806111e2a3a7fdd595846e19453c7428b34ae87d03afd","source":{"kind":"arxiv","id":"1509.00362","version":5},"attestation_state":"computed","paper":{"title":"The lower bound for the number of facets of a k-neighborly d-polytope with d+3 vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandr Maksimenko","submitted_at":"2015-09-01T15:47:26Z","abstract_excerpt":"We have found the minimal difference $\\Delta(k) = \\min\\limits_P (f_{d-1}(P) - f_{0}(P))$ between the number of facets and the number of vertices of a $k$-neighborly $d$-polytope $P$ for the case $f_{0}(P) = d+3$: $\\Delta(2) = 4$, $\\Delta(3) = 15$, and $\\Delta(k) = 2 (k^2 - 1)$ for $k \\ge 4$."},"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":"1509.00362","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T15:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"a8f19768dc492099f7b3bc80b69803543e9808a3ed75ad8437373883cf8c4d44","abstract_canon_sha256":"644c709a543918932610e0358e5401a52f4fbc875a532604c643f53c75a27458"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:24.013570Z","signature_b64":"7mnpbYx2SAR/aIFxgHNI9R6DkDXzOjtge0lAQFckRSKAdlmZhWldMpVYu5xsFOSTVqmy9ijZKRoL7AJn6OwkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3d498d25a307ca857806111e2a3a7fdd595846e19453c7428b34ae87d03afd","last_reissued_at":"2026-05-18T00:07:24.013114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:24.013114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The lower bound for the number of facets of a k-neighborly d-polytope with d+3 vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandr Maksimenko","submitted_at":"2015-09-01T15:47:26Z","abstract_excerpt":"We have found the minimal difference $\\Delta(k) = \\min\\limits_P (f_{d-1}(P) - f_{0}(P))$ between the number of facets and the number of vertices of a $k$-neighborly $d$-polytope $P$ for the case $f_{0}(P) = d+3$: $\\Delta(2) = 4$, $\\Delta(3) = 15$, and $\\Delta(k) = 2 (k^2 - 1)$ for $k \\ge 4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00362","kind":"arxiv","version":5},"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":"1509.00362","created_at":"2026-05-18T00:07:24.013181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00362v5","created_at":"2026-05-18T00:07:24.013181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00362","created_at":"2026-05-18T00:07:24.013181+00:00"},{"alias_kind":"pith_short_12","alias_value":"XY6UTDJFUMD4","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XY6UTDJFUMD4VBLY","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XY6UTDJF","created_at":"2026-05-18T12:29:50.041715+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/XY6UTDJFUMD4VBLYAYIR4KR2P7","json":"https://pith.science/pith/XY6UTDJFUMD4VBLYAYIR4KR2P7.json","graph_json":"https://pith.science/api/pith-number/XY6UTDJFUMD4VBLYAYIR4KR2P7/graph.json","events_json":"https://pith.science/api/pith-number/XY6UTDJFUMD4VBLYAYIR4KR2P7/events.json","paper":"https://pith.science/paper/XY6UTDJF"},"agent_actions":{"view_html":"https://pith.science/pith/XY6UTDJFUMD4VBLYAYIR4KR2P7","download_json":"https://pith.science/pith/XY6UTDJFUMD4VBLYAYIR4KR2P7.json","view_paper":"https://pith.science/paper/XY6UTDJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00362&json=true","fetch_graph":"https://pith.science/api/pith-number/XY6UTDJFUMD4VBLYAYIR4KR2P7/graph.json","fetch_events":"https://pith.science/api/pith-number/XY6UTDJFUMD4VBLYAYIR4KR2P7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XY6UTDJFUMD4VBLYAYIR4KR2P7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XY6UTDJFUMD4VBLYAYIR4KR2P7/action/storage_attestation","attest_author":"https://pith.science/pith/XY6UTDJFUMD4VBLYAYIR4KR2P7/action/author_attestation","sign_citation":"https://pith.science/pith/XY6UTDJFUMD4VBLYAYIR4KR2P7/action/citation_signature","submit_replication":"https://pith.science/pith/XY6UTDJFUMD4VBLYAYIR4KR2P7/action/replication_record"}},"created_at":"2026-05-18T00:07:24.013181+00:00","updated_at":"2026-05-18T00:07:24.013181+00:00"}