{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JX2EPUAKMBFNBGNCT4BR2WIAJU","short_pith_number":"pith:JX2EPUAK","schema_version":"1.0","canonical_sha256":"4df447d00a604ad099a29f031d59004d1ea47af585b3b221f172482d92c60239","source":{"kind":"arxiv","id":"2607.12459","version":1},"attestation_state":"computed","paper":{"title":"Renormalisation of Inhomogeneous Random Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Diego Garlaschelli, Frank den Hollander, Luca Avena, Rajat Subhra Hazra","submitted_at":"2026-07-14T07:41:58Z","abstract_excerpt":"We consider inhomogeneous random graphs in which vertices are assigned i.i.d.\\ random weights, pairs of distinct vertices are connected by an edge independently with a probability that is a bi-variate function of the weights of the vertices, and single vertices are connected to themselves by a self-loop independently with a probability that is a uni-variate function of the weight of the vertex. We apply a renormalisation transformation in which vertices are aggregated into groups of equal size according to a greedy algorithm, namely, distinct groups of aggregated vertices are connected by an a"},"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":"2607.12459","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-07-14T07:41:58Z","cross_cats_sorted":[],"title_canon_sha256":"22b6d56f6569ea98d6f67ae3e7e1c417dadf7c9e5e5685f79bc90ca8f52d95f1","abstract_canon_sha256":"384b02711cdce492259847b5b93836892463092b370c8c42e9a666893dfd2217"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-15T01:21:36.244914Z","signature_b64":"ij94AwUbP3UBjWM3PMsE4VGZJIf4uE3BbEr0UfQpV6x50fPHQLTJbBYHF+89R4cE71tkKRFTHeY3C1caHZbuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4df447d00a604ad099a29f031d59004d1ea47af585b3b221f172482d92c60239","last_reissued_at":"2026-07-15T01:21:36.244022Z","signature_status":"signed_v1","first_computed_at":"2026-07-15T01:21:36.244022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Renormalisation of Inhomogeneous Random Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Diego Garlaschelli, Frank den Hollander, Luca Avena, Rajat Subhra Hazra","submitted_at":"2026-07-14T07:41:58Z","abstract_excerpt":"We consider inhomogeneous random graphs in which vertices are assigned i.i.d.\\ random weights, pairs of distinct vertices are connected by an edge independently with a probability that is a bi-variate function of the weights of the vertices, and single vertices are connected to themselves by a self-loop independently with a probability that is a uni-variate function of the weight of the vertex. We apply a renormalisation transformation in which vertices are aggregated into groups of equal size according to a greedy algorithm, namely, distinct groups of aggregated vertices are connected by an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.12459","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.12459/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":"2607.12459","created_at":"2026-07-15T01:21:36.244503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.12459v1","created_at":"2026-07-15T01:21:36.244503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.12459","created_at":"2026-07-15T01:21:36.244503+00:00"},{"alias_kind":"pith_short_12","alias_value":"JX2EPUAKMBFN","created_at":"2026-07-15T01:21:36.244503+00:00"},{"alias_kind":"pith_short_16","alias_value":"JX2EPUAKMBFNBGNC","created_at":"2026-07-15T01:21:36.244503+00:00"},{"alias_kind":"pith_short_8","alias_value":"JX2EPUAK","created_at":"2026-07-15T01:21:36.244503+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/JX2EPUAKMBFNBGNCT4BR2WIAJU","json":"https://pith.science/pith/JX2EPUAKMBFNBGNCT4BR2WIAJU.json","graph_json":"https://pith.science/api/pith-number/JX2EPUAKMBFNBGNCT4BR2WIAJU/graph.json","events_json":"https://pith.science/api/pith-number/JX2EPUAKMBFNBGNCT4BR2WIAJU/events.json","paper":"https://pith.science/paper/JX2EPUAK"},"agent_actions":{"view_html":"https://pith.science/pith/JX2EPUAKMBFNBGNCT4BR2WIAJU","download_json":"https://pith.science/pith/JX2EPUAKMBFNBGNCT4BR2WIAJU.json","view_paper":"https://pith.science/paper/JX2EPUAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.12459&json=true","fetch_graph":"https://pith.science/api/pith-number/JX2EPUAKMBFNBGNCT4BR2WIAJU/graph.json","fetch_events":"https://pith.science/api/pith-number/JX2EPUAKMBFNBGNCT4BR2WIAJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JX2EPUAKMBFNBGNCT4BR2WIAJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JX2EPUAKMBFNBGNCT4BR2WIAJU/action/storage_attestation","attest_author":"https://pith.science/pith/JX2EPUAKMBFNBGNCT4BR2WIAJU/action/author_attestation","sign_citation":"https://pith.science/pith/JX2EPUAKMBFNBGNCT4BR2WIAJU/action/citation_signature","submit_replication":"https://pith.science/pith/JX2EPUAKMBFNBGNCT4BR2WIAJU/action/replication_record"}},"created_at":"2026-07-15T01:21:36.244503+00:00","updated_at":"2026-07-15T01:21:36.244503+00:00"}