{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PNFC67IGH4KDXM565PKYCFHOXY","short_pith_number":"pith:PNFC67IG","schema_version":"1.0","canonical_sha256":"7b4a2f7d063f143bb3beebd58114eebe0f0df3c142ad94dbb63096186525cd26","source":{"kind":"arxiv","id":"1710.05156","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic enumeration of perfect matchings in $m$-barrel fullerene graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Afshin Behmaram, C\\'edric Boutillier","submitted_at":"2017-10-14T09:35:02Z","abstract_excerpt":"A connected planar cubic graph is called an $m$-barrel fullerene and denoted by $F(m,k)$, if it has the following structure: The first circle is an $m$-gon. Then $m$-gon is bounded by $m$ pentagons. After that we have additional k layers of hexagons. At the last circle $m$-pentagons connected to the second $m$-gon. In this paper we asymptotically count by two different methods the number of perfect matchings in $m$-barrel fullerene graphs, as the number of hexagonal layers is large, and show that the results are equal."},"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":"1710.05156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-14T09:35:02Z","cross_cats_sorted":[],"title_canon_sha256":"8fccd6bb0c9d5793fbf6a24ff62ed1fdbdffbd853b573b77d03303cf8dc6d8d7","abstract_canon_sha256":"461ca3bcec57c4a5de7608cf41b4b403299f481e16b4028863f85ea317a62039"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:54.181656Z","signature_b64":"buKHHe2y0alUWYVDGC/YHUKU7vk5fbkn/DgYjnKczHfgn5HsNH298YsnFa4SEjM+mASlEIcnhAh3aiL2ZGg6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b4a2f7d063f143bb3beebd58114eebe0f0df3c142ad94dbb63096186525cd26","last_reissued_at":"2026-05-18T00:32:54.180933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:54.180933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic enumeration of perfect matchings in $m$-barrel fullerene graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Afshin Behmaram, C\\'edric Boutillier","submitted_at":"2017-10-14T09:35:02Z","abstract_excerpt":"A connected planar cubic graph is called an $m$-barrel fullerene and denoted by $F(m,k)$, if it has the following structure: The first circle is an $m$-gon. Then $m$-gon is bounded by $m$ pentagons. After that we have additional k layers of hexagons. At the last circle $m$-pentagons connected to the second $m$-gon. In this paper we asymptotically count by two different methods the number of perfect matchings in $m$-barrel fullerene graphs, as the number of hexagonal layers is large, and show that the results are equal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05156","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":"1710.05156","created_at":"2026-05-18T00:32:54.181039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05156v1","created_at":"2026-05-18T00:32:54.181039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05156","created_at":"2026-05-18T00:32:54.181039+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNFC67IGH4KD","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNFC67IGH4KDXM56","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNFC67IG","created_at":"2026-05-18T12:31:37.085036+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/PNFC67IGH4KDXM565PKYCFHOXY","json":"https://pith.science/pith/PNFC67IGH4KDXM565PKYCFHOXY.json","graph_json":"https://pith.science/api/pith-number/PNFC67IGH4KDXM565PKYCFHOXY/graph.json","events_json":"https://pith.science/api/pith-number/PNFC67IGH4KDXM565PKYCFHOXY/events.json","paper":"https://pith.science/paper/PNFC67IG"},"agent_actions":{"view_html":"https://pith.science/pith/PNFC67IGH4KDXM565PKYCFHOXY","download_json":"https://pith.science/pith/PNFC67IGH4KDXM565PKYCFHOXY.json","view_paper":"https://pith.science/paper/PNFC67IG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05156&json=true","fetch_graph":"https://pith.science/api/pith-number/PNFC67IGH4KDXM565PKYCFHOXY/graph.json","fetch_events":"https://pith.science/api/pith-number/PNFC67IGH4KDXM565PKYCFHOXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNFC67IGH4KDXM565PKYCFHOXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNFC67IGH4KDXM565PKYCFHOXY/action/storage_attestation","attest_author":"https://pith.science/pith/PNFC67IGH4KDXM565PKYCFHOXY/action/author_attestation","sign_citation":"https://pith.science/pith/PNFC67IGH4KDXM565PKYCFHOXY/action/citation_signature","submit_replication":"https://pith.science/pith/PNFC67IGH4KDXM565PKYCFHOXY/action/replication_record"}},"created_at":"2026-05-18T00:32:54.181039+00:00","updated_at":"2026-05-18T00:32:54.181039+00:00"}