{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5HGTKLERUDHWD6SQDPJDGMFMN2","short_pith_number":"pith:5HGTKLER","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"},"canonical_sha256":"e9cd352c91a0cf61fa501bd23330ac6ea4a30ac90b1ced1c4f0f7b9d427ad306","source":{"kind":"arxiv","id":"2410.23702","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23702","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23702v1","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23702","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"5HGTKLERUDHW","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"pith_short_16","alias_value":"5HGTKLERUDHWD6SQ","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"pith_short_8","alias_value":"5HGTKLER","created_at":"2026-07-05T09:29:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5HGTKLERUDHWD6SQDPJDGMFMN2","target":"record","payload":{"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"},"canonical_sha256":"e9cd352c91a0cf61fa501bd23330ac6ea4a30ac90b1ced1c4f0f7b9d427ad306","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"},"source_kind":"arxiv","source_id":"2410.23702","source_version":1,"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-05T09:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Npj+nhMq83YKM+a6NmewU5D+glD9Pboi/I6l1+nZqK9JLE8TCG/H/5awogvMns2RgOy2Te2rt4BfK7NgyPzyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:09:12.526798Z"},"content_sha256":"e7d404fe9a4046ec22450065f385346282a777aca209af8f7d1234fd34236573","schema_version":"1.0","event_id":"sha256:e7d404fe9a4046ec22450065f385346282a777aca209af8f7d1234fd34236573"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5HGTKLERUDHWD6SQDPJDGMFMN2","target":"graph","payload":{"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"},"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-05T09:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vAKopgb+VNvhJV8vupCHH/SUINZXMOUrtVDJDfcOx7b4WR8eff5uHeLqjpctOmemuEEQ+CKT2DincJt4hfG0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:09:12.527757Z"},"content_sha256":"6533959f5379289dac5be585c8859e6426f1bdafcd59580e2812ff587035e770","schema_version":"1.0","event_id":"sha256:6533959f5379289dac5be585c8859e6426f1bdafcd59580e2812ff587035e770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/bundle.json","state_url":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/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-13T13:09:12Z","links":{"resolver":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2","bundle":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/bundle.json","state":"https://pith.science/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HGTKLERUDHWD6SQDPJDGMFMN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5HGTKLERUDHWD6SQDPJDGMFMN2","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":"521713b9e1cb3e3db2fe4e561f79c4f3658e82b5118a09f32fe1217aa97336c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T07:48:35Z","title_canon_sha256":"7880823ed986ab0ff82fd718d3cd46e0981058c0d84dd6adb6740e66c22d1e6f"},"schema_version":"1.0","source":{"id":"2410.23702","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23702","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23702v1","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23702","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"5HGTKLERUDHW","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"pith_short_16","alias_value":"5HGTKLERUDHWD6SQ","created_at":"2026-07-05T09:29:04Z"},{"alias_kind":"pith_short_8","alias_value":"5HGTKLER","created_at":"2026-07-05T09:29:04Z"}],"graph_snapshots":[{"event_id":"sha256:6533959f5379289dac5be585c8859e6426f1bdafcd59580e2812ff587035e770","target":"graph","created_at":"2026-07-05T09:29:04Z","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/2410.23702/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chengli Li, Xingzhi Zhan, Yurui Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T07:48:35Z","title":"The minimum size of a $3$-connected locally nonforesty graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23702","kind":"arxiv","version":1},"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:e7d404fe9a4046ec22450065f385346282a777aca209af8f7d1234fd34236573","target":"record","created_at":"2026-07-05T09:29:04Z","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":"521713b9e1cb3e3db2fe4e561f79c4f3658e82b5118a09f32fe1217aa97336c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T07:48:35Z","title_canon_sha256":"7880823ed986ab0ff82fd718d3cd46e0981058c0d84dd6adb6740e66c22d1e6f"},"schema_version":"1.0","source":{"id":"2410.23702","kind":"arxiv","version":1}},"canonical_sha256":"e9cd352c91a0cf61fa501bd23330ac6ea4a30ac90b1ced1c4f0f7b9d427ad306","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9cd352c91a0cf61fa501bd23330ac6ea4a30ac90b1ced1c4f0f7b9d427ad306","first_computed_at":"2026-07-05T09:29:04.096234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:29:04.096234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IfsoZo4efEwPnJdf/J5/jlrbcZlxi9B75+yXbVuQ2EakD0zcKq4XoKL4eDSk68es2dzOyKlPWaISQjHtRtrlCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:29:04.096779Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.23702","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7d404fe9a4046ec22450065f385346282a777aca209af8f7d1234fd34236573","sha256:6533959f5379289dac5be585c8859e6426f1bdafcd59580e2812ff587035e770"],"state_sha256":"48b8faf5e37ea0b5258a033700910b8cbaf4103da40cbc7e87961456a4c6fd34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBDmmBYLqeaSUnF1OWzUK4+ecfemtZc8JFzSde3SphTqDpv0hpEFj3j3aNbiGuslmOLvZ89I+1NzCIjVeFtwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T13:09:12.534704Z","bundle_sha256":"8df9489837f989bfecea10dfcabcf17c8d1aaf409f5e716c026c8a0d137efdb5"}}