{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DRYJ4WIS7E7VPYI3K6VUAXU7S5","short_pith_number":"pith:DRYJ4WIS","schema_version":"1.0","canonical_sha256":"1c709e5912f93f57e11b57ab405e9f977f500eb0f11561dcac2260256fe46c48","source":{"kind":"arxiv","id":"2206.00186","version":1},"attestation_state":"computed","paper":{"title":"Dense minors of graphs with independence number two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Seymour, Sergey Norin","submitted_at":"2022-06-01T02:15:41Z","abstract_excerpt":"Motivated by Hadwiger's conjecture, we prove that every $n$-vertex graph $G$ with no independent set of size three contains an $\\lceil n/2\\rceil$-vertex simple minor $H$ with $$0.98688 \\cdot \\binom{|V(H)|}{2} - o(n^2)$$ edges."},"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":"2206.00186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-01T02:15:41Z","cross_cats_sorted":[],"title_canon_sha256":"b2c767d9688f8ffd936e40f0fe5d16ea8ba1ec6683b70d9db3b3ec68da7c61d0","abstract_canon_sha256":"00b719409b3617985483b3663a9208facbeb3f0f486c42126bc897f4a31b29d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:13.871879Z","signature_b64":"NPsdoRkqaxusOfOJFO6jICYyTgiIhta29Y9U45OnqKFNeyiZSlVVer3uA7QKrCD/KWEcxao2nUc2MUJkt3ueBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c709e5912f93f57e11b57ab405e9f977f500eb0f11561dcac2260256fe46c48","last_reissued_at":"2026-07-05T04:28:13.871456Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:13.871456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dense minors of graphs with independence number two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Seymour, Sergey Norin","submitted_at":"2022-06-01T02:15:41Z","abstract_excerpt":"Motivated by Hadwiger's conjecture, we prove that every $n$-vertex graph $G$ with no independent set of size three contains an $\\lceil n/2\\rceil$-vertex simple minor $H$ with $$0.98688 \\cdot \\binom{|V(H)|}{2} - o(n^2)$$ edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00186","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.00186/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2206.00186","created_at":"2026-07-05T04:28:13.871520+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.00186v1","created_at":"2026-07-05T04:28:13.871520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00186","created_at":"2026-07-05T04:28:13.871520+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRYJ4WIS7E7V","created_at":"2026-07-05T04:28:13.871520+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRYJ4WIS7E7VPYI3","created_at":"2026-07-05T04:28:13.871520+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRYJ4WIS","created_at":"2026-07-05T04:28:13.871520+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/DRYJ4WIS7E7VPYI3K6VUAXU7S5","json":"https://pith.science/pith/DRYJ4WIS7E7VPYI3K6VUAXU7S5.json","graph_json":"https://pith.science/api/pith-number/DRYJ4WIS7E7VPYI3K6VUAXU7S5/graph.json","events_json":"https://pith.science/api/pith-number/DRYJ4WIS7E7VPYI3K6VUAXU7S5/events.json","paper":"https://pith.science/paper/DRYJ4WIS"},"agent_actions":{"view_html":"https://pith.science/pith/DRYJ4WIS7E7VPYI3K6VUAXU7S5","download_json":"https://pith.science/pith/DRYJ4WIS7E7VPYI3K6VUAXU7S5.json","view_paper":"https://pith.science/paper/DRYJ4WIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.00186&json=true","fetch_graph":"https://pith.science/api/pith-number/DRYJ4WIS7E7VPYI3K6VUAXU7S5/graph.json","fetch_events":"https://pith.science/api/pith-number/DRYJ4WIS7E7VPYI3K6VUAXU7S5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRYJ4WIS7E7VPYI3K6VUAXU7S5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRYJ4WIS7E7VPYI3K6VUAXU7S5/action/storage_attestation","attest_author":"https://pith.science/pith/DRYJ4WIS7E7VPYI3K6VUAXU7S5/action/author_attestation","sign_citation":"https://pith.science/pith/DRYJ4WIS7E7VPYI3K6VUAXU7S5/action/citation_signature","submit_replication":"https://pith.science/pith/DRYJ4WIS7E7VPYI3K6VUAXU7S5/action/replication_record"}},"created_at":"2026-07-05T04:28:13.871520+00:00","updated_at":"2026-07-05T04:28:13.871520+00:00"}