{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WCUDJVLZSLHXT6THXOUOS5RZ44","short_pith_number":"pith:WCUDJVLZ","schema_version":"1.0","canonical_sha256":"b0a834d57992cf79fa67bba8e97639e715d865694801d54e7c81ccfaccb63e8b","source":{"kind":"arxiv","id":"1805.03736","version":1},"attestation_state":"computed","paper":{"title":"Cores, shell indices and the degeneracy of a graph limit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Rauh","submitted_at":"2018-05-09T21:17:06Z","abstract_excerpt":"The $k$-core of a graph is the maximal subgraph in which every node has degree at least~$k$, the shell index of a node is the largest $k$ such that the $k$-core contains the node, and the degeneracy of a graph is the largest shell index of any node. After a suitable normalization, these three concepts generalize to limits of dense graphs (also called graphons). In particular, the degeneracy is continuous with respect to the cut metric."},"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":"1805.03736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-09T21:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"30f9fc35daadc5d6252492cdd44b02737d33a2a3493a3d2d83e4dad54f8c1393","abstract_canon_sha256":"57696be4a082806aa6563b0a4636c141d2fa3b1c854c77b24626ccac3945f38d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:18.889489Z","signature_b64":"R5UhzSN/0INq8lu+GGpd3+sCqzGe65X4GWIgiMK4g8acn5yn/rvJ9vP0X8DxNB3JLi/JNoJxD/N6H6S3kX9eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0a834d57992cf79fa67bba8e97639e715d865694801d54e7c81ccfaccb63e8b","last_reissued_at":"2026-05-18T00:16:18.888697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:18.888697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cores, shell indices and the degeneracy of a graph limit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Rauh","submitted_at":"2018-05-09T21:17:06Z","abstract_excerpt":"The $k$-core of a graph is the maximal subgraph in which every node has degree at least~$k$, the shell index of a node is the largest $k$ such that the $k$-core contains the node, and the degeneracy of a graph is the largest shell index of any node. After a suitable normalization, these three concepts generalize to limits of dense graphs (also called graphons). In particular, the degeneracy is continuous with respect to the cut metric."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03736","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":"1805.03736","created_at":"2026-05-18T00:16:18.888821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03736v1","created_at":"2026-05-18T00:16:18.888821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03736","created_at":"2026-05-18T00:16:18.888821+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCUDJVLZSLHX","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCUDJVLZSLHXT6TH","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCUDJVLZ","created_at":"2026-05-18T12:32:59.047623+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/WCUDJVLZSLHXT6THXOUOS5RZ44","json":"https://pith.science/pith/WCUDJVLZSLHXT6THXOUOS5RZ44.json","graph_json":"https://pith.science/api/pith-number/WCUDJVLZSLHXT6THXOUOS5RZ44/graph.json","events_json":"https://pith.science/api/pith-number/WCUDJVLZSLHXT6THXOUOS5RZ44/events.json","paper":"https://pith.science/paper/WCUDJVLZ"},"agent_actions":{"view_html":"https://pith.science/pith/WCUDJVLZSLHXT6THXOUOS5RZ44","download_json":"https://pith.science/pith/WCUDJVLZSLHXT6THXOUOS5RZ44.json","view_paper":"https://pith.science/paper/WCUDJVLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03736&json=true","fetch_graph":"https://pith.science/api/pith-number/WCUDJVLZSLHXT6THXOUOS5RZ44/graph.json","fetch_events":"https://pith.science/api/pith-number/WCUDJVLZSLHXT6THXOUOS5RZ44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCUDJVLZSLHXT6THXOUOS5RZ44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCUDJVLZSLHXT6THXOUOS5RZ44/action/storage_attestation","attest_author":"https://pith.science/pith/WCUDJVLZSLHXT6THXOUOS5RZ44/action/author_attestation","sign_citation":"https://pith.science/pith/WCUDJVLZSLHXT6THXOUOS5RZ44/action/citation_signature","submit_replication":"https://pith.science/pith/WCUDJVLZSLHXT6THXOUOS5RZ44/action/replication_record"}},"created_at":"2026-05-18T00:16:18.888821+00:00","updated_at":"2026-05-18T00:16:18.888821+00:00"}