{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AUQ6Z73ZDXSAZPSEETIPFIEF57","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":"fc7080a4fe20bbd8965352564a7d9f18f5c8f311a5d6de169a83ce47ac9fbbbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T07:19:48Z","title_canon_sha256":"f2d0c4f740940c57433fc2ff31ee382dcca2f728fc24a5e91ab4f93c4feebcfa"},"schema_version":"1.0","source":{"id":"1907.01202","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01202","created_at":"2026-07-05T01:58:39Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01202v2","created_at":"2026-07-05T01:58:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01202","created_at":"2026-07-05T01:58:39Z"},{"alias_kind":"pith_short_12","alias_value":"AUQ6Z73ZDXSA","created_at":"2026-07-05T01:58:39Z"},{"alias_kind":"pith_short_16","alias_value":"AUQ6Z73ZDXSAZPSE","created_at":"2026-07-05T01:58:39Z"},{"alias_kind":"pith_short_8","alias_value":"AUQ6Z73Z","created_at":"2026-07-05T01:58:39Z"}],"graph_snapshots":[{"event_id":"sha256:88390ed9fbea01a34f9fa7e349cf73ac916c713617acc368b92c66876995b0bc","target":"graph","created_at":"2026-07-05T01:58:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.01202/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that for sufficiently large $d$ and for $t\\geq d+1$, there is a graph $G$ with average degree $(1-\\varepsilon)\\lambda t \\sqrt{\\ln d}$ such that almost every graph $H$ with $t$ vertices and average degree $d$ is not a minor of $G$, where $\\lambda=0.63817\\dots$ is an explicitly defined constant. This generalises analogous results for complete graphs by Thomason (2001) and for general dense graphs by Myers and Thomason (2005). It also shows that an upper bound for sparse graphs by Reed and Wood (2016) is best possible up to a constant factor.","authors_text":"Andrew Thomason, Bruce Reed, David R. Wood, Sergey Norin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T07:19:48Z","title":"A lower bound on the average degree forcing a minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01202","kind":"arxiv","version":2},"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:8e807b09c369f15c6f1f623fe1fda137778d8dcddf9b43c87e6e4ebab5ca93cc","target":"record","created_at":"2026-07-05T01:58:39Z","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":"fc7080a4fe20bbd8965352564a7d9f18f5c8f311a5d6de169a83ce47ac9fbbbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-02T07:19:48Z","title_canon_sha256":"f2d0c4f740940c57433fc2ff31ee382dcca2f728fc24a5e91ab4f93c4feebcfa"},"schema_version":"1.0","source":{"id":"1907.01202","kind":"arxiv","version":2}},"canonical_sha256":"0521ecff791de40cbe4424d0f2a085efe03f47be895222d9256bac7203ebf661","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0521ecff791de40cbe4424d0f2a085efe03f47be895222d9256bac7203ebf661","first_computed_at":"2026-07-05T01:58:39.358497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:58:39.358497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlxaFU80xnWymPPy9Qe8gLgW61pFk6lRAHVA7PtHDoKw6RImeoqOjezGzEQH1gtrfep8dvd57kvQGxXpT5QiAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:58:39.358901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01202","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e807b09c369f15c6f1f623fe1fda137778d8dcddf9b43c87e6e4ebab5ca93cc","sha256:88390ed9fbea01a34f9fa7e349cf73ac916c713617acc368b92c66876995b0bc"],"state_sha256":"a5a25e476de93be4614d1c825048b1788cfa1d647b0d1d56ddd3dd1fccb5dbe3"}