{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RFXAEIIHQKOJ66FWPKKASE35N3","short_pith_number":"pith:RFXAEIIH","canonical_record":{"source":{"id":"1709.00864","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-04T08:52:07Z","cross_cats_sorted":[],"title_canon_sha256":"29d222ec37d11748389f2d9da25b174342c59e987c3f115e895a61f773a61063","abstract_canon_sha256":"d181503f3e4a5f0681d5b5fe3f6ccb6730054b0d28dd8805fccf79abc3de8028"},"schema_version":"1.0"},"canonical_sha256":"896e022107829c9f78b67a9409137d6ee150d4630260c404357e5d0b349e280d","source":{"kind":"arxiv","id":"1709.00864","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00864","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00864v2","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00864","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"RFXAEIIHQKOJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFXAEIIHQKOJ66FW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFXAEIIH","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RFXAEIIHQKOJ66FWPKKASE35N3","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00864","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-04T08:52:07Z","cross_cats_sorted":[],"title_canon_sha256":"29d222ec37d11748389f2d9da25b174342c59e987c3f115e895a61f773a61063","abstract_canon_sha256":"d181503f3e4a5f0681d5b5fe3f6ccb6730054b0d28dd8805fccf79abc3de8028"},"schema_version":"1.0"},"canonical_sha256":"896e022107829c9f78b67a9409137d6ee150d4630260c404357e5d0b349e280d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:57.057703Z","signature_b64":"T6wvuvZgzk0DdgNU1Ig9Lt42JEAAGIDItPVFdp9Tg5iPw/kPEfiOYwyBB9FBPh0uN79WfcDMO46GQeCEjse3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"896e022107829c9f78b67a9409137d6ee150d4630260c404357e5d0b349e280d","last_reissued_at":"2026-05-18T00:27:57.056911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:57.056911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00864","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-05-18T00:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIqMsgCfOe9LKp0Eoj1xWVI1tCgjiOK/m3TcZ12xWsn0Qpz8p/AJ8rbCwdN3fCgroBbDXpKeD90FNX5vAsKhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:07:50.530110Z"},"content_sha256":"0e2fd15e700f4adc44ad3a376721650458b9ef6095b0981d75493a9e96d038e1","schema_version":"1.0","event_id":"sha256:0e2fd15e700f4adc44ad3a376721650458b9ef6095b0981d75493a9e96d038e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RFXAEIIHQKOJ66FWPKKASE35N3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The evolution of random graphs on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chris Dowden, Mihyun Kang, Philipp Spr\\\"ussel","submitted_at":"2017-09-04T08:52:07Z","abstract_excerpt":"For integers $g,m \\geq 0$ and $n>0$, let $S_{g}(n,m)$ denote the graph taken uniformly at random from the set of all graphs on $\\{1,2, \\ldots, n\\}$ with exactly $m=m(n)$ edges and with genus at most $g$. We use counting arguments to investigate the components, subgraphs, maximum degree, and largest face size of $S_{g}(n,m)$, finding that there is often different asymptotic behaviour depending on the ratio $\\frac{m}{n}$.\n  In our main results, we show that the probability that $S_{g}(n,m)$ contains any given non-planar component converges to $0$ as $n \\to \\infty$ for all $m(n)$; the probability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00864","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"},"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:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UPQ3fR7OaHpQNwSWUoiOgDOBux6bFmx0B6clMKQCuB7eafQ2REcPxV82z9yO8MipqsD91RU3xbu4nmFYOcm6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:07:50.530819Z"},"content_sha256":"b657edd7e3fc05efdc7136ec806d480da87348303edca9d3e6127bda94f7507c","schema_version":"1.0","event_id":"sha256:b657edd7e3fc05efdc7136ec806d480da87348303edca9d3e6127bda94f7507c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFXAEIIHQKOJ66FWPKKASE35N3/bundle.json","state_url":"https://pith.science/pith/RFXAEIIHQKOJ66FWPKKASE35N3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFXAEIIHQKOJ66FWPKKASE35N3/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-05-23T15:07:50Z","links":{"resolver":"https://pith.science/pith/RFXAEIIHQKOJ66FWPKKASE35N3","bundle":"https://pith.science/pith/RFXAEIIHQKOJ66FWPKKASE35N3/bundle.json","state":"https://pith.science/pith/RFXAEIIHQKOJ66FWPKKASE35N3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFXAEIIHQKOJ66FWPKKASE35N3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RFXAEIIHQKOJ66FWPKKASE35N3","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":"d181503f3e4a5f0681d5b5fe3f6ccb6730054b0d28dd8805fccf79abc3de8028","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-04T08:52:07Z","title_canon_sha256":"29d222ec37d11748389f2d9da25b174342c59e987c3f115e895a61f773a61063"},"schema_version":"1.0","source":{"id":"1709.00864","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00864","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00864v2","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00864","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"RFXAEIIHQKOJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFXAEIIHQKOJ66FW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFXAEIIH","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b657edd7e3fc05efdc7136ec806d480da87348303edca9d3e6127bda94f7507c","target":"graph","created_at":"2026-05-18T00:27:57Z","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":"For integers $g,m \\geq 0$ and $n>0$, let $S_{g}(n,m)$ denote the graph taken uniformly at random from the set of all graphs on $\\{1,2, \\ldots, n\\}$ with exactly $m=m(n)$ edges and with genus at most $g$. We use counting arguments to investigate the components, subgraphs, maximum degree, and largest face size of $S_{g}(n,m)$, finding that there is often different asymptotic behaviour depending on the ratio $\\frac{m}{n}$.\n  In our main results, we show that the probability that $S_{g}(n,m)$ contains any given non-planar component converges to $0$ as $n \\to \\infty$ for all $m(n)$; the probability","authors_text":"Chris Dowden, Mihyun Kang, Philipp Spr\\\"ussel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-04T08:52:07Z","title":"The evolution of random graphs on surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00864","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:0e2fd15e700f4adc44ad3a376721650458b9ef6095b0981d75493a9e96d038e1","target":"record","created_at":"2026-05-18T00:27:57Z","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":"d181503f3e4a5f0681d5b5fe3f6ccb6730054b0d28dd8805fccf79abc3de8028","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-04T08:52:07Z","title_canon_sha256":"29d222ec37d11748389f2d9da25b174342c59e987c3f115e895a61f773a61063"},"schema_version":"1.0","source":{"id":"1709.00864","kind":"arxiv","version":2}},"canonical_sha256":"896e022107829c9f78b67a9409137d6ee150d4630260c404357e5d0b349e280d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"896e022107829c9f78b67a9409137d6ee150d4630260c404357e5d0b349e280d","first_computed_at":"2026-05-18T00:27:57.056911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:57.056911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T6wvuvZgzk0DdgNU1Ig9Lt42JEAAGIDItPVFdp9Tg5iPw/kPEfiOYwyBB9FBPh0uN79WfcDMO46GQeCEjse3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:57.057703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00864","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e2fd15e700f4adc44ad3a376721650458b9ef6095b0981d75493a9e96d038e1","sha256:b657edd7e3fc05efdc7136ec806d480da87348303edca9d3e6127bda94f7507c"],"state_sha256":"d93bf0755d11bca7de7da10f4c3059898f7383a372b5277f2e6cabc735708e3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zRi5Tp1NPkgEUPiWmpAwtW2FyU7KzpQ8+V8RsGhgyiaEQ42Qf+qDPH9MYlFULjO0Wdgc0hRakiLYSzRhUDSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T15:07:50.535453Z","bundle_sha256":"212deedb0531c8bb354616a78fa24a716c3a481ae2dcfc5008037f6fc0c49efc"}}