{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:667ONZAFFLGEAS7ONYHUJUWPXZ","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":"e619eb728afa5941f7debfba2d8af667df2a44f5975e8f3e1b25adf0ab570986","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-03-25T14:32:28Z","title_canon_sha256":"2091a665c59586a30ad2b6fda86291b3e01d03a7a54b8245d1eceb74b82b8875"},"schema_version":"1.0","source":{"id":"2503.19705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.19705","created_at":"2026-07-05T10:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"2503.19705v1","created_at":"2026-07-05T10:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.19705","created_at":"2026-07-05T10:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"667ONZAFFLGE","created_at":"2026-07-05T10:39:00Z"},{"alias_kind":"pith_short_16","alias_value":"667ONZAFFLGEAS7O","created_at":"2026-07-05T10:39:00Z"},{"alias_kind":"pith_short_8","alias_value":"667ONZAF","created_at":"2026-07-05T10:39:00Z"}],"graph_snapshots":[{"event_id":"sha256:328d75cd3cf1d866c9b7bb2356d5f163a86d2643ded04dcf1e7a0ed024318219","target":"graph","created_at":"2026-07-05T10:39:00Z","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/2503.19705/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps with $n$ edges and show that under some integrability conditions on these weights, the maps with distances rescaled by a factor $n^{-1/2}$ converge to a constant multiple of Aldous' continuum random tree (CRT) in the Gromov--Hausdorff sense. The proof relies on a bijection between a set of trees with $n$ leaves and a set of series-parallel maps with $n$ edges, ","authors_text":"Benedikt Stufler, Daniel Amankwah, Jakob Bj\\\"ornberg, Joonas Turunen, Sigurdur \\\"Orn Stef\\'ansson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-03-25T14:32:28Z","title":"The scaling limit of random 2-connected series-parallel maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.19705","kind":"arxiv","version":1},"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:d0b896f8eba8e05a6aac8f50abab52e356bfe97fd8d3cc2a3d388fcd27f4de30","target":"record","created_at":"2026-07-05T10:39:00Z","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":"e619eb728afa5941f7debfba2d8af667df2a44f5975e8f3e1b25adf0ab570986","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-03-25T14:32:28Z","title_canon_sha256":"2091a665c59586a30ad2b6fda86291b3e01d03a7a54b8245d1eceb74b82b8875"},"schema_version":"1.0","source":{"id":"2503.19705","kind":"arxiv","version":1}},"canonical_sha256":"f7bee6e4052acc404bee6e0f44d2cfbe4db67f73a582c294db9957914f845017","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7bee6e4052acc404bee6e0f44d2cfbe4db67f73a582c294db9957914f845017","first_computed_at":"2026-07-05T10:39:00.093485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:39:00.093485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0NK3k1F0WmlxwO0m99VieGkz6ACpYYqScOmob4K3nXmZloQ9NHgck5sc2Lek4mauSR3TTgkIKfmlwdlaVdCUAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:39:00.093920Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.19705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0b896f8eba8e05a6aac8f50abab52e356bfe97fd8d3cc2a3d388fcd27f4de30","sha256:328d75cd3cf1d866c9b7bb2356d5f163a86d2643ded04dcf1e7a0ed024318219"],"state_sha256":"c1da2762b6d890426784938f0f7a147d491ba80b145e3632d7987d6b7c555f6d"}