{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:O5FRTMYEF2J4BTD5OGQMET2JOG","short_pith_number":"pith:O5FRTMYE","canonical_record":{"source":{"id":"1305.6945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T20:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"432f9ac3610345998641c8d72141133906426cfd8eafc893af66a95d3d868681","abstract_canon_sha256":"3f55802f25ac3be9d7e7c1ac71efd8716e97ca80f092b89f15c3b166ad9cbb05"},"schema_version":"1.0"},"canonical_sha256":"774b19b3042e93c0cc7d71a0c24f4971927a8647d910952ea9d3928c1190825d","source":{"kind":"arxiv","id":"1305.6945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6945","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6945v1","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6945","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"O5FRTMYEF2J4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O5FRTMYEF2J4BTD5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O5FRTMYE","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:O5FRTMYEF2J4BTD5OGQMET2JOG","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T20:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"432f9ac3610345998641c8d72141133906426cfd8eafc893af66a95d3d868681","abstract_canon_sha256":"3f55802f25ac3be9d7e7c1ac71efd8716e97ca80f092b89f15c3b166ad9cbb05"},"schema_version":"1.0"},"canonical_sha256":"774b19b3042e93c0cc7d71a0c24f4971927a8647d910952ea9d3928c1190825d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:16.808636Z","signature_b64":"vbv3jWNR2Wi3KR/UIo2C7oQGyEF7pgbpleojXiNcfOrmSEs5dw0MBwOFZgao0MyMTEdEwXkdjkmYFLWuTMt3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"774b19b3042e93c0cc7d71a0c24f4971927a8647d910952ea9d3928c1190825d","last_reissued_at":"2026-05-18T03:22:16.808204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:16.808204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6945","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-18T03:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0HamfbVe8i7UlbUAmOUCxoiJRErMtc/bbsMq1/BM9V+7Etm6Th00Bior6Tdtrjk8v8haYWPu6GE+6YX6qhDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:06:58.628628Z"},"content_sha256":"6ee840712d1e49d6bfde2356b7358165bc1ce1e8a5cb6d750a6af97b993ef2ad","schema_version":"1.0","event_id":"sha256:6ee840712d1e49d6bfde2356b7358165bc1ce1e8a5cb6d750a6af97b993ef2ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:O5FRTMYEF2J4BTD5OGQMET2JOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infinite Tur\\'an problems for bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Xing Peng","submitted_at":"2013-05-29T20:42:47Z","abstract_excerpt":"We consider an infinite version of the bipartite Tur\\'{a}n problem. Let $G$ be an infinite graph with $V(G) = \\mathbb{N}$ and let $G_n$ be the $n$-vertex subgraph of $G$ induced by the vertices $\\{1,2, \\dots, n \\}$. We show that if $G$ is $K_{2,t+1}$-free then for infinitely many $n$, $e(G_n) \\leq 0.471 \\sqrt{t} n^{3/2}$. Using the $K_{2,t+1}$-free graphs constructed by F\\\"{u}redi, we construct an infinite $K_{2,t+1}$-free graph with $e(G_n) \\geq 0.23 \\sqrt{t}n^{3/2}$ for all $n \\geq n_0$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6945","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-18T03:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RjBtGBS1OTsWp7Aff3qTq6KlUZfvXYBiYngYeTUTKt/+vi2S94pFNWkQsWGsrdKwsqxiwKopw4MQi4v4MqRfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:06:58.628970Z"},"content_sha256":"140ad7e8af2c0ff4bf15fb0f0060e33b80ef39cfafdb7317f4b0fe32b7b3805b","schema_version":"1.0","event_id":"sha256:140ad7e8af2c0ff4bf15fb0f0060e33b80ef39cfafdb7317f4b0fe32b7b3805b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5FRTMYEF2J4BTD5OGQMET2JOG/bundle.json","state_url":"https://pith.science/pith/O5FRTMYEF2J4BTD5OGQMET2JOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5FRTMYEF2J4BTD5OGQMET2JOG/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-02T23:06:58Z","links":{"resolver":"https://pith.science/pith/O5FRTMYEF2J4BTD5OGQMET2JOG","bundle":"https://pith.science/pith/O5FRTMYEF2J4BTD5OGQMET2JOG/bundle.json","state":"https://pith.science/pith/O5FRTMYEF2J4BTD5OGQMET2JOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5FRTMYEF2J4BTD5OGQMET2JOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:O5FRTMYEF2J4BTD5OGQMET2JOG","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":"3f55802f25ac3be9d7e7c1ac71efd8716e97ca80f092b89f15c3b166ad9cbb05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T20:42:47Z","title_canon_sha256":"432f9ac3610345998641c8d72141133906426cfd8eafc893af66a95d3d868681"},"schema_version":"1.0","source":{"id":"1305.6945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6945","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6945v1","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6945","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"O5FRTMYEF2J4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O5FRTMYEF2J4BTD5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O5FRTMYE","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:140ad7e8af2c0ff4bf15fb0f0060e33b80ef39cfafdb7317f4b0fe32b7b3805b","target":"graph","created_at":"2026-05-18T03:22:16Z","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 consider an infinite version of the bipartite Tur\\'{a}n problem. Let $G$ be an infinite graph with $V(G) = \\mathbb{N}$ and let $G_n$ be the $n$-vertex subgraph of $G$ induced by the vertices $\\{1,2, \\dots, n \\}$. We show that if $G$ is $K_{2,t+1}$-free then for infinitely many $n$, $e(G_n) \\leq 0.471 \\sqrt{t} n^{3/2}$. Using the $K_{2,t+1}$-free graphs constructed by F\\\"{u}redi, we construct an infinite $K_{2,t+1}$-free graph with $e(G_n) \\geq 0.23 \\sqrt{t}n^{3/2}$ for all $n \\geq n_0$.","authors_text":"Craig Timmons, Xing Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T20:42:47Z","title":"Infinite Tur\\'an problems for bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6945","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:6ee840712d1e49d6bfde2356b7358165bc1ce1e8a5cb6d750a6af97b993ef2ad","target":"record","created_at":"2026-05-18T03:22:16Z","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":"3f55802f25ac3be9d7e7c1ac71efd8716e97ca80f092b89f15c3b166ad9cbb05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T20:42:47Z","title_canon_sha256":"432f9ac3610345998641c8d72141133906426cfd8eafc893af66a95d3d868681"},"schema_version":"1.0","source":{"id":"1305.6945","kind":"arxiv","version":1}},"canonical_sha256":"774b19b3042e93c0cc7d71a0c24f4971927a8647d910952ea9d3928c1190825d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"774b19b3042e93c0cc7d71a0c24f4971927a8647d910952ea9d3928c1190825d","first_computed_at":"2026-05-18T03:22:16.808204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:16.808204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vbv3jWNR2Wi3KR/UIo2C7oQGyEF7pgbpleojXiNcfOrmSEs5dw0MBwOFZgao0MyMTEdEwXkdjkmYFLWuTMt3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:16.808636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ee840712d1e49d6bfde2356b7358165bc1ce1e8a5cb6d750a6af97b993ef2ad","sha256:140ad7e8af2c0ff4bf15fb0f0060e33b80ef39cfafdb7317f4b0fe32b7b3805b"],"state_sha256":"a44d3be3c5beb97b2c85794b61c1d6f66ea45d2aac85e909937ce4d997a3cdd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pRPK5ARfIKBJpggvspOnqyArTWRFAeTMnClO/jCZ2mky43mrcid+oN5JVOFUwDtdG/HfAYQZvPVkJjstckT2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:06:58.630952Z","bundle_sha256":"f22461d3f431f29b3fe33847184d4458e5f422fc304d81a00e35d9328590019a"}}