{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2HESFBG6L4FUXGURWMH4JFX5M3","short_pith_number":"pith:2HESFBG6","canonical_record":{"source":{"id":"1208.3568","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-17T10:31:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3247e82c18107d1e6dc44a72a1a0d30e0c3c799d36b7daae224d2fd5c6cec6e1","abstract_canon_sha256":"d617fd6bac766199c45f29756026b1be30cb7c4f8dbead1693cbb9579d551bca"},"schema_version":"1.0"},"canonical_sha256":"d1c92284de5f0b4b9a91b30fc496fd66d47fe518f31651bbd1627a9d1fb31366","source":{"kind":"arxiv","id":"1208.3568","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3568","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3568v2","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3568","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"2HESFBG6L4FU","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2HESFBG6L4FUXGUR","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2HESFBG6","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2HESFBG6L4FUXGURWMH4JFX5M3","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3568","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-17T10:31:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3247e82c18107d1e6dc44a72a1a0d30e0c3c799d36b7daae224d2fd5c6cec6e1","abstract_canon_sha256":"d617fd6bac766199c45f29756026b1be30cb7c4f8dbead1693cbb9579d551bca"},"schema_version":"1.0"},"canonical_sha256":"d1c92284de5f0b4b9a91b30fc496fd66d47fe518f31651bbd1627a9d1fb31366","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:25.648406Z","signature_b64":"aCQ5GWk8L6obBfPswrOoInmxgFa3t9eGLDAWLZE9xj3x/RF8AJAQjokQFKUaS6EgB99b6xN70KUgf4gUHxMKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c92284de5f0b4b9a91b30fc496fd66d47fe518f31651bbd1627a9d1fb31366","last_reissued_at":"2026-05-18T03:25:25.647599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:25.647599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3568","source_version":2,"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-05-18T03:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQCYBoy40E+R6AoUCnALb3El2RY41PlGSmDRSbBj0UDlb/FrCCQL4TcEON837Lh1Aq2F/ck6vkGqORJyeELWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:15:57.798604Z"},"content_sha256":"ef810107864a12db4f9fa42c2c6b06ed7d82c679ea407ad7588bedb5325fcd1c","schema_version":"1.0","event_id":"sha256:ef810107864a12db4f9fa42c2c6b06ed7d82c679ea407ad7588bedb5325fcd1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2HESFBG6L4FUXGURWMH4JFX5M3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small Complete Minors Above the Extremal Edge Density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Benny Sudakov","submitted_at":"2012-08-17T10:31:54Z","abstract_excerpt":"A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader's result by replacing the notion of high connectivity by the notion of vertex expansion.\n  Another well known result in graph theory states that for every integer t there is a smallest real c(t) so that every n-vertex graph with c(t)n edges contains a K_t-minor. Fiorini, Joret, Theis and Wood conjectured that if an n-vertex graph G has (c(t)+\\epsilon)n edges then G contains a K_t-min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3568","kind":"arxiv","version":2},"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"},"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-05-18T03:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6GvX+SINonWeP/NsujnrbVICLV28y9MqbJbYew9DKJ1kylJao7JXF9b4osnd5AFXe+nQYx1Pn67x0J9cDj9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:15:57.799298Z"},"content_sha256":"0eb9d38e13488b7082decbe73ff16ab30b0975a18b3be25033d1c8cf35da71dd","schema_version":"1.0","event_id":"sha256:0eb9d38e13488b7082decbe73ff16ab30b0975a18b3be25033d1c8cf35da71dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HESFBG6L4FUXGURWMH4JFX5M3/bundle.json","state_url":"https://pith.science/pith/2HESFBG6L4FUXGURWMH4JFX5M3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HESFBG6L4FUXGURWMH4JFX5M3/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-05-30T10:15:57Z","links":{"resolver":"https://pith.science/pith/2HESFBG6L4FUXGURWMH4JFX5M3","bundle":"https://pith.science/pith/2HESFBG6L4FUXGURWMH4JFX5M3/bundle.json","state":"https://pith.science/pith/2HESFBG6L4FUXGURWMH4JFX5M3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HESFBG6L4FUXGURWMH4JFX5M3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2HESFBG6L4FUXGURWMH4JFX5M3","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":"d617fd6bac766199c45f29756026b1be30cb7c4f8dbead1693cbb9579d551bca","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-17T10:31:54Z","title_canon_sha256":"3247e82c18107d1e6dc44a72a1a0d30e0c3c799d36b7daae224d2fd5c6cec6e1"},"schema_version":"1.0","source":{"id":"1208.3568","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3568","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3568v2","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3568","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"2HESFBG6L4FU","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2HESFBG6L4FUXGUR","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2HESFBG6","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:0eb9d38e13488b7082decbe73ff16ab30b0975a18b3be25033d1c8cf35da71dd","target":"graph","created_at":"2026-05-18T03:25:25Z","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"},"paper":{"abstract_excerpt":"A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader's result by replacing the notion of high connectivity by the notion of vertex expansion.\n  Another well known result in graph theory states that for every integer t there is a smallest real c(t) so that every n-vertex graph with c(t)n edges contains a K_t-minor. Fiorini, Joret, Theis and Wood conjectured that if an n-vertex graph G has (c(t)+\\epsilon)n edges then G contains a K_t-min","authors_text":"Asaf Shapira, Benny Sudakov","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-17T10:31:54Z","title":"Small Complete Minors Above the Extremal Edge Density"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3568","kind":"arxiv","version":2},"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:ef810107864a12db4f9fa42c2c6b06ed7d82c679ea407ad7588bedb5325fcd1c","target":"record","created_at":"2026-05-18T03:25:25Z","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":"d617fd6bac766199c45f29756026b1be30cb7c4f8dbead1693cbb9579d551bca","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-17T10:31:54Z","title_canon_sha256":"3247e82c18107d1e6dc44a72a1a0d30e0c3c799d36b7daae224d2fd5c6cec6e1"},"schema_version":"1.0","source":{"id":"1208.3568","kind":"arxiv","version":2}},"canonical_sha256":"d1c92284de5f0b4b9a91b30fc496fd66d47fe518f31651bbd1627a9d1fb31366","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1c92284de5f0b4b9a91b30fc496fd66d47fe518f31651bbd1627a9d1fb31366","first_computed_at":"2026-05-18T03:25:25.647599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:25.647599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aCQ5GWk8L6obBfPswrOoInmxgFa3t9eGLDAWLZE9xj3x/RF8AJAQjokQFKUaS6EgB99b6xN70KUgf4gUHxMKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:25.648406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3568","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef810107864a12db4f9fa42c2c6b06ed7d82c679ea407ad7588bedb5325fcd1c","sha256:0eb9d38e13488b7082decbe73ff16ab30b0975a18b3be25033d1c8cf35da71dd"],"state_sha256":"482be8a8f0dfe74375c545260aaece5470c70d3932406babaf5d9358a75151d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGqsUKSx4354gDKq5O68MqVvnxZwfygoh85qFHSedLbjDiWlWKhM984H/0DkiEsAtVA4YDfYdMZZZ9I6Wd1KDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:15:57.802885Z","bundle_sha256":"f7ba4f1647dbd69ee087a4f01ac1cced3c13770daba4416764e3e32b7ce98b34"}}