{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LGXK5R56MXU2OHUZHJDQTISCZG","short_pith_number":"pith:LGXK5R56","schema_version":"1.0","canonical_sha256":"59aeaec7be65e9a71e993a4709a242c9a9c8e7bd998505c0f9c0a873675a4ce3","source":{"kind":"arxiv","id":"1905.13524","version":1},"attestation_state":"computed","paper":{"title":"Randomized construction of complexes with large diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Newman, Francisco Criado","submitted_at":"2019-05-31T11:45:04Z","abstract_excerpt":"We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is within an $O(d^2)$ factor of the upper bound. This improves on the previously best-known lower bound which was within a factor of $e^{\\Theta(d)}$ of the upper bound. We also make a similar improvement in the case of pseudomanifolds."},"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":"1905.13524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-31T11:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"1d3857a1b45e3979dd7c63b20ea3675a66821ce58c2421d8f929d8fbf2b8e5b4","abstract_canon_sha256":"a983777d5aedfd0a328605a894f32f9e230f2f963414fa1229dd88882cc10dbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:34.698561Z","signature_b64":"RkDQlwGKiLumxb5WLaGCql6oi2DOpde4a0vQR9rnGAebqSnCOr55hE3n3KodIDq6SQhEb43ylH+jQUuHnVXFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59aeaec7be65e9a71e993a4709a242c9a9c8e7bd998505c0f9c0a873675a4ce3","last_reissued_at":"2026-05-17T23:44:34.698015Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:34.698015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized construction of complexes with large diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Newman, Francisco Criado","submitted_at":"2019-05-31T11:45:04Z","abstract_excerpt":"We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is within an $O(d^2)$ factor of the upper bound. This improves on the previously best-known lower bound which was within a factor of $e^{\\Theta(d)}$ of the upper bound. We also make a similar improvement in the case of pseudomanifolds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13524","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":"1905.13524","created_at":"2026-05-17T23:44:34.698089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13524v1","created_at":"2026-05-17T23:44:34.698089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13524","created_at":"2026-05-17T23:44:34.698089+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGXK5R56MXU2","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGXK5R56MXU2OHUZ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGXK5R56","created_at":"2026-05-18T12:33:21.387695+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/LGXK5R56MXU2OHUZHJDQTISCZG","json":"https://pith.science/pith/LGXK5R56MXU2OHUZHJDQTISCZG.json","graph_json":"https://pith.science/api/pith-number/LGXK5R56MXU2OHUZHJDQTISCZG/graph.json","events_json":"https://pith.science/api/pith-number/LGXK5R56MXU2OHUZHJDQTISCZG/events.json","paper":"https://pith.science/paper/LGXK5R56"},"agent_actions":{"view_html":"https://pith.science/pith/LGXK5R56MXU2OHUZHJDQTISCZG","download_json":"https://pith.science/pith/LGXK5R56MXU2OHUZHJDQTISCZG.json","view_paper":"https://pith.science/paper/LGXK5R56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13524&json=true","fetch_graph":"https://pith.science/api/pith-number/LGXK5R56MXU2OHUZHJDQTISCZG/graph.json","fetch_events":"https://pith.science/api/pith-number/LGXK5R56MXU2OHUZHJDQTISCZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGXK5R56MXU2OHUZHJDQTISCZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGXK5R56MXU2OHUZHJDQTISCZG/action/storage_attestation","attest_author":"https://pith.science/pith/LGXK5R56MXU2OHUZHJDQTISCZG/action/author_attestation","sign_citation":"https://pith.science/pith/LGXK5R56MXU2OHUZHJDQTISCZG/action/citation_signature","submit_replication":"https://pith.science/pith/LGXK5R56MXU2OHUZHJDQTISCZG/action/replication_record"}},"created_at":"2026-05-17T23:44:34.698089+00:00","updated_at":"2026-05-17T23:44:34.698089+00:00"}