{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Y2FRX5H4OEMBTI23ZNIZOM5DRF","short_pith_number":"pith:Y2FRX5H4","canonical_record":{"source":{"id":"1401.4928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-20T14:58:29Z","cross_cats_sorted":[],"title_canon_sha256":"2332966fa1864f40090f8acfe7aad5d04af977c3ed301553aa8253f2182a7723","abstract_canon_sha256":"468197edbe3185f5d928533cb02b75542124078ba2597c2fb126272e823620ce"},"schema_version":"1.0"},"canonical_sha256":"c68b1bf4fc711819a35bcb519733a389456318ddd5d32c3cdb776a303cdaf79e","source":{"kind":"arxiv","id":"1401.4928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4928","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4928v2","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4928","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"Y2FRX5H4OEMB","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y2FRX5H4OEMBTI23","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y2FRX5H4","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Y2FRX5H4OEMBTI23ZNIZOM5DRF","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-20T14:58:29Z","cross_cats_sorted":[],"title_canon_sha256":"2332966fa1864f40090f8acfe7aad5d04af977c3ed301553aa8253f2182a7723","abstract_canon_sha256":"468197edbe3185f5d928533cb02b75542124078ba2597c2fb126272e823620ce"},"schema_version":"1.0"},"canonical_sha256":"c68b1bf4fc711819a35bcb519733a389456318ddd5d32c3cdb776a303cdaf79e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:08.616148Z","signature_b64":"dKYx0PY0ttf7M1Md5nhy2N2aPjQ1fN0PYBBUnYV72yjqQ5PzB1a+Wzm3TnvP+cPrVO9uW00OMpxTFoW48ixhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c68b1bf4fc711819a35bcb519733a389456318ddd5d32c3cdb776a303cdaf79e","last_reissued_at":"2026-05-18T02:19:08.615709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:08.615709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4928","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-18T02:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBND9iTx7aPW6ELz+Alx1thxOHsxomzWN+WwByr+1YOeYRqR8niYas5ti4bi28OEydqSIZmBeQwbp01lXwZuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:20:54.739094Z"},"content_sha256":"75d558ca5ab5b9072bab16e34ec26472109a3af7a6e9ea65b0ee35e4e6538ec6","schema_version":"1.0","event_id":"sha256:75d558ca5ab5b9072bab16e34ec26472109a3af7a6e9ea65b0ee35e4e6538ec6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Y2FRX5H4OEMBTI23ZNIZOM5DRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large subgraphs without short cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florent Foucaud, Guillem Perarnau, Michael Krivelevich","submitted_at":"2014-01-20T14:58:29Z","abstract_excerpt":"We study two extremal problems about subgraphs excluding a family $\\F$ of graphs. i) Among all graphs with $m$ edges, what is the smallest size $f(m,\\F)$ of a largest $\\F$--free subgraph? ii) Among all graphs with minimum degree $\\delta$ and maximum degree $\\Delta$, what is the smallest minimum degree $h(\\delta,\\Delta,\\F)$ of a spanning $\\F$--free subgraph with largest minimum degree? These questions are easy to answer for families not containing any bipartite graph. We study the case where $\\F$ is composed of all even cycles of length at most $2r$, $r\\geq 2$. In this case, we give bounds on $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4928","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-18T02:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vO4a6h136c3m9DPhqyWzlbwVPYZS3cZPQUwpgQBKnK+QIVoYusm39MZPm6GpigiHuI4c65EGsetTVbpfZl7zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:20:54.739708Z"},"content_sha256":"06886fbb756243f987cdc1d67d9ec628f7c01f39a485c3f8ed16978117b6121e","schema_version":"1.0","event_id":"sha256:06886fbb756243f987cdc1d67d9ec628f7c01f39a485c3f8ed16978117b6121e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/bundle.json","state_url":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/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-25T23:20:54Z","links":{"resolver":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF","bundle":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/bundle.json","state":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Y2FRX5H4OEMBTI23ZNIZOM5DRF","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":"468197edbe3185f5d928533cb02b75542124078ba2597c2fb126272e823620ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-20T14:58:29Z","title_canon_sha256":"2332966fa1864f40090f8acfe7aad5d04af977c3ed301553aa8253f2182a7723"},"schema_version":"1.0","source":{"id":"1401.4928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4928","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4928v2","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4928","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"Y2FRX5H4OEMB","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y2FRX5H4OEMBTI23","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y2FRX5H4","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:06886fbb756243f987cdc1d67d9ec628f7c01f39a485c3f8ed16978117b6121e","target":"graph","created_at":"2026-05-18T02:19:08Z","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":"We study two extremal problems about subgraphs excluding a family $\\F$ of graphs. i) Among all graphs with $m$ edges, what is the smallest size $f(m,\\F)$ of a largest $\\F$--free subgraph? ii) Among all graphs with minimum degree $\\delta$ and maximum degree $\\Delta$, what is the smallest minimum degree $h(\\delta,\\Delta,\\F)$ of a spanning $\\F$--free subgraph with largest minimum degree? These questions are easy to answer for families not containing any bipartite graph. We study the case where $\\F$ is composed of all even cycles of length at most $2r$, $r\\geq 2$. In this case, we give bounds on $","authors_text":"Florent Foucaud, Guillem Perarnau, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-20T14:58:29Z","title":"Large subgraphs without short cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4928","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:75d558ca5ab5b9072bab16e34ec26472109a3af7a6e9ea65b0ee35e4e6538ec6","target":"record","created_at":"2026-05-18T02:19:08Z","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":"468197edbe3185f5d928533cb02b75542124078ba2597c2fb126272e823620ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-20T14:58:29Z","title_canon_sha256":"2332966fa1864f40090f8acfe7aad5d04af977c3ed301553aa8253f2182a7723"},"schema_version":"1.0","source":{"id":"1401.4928","kind":"arxiv","version":2}},"canonical_sha256":"c68b1bf4fc711819a35bcb519733a389456318ddd5d32c3cdb776a303cdaf79e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c68b1bf4fc711819a35bcb519733a389456318ddd5d32c3cdb776a303cdaf79e","first_computed_at":"2026-05-18T02:19:08.615709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:08.615709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dKYx0PY0ttf7M1Md5nhy2N2aPjQ1fN0PYBBUnYV72yjqQ5PzB1a+Wzm3TnvP+cPrVO9uW00OMpxTFoW48ixhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:08.616148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75d558ca5ab5b9072bab16e34ec26472109a3af7a6e9ea65b0ee35e4e6538ec6","sha256:06886fbb756243f987cdc1d67d9ec628f7c01f39a485c3f8ed16978117b6121e"],"state_sha256":"1c8b3a3f250611f14b8b7e2a9280c3e3b70b4e32c0ccbf6a127a15dc0d2b733d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBnqcIUW71Kt3AST6OdSpRJztKApoBecsjI42Pvipnq8yJ/Qs08y0bJeNBFqhWf2tywE14y+BlX97RbkqpAcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:20:54.743118Z","bundle_sha256":"b3d26f334d35f2bdbb05b6e1530b5131bf83eabc3c79782f9643cb0a9ff8d96f"}}