{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OSS5Z4ZJ5FUYYWXGT23OODPDUW","short_pith_number":"pith:OSS5Z4ZJ","schema_version":"1.0","canonical_sha256":"74a5dcf329e9698c5ae69eb6e70de3a5960eb644698349634d08a67bd39ac4be","source":{"kind":"arxiv","id":"1604.01934","version":1},"attestation_state":"computed","paper":{"title":"Fullerene graphs of small diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diego Nicodemos, Mat\\v{e}j Stehl\\'ik","submitted_at":"2016-04-07T09:29:55Z","abstract_excerpt":"A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of Andova and \\v{S}krekovski [MATCH Commun. Math. Comput. Chem. 70 (2013) 205-220], who conjectured that every fullerene graph on $n$ vertices has diameter at least $\\lfloor \\sqrt{5n/3}\\rfloor-1$."},"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":"1604.01934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-07T09:29:55Z","cross_cats_sorted":[],"title_canon_sha256":"c2e301eda6442253c559887176926cc90fa0ea8b878f4c847c1c3b12ce82bc73","abstract_canon_sha256":"e46a46845da866108569fd70db685d698234d16cfdac8a77ab5abef4aaf8ccd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:39.432652Z","signature_b64":"OZfwIKp1JbZhtnM7bcmMkDVHt5SnUW6Z1Ycv6QjAJ6rrgXSyauKGS6k+XViZ8TQqlax+ijjsYH6dPaQBuu5JBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74a5dcf329e9698c5ae69eb6e70de3a5960eb644698349634d08a67bd39ac4be","last_reissued_at":"2026-05-18T00:34:39.431858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:39.431858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fullerene graphs of small diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diego Nicodemos, Mat\\v{e}j Stehl\\'ik","submitted_at":"2016-04-07T09:29:55Z","abstract_excerpt":"A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of Andova and \\v{S}krekovski [MATCH Commun. Math. Comput. Chem. 70 (2013) 205-220], who conjectured that every fullerene graph on $n$ vertices has diameter at least $\\lfloor \\sqrt{5n/3}\\rfloor-1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01934","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":"1604.01934","created_at":"2026-05-18T00:34:39.432009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01934v1","created_at":"2026-05-18T00:34:39.432009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01934","created_at":"2026-05-18T00:34:39.432009+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSS5Z4ZJ5FUY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSS5Z4ZJ5FUYYWXG","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSS5Z4ZJ","created_at":"2026-05-18T12:30:36.002864+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/OSS5Z4ZJ5FUYYWXGT23OODPDUW","json":"https://pith.science/pith/OSS5Z4ZJ5FUYYWXGT23OODPDUW.json","graph_json":"https://pith.science/api/pith-number/OSS5Z4ZJ5FUYYWXGT23OODPDUW/graph.json","events_json":"https://pith.science/api/pith-number/OSS5Z4ZJ5FUYYWXGT23OODPDUW/events.json","paper":"https://pith.science/paper/OSS5Z4ZJ"},"agent_actions":{"view_html":"https://pith.science/pith/OSS5Z4ZJ5FUYYWXGT23OODPDUW","download_json":"https://pith.science/pith/OSS5Z4ZJ5FUYYWXGT23OODPDUW.json","view_paper":"https://pith.science/paper/OSS5Z4ZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01934&json=true","fetch_graph":"https://pith.science/api/pith-number/OSS5Z4ZJ5FUYYWXGT23OODPDUW/graph.json","fetch_events":"https://pith.science/api/pith-number/OSS5Z4ZJ5FUYYWXGT23OODPDUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSS5Z4ZJ5FUYYWXGT23OODPDUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSS5Z4ZJ5FUYYWXGT23OODPDUW/action/storage_attestation","attest_author":"https://pith.science/pith/OSS5Z4ZJ5FUYYWXGT23OODPDUW/action/author_attestation","sign_citation":"https://pith.science/pith/OSS5Z4ZJ5FUYYWXGT23OODPDUW/action/citation_signature","submit_replication":"https://pith.science/pith/OSS5Z4ZJ5FUYYWXGT23OODPDUW/action/replication_record"}},"created_at":"2026-05-18T00:34:39.432009+00:00","updated_at":"2026-05-18T00:34:39.432009+00:00"}