{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2XQ5JVKXOAN36QS25WAF5IRPH5","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":"71f2cf3039022948a2cd2d9b7893459bb7c2ce5f795c297365fef8c5fecdf8cb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-21T10:57:33Z","title_canon_sha256":"2d4677832df007c9982af14b091290d48a1629ee5a514b5a04a74fab415a199e"},"schema_version":"1.0","source":{"id":"1703.07145","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07145","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07145v4","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07145","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"2XQ5JVKXOAN3","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"pith_short_16","alias_value":"2XQ5JVKXOAN36QS2","created_at":"2026-07-05T01:01:17Z"},{"alias_kind":"pith_short_8","alias_value":"2XQ5JVKX","created_at":"2026-07-05T01:01:17Z"}],"graph_snapshots":[{"event_id":"sha256:2cc8a9b2f700914f0af683a1fc3da846388243eca53195695505f1fce4930aa1","target":"graph","created_at":"2026-07-05T01:01:17Z","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/1703.07145/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such results were derived by Bhamidi, van der Hofstad, Sen [Probab. Theory Relat. Fields 2018]. We develop general principles under which the identical scaling limits as the rank-one case can be obtained. Of independent interest, we derive refined asymptotics for various susceptibility functions and the maximal diameter in the barely subcritical regime.","authors_text":"Remco van der Hofstad, Sanchayan Sen, Shankar Bhamidi, Souvik Dhara","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-21T10:57:33Z","title":"Universality for critical heavy-tailed network models: Metric structure of maximal components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07145","kind":"arxiv","version":4},"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:15cdc71f39ee3e86d9667b213e1874b7cfc0d5cbb5380f9f7257ccac52a48c4f","target":"record","created_at":"2026-07-05T01:01:17Z","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":"71f2cf3039022948a2cd2d9b7893459bb7c2ce5f795c297365fef8c5fecdf8cb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-21T10:57:33Z","title_canon_sha256":"2d4677832df007c9982af14b091290d48a1629ee5a514b5a04a74fab415a199e"},"schema_version":"1.0","source":{"id":"1703.07145","kind":"arxiv","version":4}},"canonical_sha256":"d5e1d4d557701bbf425aed805ea22f3f443aa5a16ac3cdce27f00466554a8a13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5e1d4d557701bbf425aed805ea22f3f443aa5a16ac3cdce27f00466554a8a13","first_computed_at":"2026-07-05T01:01:17.830502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:01:17.830502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pTi2ruowXz21sTLEnuyZ8HDWLqoArwPM2B+2srWA8uGKfDPv0ZGR+DAeaNuvhL9zDGUd7U4IdnfYl7GiNMJ9BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:01:17.830879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07145","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15cdc71f39ee3e86d9667b213e1874b7cfc0d5cbb5380f9f7257ccac52a48c4f","sha256:2cc8a9b2f700914f0af683a1fc3da846388243eca53195695505f1fce4930aa1"],"state_sha256":"72008a8d9d5343c520cd9d88b9e1083e91021259e6c245f10e7d5f7619f97c93"}