{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Y2FRX5H4OEMBTI23ZNIZOM5DRF","short_pith_number":"pith:Y2FRX5H4","schema_version":"1.0","canonical_sha256":"c68b1bf4fc711819a35bcb519733a389456318ddd5d32c3cdb776a303cdaf79e","source":{"kind":"arxiv","id":"1401.4928","version":2},"attestation_state":"computed","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 $"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.4928","created_at":"2026-05-18T02:19:08.615782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4928v2","created_at":"2026-05-18T02:19:08.615782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4928","created_at":"2026-05-18T02:19:08.615782+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2FRX5H4OEMB","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2FRX5H4OEMBTI23","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2FRX5H4","created_at":"2026-05-18T12:28:57.508820+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/Y2FRX5H4OEMBTI23ZNIZOM5DRF","json":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF.json","graph_json":"https://pith.science/api/pith-number/Y2FRX5H4OEMBTI23ZNIZOM5DRF/graph.json","events_json":"https://pith.science/api/pith-number/Y2FRX5H4OEMBTI23ZNIZOM5DRF/events.json","paper":"https://pith.science/paper/Y2FRX5H4"},"agent_actions":{"view_html":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF","download_json":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF.json","view_paper":"https://pith.science/paper/Y2FRX5H4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4928&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2FRX5H4OEMBTI23ZNIZOM5DRF/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2FRX5H4OEMBTI23ZNIZOM5DRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/action/storage_attestation","attest_author":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/action/author_attestation","sign_citation":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/action/citation_signature","submit_replication":"https://pith.science/pith/Y2FRX5H4OEMBTI23ZNIZOM5DRF/action/replication_record"}},"created_at":"2026-05-18T02:19:08.615782+00:00","updated_at":"2026-05-18T02:19:08.615782+00:00"}