{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4JARCHTXZWLOGTUOLIT2IPVDCV","short_pith_number":"pith:4JARCHTX","schema_version":"1.0","canonical_sha256":"e241111e77cd96e34e8e5a27a43ea3154d832250a75d135a855bb6db4f097184","source":{"kind":"arxiv","id":"2407.05998","version":1},"attestation_state":"computed","paper":{"title":"Probability graphons: the right convergence point of view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.FA"],"primary_cat":"math.PR","authors_text":"Giulio Zucal","submitted_at":"2024-07-08T14:47:25Z","abstract_excerpt":"We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and quotient sets to the case of probability graphons. Furthermore, we characterise the convergence of probability graphons in terms of these global quantities. In particular, we show the equivalence of these two notions of convergence with the unlabelled cut-metric convergence (and thus also with the homomorphism densities convergence and the subgraph sampling co"},"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":"2407.05998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-07-08T14:47:25Z","cross_cats_sorted":["math.CO","math.FA"],"title_canon_sha256":"561909b1b9d488329f87083f527c4e77de5a3f37cd226b8b1b3bd591e5088976","abstract_canon_sha256":"2f3908698fdf7953a3a9df8c1aeb3d6fe376a9e1260e698e4b6ef59d9da5b899"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:22.132998Z","signature_b64":"ZKD6SWBQ8mfktFYECSkBHxHAoR9XeorA/MnrHJn+cXyxP2rRMTwfX0C16TzsCeDgXrp+dixNDURcfrZqtyxuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e241111e77cd96e34e8e5a27a43ea3154d832250a75d135a855bb6db4f097184","last_reissued_at":"2026-07-05T08:41:22.132532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:22.132532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probability graphons: the right convergence point of view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.FA"],"primary_cat":"math.PR","authors_text":"Giulio Zucal","submitted_at":"2024-07-08T14:47:25Z","abstract_excerpt":"We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and quotient sets to the case of probability graphons. Furthermore, we characterise the convergence of probability graphons in terms of these global quantities. In particular, we show the equivalence of these two notions of convergence with the unlabelled cut-metric convergence (and thus also with the homomorphism densities convergence and the subgraph sampling co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05998","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/2407.05998/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":"2407.05998","created_at":"2026-07-05T08:41:22.132593+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05998v1","created_at":"2026-07-05T08:41:22.132593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05998","created_at":"2026-07-05T08:41:22.132593+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JARCHTXZWLO","created_at":"2026-07-05T08:41:22.132593+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JARCHTXZWLOGTUO","created_at":"2026-07-05T08:41:22.132593+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JARCHTX","created_at":"2026-07-05T08:41:22.132593+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21556","citing_title":"Mean field limit of non-exchangeable interacting diffusions on co-evolutionary networks","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2502.04280","citing_title":"Mean-Field Analysis of Latent Variable Process Models on Dynamically Evolving Graphs with Feedback Effects","ref_index":87,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JARCHTXZWLOGTUOLIT2IPVDCV","json":"https://pith.science/pith/4JARCHTXZWLOGTUOLIT2IPVDCV.json","graph_json":"https://pith.science/api/pith-number/4JARCHTXZWLOGTUOLIT2IPVDCV/graph.json","events_json":"https://pith.science/api/pith-number/4JARCHTXZWLOGTUOLIT2IPVDCV/events.json","paper":"https://pith.science/paper/4JARCHTX"},"agent_actions":{"view_html":"https://pith.science/pith/4JARCHTXZWLOGTUOLIT2IPVDCV","download_json":"https://pith.science/pith/4JARCHTXZWLOGTUOLIT2IPVDCV.json","view_paper":"https://pith.science/paper/4JARCHTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05998&json=true","fetch_graph":"https://pith.science/api/pith-number/4JARCHTXZWLOGTUOLIT2IPVDCV/graph.json","fetch_events":"https://pith.science/api/pith-number/4JARCHTXZWLOGTUOLIT2IPVDCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JARCHTXZWLOGTUOLIT2IPVDCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JARCHTXZWLOGTUOLIT2IPVDCV/action/storage_attestation","attest_author":"https://pith.science/pith/4JARCHTXZWLOGTUOLIT2IPVDCV/action/author_attestation","sign_citation":"https://pith.science/pith/4JARCHTXZWLOGTUOLIT2IPVDCV/action/citation_signature","submit_replication":"https://pith.science/pith/4JARCHTXZWLOGTUOLIT2IPVDCV/action/replication_record"}},"created_at":"2026-07-05T08:41:22.132593+00:00","updated_at":"2026-07-05T08:41:22.132593+00:00"}