{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:56PLKKPTUJMLH7VGRWL6QLMNLJ","short_pith_number":"pith:56PLKKPT","schema_version":"1.0","canonical_sha256":"ef9eb529f3a258b3fea68d97e82d8d5a4f788f7e2f6a0e3853437dfad12b0888","source":{"kind":"arxiv","id":"1008.5361","version":1},"attestation_state":"computed","paper":{"title":"The maximum degree of planar graphs I. Series-parallel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marc Noy, Michael Drmota, Omer Gimenez","submitted_at":"2010-08-31T16:51:10Z","abstract_excerpt":"We prove that the maximum degree $\\Delta_n$ of a random series-parallel graph with $n$ vertices satisfies $\\Delta_n/\\log n \\to c$ in probability, and $\\mathbb{E}\\, \\Delta_n \\sim c \\log n$ for a computable constant $c>0$. The same result holds for outerplanar graphs."},"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":"1008.5361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-31T16:51:10Z","cross_cats_sorted":[],"title_canon_sha256":"6777e4b7f9aa75db3fab595da0c61ebc3f79a2c58d3782ab51ee27d8a7f99590","abstract_canon_sha256":"ab7c131ebface52c3aa7d9b16c0d9d8129ffae2bf35bd384a68b395d9b3e1781"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:36.090607Z","signature_b64":"sJhCnI9BrVlgvczAOwfZrGW9q3ZjiBSpyAgPndCB9JnEBINQiDdISD2KnvIB7MfDq0GSzOj1sWqCMT8KA2g7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef9eb529f3a258b3fea68d97e82d8d5a4f788f7e2f6a0e3853437dfad12b0888","last_reissued_at":"2026-05-18T04:41:36.090224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:36.090224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum degree of planar graphs I. Series-parallel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marc Noy, Michael Drmota, Omer Gimenez","submitted_at":"2010-08-31T16:51:10Z","abstract_excerpt":"We prove that the maximum degree $\\Delta_n$ of a random series-parallel graph with $n$ vertices satisfies $\\Delta_n/\\log n \\to c$ in probability, and $\\mathbb{E}\\, \\Delta_n \\sim c \\log n$ for a computable constant $c>0$. The same result holds for outerplanar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5361","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":"1008.5361","created_at":"2026-05-18T04:41:36.090278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.5361v1","created_at":"2026-05-18T04:41:36.090278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5361","created_at":"2026-05-18T04:41:36.090278+00:00"},{"alias_kind":"pith_short_12","alias_value":"56PLKKPTUJML","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"56PLKKPTUJMLH7VG","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"56PLKKPT","created_at":"2026-05-18T12:26:04.259169+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/56PLKKPTUJMLH7VGRWL6QLMNLJ","json":"https://pith.science/pith/56PLKKPTUJMLH7VGRWL6QLMNLJ.json","graph_json":"https://pith.science/api/pith-number/56PLKKPTUJMLH7VGRWL6QLMNLJ/graph.json","events_json":"https://pith.science/api/pith-number/56PLKKPTUJMLH7VGRWL6QLMNLJ/events.json","paper":"https://pith.science/paper/56PLKKPT"},"agent_actions":{"view_html":"https://pith.science/pith/56PLKKPTUJMLH7VGRWL6QLMNLJ","download_json":"https://pith.science/pith/56PLKKPTUJMLH7VGRWL6QLMNLJ.json","view_paper":"https://pith.science/paper/56PLKKPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.5361&json=true","fetch_graph":"https://pith.science/api/pith-number/56PLKKPTUJMLH7VGRWL6QLMNLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/56PLKKPTUJMLH7VGRWL6QLMNLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56PLKKPTUJMLH7VGRWL6QLMNLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56PLKKPTUJMLH7VGRWL6QLMNLJ/action/storage_attestation","attest_author":"https://pith.science/pith/56PLKKPTUJMLH7VGRWL6QLMNLJ/action/author_attestation","sign_citation":"https://pith.science/pith/56PLKKPTUJMLH7VGRWL6QLMNLJ/action/citation_signature","submit_replication":"https://pith.science/pith/56PLKKPTUJMLH7VGRWL6QLMNLJ/action/replication_record"}},"created_at":"2026-05-18T04:41:36.090278+00:00","updated_at":"2026-05-18T04:41:36.090278+00:00"}