{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AIMXYLTFG3GGO426T5Q63D75FC","short_pith_number":"pith:AIMXYLTF","canonical_record":{"source":{"id":"1708.02092","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T12:34:51Z","cross_cats_sorted":[],"title_canon_sha256":"f28ad62bcf3e7eb4c1b6b2778f93135c8a415b14362cbbc3bf7166d1c536234c","abstract_canon_sha256":"f11d40c28f9f939748d7d04b9b8b925bdce1b3895f6c12149de891f74cff4398"},"schema_version":"1.0"},"canonical_sha256":"02197c2e6536cc67735e9f61ed8ffd28bc849d6ff193cb5997a1624ddb4e436a","source":{"kind":"arxiv","id":"1708.02092","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02092","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02092v3","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02092","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"pith_short_12","alias_value":"AIMXYLTFG3GG","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIMXYLTFG3GGO426","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIMXYLTF","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AIMXYLTFG3GGO426T5Q63D75FC","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02092","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T12:34:51Z","cross_cats_sorted":[],"title_canon_sha256":"f28ad62bcf3e7eb4c1b6b2778f93135c8a415b14362cbbc3bf7166d1c536234c","abstract_canon_sha256":"f11d40c28f9f939748d7d04b9b8b925bdce1b3895f6c12149de891f74cff4398"},"schema_version":"1.0"},"canonical_sha256":"02197c2e6536cc67735e9f61ed8ffd28bc849d6ff193cb5997a1624ddb4e436a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:51.181753Z","signature_b64":"GT5yaULb5FlVmqF7I6AGkgy8b5MHi3rUUM0lcdYCHHLW2lUNVRfMOD+62noR/XPA3ze6zdnbAj46jMhYbjWgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02197c2e6536cc67735e9f61ed8ffd28bc849d6ff193cb5997a1624ddb4e436a","last_reissued_at":"2026-05-18T00:06:51.181142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:51.181142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02092","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMgjThHKyxMygV3gm3+QmBLcECelLbdcqKXwzUmco6QvSanvGM9DYDNO8UEwnOnv8sooXljA4PoQnJdhpH6sCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:59:19.937404Z"},"content_sha256":"277cfbe82080f5a5351e82662ab541cffc37c30f076a77b0de4ba21901dc28f3","schema_version":"1.0","event_id":"sha256:277cfbe82080f5a5351e82662ab541cffc37c30f076a77b0de4ba21901dc28f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AIMXYLTFG3GGO426T5Q63D75FC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Face distributions of embeddings of complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Timothy Sun","submitted_at":"2017-08-07T12:34:51Z","abstract_excerpt":"A longstanding open question of Archdeacon and Craft asks whether every complete graph has a minimum genus embedding with at most one nontriangular face. We exhibit such an embedding for each complete graph except $K_8$, the complete graph on 8 vertices, and we go on to prove that no such embedding can exist for this graph. Our approach also solves a more general problem, giving a complete characterization of the possible face distributions (i.e. the numbers of faces of each length) realizable by minimum genus embeddings of each complete graph. We also tackle analogous questions for nonorienta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02092","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CnIUTNGiDcOroBQF7RQLXWve6ahPq/o2rF2WVRmnhgVH3buo1oUN7Xr92JBpeXPaUASQ1JBIntuFt26TdjM9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:59:19.937760Z"},"content_sha256":"2c7cccd622c4ec2e61f2ff8543f1cda7faebb760a5b246809dbad32aade6892b","schema_version":"1.0","event_id":"sha256:2c7cccd622c4ec2e61f2ff8543f1cda7faebb760a5b246809dbad32aade6892b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIMXYLTFG3GGO426T5Q63D75FC/bundle.json","state_url":"https://pith.science/pith/AIMXYLTFG3GGO426T5Q63D75FC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIMXYLTFG3GGO426T5Q63D75FC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T07:59:19Z","links":{"resolver":"https://pith.science/pith/AIMXYLTFG3GGO426T5Q63D75FC","bundle":"https://pith.science/pith/AIMXYLTFG3GGO426T5Q63D75FC/bundle.json","state":"https://pith.science/pith/AIMXYLTFG3GGO426T5Q63D75FC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIMXYLTFG3GGO426T5Q63D75FC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AIMXYLTFG3GGO426T5Q63D75FC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f11d40c28f9f939748d7d04b9b8b925bdce1b3895f6c12149de891f74cff4398","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T12:34:51Z","title_canon_sha256":"f28ad62bcf3e7eb4c1b6b2778f93135c8a415b14362cbbc3bf7166d1c536234c"},"schema_version":"1.0","source":{"id":"1708.02092","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02092","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02092v3","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02092","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"pith_short_12","alias_value":"AIMXYLTFG3GG","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIMXYLTFG3GGO426","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIMXYLTF","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:2c7cccd622c4ec2e61f2ff8543f1cda7faebb760a5b246809dbad32aade6892b","target":"graph","created_at":"2026-05-18T00:06:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A longstanding open question of Archdeacon and Craft asks whether every complete graph has a minimum genus embedding with at most one nontriangular face. We exhibit such an embedding for each complete graph except $K_8$, the complete graph on 8 vertices, and we go on to prove that no such embedding can exist for this graph. Our approach also solves a more general problem, giving a complete characterization of the possible face distributions (i.e. the numbers of faces of each length) realizable by minimum genus embeddings of each complete graph. We also tackle analogous questions for nonorienta","authors_text":"Timothy Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T12:34:51Z","title":"Face distributions of embeddings of complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02092","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:277cfbe82080f5a5351e82662ab541cffc37c30f076a77b0de4ba21901dc28f3","target":"record","created_at":"2026-05-18T00:06:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f11d40c28f9f939748d7d04b9b8b925bdce1b3895f6c12149de891f74cff4398","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-07T12:34:51Z","title_canon_sha256":"f28ad62bcf3e7eb4c1b6b2778f93135c8a415b14362cbbc3bf7166d1c536234c"},"schema_version":"1.0","source":{"id":"1708.02092","kind":"arxiv","version":3}},"canonical_sha256":"02197c2e6536cc67735e9f61ed8ffd28bc849d6ff193cb5997a1624ddb4e436a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02197c2e6536cc67735e9f61ed8ffd28bc849d6ff193cb5997a1624ddb4e436a","first_computed_at":"2026-05-18T00:06:51.181142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:51.181142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GT5yaULb5FlVmqF7I6AGkgy8b5MHi3rUUM0lcdYCHHLW2lUNVRfMOD+62noR/XPA3ze6zdnbAj46jMhYbjWgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:51.181753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02092","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:277cfbe82080f5a5351e82662ab541cffc37c30f076a77b0de4ba21901dc28f3","sha256:2c7cccd622c4ec2e61f2ff8543f1cda7faebb760a5b246809dbad32aade6892b"],"state_sha256":"b8bd0959d5be56b76bfbadbb27125ee64068dcc3cbf6e355c293bce8f8897d08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCz9eqnwJ3U7yijvtzGo3eCHdUegge0AbwV1ngezuz6sJqJyq5zRNV9uOT+EUu6+shyLa3NrPiegKR/wcgaUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:59:19.940715Z","bundle_sha256":"2f56dc8a70d2d533f80216c98bc11ad25571eb770ac5db028c4e3b427a2655b9"}}