{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O6RJ7M7EYUEOMENLFQ3THF3KKH","short_pith_number":"pith:O6RJ7M7E","schema_version":"1.0","canonical_sha256":"77a29fb3e4c508e611ab2c3733976a51e7b7f866931253321aca29dbb21588aa","source":{"kind":"arxiv","id":"1611.05298","version":1},"attestation_state":"computed","paper":{"title":"Finite sets of operations sufficient to construct any fullerene from $C_{20}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nikolay Erokhovets, Victor M. Buchstaber","submitted_at":"2016-11-16T14:52:27Z","abstract_excerpt":"We study the well-known problem of combinatorial classification of fullerenes. By a (mathematical) fullerene we mean a convex simple three dimensional polytope with all facets pentagons and hexagons. We analyse approaches of construction of arbitrary fullerene from the dodecahedron (a fullerene $C_{20}$). A growth operation is a combinatorial operation that substitutes the patch with more facets and the same boundary for the patch on the surface of a simple polytope to produce a new simple polytope. It is known that an infinite set of different growth operations transforming fullerenes into fu"},"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":"1611.05298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-16T14:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"aa9b01f32740bca87beff3fbc8251f0fa66362110a254104638264fe9e610fc9","abstract_canon_sha256":"1fad32ead20df14a2c0c2b301d5968e903b49c0ccbd8b49e1bbf9ee43be3dc68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:27.402477Z","signature_b64":"FsiKEMiuKPG3Bjvn/V9YjAiP6z89mQNCAjzum9AbUiY5SC/rGHPrH1/Miux8SLMiiwjLU4MkmvU+McKEeeG6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77a29fb3e4c508e611ab2c3733976a51e7b7f866931253321aca29dbb21588aa","last_reissued_at":"2026-05-18T00:58:27.401821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:27.401821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite sets of operations sufficient to construct any fullerene from $C_{20}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nikolay Erokhovets, Victor M. Buchstaber","submitted_at":"2016-11-16T14:52:27Z","abstract_excerpt":"We study the well-known problem of combinatorial classification of fullerenes. By a (mathematical) fullerene we mean a convex simple three dimensional polytope with all facets pentagons and hexagons. We analyse approaches of construction of arbitrary fullerene from the dodecahedron (a fullerene $C_{20}$). A growth operation is a combinatorial operation that substitutes the patch with more facets and the same boundary for the patch on the surface of a simple polytope to produce a new simple polytope. It is known that an infinite set of different growth operations transforming fullerenes into fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05298","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":"1611.05298","created_at":"2026-05-18T00:58:27.401915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05298v1","created_at":"2026-05-18T00:58:27.401915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05298","created_at":"2026-05-18T00:58:27.401915+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6RJ7M7EYUEO","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6RJ7M7EYUEOMENL","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6RJ7M7E","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/O6RJ7M7EYUEOMENLFQ3THF3KKH","json":"https://pith.science/pith/O6RJ7M7EYUEOMENLFQ3THF3KKH.json","graph_json":"https://pith.science/api/pith-number/O6RJ7M7EYUEOMENLFQ3THF3KKH/graph.json","events_json":"https://pith.science/api/pith-number/O6RJ7M7EYUEOMENLFQ3THF3KKH/events.json","paper":"https://pith.science/paper/O6RJ7M7E"},"agent_actions":{"view_html":"https://pith.science/pith/O6RJ7M7EYUEOMENLFQ3THF3KKH","download_json":"https://pith.science/pith/O6RJ7M7EYUEOMENLFQ3THF3KKH.json","view_paper":"https://pith.science/paper/O6RJ7M7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05298&json=true","fetch_graph":"https://pith.science/api/pith-number/O6RJ7M7EYUEOMENLFQ3THF3KKH/graph.json","fetch_events":"https://pith.science/api/pith-number/O6RJ7M7EYUEOMENLFQ3THF3KKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6RJ7M7EYUEOMENLFQ3THF3KKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6RJ7M7EYUEOMENLFQ3THF3KKH/action/storage_attestation","attest_author":"https://pith.science/pith/O6RJ7M7EYUEOMENLFQ3THF3KKH/action/author_attestation","sign_citation":"https://pith.science/pith/O6RJ7M7EYUEOMENLFQ3THF3KKH/action/citation_signature","submit_replication":"https://pith.science/pith/O6RJ7M7EYUEOMENLFQ3THF3KKH/action/replication_record"}},"created_at":"2026-05-18T00:58:27.401915+00:00","updated_at":"2026-05-18T00:58:27.401915+00:00"}