{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZHEOP7BYM63QZOQ26IZSL6H4BE","short_pith_number":"pith:ZHEOP7BY","canonical_record":{"source":{"id":"1810.04746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T20:47:16Z","cross_cats_sorted":[],"title_canon_sha256":"5cc10952bc2faa8df518f8f7f0567477eafe7abf7f223789ddb4c90a2c1ec8aa","abstract_canon_sha256":"2bee76c05e2a91f1e787e5b39a1aa1587a41439f573179390c44f079478677bd"},"schema_version":"1.0"},"canonical_sha256":"c9c8e7fc3867b70cba1af23325f8fc0909e5514945a5118eeefe270853ea0872","source":{"kind":"arxiv","id":"1810.04746","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04746","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04746v1","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04746","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZHEOP7BYM63Q","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZHEOP7BYM63QZOQ2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZHEOP7BY","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZHEOP7BYM63QZOQ26IZSL6H4BE","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T20:47:16Z","cross_cats_sorted":[],"title_canon_sha256":"5cc10952bc2faa8df518f8f7f0567477eafe7abf7f223789ddb4c90a2c1ec8aa","abstract_canon_sha256":"2bee76c05e2a91f1e787e5b39a1aa1587a41439f573179390c44f079478677bd"},"schema_version":"1.0"},"canonical_sha256":"c9c8e7fc3867b70cba1af23325f8fc0909e5514945a5118eeefe270853ea0872","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:36.019540Z","signature_b64":"LDPtT6wq8k4wgHWLdw7yyYQ3GB+pTyGFZfRWXvM+dF6YgOtAujt3qfMkN2mgvy4SIEXVbzE6dKK4ezpNhF61BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9c8e7fc3867b70cba1af23325f8fc0909e5514945a5118eeefe270853ea0872","last_reissued_at":"2026-05-18T00:03:36.019114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:36.019114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04746","source_version":1,"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:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"atGynOZC9Sv1hwXdd0gCbm7Kp5HU73tSdxnQ44DGMo+AwTcAEaxir0YjuOMgjjfrUlX3spdflXzzm2nR9xxZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:08:22.579089Z"},"content_sha256":"3db10c778345af5534850ca6e6521255798ade30f5064142eb5d0f06f4a5233c","schema_version":"1.0","event_id":"sha256:3db10c778345af5534850ca6e6521255798ade30f5064142eb5d0f06f4a5233c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZHEOP7BYM63QZOQ26IZSL6H4BE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability and Erd\\H{o}s--Stone type results for $F$-free graphs with a fixed number of edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Uzzell, Jamie Radcliffe","submitted_at":"2018-10-10T20:47:16Z","abstract_excerpt":"A fundamental problem of extremal graph theory is to ask, 'What is the maximum number of edges in an $F$-free graph on $n$ vertices?' Recently Alon and Shikhelman proposed a more general, subgraph counting, version of this question. They considered the question of determining the maximum number of copies of a fixed graph $T$ in an $F$-free graph on $n$ vertices.\n  In this more general context, where we are no longer counting edges, it is also natural to ask what is the maximum number of copies of $T$ in an $F$-free graph with $m$ edges and no restriction on the number of vertices. Frohmader, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04746","kind":"arxiv","version":1},"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:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dln1Tz/Xxqb0nPnwI+4X/j2GA5VU00+HtuFNqGfeynFkWBW6KFrS5IaqmMc6zNKOobh/f1sVl2pkclTQ/ZOfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:08:22.579737Z"},"content_sha256":"9e83b11ee51a4f7176a7afd8fe3a18b9ec7f6c68ab8d15f4251e06afa125345d","schema_version":"1.0","event_id":"sha256:9e83b11ee51a4f7176a7afd8fe3a18b9ec7f6c68ab8d15f4251e06afa125345d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHEOP7BYM63QZOQ26IZSL6H4BE/bundle.json","state_url":"https://pith.science/pith/ZHEOP7BYM63QZOQ26IZSL6H4BE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHEOP7BYM63QZOQ26IZSL6H4BE/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-07T23:08:22Z","links":{"resolver":"https://pith.science/pith/ZHEOP7BYM63QZOQ26IZSL6H4BE","bundle":"https://pith.science/pith/ZHEOP7BYM63QZOQ26IZSL6H4BE/bundle.json","state":"https://pith.science/pith/ZHEOP7BYM63QZOQ26IZSL6H4BE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHEOP7BYM63QZOQ26IZSL6H4BE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZHEOP7BYM63QZOQ26IZSL6H4BE","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":"2bee76c05e2a91f1e787e5b39a1aa1587a41439f573179390c44f079478677bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T20:47:16Z","title_canon_sha256":"5cc10952bc2faa8df518f8f7f0567477eafe7abf7f223789ddb4c90a2c1ec8aa"},"schema_version":"1.0","source":{"id":"1810.04746","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04746","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04746v1","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04746","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZHEOP7BYM63Q","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZHEOP7BYM63QZOQ2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZHEOP7BY","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:9e83b11ee51a4f7176a7afd8fe3a18b9ec7f6c68ab8d15f4251e06afa125345d","target":"graph","created_at":"2026-05-18T00:03:36Z","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":"A fundamental problem of extremal graph theory is to ask, 'What is the maximum number of edges in an $F$-free graph on $n$ vertices?' Recently Alon and Shikhelman proposed a more general, subgraph counting, version of this question. They considered the question of determining the maximum number of copies of a fixed graph $T$ in an $F$-free graph on $n$ vertices.\n  In this more general context, where we are no longer counting edges, it is also natural to ask what is the maximum number of copies of $T$ in an $F$-free graph with $m$ edges and no restriction on the number of vertices. Frohmader, i","authors_text":"Andrew Uzzell, Jamie Radcliffe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T20:47:16Z","title":"Stability and Erd\\H{o}s--Stone type results for $F$-free graphs with a fixed number of edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04746","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:3db10c778345af5534850ca6e6521255798ade30f5064142eb5d0f06f4a5233c","target":"record","created_at":"2026-05-18T00:03:36Z","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":"2bee76c05e2a91f1e787e5b39a1aa1587a41439f573179390c44f079478677bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T20:47:16Z","title_canon_sha256":"5cc10952bc2faa8df518f8f7f0567477eafe7abf7f223789ddb4c90a2c1ec8aa"},"schema_version":"1.0","source":{"id":"1810.04746","kind":"arxiv","version":1}},"canonical_sha256":"c9c8e7fc3867b70cba1af23325f8fc0909e5514945a5118eeefe270853ea0872","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9c8e7fc3867b70cba1af23325f8fc0909e5514945a5118eeefe270853ea0872","first_computed_at":"2026-05-18T00:03:36.019114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:36.019114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LDPtT6wq8k4wgHWLdw7yyYQ3GB+pTyGFZfRWXvM+dF6YgOtAujt3qfMkN2mgvy4SIEXVbzE6dKK4ezpNhF61BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:36.019540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04746","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3db10c778345af5534850ca6e6521255798ade30f5064142eb5d0f06f4a5233c","sha256:9e83b11ee51a4f7176a7afd8fe3a18b9ec7f6c68ab8d15f4251e06afa125345d"],"state_sha256":"6895de6c03f2f2b6da2e5c708f16e86d7728132aec6e7ef58913724ee6e2f416"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YKFiqgRuL4fQ7FTAU+qGeTDyQ48GHQLXUBE806q+djIu7OFzGglrm6rCYs0uTdAlWmlw2D1HUQaU/58Q8QN3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:08:22.583591Z","bundle_sha256":"b6b3ed322ac5ca1a7ca93406adebc9efe03faca17aef35741f71763be2828a97"}}