{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RFRIEAUJGB7RG2CUMTDQCTLAC6","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":"b9899f21082f46849690a7e5e1ea3518e8f341e197bc90935e8d4991e0b9a105","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-05T00:38:24Z","title_canon_sha256":"a119a1337e6be8391e98bb542c2f55442d06929362685d6d8eec73ce08bf98a1"},"schema_version":"1.0","source":{"id":"1702.01355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01355","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01355v1","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01355","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"RFRIEAUJGB7R","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFRIEAUJGB7RG2CU","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFRIEAUJ","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:182c7b9f2ad03c1d138f2c2acb67ccf90978e064894c648a4203f9263f1b1885","target":"graph","created_at":"2026-05-18T00:51:23Z","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 purpose of this paper is to characterize graphs that do not have a large $K_{2,n}$-minor. As corollaries, it is proved that, for any given positive integer $n$, every sufficiently large 3-connected graph with minimum degree at least six, every 4-connected graph with a vertex of sufficiently high degree, and every sufficiently large 5-connected graph must have a $K_{2,n}$-minor.","authors_text":"Guoli Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-05T00:38:24Z","title":"Graphs without large $K_{2,n}$-minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01355","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:c2a04c87f4f135e1b73d15df83b379db14486dff64fb016b850aaba7cf5071d4","target":"record","created_at":"2026-05-18T00:51:23Z","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":"b9899f21082f46849690a7e5e1ea3518e8f341e197bc90935e8d4991e0b9a105","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-05T00:38:24Z","title_canon_sha256":"a119a1337e6be8391e98bb542c2f55442d06929362685d6d8eec73ce08bf98a1"},"schema_version":"1.0","source":{"id":"1702.01355","kind":"arxiv","version":1}},"canonical_sha256":"8962820289307f13685464c7014d601787ce86f6c21f0d6a36a222f19a278101","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8962820289307f13685464c7014d601787ce86f6c21f0d6a36a222f19a278101","first_computed_at":"2026-05-18T00:51:23.668155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:23.668155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0u986hviOl14EHcEx6WRBOtkdCCSOkp8SISQjVhSWtDFz0gokFXz/Zrj0PGuOY36Z20ZrEIW5tRdMYHj7VRPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:23.668636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2a04c87f4f135e1b73d15df83b379db14486dff64fb016b850aaba7cf5071d4","sha256:182c7b9f2ad03c1d138f2c2acb67ccf90978e064894c648a4203f9263f1b1885"],"state_sha256":"6f17c064f32c71f43c6e18475e7f6b0749a735e87bdd501604a90298786825ec"}