{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ZAGHF6QQHJIMB54FZARXFTG3H5","short_pith_number":"pith:ZAGHF6QQ","schema_version":"1.0","canonical_sha256":"c80c72fa103a50c0f785c82372ccdb3f56fbfed991f3cf725066912367a67229","source":{"kind":"arxiv","id":"0901.0929","version":2},"attestation_state":"computed","paper":{"title":"Finitely forcible graphons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Balazs Szegedy, Laszlo Lovasz","submitted_at":"2009-01-07T21:07:59Z","abstract_excerpt":"We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by finitely many subgraph densities. Generalizing results of Turan, Erdos-Simonovits and Chung-Graham-Wilson, we construct numerous finitely forcible graphons. Most of these fall into two categories: one type has an algebraic structure and the other type has an iterated (fractal-like) structure. We also give some necessary conditions for forcibility, which impl"},"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":"0901.0929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-07T21:07:59Z","cross_cats_sorted":[],"title_canon_sha256":"256b6a5384e426cd2ba3701817f51cb12c210392dc04023d6bfbc07f4369b897","abstract_canon_sha256":"39d54c39478128b0df7d6ef5bc88c15dea58ebdde520974c7df538b331ae6306"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:21.301002Z","signature_b64":"rpHyr1ZJDPG0thFsgEFgtxYTmQKqiDMAzB1yKtez32a9LfHeXKNaH6fmUGDJjqyDgNEqmzAlPaaDnjModK+jAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c80c72fa103a50c0f785c82372ccdb3f56fbfed991f3cf725066912367a67229","last_reissued_at":"2026-05-18T03:15:21.300141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:21.300141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finitely forcible graphons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Balazs Szegedy, Laszlo Lovasz","submitted_at":"2009-01-07T21:07:59Z","abstract_excerpt":"We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by finitely many subgraph densities. Generalizing results of Turan, Erdos-Simonovits and Chung-Graham-Wilson, we construct numerous finitely forcible graphons. Most of these fall into two categories: one type has an algebraic structure and the other type has an iterated (fractal-like) structure. We also give some necessary conditions for forcibility, which impl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0929","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":""},"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":"0901.0929","created_at":"2026-05-18T03:15:21.300287+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.0929v2","created_at":"2026-05-18T03:15:21.300287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0929","created_at":"2026-05-18T03:15:21.300287+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAGHF6QQHJIM","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAGHF6QQHJIMB54F","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAGHF6QQ","created_at":"2026-05-18T12:26:02.257875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5","json":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5.json","graph_json":"https://pith.science/api/pith-number/ZAGHF6QQHJIMB54FZARXFTG3H5/graph.json","events_json":"https://pith.science/api/pith-number/ZAGHF6QQHJIMB54FZARXFTG3H5/events.json","paper":"https://pith.science/paper/ZAGHF6QQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5","download_json":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5.json","view_paper":"https://pith.science/paper/ZAGHF6QQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.0929&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAGHF6QQHJIMB54FZARXFTG3H5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAGHF6QQHJIMB54FZARXFTG3H5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/action/storage_attestation","attest_author":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/action/author_attestation","sign_citation":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/action/citation_signature","submit_replication":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/action/replication_record"}},"created_at":"2026-05-18T03:15:21.300287+00:00","updated_at":"2026-05-18T03:15:21.300287+00:00"}