{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3WDFN6WJNXDPTCZ7JPJ3PLZWC5","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":"22139a89369b22d0b65752045d7f50cd62bd86e93d09bbb0ceacfa6dd37baf8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-10T03:53:20Z","title_canon_sha256":"1be98f00c5d5b7aa40a33bd4b3fab8f3e610cd9f3912922d1e93dc5b95ca0829"},"schema_version":"1.0","source":{"id":"1702.03060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03060","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03060v1","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03060","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"3WDFN6WJNXDP","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3WDFN6WJNXDPTCZ7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3WDFN6WJ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:ca96fb0f0a22cc7961ddda278319c9578dbb03c234297b249726073235ccb552","target":"graph","created_at":"2026-05-18T00:50:58Z","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":"The Erd\\H{o}s-S\\'{o}s Conjecture states that every graph with average degree more than $k-2$ contains all trees of order $k$ as subgraphs. In this paper, we consider a variation of the above conjecture: studying the maximum size of an $(n,m)$-bipartite graph which does not contain all $(k,l)$-bipartite trees for given integers $n\\ge m$ and $k\\ge l$. In particular, we determine that the maximum size of an $(n,m)$-bipartite graph which does not contain all $(n,m)$-bipartite trees as subgraphs (or all $(k,2)$-bipartite trees as subgraphs, respectively). Furthermore, all these extremal graphs are ","authors_text":"Long-tu Yuan, Xiao-Dong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-10T03:53:20Z","title":"A Variation of the Erd\\H{o}s-S\\'os Conjecture in Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03060","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:c2b7259ab2b3e3ad5948772408351bff69c855e45f49bd818d2168d7d3caf065","target":"record","created_at":"2026-05-18T00:50:58Z","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":"22139a89369b22d0b65752045d7f50cd62bd86e93d09bbb0ceacfa6dd37baf8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-10T03:53:20Z","title_canon_sha256":"1be98f00c5d5b7aa40a33bd4b3fab8f3e610cd9f3912922d1e93dc5b95ca0829"},"schema_version":"1.0","source":{"id":"1702.03060","kind":"arxiv","version":1}},"canonical_sha256":"dd8656fac96dc6f98b3f4bd3b7af36177ddd67874181ced520236909a36afb8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd8656fac96dc6f98b3f4bd3b7af36177ddd67874181ced520236909a36afb8c","first_computed_at":"2026-05-18T00:50:58.737383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:58.737383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/V+VHqV+ezcvjGT3JxI/IY7dsbSYrbJ4HqpgLjhJHaOmnnKKNBNvKjdNitlC1gqnBMTua/1Q6xzC8UL2GR2zAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:58.737861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2b7259ab2b3e3ad5948772408351bff69c855e45f49bd818d2168d7d3caf065","sha256:ca96fb0f0a22cc7961ddda278319c9578dbb03c234297b249726073235ccb552"],"state_sha256":"f3fb6f0841bf788031b01f33f909a03d95c5619de6f8d273d1c1ef8f74f54190"}