{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FVI2J7KICYXSMTSYWZELNXIG7L","short_pith_number":"pith:FVI2J7KI","schema_version":"1.0","canonical_sha256":"2d51a4fd48162f264e58b648b6dd06fafe4ef5fe4bde4f4d03bb202275cfcf29","source":{"kind":"arxiv","id":"1509.05807","version":1},"attestation_state":"computed","paper":{"title":"Gray coding planar maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Sergey Avgustinovich, Sergey Kitaev, Vincent Vajnovszki, Vladimir N. Potapov","submitted_at":"2015-09-18T21:50:18Z","abstract_excerpt":"The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize beta-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps."},"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":"1509.05807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-18T21:50:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7a9dd7e462724bf082b15427db5482f14bfe292ab5f9fd6f33bf3e14b6d617d1","abstract_canon_sha256":"72f7d50ef2cda408906765ebec760846533700198d27683d10f757cc82e76d9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.277041Z","signature_b64":"bAFdbR69qn2p51i2Q6L0ZR7U4f6GNxytO5dgm6uQKFoHtQbAxoVZaDYXYr0/vKwx+t68bogs25/ZTB73FwsfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d51a4fd48162f264e58b648b6dd06fafe4ef5fe4bde4f4d03bb202275cfcf29","last_reissued_at":"2026-05-18T01:32:42.276553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.276553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gray coding planar maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Sergey Avgustinovich, Sergey Kitaev, Vincent Vajnovszki, Vladimir N. Potapov","submitted_at":"2015-09-18T21:50:18Z","abstract_excerpt":"The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize beta-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05807","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":"1509.05807","created_at":"2026-05-18T01:32:42.276622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05807v1","created_at":"2026-05-18T01:32:42.276622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05807","created_at":"2026-05-18T01:32:42.276622+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVI2J7KICYXS","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVI2J7KICYXSMTSY","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVI2J7KI","created_at":"2026-05-18T12:29:22.688609+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/FVI2J7KICYXSMTSYWZELNXIG7L","json":"https://pith.science/pith/FVI2J7KICYXSMTSYWZELNXIG7L.json","graph_json":"https://pith.science/api/pith-number/FVI2J7KICYXSMTSYWZELNXIG7L/graph.json","events_json":"https://pith.science/api/pith-number/FVI2J7KICYXSMTSYWZELNXIG7L/events.json","paper":"https://pith.science/paper/FVI2J7KI"},"agent_actions":{"view_html":"https://pith.science/pith/FVI2J7KICYXSMTSYWZELNXIG7L","download_json":"https://pith.science/pith/FVI2J7KICYXSMTSYWZELNXIG7L.json","view_paper":"https://pith.science/paper/FVI2J7KI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05807&json=true","fetch_graph":"https://pith.science/api/pith-number/FVI2J7KICYXSMTSYWZELNXIG7L/graph.json","fetch_events":"https://pith.science/api/pith-number/FVI2J7KICYXSMTSYWZELNXIG7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVI2J7KICYXSMTSYWZELNXIG7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVI2J7KICYXSMTSYWZELNXIG7L/action/storage_attestation","attest_author":"https://pith.science/pith/FVI2J7KICYXSMTSYWZELNXIG7L/action/author_attestation","sign_citation":"https://pith.science/pith/FVI2J7KICYXSMTSYWZELNXIG7L/action/citation_signature","submit_replication":"https://pith.science/pith/FVI2J7KICYXSMTSYWZELNXIG7L/action/replication_record"}},"created_at":"2026-05-18T01:32:42.276622+00:00","updated_at":"2026-05-18T01:32:42.276622+00:00"}