{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DAF52GYV5Y73WB45TI4YRXUSRQ","short_pith_number":"pith:DAF52GYV","schema_version":"1.0","canonical_sha256":"180bdd1b15ee3fbb079d9a3988de928c3a4ef9b06ff8baecae9a4902187ffa52","source":{"kind":"arxiv","id":"2404.13822","version":2},"attestation_state":"computed","paper":{"title":"Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Anirban Chatterjee, Bhaswar B. Bhattacharya, Soham Dan","submitted_at":"2024-04-22T01:53:25Z","abstract_excerpt":"Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a natural way to sample exchangeable random graphs. It is well known that network moments (motif/subgraph counts) identify a graphon (up to an isomorphism), hence, understanding the sampling distribution of subgraph counts in random graphs sampled from a graphon is pivotal for nonparametric network inference. In this paper, we derive the joint asymptotic dist"},"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":"2404.13822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-04-22T01:53:25Z","cross_cats_sorted":["math.PR","stat.TH"],"title_canon_sha256":"3c55083a21a9985d1cdf00e00988e767406dc9c797ba60c742de609cbd45c55a","abstract_canon_sha256":"5d4a43dd2d1708976f3107f918818ffb26822f333b07486bdae16c79e590d1f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:27.356461Z","signature_b64":"YIxOL4N3cKULorzGlxciW2AgmkgtHcplSc674bvydmIOvjUyBJuozhOMt7xbAQ+z2ISIVywkUPqsNRIBboPpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"180bdd1b15ee3fbb079d9a3988de928c3a4ef9b06ff8baecae9a4902187ffa52","last_reissued_at":"2026-07-05T09:07:27.356023Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:27.356023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Anirban Chatterjee, Bhaswar B. Bhattacharya, Soham Dan","submitted_at":"2024-04-22T01:53:25Z","abstract_excerpt":"Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a natural way to sample exchangeable random graphs. It is well known that network moments (motif/subgraph counts) identify a graphon (up to an isomorphism), hence, understanding the sampling distribution of subgraph counts in random graphs sampled from a graphon is pivotal for nonparametric network inference. In this paper, we derive the joint asymptotic dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13822","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/2404.13822/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":"2404.13822","created_at":"2026-07-05T09:07:27.356090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.13822v2","created_at":"2026-07-05T09:07:27.356090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13822","created_at":"2026-07-05T09:07:27.356090+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAF52GYV5Y73","created_at":"2026-07-05T09:07:27.356090+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAF52GYV5Y73WB45","created_at":"2026-07-05T09:07:27.356090+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAF52GYV","created_at":"2026-07-05T09:07:27.356090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.11541","citing_title":"Functional central limit theorem for the subgraph count of the voter model on dynamic random graphs","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DAF52GYV5Y73WB45TI4YRXUSRQ","json":"https://pith.science/pith/DAF52GYV5Y73WB45TI4YRXUSRQ.json","graph_json":"https://pith.science/api/pith-number/DAF52GYV5Y73WB45TI4YRXUSRQ/graph.json","events_json":"https://pith.science/api/pith-number/DAF52GYV5Y73WB45TI4YRXUSRQ/events.json","paper":"https://pith.science/paper/DAF52GYV"},"agent_actions":{"view_html":"https://pith.science/pith/DAF52GYV5Y73WB45TI4YRXUSRQ","download_json":"https://pith.science/pith/DAF52GYV5Y73WB45TI4YRXUSRQ.json","view_paper":"https://pith.science/paper/DAF52GYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.13822&json=true","fetch_graph":"https://pith.science/api/pith-number/DAF52GYV5Y73WB45TI4YRXUSRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DAF52GYV5Y73WB45TI4YRXUSRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAF52GYV5Y73WB45TI4YRXUSRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAF52GYV5Y73WB45TI4YRXUSRQ/action/storage_attestation","attest_author":"https://pith.science/pith/DAF52GYV5Y73WB45TI4YRXUSRQ/action/author_attestation","sign_citation":"https://pith.science/pith/DAF52GYV5Y73WB45TI4YRXUSRQ/action/citation_signature","submit_replication":"https://pith.science/pith/DAF52GYV5Y73WB45TI4YRXUSRQ/action/replication_record"}},"created_at":"2026-07-05T09:07:27.356090+00:00","updated_at":"2026-07-05T09:07:27.356090+00:00"}