{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5HGTKLERUDHWD6SQDPJDGMFMN2","short_pith_number":"pith:5HGTKLER","schema_version":"1.0","canonical_sha256":"e9cd352c91a0cf61fa501bd23330ac6ea4a30ac90b1ced1c4f0f7b9d427ad306","source":{"kind":"arxiv","id":"2410.23702","version":1},"attestation_state":"computed","paper":{"title":"The minimum size of a $3$-connected locally nonforesty graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Xingzhi Zhan, Yurui Tang","submitted_at":"2024-10-31T07:48:35Z","abstract_excerpt":"A local subgraph of a graph is the subgraph induced by the neighborhood of a vertex. Thus a graph of order $n$ has $n$ local subgraphs. A graph $G$ is called locally nonforesty if every local subgraph of $G$ contains a cycle. Recently, in studying forest cuts of a graph, Chernyshev, Rauch and Rautenbach posed the conjecture that if $n$ and $m$ are the order and size of a $3$-connected locally nonforesty graph respectively, then $m\\ge 7(n-1)/3.$ We solve this problem by determining the minimum size of a $3$-connected locally nonforesty graph of order $n.$ It turns out that the conjecture does n"},"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":"2410.23702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T07:48:35Z","cross_cats_sorted":[],"title_canon_sha256":"7880823ed986ab0ff82fd718d3cd46e0981058c0d84dd6adb6740e66c22d1e6f","abstract_canon_sha256":"521713b9e1cb3e3db2fe4e561f79c4f3658e82b5118a09f32fe1217aa97336c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:04.096779Z","signature_b64":"IfsoZo4efEwPnJdf/J5/jlrbcZlxi9B75+yXbVuQ2EakD0zcKq4XoKL4eDSk68es2dzOyKlPWaISQjHtRtrlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9cd352c91a0cf61fa501bd23330ac6ea4a30ac90b1ced1c4f0f7b9d427ad306","last_reissued_at":"2026-07-05T09:29:04.096234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:04.096234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum size of a $3$-connected locally nonforesty graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Xingzhi Zhan, Yurui Tang","submitted_at":"2024-10-31T07:48:35Z","abstract_excerpt":"A local subgraph of a graph is the subgraph induced by the neighborhood of a vertex. Thus a graph of order $n$ has $n$ local subgraphs. A graph $G$ is called locally nonforesty if every local subgraph of $G$ contains a cycle. Recently, in studying forest cuts of a graph, Chernyshev, Rauch and Rautenbach posed the conjecture that if $n$ and $m$ are the order and size of a $3$-connected locally nonforesty graph respectively, then $m\\ge 7(n-1)/3.$ We solve this problem by determining the minimum size of a $3$-connected locally nonforesty graph of order $n.$ It turns out that the conjecture does n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23702","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/2410.23702/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.23702","created_at":"2026-07-05T09:29:04.096297+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23702v1","created_at":"2026-07-05T09:29:04.096297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23702","created_at":"2026-07-05T09:29:04.096297+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HGTKLERUDHW","created_at":"2026-07-05T09:29:04.096297+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HGTKLERUDHWD6SQ","created_at":"2026-07-05T09:29:04.096297+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HGTKLER","created_at":"2026-07-05T09:29:04.096297+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13980","citing_title":"The minimum size of a $k$-connected locally nonforesty graph","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2","json":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2.json","graph_json":"https://pith.science/api/pith-number/5HGTKLERUDHWD6SQDPJDGMFMN2/graph.json","events_json":"https://pith.science/api/pith-number/5HGTKLERUDHWD6SQDPJDGMFMN2/events.json","paper":"https://pith.science/paper/5HGTKLER"},"agent_actions":{"view_html":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2","download_json":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2.json","view_paper":"https://pith.science/paper/5HGTKLER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23702&json=true","fetch_graph":"https://pith.science/api/pith-number/5HGTKLERUDHWD6SQDPJDGMFMN2/graph.json","fetch_events":"https://pith.science/api/pith-number/5HGTKLERUDHWD6SQDPJDGMFMN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/action/storage_attestation","attest_author":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/action/author_attestation","sign_citation":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/action/citation_signature","submit_replication":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/action/replication_record"}},"created_at":"2026-07-05T09:29:04.096297+00:00","updated_at":"2026-07-05T09:29:04.096297+00:00"}