{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CS27DC74B3IWWGDXG2S7VHEJID","short_pith_number":"pith:CS27DC74","schema_version":"1.0","canonical_sha256":"14b5f18bfc0ed16b187736a5fa9c8940ec90cdbe859daa8e818c78aac2b93532","source":{"kind":"arxiv","id":"1504.00858","version":1},"attestation_state":"computed","paper":{"title":"Sparse graph limits, entropy maximization and transitive graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.PR"],"primary_cat":"math.CO","authors_text":"Balazs Szegedy","submitted_at":"2015-04-03T15:13:52Z","abstract_excerpt":"In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main applications are in the study of sparse graph sequences. We present an information theoretic limit concept for $k$-tuples of random variables that is based on the entropy maximization problem for joint distributions of random variables where a system of marginal distributions is prescribed. We give a fruitful correspondence between the two limit concepts that has "},"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":"1504.00858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-03T15:13:52Z","cross_cats_sorted":["math.GR","math.PR"],"title_canon_sha256":"ae3c8b4e37d1489caab13843d09348edc6e17e9eb1a3b7ca5141e22838ca3147","abstract_canon_sha256":"422dc1ea86895fdf6f8928d253020e45eb91a9026cee299b252438ce95ba5684"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:36.876568Z","signature_b64":"Fl8jRyXTMQcwpx+8yaAJW8PKyeEG7Gvjqh+w0qv6EFSqJEmEwS9I//JozGbFJL0I5mkR+OZP6meDm5MDUxcpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14b5f18bfc0ed16b187736a5fa9c8940ec90cdbe859daa8e818c78aac2b93532","last_reissued_at":"2026-05-18T02:19:36.876153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:36.876153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse graph limits, entropy maximization and transitive graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.PR"],"primary_cat":"math.CO","authors_text":"Balazs Szegedy","submitted_at":"2015-04-03T15:13:52Z","abstract_excerpt":"In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main applications are in the study of sparse graph sequences. We present an information theoretic limit concept for $k$-tuples of random variables that is based on the entropy maximization problem for joint distributions of random variables where a system of marginal distributions is prescribed. We give a fruitful correspondence between the two limit concepts that has "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00858","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":""},"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":"1504.00858","created_at":"2026-05-18T02:19:36.876218+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00858v1","created_at":"2026-05-18T02:19:36.876218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00858","created_at":"2026-05-18T02:19:36.876218+00:00"},{"alias_kind":"pith_short_12","alias_value":"CS27DC74B3IW","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CS27DC74B3IWWGDX","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CS27DC74","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2607.02260","citing_title":"Tensor Amplification and Spectral Transfer for Sidorenko-Type Inequalities","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28890","citing_title":"Logarithmic convergence of finite projective planes","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.26614","citing_title":"Spectral Sidorenko inequalities and edge-spectral supersaturation","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CS27DC74B3IWWGDXG2S7VHEJID","json":"https://pith.science/pith/CS27DC74B3IWWGDXG2S7VHEJID.json","graph_json":"https://pith.science/api/pith-number/CS27DC74B3IWWGDXG2S7VHEJID/graph.json","events_json":"https://pith.science/api/pith-number/CS27DC74B3IWWGDXG2S7VHEJID/events.json","paper":"https://pith.science/paper/CS27DC74"},"agent_actions":{"view_html":"https://pith.science/pith/CS27DC74B3IWWGDXG2S7VHEJID","download_json":"https://pith.science/pith/CS27DC74B3IWWGDXG2S7VHEJID.json","view_paper":"https://pith.science/paper/CS27DC74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00858&json=true","fetch_graph":"https://pith.science/api/pith-number/CS27DC74B3IWWGDXG2S7VHEJID/graph.json","fetch_events":"https://pith.science/api/pith-number/CS27DC74B3IWWGDXG2S7VHEJID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CS27DC74B3IWWGDXG2S7VHEJID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CS27DC74B3IWWGDXG2S7VHEJID/action/storage_attestation","attest_author":"https://pith.science/pith/CS27DC74B3IWWGDXG2S7VHEJID/action/author_attestation","sign_citation":"https://pith.science/pith/CS27DC74B3IWWGDXG2S7VHEJID/action/citation_signature","submit_replication":"https://pith.science/pith/CS27DC74B3IWWGDXG2S7VHEJID/action/replication_record"}},"created_at":"2026-05-18T02:19:36.876218+00:00","updated_at":"2026-05-18T02:19:36.876218+00:00"}