{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SKBXXUZTEXQJASZSILADE5ASD5","short_pith_number":"pith:SKBXXUZT","schema_version":"1.0","canonical_sha256":"92837bd33325e0904b3242c03274121f4a88c2a82b48e0ba421f848cfb65bff7","source":{"kind":"arxiv","id":"1712.01301","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic properties of random unlabelled block-weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Benedikt Stufler","submitted_at":"2017-12-04T19:03:34Z","abstract_excerpt":"We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As their number of vertices tends to infinity, we show that they admit the Brownian tree as Gromov--Hausdorff--Prokhorov scaling limit, and converge in a strengthened Benjamini--Schramm sense toward an infinite random graph. We also consider a family of random graphs that are allowed to be disconnected. Here a giant connected component emerges and the small fragm"},"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":"1712.01301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-04T19:03:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e40e57c9824e9593280c8aa49dd008c99588ccd1337f60f6f94ac17c71d8361f","abstract_canon_sha256":"c0193580b5b7a536a82595c88373dadbfab3cb8d9bf027555671ae5cf40db9a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:51.177080Z","signature_b64":"uzZ4OYcNgKo6WhMJK06RKPgVcz2yZR8RUxJpORa9t9fznbk5fYqY/as8rhTvaw8VinKZFo3OHM1ToHi3WxgSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92837bd33325e0904b3242c03274121f4a88c2a82b48e0ba421f848cfb65bff7","last_reissued_at":"2026-05-18T00:28:51.176413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:51.176413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic properties of random unlabelled block-weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Benedikt Stufler","submitted_at":"2017-12-04T19:03:34Z","abstract_excerpt":"We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As their number of vertices tends to infinity, we show that they admit the Brownian tree as Gromov--Hausdorff--Prokhorov scaling limit, and converge in a strengthened Benjamini--Schramm sense toward an infinite random graph. We also consider a family of random graphs that are allowed to be disconnected. Here a giant connected component emerges and the small fragm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01301","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":"1712.01301","created_at":"2026-05-18T00:28:51.176522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01301v1","created_at":"2026-05-18T00:28:51.176522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01301","created_at":"2026-05-18T00:28:51.176522+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKBXXUZTEXQJ","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKBXXUZTEXQJASZS","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKBXXUZT","created_at":"2026-05-18T12:31:43.269735+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/SKBXXUZTEXQJASZSILADE5ASD5","json":"https://pith.science/pith/SKBXXUZTEXQJASZSILADE5ASD5.json","graph_json":"https://pith.science/api/pith-number/SKBXXUZTEXQJASZSILADE5ASD5/graph.json","events_json":"https://pith.science/api/pith-number/SKBXXUZTEXQJASZSILADE5ASD5/events.json","paper":"https://pith.science/paper/SKBXXUZT"},"agent_actions":{"view_html":"https://pith.science/pith/SKBXXUZTEXQJASZSILADE5ASD5","download_json":"https://pith.science/pith/SKBXXUZTEXQJASZSILADE5ASD5.json","view_paper":"https://pith.science/paper/SKBXXUZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01301&json=true","fetch_graph":"https://pith.science/api/pith-number/SKBXXUZTEXQJASZSILADE5ASD5/graph.json","fetch_events":"https://pith.science/api/pith-number/SKBXXUZTEXQJASZSILADE5ASD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKBXXUZTEXQJASZSILADE5ASD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKBXXUZTEXQJASZSILADE5ASD5/action/storage_attestation","attest_author":"https://pith.science/pith/SKBXXUZTEXQJASZSILADE5ASD5/action/author_attestation","sign_citation":"https://pith.science/pith/SKBXXUZTEXQJASZSILADE5ASD5/action/citation_signature","submit_replication":"https://pith.science/pith/SKBXXUZTEXQJASZSILADE5ASD5/action/replication_record"}},"created_at":"2026-05-18T00:28:51.176522+00:00","updated_at":"2026-05-18T00:28:51.176522+00:00"}