{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XVQZHRCJSYSKLKZ6PSBEBJO5PA","short_pith_number":"pith:XVQZHRCJ","schema_version":"1.0","canonical_sha256":"bd6193c4499624a5ab3e7c8240a5dd78378ca8ee745f581cd84ecb52303fff4b","source":{"kind":"arxiv","id":"1304.5049","version":1},"attestation_state":"computed","paper":{"title":"Maximum degree in minor-closed classes of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Mitsche, Marc Noy, Omer Gimenez","submitted_at":"2013-04-18T08:27:21Z","abstract_excerpt":"Given a class of graphs G closed under taking minors, we study the maximum degree \\Delta_n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find classes of graphs providing orders of magnitude for \\Delta_n not observed before, such us \\log n/ \\log \\log \\log n and \\log n/ \\log \\log \\log \\log n."},"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":"1304.5049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-18T08:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"90c9da652457b8f0436a93c48fcfb40401f1e390ddc7a4bd0c80e2b8d629d5b2","abstract_canon_sha256":"c922379dc1cc0b7cf6969c74f0368e64c509db2055cdcb20fb1f512805fdc6de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:41.964787Z","signature_b64":"KqN2FZDw1Re7NSVM2sK8EdtK+MQjejRer9PFaxGzsccONgCxHEB1l6gHhO/9sbiqjLK1IBt1sxCoidP9qxVDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd6193c4499624a5ab3e7c8240a5dd78378ca8ee745f581cd84ecb52303fff4b","last_reissued_at":"2026-05-18T03:27:41.964111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:41.964111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum degree in minor-closed classes of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Mitsche, Marc Noy, Omer Gimenez","submitted_at":"2013-04-18T08:27:21Z","abstract_excerpt":"Given a class of graphs G closed under taking minors, we study the maximum degree \\Delta_n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find classes of graphs providing orders of magnitude for \\Delta_n not observed before, such us \\log n/ \\log \\log \\log n and \\log n/ \\log \\log \\log \\log n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5049","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":"1304.5049","created_at":"2026-05-18T03:27:41.964215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5049v1","created_at":"2026-05-18T03:27:41.964215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5049","created_at":"2026-05-18T03:27:41.964215+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVQZHRCJSYSK","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVQZHRCJSYSKLKZ6","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVQZHRCJ","created_at":"2026-05-18T12:28:06.772260+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/XVQZHRCJSYSKLKZ6PSBEBJO5PA","json":"https://pith.science/pith/XVQZHRCJSYSKLKZ6PSBEBJO5PA.json","graph_json":"https://pith.science/api/pith-number/XVQZHRCJSYSKLKZ6PSBEBJO5PA/graph.json","events_json":"https://pith.science/api/pith-number/XVQZHRCJSYSKLKZ6PSBEBJO5PA/events.json","paper":"https://pith.science/paper/XVQZHRCJ"},"agent_actions":{"view_html":"https://pith.science/pith/XVQZHRCJSYSKLKZ6PSBEBJO5PA","download_json":"https://pith.science/pith/XVQZHRCJSYSKLKZ6PSBEBJO5PA.json","view_paper":"https://pith.science/paper/XVQZHRCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5049&json=true","fetch_graph":"https://pith.science/api/pith-number/XVQZHRCJSYSKLKZ6PSBEBJO5PA/graph.json","fetch_events":"https://pith.science/api/pith-number/XVQZHRCJSYSKLKZ6PSBEBJO5PA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVQZHRCJSYSKLKZ6PSBEBJO5PA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVQZHRCJSYSKLKZ6PSBEBJO5PA/action/storage_attestation","attest_author":"https://pith.science/pith/XVQZHRCJSYSKLKZ6PSBEBJO5PA/action/author_attestation","sign_citation":"https://pith.science/pith/XVQZHRCJSYSKLKZ6PSBEBJO5PA/action/citation_signature","submit_replication":"https://pith.science/pith/XVQZHRCJSYSKLKZ6PSBEBJO5PA/action/replication_record"}},"created_at":"2026-05-18T03:27:41.964215+00:00","updated_at":"2026-05-18T03:27:41.964215+00:00"}