{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BNRZSTPSZPZEVXXQDIWEXTORNB","short_pith_number":"pith:BNRZSTPS","schema_version":"1.0","canonical_sha256":"0b63994df2cbf24adef01a2c4bcdd1687bc2156f4380ce11a9997d416d72a51b","source":{"kind":"arxiv","id":"2408.02528","version":3},"attestation_state":"computed","paper":{"title":"Graphon branching processes and fractional isomorphism","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Anna Margarethe Limbach, Eng Keat Hng, Jan Hladk\\'y","submitted_at":"2024-08-05T14:48:42Z","abstract_excerpt":"In their study of the giant component in inhomogeneous random graphs, Bollob\\'as, Janson, and Riordan introduced a class of branching processes parametrized by a possibly unbounded graphon. We prove that the tree structures underlying two such branching processes have the same distributions if and only if the corresponding graphons are fractionally isomorphic, a notion introduced by Greb\\'ik and Rocha.\n  A different class of branching processes was introduced by Hladk\\'y, Nachmias, and Tran in relation to uniform spanning trees in finite graphs approximating a given connected graphon. We prove"},"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":"2408.02528","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-05T14:48:42Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"1a7630a79996980406fed70e48e8c1b4dc535c07c79608461bb62be99f94babf","abstract_canon_sha256":"c15a6fbae192c1ea9512dadccf8ed6f9f3dffa09f8f213985c385316cbfce05e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:06.672143Z","signature_b64":"wefLnoHzvrx4Ijicx+RO1eLTyjZfKQQToOnAPsAEmizoFFacto0acAW+2OvG6L4y/tAcmDa28vVDPZC0tWjRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b63994df2cbf24adef01a2c4bcdd1687bc2156f4380ce11a9997d416d72a51b","last_reissued_at":"2026-07-05T11:59:06.671620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:06.671620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphon branching processes and fractional isomorphism","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Anna Margarethe Limbach, Eng Keat Hng, Jan Hladk\\'y","submitted_at":"2024-08-05T14:48:42Z","abstract_excerpt":"In their study of the giant component in inhomogeneous random graphs, Bollob\\'as, Janson, and Riordan introduced a class of branching processes parametrized by a possibly unbounded graphon. We prove that the tree structures underlying two such branching processes have the same distributions if and only if the corresponding graphons are fractionally isomorphic, a notion introduced by Greb\\'ik and Rocha.\n  A different class of branching processes was introduced by Hladk\\'y, Nachmias, and Tran in relation to uniform spanning trees in finite graphs approximating a given connected graphon. We prove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.02528","kind":"arxiv","version":3},"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/2408.02528/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":"2408.02528","created_at":"2026-07-05T11:59:06.671687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.02528v3","created_at":"2026-07-05T11:59:06.671687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.02528","created_at":"2026-07-05T11:59:06.671687+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNRZSTPSZPZE","created_at":"2026-07-05T11:59:06.671687+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNRZSTPSZPZEVXXQ","created_at":"2026-07-05T11:59:06.671687+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNRZSTPS","created_at":"2026-07-05T11:59:06.671687+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00059","citing_title":"Why is it easier to predict the epidemic curve than to reconstruct the underlying contact network?","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BNRZSTPSZPZEVXXQDIWEXTORNB","json":"https://pith.science/pith/BNRZSTPSZPZEVXXQDIWEXTORNB.json","graph_json":"https://pith.science/api/pith-number/BNRZSTPSZPZEVXXQDIWEXTORNB/graph.json","events_json":"https://pith.science/api/pith-number/BNRZSTPSZPZEVXXQDIWEXTORNB/events.json","paper":"https://pith.science/paper/BNRZSTPS"},"agent_actions":{"view_html":"https://pith.science/pith/BNRZSTPSZPZEVXXQDIWEXTORNB","download_json":"https://pith.science/pith/BNRZSTPSZPZEVXXQDIWEXTORNB.json","view_paper":"https://pith.science/paper/BNRZSTPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.02528&json=true","fetch_graph":"https://pith.science/api/pith-number/BNRZSTPSZPZEVXXQDIWEXTORNB/graph.json","fetch_events":"https://pith.science/api/pith-number/BNRZSTPSZPZEVXXQDIWEXTORNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNRZSTPSZPZEVXXQDIWEXTORNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNRZSTPSZPZEVXXQDIWEXTORNB/action/storage_attestation","attest_author":"https://pith.science/pith/BNRZSTPSZPZEVXXQDIWEXTORNB/action/author_attestation","sign_citation":"https://pith.science/pith/BNRZSTPSZPZEVXXQDIWEXTORNB/action/citation_signature","submit_replication":"https://pith.science/pith/BNRZSTPSZPZEVXXQDIWEXTORNB/action/replication_record"}},"created_at":"2026-07-05T11:59:06.671687+00:00","updated_at":"2026-07-05T11:59:06.671687+00:00"}