{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IPOWOY5ZLGRA4MBN7CMDNQ4YJF","short_pith_number":"pith:IPOWOY5Z","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"},"canonical_sha256":"43dd6763b959a20e302df89836c3984974331bcdb737f14805dee73671b2cbc6","source":{"kind":"arxiv","id":"2003.00942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.00942","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"2003.00942v1","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00942","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"IPOWOY5ZLGRA","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"pith_short_16","alias_value":"IPOWOY5ZLGRA4MBN","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"pith_short_8","alias_value":"IPOWOY5Z","created_at":"2026-07-05T00:44:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IPOWOY5ZLGRA4MBN7CMDNQ4YJF","target":"record","payload":{"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"},"canonical_sha256":"43dd6763b959a20e302df89836c3984974331bcdb737f14805dee73671b2cbc6","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"},"source_kind":"arxiv","source_id":"2003.00942","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JsYwwITOqtu9VQTV2u5EmYOzuwPZYZAZGPzhcocszNUBOvmslcPJzu1pbVv/gS+o7VqL0BiYqUscP6IIywNQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:00:52.161888Z"},"content_sha256":"00bf03c2b0a70025c2ea443d4e4bf714ae1f592f6bb9e28bd1e52fd10e47e449","schema_version":"1.0","event_id":"sha256:00bf03c2b0a70025c2ea443d4e4bf714ae1f592f6bb9e28bd1e52fd10e47e449"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IPOWOY5ZLGRA4MBN7CMDNQ4YJF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7HdlscvImUj4UnYHvJgAwfNC8YkEHAHceGEWqZuunyT9kvXxbGA3F5dr9cUhuiwQaSxu90MWCt/tDGjfhnezBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:00:52.162257Z"},"content_sha256":"b620fe0ba0d54cfd3aff47bf6739492e4c4423be1c82876c3f215bceea3b3f29","schema_version":"1.0","event_id":"sha256:b620fe0ba0d54cfd3aff47bf6739492e4c4423be1c82876c3f215bceea3b3f29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/bundle.json","state_url":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T08:00:52Z","links":{"resolver":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF","bundle":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/bundle.json","state":"https://pith.science/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPOWOY5ZLGRA4MBN7CMDNQ4YJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IPOWOY5ZLGRA4MBN7CMDNQ4YJF","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":"0bf53d50f6ee8f3e75779f065b3513fa8484aaa9ede3967d9f841877bd5ed71f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-02T14:38:38Z","title_canon_sha256":"cb7c1e5d018c2d1fe710997ac7de62cb788e83ef0e2e3931d60adfaefd53beed"},"schema_version":"1.0","source":{"id":"2003.00942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.00942","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"2003.00942v1","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00942","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"IPOWOY5ZLGRA","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"pith_short_16","alias_value":"IPOWOY5ZLGRA4MBN","created_at":"2026-07-05T00:44:59Z"},{"alias_kind":"pith_short_8","alias_value":"IPOWOY5Z","created_at":"2026-07-05T00:44:59Z"}],"graph_snapshots":[{"event_id":"sha256:b620fe0ba0d54cfd3aff47bf6739492e4c4423be1c82876c3f215bceea3b3f29","target":"graph","created_at":"2026-07-05T00:44:59Z","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/2003.00942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Johannes Carmesin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-02T14:38:38Z","title":"Large highly connected subgraphs in graphs with linear average degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00942","kind":"arxiv","version":1},"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:00bf03c2b0a70025c2ea443d4e4bf714ae1f592f6bb9e28bd1e52fd10e47e449","target":"record","created_at":"2026-07-05T00:44:59Z","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":"0bf53d50f6ee8f3e75779f065b3513fa8484aaa9ede3967d9f841877bd5ed71f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-02T14:38:38Z","title_canon_sha256":"cb7c1e5d018c2d1fe710997ac7de62cb788e83ef0e2e3931d60adfaefd53beed"},"schema_version":"1.0","source":{"id":"2003.00942","kind":"arxiv","version":1}},"canonical_sha256":"43dd6763b959a20e302df89836c3984974331bcdb737f14805dee73671b2cbc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43dd6763b959a20e302df89836c3984974331bcdb737f14805dee73671b2cbc6","first_computed_at":"2026-07-05T00:44:59.641458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:44:59.641458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f0KYT0uMRHEL34IxkGAirqmO6KRE1tQQm29Q3D+KLJfCOEwrmWI8+oTCWAh7xOBFO6pg8O+V49Z6YRfoem3BDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:44:59.641844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.00942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00bf03c2b0a70025c2ea443d4e4bf714ae1f592f6bb9e28bd1e52fd10e47e449","sha256:b620fe0ba0d54cfd3aff47bf6739492e4c4423be1c82876c3f215bceea3b3f29"],"state_sha256":"9d3b25e4476c60954cd5fd8c7919f49c8f63017fb005c3b46aad4d975a1b891d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFmrT95m7vjf6kFb3GbNNnc1h9wlID2g/cQxdrA59CZLSAvCDLhfQZ1wXWbndTMy2iM4C9gE1LGDXECChGSsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:00:52.164382Z","bundle_sha256":"dc19500335ab86f9c68253dfe08ceda672db8f7ce56585b341c43c20989cc84f"}}