{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JYPAEVEQUTBH2SE4UACTWD6SH4","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":"b723fdc117cb248e8ad114710736745479bc1f5df3eefc7dc5fb8f9e7801bfb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-30T01:52:00Z","title_canon_sha256":"88349e8e3006891f686012e211f401d315f56d5da0242f2bc77b81fb55cd2f32"},"schema_version":"1.0","source":{"id":"1111.7029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.7029","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.7029v1","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.7029","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"JYPAEVEQUTBH","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JYPAEVEQUTBH2SE4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JYPAEVEQ","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:209357f698b7bebeafd120b212c70a1bda963b8b8cb21eed12146af7e1d03f83","target":"graph","created_at":"2026-05-18T04:07:18Z","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":"In this paper we deal with a Tur\\'an-type problem: given a positive integer n and a forbidden graph H, how many edges can there be in a graph on n vertices without a subgraph H? How does a graph look like if it has this extremal edge number?\n  The forbidden graph in this article is a clique-path: a path of length k where each edge is extended to an r-clique, r >2. We determine both the extremal number and the extremal graphs for sufficiently large n.","authors_text":"Roman Glebov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-30T01:52:00Z","title":"Extremal graphs for clique-paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.7029","kind":"arxiv","version":1},"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:c472af4686cc0fc06d73113d38177ec4cfb21a7b282947a91ad125d065194838","target":"record","created_at":"2026-05-18T04:07:18Z","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":"b723fdc117cb248e8ad114710736745479bc1f5df3eefc7dc5fb8f9e7801bfb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-30T01:52:00Z","title_canon_sha256":"88349e8e3006891f686012e211f401d315f56d5da0242f2bc77b81fb55cd2f32"},"schema_version":"1.0","source":{"id":"1111.7029","kind":"arxiv","version":1}},"canonical_sha256":"4e1e025490a4c27d489ca0053b0fd23f385ff777115f4fa37ba2db6d3931a083","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e1e025490a4c27d489ca0053b0fd23f385ff777115f4fa37ba2db6d3931a083","first_computed_at":"2026-05-18T04:07:18.992506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:18.992506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vj2gUJP2TvarmjyaAznyMn7q9Ix0IVsf9fPKJN73JRsH3PWtNVseFnqwwWlmBult98DIuOTOwO2h29IMElzpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:18.993070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.7029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c472af4686cc0fc06d73113d38177ec4cfb21a7b282947a91ad125d065194838","sha256:209357f698b7bebeafd120b212c70a1bda963b8b8cb21eed12146af7e1d03f83"],"state_sha256":"a8f2e53f8f9630d9f1b5ad07607a0555a8e0accd8e0c0cb94680d7e9e41faebc"}