{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:77ZXGQSSEO3HFALL5WEHYUVQUC","short_pith_number":"pith:77ZXGQSS","schema_version":"1.0","canonical_sha256":"fff373425223b672816bed887c52b0a0a201b5264b3443ed0fbadd4d294a5692","source":{"kind":"arxiv","id":"2306.08489","version":2},"attestation_state":"computed","paper":{"title":"Analysis and Approximate Inference of Large Random Kronecker Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.SP"],"primary_cat":"stat.ML","authors_text":"Chengmei Niu, Yong Xiao, Yuanqian Xia, Zhenyu Liao","submitted_at":"2023-06-14T13:09:38Z","abstract_excerpt":"Random graph models are playing an increasingly important role in various fields ranging from social networks, telecommunication systems, to physiologic and biological networks. Within this landscape, the random Kronecker graph model, emerges as a prominent framework for scrutinizing intricate real-world networks. In this paper, we investigate large random Kronecker graphs, i.e., the number of graph vertices $N$ is large. Built upon recent advances in random matrix theory (RMT) and high-dimensional statistics, we prove that the adjacency of a large random Kronecker graph can be decomposed, in "},"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":"2306.08489","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-06-14T13:09:38Z","cross_cats_sorted":["cs.LG","math.SP"],"title_canon_sha256":"ba61b3403481f58d98ff95028f361eb1361a64ea64076d736495d0eb10468e38","abstract_canon_sha256":"8a2c6183ede2d66fb7b6e2a863a8574b433cd420917b500aeaba9680a49bdb85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:54.266432Z","signature_b64":"+LwWDrOGmMTPY5D7FiW9DynQDwwZLb9JuyCp32mShYMOUJQYBeJErO/6OmG9BxqYOzOyjPZdRP35ZTvo614UAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fff373425223b672816bed887c52b0a0a201b5264b3443ed0fbadd4d294a5692","last_reissued_at":"2026-07-05T07:40:54.265992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:54.265992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis and Approximate Inference of Large Random Kronecker Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.SP"],"primary_cat":"stat.ML","authors_text":"Chengmei Niu, Yong Xiao, Yuanqian Xia, Zhenyu Liao","submitted_at":"2023-06-14T13:09:38Z","abstract_excerpt":"Random graph models are playing an increasingly important role in various fields ranging from social networks, telecommunication systems, to physiologic and biological networks. Within this landscape, the random Kronecker graph model, emerges as a prominent framework for scrutinizing intricate real-world networks. In this paper, we investigate large random Kronecker graphs, i.e., the number of graph vertices $N$ is large. Built upon recent advances in random matrix theory (RMT) and high-dimensional statistics, we prove that the adjacency of a large random Kronecker graph can be decomposed, in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08489","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/2306.08489/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":"2306.08489","created_at":"2026-07-05T07:40:54.266052+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.08489v2","created_at":"2026-07-05T07:40:54.266052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08489","created_at":"2026-07-05T07:40:54.266052+00:00"},{"alias_kind":"pith_short_12","alias_value":"77ZXGQSSEO3H","created_at":"2026-07-05T07:40:54.266052+00:00"},{"alias_kind":"pith_short_16","alias_value":"77ZXGQSSEO3HFALL","created_at":"2026-07-05T07:40:54.266052+00:00"},{"alias_kind":"pith_short_8","alias_value":"77ZXGQSS","created_at":"2026-07-05T07:40:54.266052+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22292","citing_title":"Scalable inference of large-scale random kronecker graphs via tensor decomposition and Einstein summation","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/77ZXGQSSEO3HFALL5WEHYUVQUC","json":"https://pith.science/pith/77ZXGQSSEO3HFALL5WEHYUVQUC.json","graph_json":"https://pith.science/api/pith-number/77ZXGQSSEO3HFALL5WEHYUVQUC/graph.json","events_json":"https://pith.science/api/pith-number/77ZXGQSSEO3HFALL5WEHYUVQUC/events.json","paper":"https://pith.science/paper/77ZXGQSS"},"agent_actions":{"view_html":"https://pith.science/pith/77ZXGQSSEO3HFALL5WEHYUVQUC","download_json":"https://pith.science/pith/77ZXGQSSEO3HFALL5WEHYUVQUC.json","view_paper":"https://pith.science/paper/77ZXGQSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.08489&json=true","fetch_graph":"https://pith.science/api/pith-number/77ZXGQSSEO3HFALL5WEHYUVQUC/graph.json","fetch_events":"https://pith.science/api/pith-number/77ZXGQSSEO3HFALL5WEHYUVQUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77ZXGQSSEO3HFALL5WEHYUVQUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77ZXGQSSEO3HFALL5WEHYUVQUC/action/storage_attestation","attest_author":"https://pith.science/pith/77ZXGQSSEO3HFALL5WEHYUVQUC/action/author_attestation","sign_citation":"https://pith.science/pith/77ZXGQSSEO3HFALL5WEHYUVQUC/action/citation_signature","submit_replication":"https://pith.science/pith/77ZXGQSSEO3HFALL5WEHYUVQUC/action/replication_record"}},"created_at":"2026-07-05T07:40:54.266052+00:00","updated_at":"2026-07-05T07:40:54.266052+00:00"}