{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:FPMOT5UNYP7VO4HLU6UINTMUJQ","short_pith_number":"pith:FPMOT5UN","schema_version":"1.0","canonical_sha256":"2bd8e9f68dc3ff5770eba7a886cd944c3dcb95c2465dc0b5a19fa48bd4bbe2e3","source":{"kind":"arxiv","id":"1012.5795","version":1},"attestation_state":"computed","paper":{"title":"Extremal results regarding $K_6$-minors in graphs of girth at least 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elad Aigner-Horev, Roi Krakovski","submitted_at":"2010-12-28T17:07:54Z","abstract_excerpt":"We prove that every 6-connected graph of girth $\\geq 6$ has a $K_6$-minor and thus settle the Jorgensen conjecture for graphs of girth $ \\geq 6$. Relaxing the assumption on the girth, we prove that every 6-connected $n$-vertex graph of size $\\geq 3 1/5 n-8$ and of girth $\\geq 5$ contains a $K_6$-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":"1012.5795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-28T17:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"457180270137bf54678aa682095b161c906b50625fef7a08491ccbdb619633b0","abstract_canon_sha256":"bd7427c5a6143a0a38091b677a18cff145cf6b537426af66a94886189d9a167e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:21.510398Z","signature_b64":"fU9NFdTNjIkgIpt5FpWunpeJdxWQFHtug0w6Sp/Wc/afyF95b8SBpJUkE8IRdAbHaQE7ueAEKdR4jD7QsDhXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bd8e9f68dc3ff5770eba7a886cd944c3dcb95c2465dc0b5a19fa48bd4bbe2e3","last_reissued_at":"2026-05-18T04:32:21.509581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:21.509581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal results regarding $K_6$-minors in graphs of girth at least 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elad Aigner-Horev, Roi Krakovski","submitted_at":"2010-12-28T17:07:54Z","abstract_excerpt":"We prove that every 6-connected graph of girth $\\geq 6$ has a $K_6$-minor and thus settle the Jorgensen conjecture for graphs of girth $ \\geq 6$. Relaxing the assumption on the girth, we prove that every 6-connected $n$-vertex graph of size $\\geq 3 1/5 n-8$ and of girth $\\geq 5$ contains a $K_6$-minor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5795","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":"1012.5795","created_at":"2026-05-18T04:32:21.509706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5795v1","created_at":"2026-05-18T04:32:21.509706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5795","created_at":"2026-05-18T04:32:21.509706+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPMOT5UNYP7V","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPMOT5UNYP7VO4HL","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPMOT5UN","created_at":"2026-05-18T12:26:07.630475+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/FPMOT5UNYP7VO4HLU6UINTMUJQ","json":"https://pith.science/pith/FPMOT5UNYP7VO4HLU6UINTMUJQ.json","graph_json":"https://pith.science/api/pith-number/FPMOT5UNYP7VO4HLU6UINTMUJQ/graph.json","events_json":"https://pith.science/api/pith-number/FPMOT5UNYP7VO4HLU6UINTMUJQ/events.json","paper":"https://pith.science/paper/FPMOT5UN"},"agent_actions":{"view_html":"https://pith.science/pith/FPMOT5UNYP7VO4HLU6UINTMUJQ","download_json":"https://pith.science/pith/FPMOT5UNYP7VO4HLU6UINTMUJQ.json","view_paper":"https://pith.science/paper/FPMOT5UN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5795&json=true","fetch_graph":"https://pith.science/api/pith-number/FPMOT5UNYP7VO4HLU6UINTMUJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FPMOT5UNYP7VO4HLU6UINTMUJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPMOT5UNYP7VO4HLU6UINTMUJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPMOT5UNYP7VO4HLU6UINTMUJQ/action/storage_attestation","attest_author":"https://pith.science/pith/FPMOT5UNYP7VO4HLU6UINTMUJQ/action/author_attestation","sign_citation":"https://pith.science/pith/FPMOT5UNYP7VO4HLU6UINTMUJQ/action/citation_signature","submit_replication":"https://pith.science/pith/FPMOT5UNYP7VO4HLU6UINTMUJQ/action/replication_record"}},"created_at":"2026-05-18T04:32:21.509706+00:00","updated_at":"2026-05-18T04:32:21.509706+00:00"}