{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IG2NU566E7MYDNHL52YVXKIDIL","short_pith_number":"pith:IG2NU566","canonical_record":{"source":{"id":"2202.07746","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T21:57:10Z","cross_cats_sorted":[],"title_canon_sha256":"cd3dbfbf5bc33b0298c204181e538b6250078c1f4db387caa3b528b877e59e45","abstract_canon_sha256":"1dfd9bab9d78ada88911b7b4b217d99666a560e50042b6145c703c2a0aa2b45d"},"schema_version":"1.0"},"canonical_sha256":"41b4da77de27d981b4ebeeb15ba90342d57634db90fd47cc5efaa38f425904a7","source":{"kind":"arxiv","id":"2202.07746","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.07746","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"2202.07746v2","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.07746","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"IG2NU566E7MY","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"pith_short_16","alias_value":"IG2NU566E7MYDNHL","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"pith_short_8","alias_value":"IG2NU566","created_at":"2026-07-05T05:56:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IG2NU566E7MYDNHL52YVXKIDIL","target":"record","payload":{"canonical_record":{"source":{"id":"2202.07746","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T21:57:10Z","cross_cats_sorted":[],"title_canon_sha256":"cd3dbfbf5bc33b0298c204181e538b6250078c1f4db387caa3b528b877e59e45","abstract_canon_sha256":"1dfd9bab9d78ada88911b7b4b217d99666a560e50042b6145c703c2a0aa2b45d"},"schema_version":"1.0"},"canonical_sha256":"41b4da77de27d981b4ebeeb15ba90342d57634db90fd47cc5efaa38f425904a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:37.876939Z","signature_b64":"Ya0Cf1TzPJ+a5h93tgUwkxnDmge/jiOXXF4X8xxFATaOA2O+EOkOCL1A8xXfLNzT3C8mIZmAJlsNuzdYy1BjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41b4da77de27d981b4ebeeb15ba90342d57634db90fd47cc5efaa38f425904a7","last_reissued_at":"2026-07-05T05:56:37.876480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:37.876480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.07746","source_version":2,"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-07-05T05:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AD2PCmeGGjyHhDtIWgnfTsAWNmVx5p+HZ7yDPWN3LdF8T/pEC+41nVDyS3pFCiBWH3K2tXqxa5OfxZujPgPfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:25:33.953302Z"},"content_sha256":"9a990646004dd5700e2bc14fdeb4675260aa604cee330370a5668ca87f017a0d","schema_version":"1.0","event_id":"sha256:9a990646004dd5700e2bc14fdeb4675260aa604cee330370a5668ca87f017a0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IG2NU566E7MYDNHL52YVXKIDIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expected number of faces in a random embedding of any graph is at most linear","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Jesse Campion Loth","submitted_at":"2022-02-15T21:57:10Z","abstract_excerpt":"A random 2-cell embedding of a given graph $G$ is obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces of such an embedding, which is equivalent to studying its average genus. In 1991, Stahl proved that the expected number of faces in a random embedding of an arbitrary graph of order $n$ is at most $n\\log(n)$. While there are many families of graphs whose expected number of faces is $\\Theta(n)$, none are known where the expected number would be super-linear. This lead to the conjecture that there is a linear upper bound. In this note we conf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.07746","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.07746/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PUquaTTNOfis5UU8eaN7h86wuHcIm7eeZzARxBoprgAm5GT459XxdNa10zZLh0Uu+PjSiNs4HxGF/b1CvA/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:25:33.953686Z"},"content_sha256":"90d056886eb009b7afce3b79ebe91a03f4d82ad23127d34aafd6ced5942671fd","schema_version":"1.0","event_id":"sha256:90d056886eb009b7afce3b79ebe91a03f4d82ad23127d34aafd6ced5942671fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IG2NU566E7MYDNHL52YVXKIDIL/bundle.json","state_url":"https://pith.science/pith/IG2NU566E7MYDNHL52YVXKIDIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IG2NU566E7MYDNHL52YVXKIDIL/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-07-07T15:25:33Z","links":{"resolver":"https://pith.science/pith/IG2NU566E7MYDNHL52YVXKIDIL","bundle":"https://pith.science/pith/IG2NU566E7MYDNHL52YVXKIDIL/bundle.json","state":"https://pith.science/pith/IG2NU566E7MYDNHL52YVXKIDIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IG2NU566E7MYDNHL52YVXKIDIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IG2NU566E7MYDNHL52YVXKIDIL","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":"1dfd9bab9d78ada88911b7b4b217d99666a560e50042b6145c703c2a0aa2b45d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T21:57:10Z","title_canon_sha256":"cd3dbfbf5bc33b0298c204181e538b6250078c1f4db387caa3b528b877e59e45"},"schema_version":"1.0","source":{"id":"2202.07746","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.07746","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"2202.07746v2","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.07746","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"IG2NU566E7MY","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"pith_short_16","alias_value":"IG2NU566E7MYDNHL","created_at":"2026-07-05T05:56:37Z"},{"alias_kind":"pith_short_8","alias_value":"IG2NU566","created_at":"2026-07-05T05:56:37Z"}],"graph_snapshots":[{"event_id":"sha256:90d056886eb009b7afce3b79ebe91a03f4d82ad23127d34aafd6ced5942671fd","target":"graph","created_at":"2026-07-05T05:56:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.07746/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A random 2-cell embedding of a given graph $G$ is obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces of such an embedding, which is equivalent to studying its average genus. In 1991, Stahl proved that the expected number of faces in a random embedding of an arbitrary graph of order $n$ is at most $n\\log(n)$. While there are many families of graphs whose expected number of faces is $\\Theta(n)$, none are known where the expected number would be super-linear. This lead to the conjecture that there is a linear upper bound. In this note we conf","authors_text":"Bojan Mohar, Jesse Campion Loth","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T21:57:10Z","title":"Expected number of faces in a random embedding of any graph is at most linear"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.07746","kind":"arxiv","version":2},"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:9a990646004dd5700e2bc14fdeb4675260aa604cee330370a5668ca87f017a0d","target":"record","created_at":"2026-07-05T05:56:37Z","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":"1dfd9bab9d78ada88911b7b4b217d99666a560e50042b6145c703c2a0aa2b45d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T21:57:10Z","title_canon_sha256":"cd3dbfbf5bc33b0298c204181e538b6250078c1f4db387caa3b528b877e59e45"},"schema_version":"1.0","source":{"id":"2202.07746","kind":"arxiv","version":2}},"canonical_sha256":"41b4da77de27d981b4ebeeb15ba90342d57634db90fd47cc5efaa38f425904a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41b4da77de27d981b4ebeeb15ba90342d57634db90fd47cc5efaa38f425904a7","first_computed_at":"2026-07-05T05:56:37.876480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:56:37.876480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ya0Cf1TzPJ+a5h93tgUwkxnDmge/jiOXXF4X8xxFATaOA2O+EOkOCL1A8xXfLNzT3C8mIZmAJlsNuzdYy1BjCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:56:37.876939Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.07746","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a990646004dd5700e2bc14fdeb4675260aa604cee330370a5668ca87f017a0d","sha256:90d056886eb009b7afce3b79ebe91a03f4d82ad23127d34aafd6ced5942671fd"],"state_sha256":"100f97875f4d5329d15e173afb6f8ff2849e3a21d041f40736b33bccde2ec009"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gEzdyOr3jo+C6shlVHe8X8loWk19K/4F/ZnsglXfeEcfiDLWfGsQoKBeODkWsMs++YlkUiS1tsqLXU/WAXPGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:25:33.956617Z","bundle_sha256":"fe612fcf1e374986ec6d8e5994e1dc092c3c73f03c9a42b62307ba08124585d3"}}