{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NY5EX3VWAVR45QDTWF2WKRJC5F","short_pith_number":"pith:NY5EX3VW","canonical_record":{"source":{"id":"2411.17885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T21:12:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3737ef66efba33f7c24edf3e72875d999bd8068808126cd575fda05ecc25af9b","abstract_canon_sha256":"db3261da13aa35ad5e5b7fcc9d5630035723480f0fb380a7ddad03cf5e93fe70"},"schema_version":"1.0"},"canonical_sha256":"6e3a4beeb60563cec073b175654522e975b35c47aeed3ff4c242249a062e4d51","source":{"kind":"arxiv","id":"2411.17885","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17885","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17885v2","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17885","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"NY5EX3VWAVR4","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"pith_short_16","alias_value":"NY5EX3VWAVR45QDT","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"pith_short_8","alias_value":"NY5EX3VW","created_at":"2026-07-05T11:09:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NY5EX3VWAVR45QDTWF2WKRJC5F","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T21:12:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3737ef66efba33f7c24edf3e72875d999bd8068808126cd575fda05ecc25af9b","abstract_canon_sha256":"db3261da13aa35ad5e5b7fcc9d5630035723480f0fb380a7ddad03cf5e93fe70"},"schema_version":"1.0"},"canonical_sha256":"6e3a4beeb60563cec073b175654522e975b35c47aeed3ff4c242249a062e4d51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:44.228307Z","signature_b64":"ZND9HBfr+q6urHl9bNQuP+Sax7vR96lHYpg6G8FhQT2oVw74Wp07pqe5im2pF/wOdcYl/LGZajw9IVcnX9ENAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e3a4beeb60563cec073b175654522e975b35c47aeed3ff4c242249a062e4d51","last_reissued_at":"2026-07-05T11:09:44.227823Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:44.227823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17885","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-07-05T11:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9PIsnGJQ7GaOUWZkNs5LPMtgt1V1uvaanYZoj/E/8MwmrEKKqf8bo+Imxv1CbKlEyETfikV/x17Gasvq8SJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:40:14.761606Z"},"content_sha256":"fc1297c1c2d93c2a9996c4555c29412257e5c9a0f8bce4264a6ab1b1a5384b0a","schema_version":"1.0","event_id":"sha256:fc1297c1c2d93c2a9996c4555c29412257e5c9a0f8bce4264a6ab1b1a5384b0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NY5EX3VWAVR45QDTWF2WKRJC5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"C. G. Fernandes, C. M. Sato, E. F. de Figueiredo, F. Botler, R. G\\'omez, V. F. dos Santos, Y. S. Couto","submitted_at":"2024-11-26T21:12:34Z","abstract_excerpt":"Chernyshev, Rauch, and Rautenbach proved that every connected graph on $n$ vertices with less than $\\frac{11}{5}n-\\frac{18}{5}$ edges has a vertex cut that induces a forest, and conjectured that the same remains true if the graph has less than $3n-6$ edges. We improve their result by proving that every connected graph on $n$ vertices with less than $\\frac{9}{4}n$ edges has a vertex cut that induces a forest. We also study weaker versions of the problem that might lead to an improvement on the bound obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17885","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17885/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-05T11:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mTkMr9YNtQ/AhzVHX70Hh3GTOxdRRqeSvwn3OF6e+cqDU2B7tE7/vlVoNAu/diPQrdSIU+xbPDOCoqKqNNMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:40:14.762163Z"},"content_sha256":"7b407ede4650cb744d192b81f7ff5ca811816b44be5859b0b56cc2494e015357","schema_version":"1.0","event_id":"sha256:7b407ede4650cb744d192b81f7ff5ca811816b44be5859b0b56cc2494e015357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NY5EX3VWAVR45QDTWF2WKRJC5F/bundle.json","state_url":"https://pith.science/pith/NY5EX3VWAVR45QDTWF2WKRJC5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NY5EX3VWAVR45QDTWF2WKRJC5F/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-08-13T11:40:14Z","links":{"resolver":"https://pith.science/pith/NY5EX3VWAVR45QDTWF2WKRJC5F","bundle":"https://pith.science/pith/NY5EX3VWAVR45QDTWF2WKRJC5F/bundle.json","state":"https://pith.science/pith/NY5EX3VWAVR45QDTWF2WKRJC5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NY5EX3VWAVR45QDTWF2WKRJC5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NY5EX3VWAVR45QDTWF2WKRJC5F","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":"db3261da13aa35ad5e5b7fcc9d5630035723480f0fb380a7ddad03cf5e93fe70","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T21:12:34Z","title_canon_sha256":"3737ef66efba33f7c24edf3e72875d999bd8068808126cd575fda05ecc25af9b"},"schema_version":"1.0","source":{"id":"2411.17885","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17885","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17885v2","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17885","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"NY5EX3VWAVR4","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"pith_short_16","alias_value":"NY5EX3VWAVR45QDT","created_at":"2026-07-05T11:09:44Z"},{"alias_kind":"pith_short_8","alias_value":"NY5EX3VW","created_at":"2026-07-05T11:09:44Z"}],"graph_snapshots":[{"event_id":"sha256:7b407ede4650cb744d192b81f7ff5ca811816b44be5859b0b56cc2494e015357","target":"graph","created_at":"2026-07-05T11:09:44Z","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/2411.17885/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Chernyshev, Rauch, and Rautenbach proved that every connected graph on $n$ vertices with less than $\\frac{11}{5}n-\\frac{18}{5}$ edges has a vertex cut that induces a forest, and conjectured that the same remains true if the graph has less than $3n-6$ edges. We improve their result by proving that every connected graph on $n$ vertices with less than $\\frac{9}{4}n$ edges has a vertex cut that induces a forest. We also study weaker versions of the problem that might lead to an improvement on the bound obtained.","authors_text":"C. G. Fernandes, C. M. Sato, E. F. de Figueiredo, F. Botler, R. G\\'omez, V. F. dos Santos, Y. S. Couto","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T21:12:34Z","title":"Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17885","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:fc1297c1c2d93c2a9996c4555c29412257e5c9a0f8bce4264a6ab1b1a5384b0a","target":"record","created_at":"2026-07-05T11:09:44Z","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":"db3261da13aa35ad5e5b7fcc9d5630035723480f0fb380a7ddad03cf5e93fe70","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T21:12:34Z","title_canon_sha256":"3737ef66efba33f7c24edf3e72875d999bd8068808126cd575fda05ecc25af9b"},"schema_version":"1.0","source":{"id":"2411.17885","kind":"arxiv","version":2}},"canonical_sha256":"6e3a4beeb60563cec073b175654522e975b35c47aeed3ff4c242249a062e4d51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e3a4beeb60563cec073b175654522e975b35c47aeed3ff4c242249a062e4d51","first_computed_at":"2026-07-05T11:09:44.227823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:09:44.227823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZND9HBfr+q6urHl9bNQuP+Sax7vR96lHYpg6G8FhQT2oVw74Wp07pqe5im2pF/wOdcYl/LGZajw9IVcnX9ENAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:09:44.228307Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17885","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc1297c1c2d93c2a9996c4555c29412257e5c9a0f8bce4264a6ab1b1a5384b0a","sha256:7b407ede4650cb744d192b81f7ff5ca811816b44be5859b0b56cc2494e015357"],"state_sha256":"cf90e25302545e1b7329db94e03b91889289680c0561245958aad16e0ff951aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hn9HwcDSkr0rsLgSEjjE6T3XqvmJ33tFeAPuUS+v4Y7yF80deJ7lB+OeibC7mknerkVozMASB/tC74BUBEmTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T11:40:14.766984Z","bundle_sha256":"6c1dd8b13760cb74eb6b582450af6e78615c951d894f1b09d14e8469353b7705"}}