{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ZAGHF6QQHJIMB54FZARXFTG3H5","short_pith_number":"pith:ZAGHF6QQ","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"},"canonical_sha256":"c80c72fa103a50c0f785c82372ccdb3f56fbfed991f3cf725066912367a67229","source":{"kind":"arxiv","id":"0901.0929","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0929","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0929v2","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0929","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZAGHF6QQHJIM","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ZAGHF6QQHJIMB54F","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ZAGHF6QQ","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ZAGHF6QQHJIMB54FZARXFTG3H5","target":"record","payload":{"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"},"canonical_sha256":"c80c72fa103a50c0f785c82372ccdb3f56fbfed991f3cf725066912367a67229","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"},"source_kind":"arxiv","source_id":"0901.0929","source_version":2,"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-18T03:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qAXCU+sx9XS0xOwUI3MC3vdPbmW/3Zf+VmiulZNdOIA0/9NC6hTqMQjy+bacat8fAEsFd3GkKjvlEYqDTyb4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:16:23.332233Z"},"content_sha256":"76463324a46a9600a1f26d0691c7cc60e0e1d9f8c3d2d42c669438cd2c58176c","schema_version":"1.0","event_id":"sha256:76463324a46a9600a1f26d0691c7cc60e0e1d9f8c3d2d42c669438cd2c58176c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ZAGHF6QQHJIMB54FZARXFTG3H5","target":"graph","payload":{"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"},"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-18T03:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B33YMJ5sSroNVTpd4DcDVeniRzYNF6w1mVgtyPsTOipOxsArVHOJB3Qg4/PiTR0pgY8LjRtNsv0DCLa3VaMjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:16:23.332599Z"},"content_sha256":"dbdfdae1b256d59c49f00a7e288c89e6b16aa3945aaa3c0c13a11d6b578ceec4","schema_version":"1.0","event_id":"sha256:dbdfdae1b256d59c49f00a7e288c89e6b16aa3945aaa3c0c13a11d6b578ceec4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/bundle.json","state_url":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/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-06-24T04:16:23Z","links":{"resolver":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5","bundle":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/bundle.json","state":"https://pith.science/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAGHF6QQHJIMB54FZARXFTG3H5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ZAGHF6QQHJIMB54FZARXFTG3H5","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":"39d54c39478128b0df7d6ef5bc88c15dea58ebdde520974c7df538b331ae6306","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-07T21:07:59Z","title_canon_sha256":"256b6a5384e426cd2ba3701817f51cb12c210392dc04023d6bfbc07f4369b897"},"schema_version":"1.0","source":{"id":"0901.0929","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0929","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0929v2","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0929","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZAGHF6QQHJIM","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ZAGHF6QQHJIMB54F","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ZAGHF6QQ","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:dbdfdae1b256d59c49f00a7e288c89e6b16aa3945aaa3c0c13a11d6b578ceec4","target":"graph","created_at":"2026-05-18T03:15:21Z","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":"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","authors_text":"Balazs Szegedy, Laszlo Lovasz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-07T21:07:59Z","title":"Finitely forcible graphons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0929","kind":"arxiv","version":2},"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:76463324a46a9600a1f26d0691c7cc60e0e1d9f8c3d2d42c669438cd2c58176c","target":"record","created_at":"2026-05-18T03:15:21Z","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":"39d54c39478128b0df7d6ef5bc88c15dea58ebdde520974c7df538b331ae6306","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-07T21:07:59Z","title_canon_sha256":"256b6a5384e426cd2ba3701817f51cb12c210392dc04023d6bfbc07f4369b897"},"schema_version":"1.0","source":{"id":"0901.0929","kind":"arxiv","version":2}},"canonical_sha256":"c80c72fa103a50c0f785c82372ccdb3f56fbfed991f3cf725066912367a67229","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c80c72fa103a50c0f785c82372ccdb3f56fbfed991f3cf725066912367a67229","first_computed_at":"2026-05-18T03:15:21.300141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:21.300141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rpHyr1ZJDPG0thFsgEFgtxYTmQKqiDMAzB1yKtez32a9LfHeXKNaH6fmUGDJjqyDgNEqmzAlPaaDnjModK+jAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:21.301002Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.0929","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76463324a46a9600a1f26d0691c7cc60e0e1d9f8c3d2d42c669438cd2c58176c","sha256:dbdfdae1b256d59c49f00a7e288c89e6b16aa3945aaa3c0c13a11d6b578ceec4"],"state_sha256":"95e9b37ed5f3e3067264940e52e31238cc567c7c947f590281c98aca871e4e9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wxt0WW1ljCgy/IBmxbPFqSpdakl1HRX+6orYvLKe0SSDt4UFxd91k4O/9+BTocCxvNrkP+66O8+ki3tvIRX8Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:16:23.334528Z","bundle_sha256":"1e12ee447f8a27bb02d79f287c56494f7c183ff6f8b15bfe93051981672e9673"}}