{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:O2YDGBAXJSXMX4QP64KPTBP7Y4","short_pith_number":"pith:O2YDGBAX","schema_version":"1.0","canonical_sha256":"76b03304174caecbf20ff714f985ffc70b3353330fa6fc2ac9673e7616455679","source":{"kind":"arxiv","id":"1507.00067","version":4},"attestation_state":"computed","paper":{"title":"Weak regularity and finitely forcible graph limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jacob W. Cooper, Jonathan A. Noel, Tomas Kaiser","submitted_at":"2015-06-30T23:39:51Z","abstract_excerpt":"Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple structure. In particular, one of their conjectures would imply that every finitely forcible graphon has a weak $\\varepsilon$-regular partition with the number of parts bounded by a polynomial in $\\varepsilon^{-1}$. We construct a finitely forcible graphon $W$ such that the number of parts in any weak $\\varepsilon$-regular partition of $W$ is at least exponential 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":"1507.00067","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-30T23:39:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"60900bb01d3b585f398e3ae6365237118c5be9d58ac02d6e26ae07ba596f2629","abstract_canon_sha256":"c25a75c80dee634a3758f0515df13e837acba6f26c03775bfc482aacd84a26f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:54.124311Z","signature_b64":"xGKsRPwl9ELQbvNRm0zVY1kqOZ1EX4/FolkhGAR28a324XCY7oAsaS+zakrrqD0UNP9yhe18XrcwpFRLYBRIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76b03304174caecbf20ff714f985ffc70b3353330fa6fc2ac9673e7616455679","last_reissued_at":"2026-05-18T01:07:54.123860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:54.123860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak regularity and finitely forcible graph limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jacob W. Cooper, Jonathan A. Noel, Tomas Kaiser","submitted_at":"2015-06-30T23:39:51Z","abstract_excerpt":"Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple structure. In particular, one of their conjectures would imply that every finitely forcible graphon has a weak $\\varepsilon$-regular partition with the number of parts bounded by a polynomial in $\\varepsilon^{-1}$. We construct a finitely forcible graphon $W$ such that the number of parts in any weak $\\varepsilon$-regular partition of $W$ is at least exponential in $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00067","kind":"arxiv","version":4},"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":"1507.00067","created_at":"2026-05-18T01:07:54.123933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00067v4","created_at":"2026-05-18T01:07:54.123933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00067","created_at":"2026-05-18T01:07:54.123933+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2YDGBAXJSXM","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2YDGBAXJSXMX4QP","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2YDGBAX","created_at":"2026-05-18T12:29:34.919912+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/O2YDGBAXJSXMX4QP64KPTBP7Y4","json":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4.json","graph_json":"https://pith.science/api/pith-number/O2YDGBAXJSXMX4QP64KPTBP7Y4/graph.json","events_json":"https://pith.science/api/pith-number/O2YDGBAXJSXMX4QP64KPTBP7Y4/events.json","paper":"https://pith.science/paper/O2YDGBAX"},"agent_actions":{"view_html":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4","download_json":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4.json","view_paper":"https://pith.science/paper/O2YDGBAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00067&json=true","fetch_graph":"https://pith.science/api/pith-number/O2YDGBAXJSXMX4QP64KPTBP7Y4/graph.json","fetch_events":"https://pith.science/api/pith-number/O2YDGBAXJSXMX4QP64KPTBP7Y4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/action/storage_attestation","attest_author":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/action/author_attestation","sign_citation":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/action/citation_signature","submit_replication":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/action/replication_record"}},"created_at":"2026-05-18T01:07:54.123933+00:00","updated_at":"2026-05-18T01:07:54.123933+00:00"}