{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SEUVWCUFZNXKFHUE7RNX6KXOYI","short_pith_number":"pith:SEUVWCUF","schema_version":"1.0","canonical_sha256":"91295b0a85cb6ea29e84fc5b7f2aeec20627845d44915784502a0c2e97de0fa9","source":{"kind":"arxiv","id":"1602.07400","version":2},"attestation_state":"computed","paper":{"title":"3-regular colored graphs and classification of surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Biplab Basak","submitted_at":"2016-02-24T05:07:49Z","abstract_excerpt":"Motivated by the theory of crystallizations, we consider an equivalence relation on the class of $3$-regular colored graphs and prove that up to this equivalence (a) there exists a unique contracted 3-regular colored graph if the number of vertices is $4m$ and (b) there are exactly two such graphs if the number of vertices is $4m+2$ for each $m\\geq 1$. Using this, we present a simple proof of the classification of closed surfaces."},"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":"1602.07400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T05:07:49Z","cross_cats_sorted":[],"title_canon_sha256":"06da7dd7f30ae17f09b0bad314e23639f3fe64d84e9a7a18686567850d554f97","abstract_canon_sha256":"865f76f5fd786f8ef7f31dde0c862688b5f0ae3995843057d32761ee9a556991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:13.675818Z","signature_b64":"nPSokzh7FiZH3KpX4OUp4019DkozkoqZXI0PWIPUtI737OOVh7oqAXoHt+jGtlWCgXorl1JJsa+T5BCl+3pPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91295b0a85cb6ea29e84fc5b7f2aeec20627845d44915784502a0c2e97de0fa9","last_reissued_at":"2026-05-18T00:39:13.675248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:13.675248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3-regular colored graphs and classification of surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Biplab Basak","submitted_at":"2016-02-24T05:07:49Z","abstract_excerpt":"Motivated by the theory of crystallizations, we consider an equivalence relation on the class of $3$-regular colored graphs and prove that up to this equivalence (a) there exists a unique contracted 3-regular colored graph if the number of vertices is $4m$ and (b) there are exactly two such graphs if the number of vertices is $4m+2$ for each $m\\geq 1$. Using this, we present a simple proof of the classification of closed surfaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07400","kind":"arxiv","version":2},"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":"1602.07400","created_at":"2026-05-18T00:39:13.675352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07400v2","created_at":"2026-05-18T00:39:13.675352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07400","created_at":"2026-05-18T00:39:13.675352+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEUVWCUFZNXK","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEUVWCUFZNXKFHUE","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEUVWCUF","created_at":"2026-05-18T12:30:44.179134+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/SEUVWCUFZNXKFHUE7RNX6KXOYI","json":"https://pith.science/pith/SEUVWCUFZNXKFHUE7RNX6KXOYI.json","graph_json":"https://pith.science/api/pith-number/SEUVWCUFZNXKFHUE7RNX6KXOYI/graph.json","events_json":"https://pith.science/api/pith-number/SEUVWCUFZNXKFHUE7RNX6KXOYI/events.json","paper":"https://pith.science/paper/SEUVWCUF"},"agent_actions":{"view_html":"https://pith.science/pith/SEUVWCUFZNXKFHUE7RNX6KXOYI","download_json":"https://pith.science/pith/SEUVWCUFZNXKFHUE7RNX6KXOYI.json","view_paper":"https://pith.science/paper/SEUVWCUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07400&json=true","fetch_graph":"https://pith.science/api/pith-number/SEUVWCUFZNXKFHUE7RNX6KXOYI/graph.json","fetch_events":"https://pith.science/api/pith-number/SEUVWCUFZNXKFHUE7RNX6KXOYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEUVWCUFZNXKFHUE7RNX6KXOYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEUVWCUFZNXKFHUE7RNX6KXOYI/action/storage_attestation","attest_author":"https://pith.science/pith/SEUVWCUFZNXKFHUE7RNX6KXOYI/action/author_attestation","sign_citation":"https://pith.science/pith/SEUVWCUFZNXKFHUE7RNX6KXOYI/action/citation_signature","submit_replication":"https://pith.science/pith/SEUVWCUFZNXKFHUE7RNX6KXOYI/action/replication_record"}},"created_at":"2026-05-18T00:39:13.675352+00:00","updated_at":"2026-05-18T00:39:13.675352+00:00"}