{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I4VZPGQHQFW4HTOKUAHH6WORJP","short_pith_number":"pith:I4VZPGQH","canonical_record":{"source":{"id":"1309.2927","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-11T19:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"1af3a82c1dcdf2b079b920b3b9351bb2d6241795c255a56888041aa9158e0184","abstract_canon_sha256":"e7bb00c17e8f22aeb1523d4774c6a98b5b7134d38a4d24c3a26557f412b296cc"},"schema_version":"1.0"},"canonical_sha256":"472b979a07816dc3cdcaa00e7f59d14be584f3588e74269d63274d7596540064","source":{"kind":"arxiv","id":"1309.2927","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2927","created_at":"2026-05-18T01:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2927v3","created_at":"2026-05-18T01:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2927","created_at":"2026-05-18T01:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"I4VZPGQHQFW4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I4VZPGQHQFW4HTOK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I4VZPGQH","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I4VZPGQHQFW4HTOKUAHH6WORJP","target":"record","payload":{"canonical_record":{"source":{"id":"1309.2927","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-11T19:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"1af3a82c1dcdf2b079b920b3b9351bb2d6241795c255a56888041aa9158e0184","abstract_canon_sha256":"e7bb00c17e8f22aeb1523d4774c6a98b5b7134d38a4d24c3a26557f412b296cc"},"schema_version":"1.0"},"canonical_sha256":"472b979a07816dc3cdcaa00e7f59d14be584f3588e74269d63274d7596540064","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:15.451908Z","signature_b64":"v3lAiCOjZg/YNAzr536b543Nnij2tq7ICmRwSi3XCXz+IxuReHst7KOuTC9B9jCXc0YBDyMlb3s2BQAVtMDtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"472b979a07816dc3cdcaa00e7f59d14be584f3588e74269d63274d7596540064","last_reissued_at":"2026-05-18T01:27:15.451394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:15.451394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.2927","source_version":3,"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:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCxIbJx293qsu5IC61alLRlDhTPtI8iGF1yUbeex2Xz01DbDTvzC9mVdH4WmHuxFyTiZQNo+c6w9o8ShWf7JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:41:20.814308Z"},"content_sha256":"9e1366ae8e5c72986b61baf0ffc5f4e88fa254d3ad2765658e68a65ea4d4d9fc","schema_version":"1.0","event_id":"sha256:9e1366ae8e5c72986b61baf0ffc5f4e88fa254d3ad2765658e68a65ea4d4d9fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I4VZPGQHQFW4HTOKUAHH6WORJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of $C_{2l}$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Saxton, Robert Morris","submitted_at":"2013-09-11T19:51:46Z","abstract_excerpt":"One of the most basic questions one can ask about a graph $H$ is: how many $H$-free graphs on $n$ vertices are there? For non-bipartite $H$, the answer to this question has been well-understood since 1986, when Erd\\H{o}s, Frankl and R\\\"odl proved that there are $2^{(1 + o(1)) ex(n,H)}$ such graphs. For bipartite graphs, however, much less is known: even the weaker bound $2^{O(ex(n,H))}$ has been proven in only a few special cases: for cycles of length four and six, and for some complete bipartite graphs.\n  For even cycles, Bondy and Simonovits proved in the 1970s that ex$(n,C_{2l}) = O( n^{1 +"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2927","kind":"arxiv","version":3},"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:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"46WM7UcwAN6JefQ6/dpPNhHhRi0maboiSGmVOACiP4a1gNrRGCwYlLVNkBaWkOXqzWEn5TsL3Tnhnad/xamNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:41:20.814686Z"},"content_sha256":"af0f2a86f93763f200d9caaa4931c320dd08af2e0406edefe52d3d09de67fcee","schema_version":"1.0","event_id":"sha256:af0f2a86f93763f200d9caaa4931c320dd08af2e0406edefe52d3d09de67fcee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4VZPGQHQFW4HTOKUAHH6WORJP/bundle.json","state_url":"https://pith.science/pith/I4VZPGQHQFW4HTOKUAHH6WORJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4VZPGQHQFW4HTOKUAHH6WORJP/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-31T03:41:20Z","links":{"resolver":"https://pith.science/pith/I4VZPGQHQFW4HTOKUAHH6WORJP","bundle":"https://pith.science/pith/I4VZPGQHQFW4HTOKUAHH6WORJP/bundle.json","state":"https://pith.science/pith/I4VZPGQHQFW4HTOKUAHH6WORJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4VZPGQHQFW4HTOKUAHH6WORJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I4VZPGQHQFW4HTOKUAHH6WORJP","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":"e7bb00c17e8f22aeb1523d4774c6a98b5b7134d38a4d24c3a26557f412b296cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-11T19:51:46Z","title_canon_sha256":"1af3a82c1dcdf2b079b920b3b9351bb2d6241795c255a56888041aa9158e0184"},"schema_version":"1.0","source":{"id":"1309.2927","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2927","created_at":"2026-05-18T01:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2927v3","created_at":"2026-05-18T01:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2927","created_at":"2026-05-18T01:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"I4VZPGQHQFW4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I4VZPGQHQFW4HTOK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I4VZPGQH","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:af0f2a86f93763f200d9caaa4931c320dd08af2e0406edefe52d3d09de67fcee","target":"graph","created_at":"2026-05-18T01:27:15Z","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":"One of the most basic questions one can ask about a graph $H$ is: how many $H$-free graphs on $n$ vertices are there? For non-bipartite $H$, the answer to this question has been well-understood since 1986, when Erd\\H{o}s, Frankl and R\\\"odl proved that there are $2^{(1 + o(1)) ex(n,H)}$ such graphs. For bipartite graphs, however, much less is known: even the weaker bound $2^{O(ex(n,H))}$ has been proven in only a few special cases: for cycles of length four and six, and for some complete bipartite graphs.\n  For even cycles, Bondy and Simonovits proved in the 1970s that ex$(n,C_{2l}) = O( n^{1 +","authors_text":"David Saxton, Robert Morris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-11T19:51:46Z","title":"The number of $C_{2l}$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2927","kind":"arxiv","version":3},"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:9e1366ae8e5c72986b61baf0ffc5f4e88fa254d3ad2765658e68a65ea4d4d9fc","target":"record","created_at":"2026-05-18T01:27:15Z","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":"e7bb00c17e8f22aeb1523d4774c6a98b5b7134d38a4d24c3a26557f412b296cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-11T19:51:46Z","title_canon_sha256":"1af3a82c1dcdf2b079b920b3b9351bb2d6241795c255a56888041aa9158e0184"},"schema_version":"1.0","source":{"id":"1309.2927","kind":"arxiv","version":3}},"canonical_sha256":"472b979a07816dc3cdcaa00e7f59d14be584f3588e74269d63274d7596540064","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"472b979a07816dc3cdcaa00e7f59d14be584f3588e74269d63274d7596540064","first_computed_at":"2026-05-18T01:27:15.451394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:15.451394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v3lAiCOjZg/YNAzr536b543Nnij2tq7ICmRwSi3XCXz+IxuReHst7KOuTC9B9jCXc0YBDyMlb3s2BQAVtMDtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:15.451908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.2927","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e1366ae8e5c72986b61baf0ffc5f4e88fa254d3ad2765658e68a65ea4d4d9fc","sha256:af0f2a86f93763f200d9caaa4931c320dd08af2e0406edefe52d3d09de67fcee"],"state_sha256":"3a8940bc2c5c4d1795063ef29dfe7ce5c8a867191a07761a3d6e92210e6e97aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Pu2AVq/Opk1cv7/puWmDtrOExNU1fnaxzl40RuL8OAvamy94kX5EOPPg84x/wxBB2z3Mb7j3w7xzX788uWqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:41:20.816943Z","bundle_sha256":"8f6df8648644961d5735648257b5de5c207cd7edd136a5a9279b7814b946d8a9"}}