{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IPOWOY5ZLGRA4MBN7CMDNQ4YJF","short_pith_number":"pith:IPOWOY5Z","schema_version":"1.0","canonical_sha256":"43dd6763b959a20e302df89836c3984974331bcdb737f14805dee73671b2cbc6","source":{"kind":"arxiv","id":"2003.00942","version":1},"attestation_state":"computed","paper":{"title":"Large highly connected subgraphs in graphs with linear average degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin","submitted_at":"2020-03-02T14:38:38Z","abstract_excerpt":"In 1972 Mader proved that every graph with average degree at least $4k$ has a $(k+1)$-connected subgraph with more than $2k$ vertices. We improve this bound by showing that the constant $4$ can be replaced by $3+\\frac{1}{3}$; this bound is sharp."},"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":"2003.00942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-02T14:38:38Z","cross_cats_sorted":[],"title_canon_sha256":"cb7c1e5d018c2d1fe710997ac7de62cb788e83ef0e2e3931d60adfaefd53beed","abstract_canon_sha256":"0bf53d50f6ee8f3e75779f065b3513fa8484aaa9ede3967d9f841877bd5ed71f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:59.641844Z","signature_b64":"f0KYT0uMRHEL34IxkGAirqmO6KRE1tQQm29Q3D+KLJfCOEwrmWI8+oTCWAh7xOBFO6pg8O+V49Z6YRfoem3BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43dd6763b959a20e302df89836c3984974331bcdb737f14805dee73671b2cbc6","last_reissued_at":"2026-07-05T00:44:59.641458Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:59.641458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large highly connected subgraphs in graphs with linear average degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin","submitted_at":"2020-03-02T14:38:38Z","abstract_excerpt":"In 1972 Mader proved that every graph with average degree at least $4k$ has a $(k+1)$-connected subgraph with more than $2k$ vertices. We improve this bound by showing that the constant $4$ can be replaced by $3+\\frac{1}{3}$; this bound is sharp."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00942","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/2003.00942/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":"2003.00942","created_at":"2026-07-05T00:44:59.641515+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.00942v1","created_at":"2026-07-05T00:44:59.641515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00942","created_at":"2026-07-05T00:44:59.641515+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPOWOY5ZLGRA","created_at":"2026-07-05T00:44:59.641515+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPOWOY5ZLGRA4MBN","created_at":"2026-07-05T00:44:59.641515+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPOWOY5Z","created_at":"2026-07-05T00:44:59.641515+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17038","citing_title":"Hypergraphs without Subgraphs of Given Connectivity","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF","json":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF.json","graph_json":"https://pith.science/api/pith-number/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/graph.json","events_json":"https://pith.science/api/pith-number/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/events.json","paper":"https://pith.science/paper/IPOWOY5Z"},"agent_actions":{"view_html":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF","download_json":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF.json","view_paper":"https://pith.science/paper/IPOWOY5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.00942&json=true","fetch_graph":"https://pith.science/api/pith-number/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/graph.json","fetch_events":"https://pith.science/api/pith-number/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/action/storage_attestation","attest_author":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/action/author_attestation","sign_citation":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/action/citation_signature","submit_replication":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/action/replication_record"}},"created_at":"2026-07-05T00:44:59.641515+00:00","updated_at":"2026-07-05T00:44:59.641515+00:00"}