{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GNSWW3POPHVOLZD3ZT5ZDPLVXS","short_pith_number":"pith:GNSWW3PO","schema_version":"1.0","canonical_sha256":"33656b6dee79eae5e47bccfb91bd75bca19529dac5e5c50a44302a857d4dcb93","source":{"kind":"arxiv","id":"1811.06940","version":2},"attestation_state":"computed","paper":{"title":"Stable graphs: distributions and line-breaking construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"B\\'en\\'edicte Haas, Christina Goldschmidt, Delphin S\\'enizergues","submitted_at":"2018-11-16T17:48:40Z","abstract_excerpt":"For $\\alpha \\in (1,2]$, the $\\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured metric spaces (the limiting connected components), each of which is tree-like, in the sense that it consists of an $\\mathbb R$-tree with finitely many vertex-identifications (which create cycles). Indeed, given their masses and numbers of vertex-identifications, these components are independent and may be constructed from a spanning $\\mathbb R$-tree, which is"},"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":"1811.06940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-11-16T17:48:40Z","cross_cats_sorted":[],"title_canon_sha256":"f66dc5bd6492149b4fec15f5e02ae177e4fd047ca98ee8c1065897f9ee514f10","abstract_canon_sha256":"5aa659b0b99589ebe6a2d40d1eb009390e6072bed6e26aef11bfff37f2691fb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:15.434121Z","signature_b64":"xnKj3uirzruIy2jQbjFBT5qrMfGZEKmu/lW1HbvpTBcbEuilFofi2P8NYbYP3Ch/u0UNe41aVRIRiRTVEM+MCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33656b6dee79eae5e47bccfb91bd75bca19529dac5e5c50a44302a857d4dcb93","last_reissued_at":"2026-07-05T01:17:15.433606Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:15.433606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable graphs: distributions and line-breaking construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"B\\'en\\'edicte Haas, Christina Goldschmidt, Delphin S\\'enizergues","submitted_at":"2018-11-16T17:48:40Z","abstract_excerpt":"For $\\alpha \\in (1,2]$, the $\\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured metric spaces (the limiting connected components), each of which is tree-like, in the sense that it consists of an $\\mathbb R$-tree with finitely many vertex-identifications (which create cycles). Indeed, given their masses and numbers of vertex-identifications, these components are independent and may be constructed from a spanning $\\mathbb R$-tree, which is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06940","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/1811.06940/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.06940","created_at":"2026-07-05T01:17:15.433665+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06940v2","created_at":"2026-07-05T01:17:15.433665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06940","created_at":"2026-07-05T01:17:15.433665+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNSWW3POPHVO","created_at":"2026-07-05T01:17:15.433665+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNSWW3POPHVOLZD3","created_at":"2026-07-05T01:17:15.433665+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNSWW3PO","created_at":"2026-07-05T01:17:15.433665+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04403","citing_title":"On breadth-first constructions of scaling limits of random graphs and random unicellular maps","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GNSWW3POPHVOLZD3ZT5ZDPLVXS","json":"https://pith.science/pith/GNSWW3POPHVOLZD3ZT5ZDPLVXS.json","graph_json":"https://pith.science/api/pith-number/GNSWW3POPHVOLZD3ZT5ZDPLVXS/graph.json","events_json":"https://pith.science/api/pith-number/GNSWW3POPHVOLZD3ZT5ZDPLVXS/events.json","paper":"https://pith.science/paper/GNSWW3PO"},"agent_actions":{"view_html":"https://pith.science/pith/GNSWW3POPHVOLZD3ZT5ZDPLVXS","download_json":"https://pith.science/pith/GNSWW3POPHVOLZD3ZT5ZDPLVXS.json","view_paper":"https://pith.science/paper/GNSWW3PO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06940&json=true","fetch_graph":"https://pith.science/api/pith-number/GNSWW3POPHVOLZD3ZT5ZDPLVXS/graph.json","fetch_events":"https://pith.science/api/pith-number/GNSWW3POPHVOLZD3ZT5ZDPLVXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNSWW3POPHVOLZD3ZT5ZDPLVXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNSWW3POPHVOLZD3ZT5ZDPLVXS/action/storage_attestation","attest_author":"https://pith.science/pith/GNSWW3POPHVOLZD3ZT5ZDPLVXS/action/author_attestation","sign_citation":"https://pith.science/pith/GNSWW3POPHVOLZD3ZT5ZDPLVXS/action/citation_signature","submit_replication":"https://pith.science/pith/GNSWW3POPHVOLZD3ZT5ZDPLVXS/action/replication_record"}},"created_at":"2026-07-05T01:17:15.433665+00:00","updated_at":"2026-07-05T01:17:15.433665+00:00"}