{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O2YDGBAXJSXMX4QP64KPTBP7Y4","short_pith_number":"pith:O2YDGBAX","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"},"canonical_sha256":"76b03304174caecbf20ff714f985ffc70b3353330fa6fc2ac9673e7616455679","source":{"kind":"arxiv","id":"1507.00067","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00067","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00067v4","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00067","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"O2YDGBAXJSXM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O2YDGBAXJSXMX4QP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O2YDGBAX","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O2YDGBAXJSXMX4QP64KPTBP7Y4","target":"record","payload":{"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"},"canonical_sha256":"76b03304174caecbf20ff714f985ffc70b3353330fa6fc2ac9673e7616455679","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"},"source_kind":"arxiv","source_id":"1507.00067","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UCf65XLlskVXH79NfMwnmxxx7Vx8jwv2ELxjbMX83AX8I96ys2TjPRt/Cv2uo4uj69oy+BwZTqh+nAYEFbM1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T18:45:23.519255Z"},"content_sha256":"9268acc2de643f5f0fbc7d562b9fed4b7f04131235c52289af453a3073e93464","schema_version":"1.0","event_id":"sha256:9268acc2de643f5f0fbc7d562b9fed4b7f04131235c52289af453a3073e93464"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O2YDGBAXJSXMX4QP64KPTBP7Y4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f72hOeQyRhm2dQtuSfO6b2n9+nnxvcqsESs/WE0VUCq6UoSm1jMIm9ABNSKtEpNlAlICoa38Jv2ADOLtqnqHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T18:45:23.519818Z"},"content_sha256":"8295ac7d688d2b501a29193dc0e48d3db4caa80bd451f259768e079406d739c0","schema_version":"1.0","event_id":"sha256:8295ac7d688d2b501a29193dc0e48d3db4caa80bd451f259768e079406d739c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/bundle.json","state_url":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-18T18:45:23Z","links":{"resolver":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4","bundle":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/bundle.json","state":"https://pith.science/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2YDGBAXJSXMX4QP64KPTBP7Y4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O2YDGBAXJSXMX4QP64KPTBP7Y4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c25a75c80dee634a3758f0515df13e837acba6f26c03775bfc482aacd84a26f9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-30T23:39:51Z","title_canon_sha256":"60900bb01d3b585f398e3ae6365237118c5be9d58ac02d6e26ae07ba596f2629"},"schema_version":"1.0","source":{"id":"1507.00067","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00067","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00067v4","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00067","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"O2YDGBAXJSXM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O2YDGBAXJSXMX4QP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O2YDGBAX","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:8295ac7d688d2b501a29193dc0e48d3db4caa80bd451f259768e079406d739c0","target":"graph","created_at":"2026-05-18T01:07:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 $","authors_text":"Daniel Kral, Jacob W. Cooper, Jonathan A. Noel, Tomas Kaiser","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-30T23:39:51Z","title":"Weak regularity and finitely forcible graph limits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00067","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9268acc2de643f5f0fbc7d562b9fed4b7f04131235c52289af453a3073e93464","target":"record","created_at":"2026-05-18T01:07:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c25a75c80dee634a3758f0515df13e837acba6f26c03775bfc482aacd84a26f9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-30T23:39:51Z","title_canon_sha256":"60900bb01d3b585f398e3ae6365237118c5be9d58ac02d6e26ae07ba596f2629"},"schema_version":"1.0","source":{"id":"1507.00067","kind":"arxiv","version":4}},"canonical_sha256":"76b03304174caecbf20ff714f985ffc70b3353330fa6fc2ac9673e7616455679","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76b03304174caecbf20ff714f985ffc70b3353330fa6fc2ac9673e7616455679","first_computed_at":"2026-05-18T01:07:54.123860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:54.123860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xGKsRPwl9ELQbvNRm0zVY1kqOZ1EX4/FolkhGAR28a324XCY7oAsaS+zakrrqD0UNP9yhe18XrcwpFRLYBRIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:54.124311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00067","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9268acc2de643f5f0fbc7d562b9fed4b7f04131235c52289af453a3073e93464","sha256:8295ac7d688d2b501a29193dc0e48d3db4caa80bd451f259768e079406d739c0"],"state_sha256":"cba1465bbb5846ef44627376cf46bd64f56d055cd246bdcb852fd8bae17982ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XA5WCa4fosNVeeejsL36To6afzptkFJFK8CeH2h68qBm7k7hNTw+7Uz5sxYOBPWZvRQyC+TEEVCiugGZwT8lAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T18:45:23.521643Z","bundle_sha256":"2107959708d59c85eeeeba8608309217fffec8d7d588d18bc14fb25d5529a342"}}