{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KNULKXAXTIZXEIBOJPDPWE3KI2","short_pith_number":"pith:KNULKXAX","canonical_record":{"source":{"id":"1307.5967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T07:48:51Z","cross_cats_sorted":[],"title_canon_sha256":"1c33531e7767982ff339b3dc6bd024f9b70da5e4cf302a5182aef1f541980d3f","abstract_canon_sha256":"ba59b7b0e28ba46ca87f82029fdbb845f0a3cc6c6f8c6f5067cceae13d850adc"},"schema_version":"1.0"},"canonical_sha256":"5368b55c179a3372202e4bc6fb136a4693cde03b0885182ce6b2aa61a3600981","source":{"kind":"arxiv","id":"1307.5967","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5967","created_at":"2026-05-18T00:28:27Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5967v2","created_at":"2026-05-18T00:28:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5967","created_at":"2026-05-18T00:28:27Z"},{"alias_kind":"pith_short_12","alias_value":"KNULKXAXTIZX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KNULKXAXTIZXEIBO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KNULKXAX","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KNULKXAXTIZXEIBOJPDPWE3KI2","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T07:48:51Z","cross_cats_sorted":[],"title_canon_sha256":"1c33531e7767982ff339b3dc6bd024f9b70da5e4cf302a5182aef1f541980d3f","abstract_canon_sha256":"ba59b7b0e28ba46ca87f82029fdbb845f0a3cc6c6f8c6f5067cceae13d850adc"},"schema_version":"1.0"},"canonical_sha256":"5368b55c179a3372202e4bc6fb136a4693cde03b0885182ce6b2aa61a3600981","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:27.720509Z","signature_b64":"bY1hTN2dW8eWVuadCeTNZcYNK5a3S331ynHW5ZLmZiOMC4SpgkKhClMyrtmAjwTwHhLmy12cZZ+FgE1r1HQVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5368b55c179a3372202e4bc6fb136a4693cde03b0885182ce6b2aa61a3600981","last_reissued_at":"2026-05-18T00:28:27.719777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:27.719777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5967","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-18T00:28:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YDKW221pTAeQLZx6dnM45e+ys3tourWw9q/px6wL/lTh0WeV7A98sIRNUrLYTXgrs2iebper1d7LjurLUxBaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:33:32.707980Z"},"content_sha256":"4d9ab2b52d0650f0d8058541aa55adddd3f9bf458822071f3321dfd553b19e3c","schema_version":"1.0","event_id":"sha256:4d9ab2b52d0650f0d8058541aa55adddd3f9bf458822071f3321dfd553b19e3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KNULKXAXTIZXEIBOJPDPWE3KI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The typical structure of sparse $K_{r+1}$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'ozsef Balogh, Lutz Warnke, Robert Morris, Wojciech Samotij","submitted_at":"2013-07-23T07:48:51Z","abstract_excerpt":"Two central topics of study in combinatorics are the so-called evolution of random graphs, introduced by the seminal work of Erd\\H{o}s and R\\'enyi, and the family of $H$-free graphs, that is, graphs which do not contain a subgraph isomorphic to a given (usually small) graph $H$. A widely studied problem that lies at the interface of these two areas is that of determining how the structure of a typical $H$-free graph with $n$ vertices and $m$ edges changes as $m$ grows from $0$ to $\\text{ex}(n,H)$. In this paper, we resolve this problem in the case when $H$ is a clique, extending a classical re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5967","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-18T00:28:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jw1uJqCyIBtgEbyDE3jKaupLy90TZsv+O387jVNnSwtrO8SOvWC6tn9nAEP4EEBHqlHhLfjKF9zUCFyqwlpMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:33:32.708341Z"},"content_sha256":"cf52b9d66fab30f9c97fabba0546a4649c5faf8f390c750ad46ea09ce10678eb","schema_version":"1.0","event_id":"sha256:cf52b9d66fab30f9c97fabba0546a4649c5faf8f390c750ad46ea09ce10678eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNULKXAXTIZXEIBOJPDPWE3KI2/bundle.json","state_url":"https://pith.science/pith/KNULKXAXTIZXEIBOJPDPWE3KI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNULKXAXTIZXEIBOJPDPWE3KI2/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-28T01:33:32Z","links":{"resolver":"https://pith.science/pith/KNULKXAXTIZXEIBOJPDPWE3KI2","bundle":"https://pith.science/pith/KNULKXAXTIZXEIBOJPDPWE3KI2/bundle.json","state":"https://pith.science/pith/KNULKXAXTIZXEIBOJPDPWE3KI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNULKXAXTIZXEIBOJPDPWE3KI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KNULKXAXTIZXEIBOJPDPWE3KI2","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":"ba59b7b0e28ba46ca87f82029fdbb845f0a3cc6c6f8c6f5067cceae13d850adc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T07:48:51Z","title_canon_sha256":"1c33531e7767982ff339b3dc6bd024f9b70da5e4cf302a5182aef1f541980d3f"},"schema_version":"1.0","source":{"id":"1307.5967","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5967","created_at":"2026-05-18T00:28:27Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5967v2","created_at":"2026-05-18T00:28:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5967","created_at":"2026-05-18T00:28:27Z"},{"alias_kind":"pith_short_12","alias_value":"KNULKXAXTIZX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KNULKXAXTIZXEIBO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KNULKXAX","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:cf52b9d66fab30f9c97fabba0546a4649c5faf8f390c750ad46ea09ce10678eb","target":"graph","created_at":"2026-05-18T00:28:27Z","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":"Two central topics of study in combinatorics are the so-called evolution of random graphs, introduced by the seminal work of Erd\\H{o}s and R\\'enyi, and the family of $H$-free graphs, that is, graphs which do not contain a subgraph isomorphic to a given (usually small) graph $H$. A widely studied problem that lies at the interface of these two areas is that of determining how the structure of a typical $H$-free graph with $n$ vertices and $m$ edges changes as $m$ grows from $0$ to $\\text{ex}(n,H)$. In this paper, we resolve this problem in the case when $H$ is a clique, extending a classical re","authors_text":"J\\'ozsef Balogh, Lutz Warnke, Robert Morris, Wojciech Samotij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T07:48:51Z","title":"The typical structure of sparse $K_{r+1}$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5967","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:4d9ab2b52d0650f0d8058541aa55adddd3f9bf458822071f3321dfd553b19e3c","target":"record","created_at":"2026-05-18T00:28:27Z","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":"ba59b7b0e28ba46ca87f82029fdbb845f0a3cc6c6f8c6f5067cceae13d850adc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T07:48:51Z","title_canon_sha256":"1c33531e7767982ff339b3dc6bd024f9b70da5e4cf302a5182aef1f541980d3f"},"schema_version":"1.0","source":{"id":"1307.5967","kind":"arxiv","version":2}},"canonical_sha256":"5368b55c179a3372202e4bc6fb136a4693cde03b0885182ce6b2aa61a3600981","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5368b55c179a3372202e4bc6fb136a4693cde03b0885182ce6b2aa61a3600981","first_computed_at":"2026-05-18T00:28:27.719777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:27.719777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bY1hTN2dW8eWVuadCeTNZcYNK5a3S331ynHW5ZLmZiOMC4SpgkKhClMyrtmAjwTwHhLmy12cZZ+FgE1r1HQVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:27.720509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5967","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d9ab2b52d0650f0d8058541aa55adddd3f9bf458822071f3321dfd553b19e3c","sha256:cf52b9d66fab30f9c97fabba0546a4649c5faf8f390c750ad46ea09ce10678eb"],"state_sha256":"50fdecc13a8d94f6d04a3cd3348ebe0f80341c06385a61ca52f18f84df129bf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tTK+rOVtD5jxwm8HCe3YzaZD5J+H2XGKILBJ6DPhavwiugPoy9N/m62DYtrojT49gxSX7ZmmqENqUydYYpqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:33:32.710351Z","bundle_sha256":"d32f61d4dc8356e4a03651665617befd85dd27114c35d2b2d744106827f46419"}}