{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E3BQFWG54IZULDG74PONX7WBSF","short_pith_number":"pith:E3BQFWG5","schema_version":"1.0","canonical_sha256":"26c302d8dde233458cdfe3dcdbfec191791741e879221f53d68730eb7ed64e5f","source":{"kind":"arxiv","id":"1608.02510","version":1},"attestation_state":"computed","paper":{"title":"On enumeration of tree-rooted planar cubic maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yury Kochetkov","submitted_at":"2016-08-08T16:07:03Z","abstract_excerpt":"We consider planar cubic maps, i.e. connected cubic graphs imbedded into plane, with marked spanning tree and marked directed edge (not in this tree). The number of such objects with $2n$ vertices is $C_{2n}\\cdot C_{n+1}$, where $C_k$ is $k$-th Catalan number."},"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":"1608.02510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-08T16:07:03Z","cross_cats_sorted":[],"title_canon_sha256":"3f76e1a3b1d9ce54fcc53659c6dfd585f5e598e1f5d476bca6de1c6c4545987d","abstract_canon_sha256":"348802acf3bf36c3ac87abb6bdc35526369822daaea25621ecd4a87a97bbeaf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:39.769186Z","signature_b64":"HD1zzOxyroljkpTHKeHokYFtumJ/3MHKHgxDXc/5obTW9axxjldiwG3GUpTSCog3G1MRU69pxebp0yWSQoLZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26c302d8dde233458cdfe3dcdbfec191791741e879221f53d68730eb7ed64e5f","last_reissued_at":"2026-05-18T01:09:39.768791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:39.768791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On enumeration of tree-rooted planar cubic maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yury Kochetkov","submitted_at":"2016-08-08T16:07:03Z","abstract_excerpt":"We consider planar cubic maps, i.e. connected cubic graphs imbedded into plane, with marked spanning tree and marked directed edge (not in this tree). The number of such objects with $2n$ vertices is $C_{2n}\\cdot C_{n+1}$, where $C_k$ is $k$-th Catalan number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02510","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":"1608.02510","created_at":"2026-05-18T01:09:39.768848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02510v1","created_at":"2026-05-18T01:09:39.768848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02510","created_at":"2026-05-18T01:09:39.768848+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3BQFWG54IZU","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3BQFWG54IZULDG7","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3BQFWG5","created_at":"2026-05-18T12:30:12.583610+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/E3BQFWG54IZULDG74PONX7WBSF","json":"https://pith.science/pith/E3BQFWG54IZULDG74PONX7WBSF.json","graph_json":"https://pith.science/api/pith-number/E3BQFWG54IZULDG74PONX7WBSF/graph.json","events_json":"https://pith.science/api/pith-number/E3BQFWG54IZULDG74PONX7WBSF/events.json","paper":"https://pith.science/paper/E3BQFWG5"},"agent_actions":{"view_html":"https://pith.science/pith/E3BQFWG54IZULDG74PONX7WBSF","download_json":"https://pith.science/pith/E3BQFWG54IZULDG74PONX7WBSF.json","view_paper":"https://pith.science/paper/E3BQFWG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02510&json=true","fetch_graph":"https://pith.science/api/pith-number/E3BQFWG54IZULDG74PONX7WBSF/graph.json","fetch_events":"https://pith.science/api/pith-number/E3BQFWG54IZULDG74PONX7WBSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3BQFWG54IZULDG74PONX7WBSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3BQFWG54IZULDG74PONX7WBSF/action/storage_attestation","attest_author":"https://pith.science/pith/E3BQFWG54IZULDG74PONX7WBSF/action/author_attestation","sign_citation":"https://pith.science/pith/E3BQFWG54IZULDG74PONX7WBSF/action/citation_signature","submit_replication":"https://pith.science/pith/E3BQFWG54IZULDG74PONX7WBSF/action/replication_record"}},"created_at":"2026-05-18T01:09:39.768848+00:00","updated_at":"2026-05-18T01:09:39.768848+00:00"}