{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RFRIEAUJGB7RG2CUMTDQCTLAC6","short_pith_number":"pith:RFRIEAUJ","schema_version":"1.0","canonical_sha256":"8962820289307f13685464c7014d601787ce86f6c21f0d6a36a222f19a278101","source":{"kind":"arxiv","id":"1702.01355","version":1},"attestation_state":"computed","paper":{"title":"Graphs without large $K_{2,n}$-minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoli Ding","submitted_at":"2017-02-05T00:38:24Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.01355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-05T00:38:24Z","cross_cats_sorted":[],"title_canon_sha256":"a119a1337e6be8391e98bb542c2f55442d06929362685d6d8eec73ce08bf98a1","abstract_canon_sha256":"b9899f21082f46849690a7e5e1ea3518e8f341e197bc90935e8d4991e0b9a105"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:23.668636Z","signature_b64":"0u986hviOl14EHcEx6WRBOtkdCCSOkp8SISQjVhSWtDFz0gokFXz/Zrj0PGuOY36Z20ZrEIW5tRdMYHj7VRPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8962820289307f13685464c7014d601787ce86f6c21f0d6a36a222f19a278101","last_reissued_at":"2026-05-18T00:51:23.668155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:23.668155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs without large $K_{2,n}$-minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoli Ding","submitted_at":"2017-02-05T00:38:24Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01355","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.01355","created_at":"2026-05-18T00:51:23.668214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01355v1","created_at":"2026-05-18T00:51:23.668214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01355","created_at":"2026-05-18T00:51:23.668214+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFRIEAUJGB7R","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFRIEAUJGB7RG2CU","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFRIEAUJ","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RFRIEAUJGB7RG2CUMTDQCTLAC6","json":"https://pith.science/pith/RFRIEAUJGB7RG2CUMTDQCTLAC6.json","graph_json":"https://pith.science/api/pith-number/RFRIEAUJGB7RG2CUMTDQCTLAC6/graph.json","events_json":"https://pith.science/api/pith-number/RFRIEAUJGB7RG2CUMTDQCTLAC6/events.json","paper":"https://pith.science/paper/RFRIEAUJ"},"agent_actions":{"view_html":"https://pith.science/pith/RFRIEAUJGB7RG2CUMTDQCTLAC6","download_json":"https://pith.science/pith/RFRIEAUJGB7RG2CUMTDQCTLAC6.json","view_paper":"https://pith.science/paper/RFRIEAUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01355&json=true","fetch_graph":"https://pith.science/api/pith-number/RFRIEAUJGB7RG2CUMTDQCTLAC6/graph.json","fetch_events":"https://pith.science/api/pith-number/RFRIEAUJGB7RG2CUMTDQCTLAC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFRIEAUJGB7RG2CUMTDQCTLAC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFRIEAUJGB7RG2CUMTDQCTLAC6/action/storage_attestation","attest_author":"https://pith.science/pith/RFRIEAUJGB7RG2CUMTDQCTLAC6/action/author_attestation","sign_citation":"https://pith.science/pith/RFRIEAUJGB7RG2CUMTDQCTLAC6/action/citation_signature","submit_replication":"https://pith.science/pith/RFRIEAUJGB7RG2CUMTDQCTLAC6/action/replication_record"}},"created_at":"2026-05-18T00:51:23.668214+00:00","updated_at":"2026-05-18T00:51:23.668214+00:00"}