{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UUC5VHJEBC3RTYKXVZPCWGJCOY","short_pith_number":"pith:UUC5VHJE","canonical_record":{"source":{"id":"2501.13980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-23T02:40:55Z","cross_cats_sorted":[],"title_canon_sha256":"55d2fa29e905d296e1381a6049b7c2ad86c3c5376b54c706b261e1ded26ea113","abstract_canon_sha256":"b3e8af914e679daf6acba43d733e1c0ba44761f01ae4e1a2f69013424c403af0"},"schema_version":"1.0"},"canonical_sha256":"a505da9d2408b719e157ae5e2b192276266128884bc3112e1158d563c5408168","source":{"kind":"arxiv","id":"2501.13980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13980","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13980v1","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13980","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"UUC5VHJEBC3R","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"pith_short_16","alias_value":"UUC5VHJEBC3RTYKX","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"pith_short_8","alias_value":"UUC5VHJE","created_at":"2026-07-05T10:04:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UUC5VHJEBC3RTYKXVZPCWGJCOY","target":"record","payload":{"canonical_record":{"source":{"id":"2501.13980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-23T02:40:55Z","cross_cats_sorted":[],"title_canon_sha256":"55d2fa29e905d296e1381a6049b7c2ad86c3c5376b54c706b261e1ded26ea113","abstract_canon_sha256":"b3e8af914e679daf6acba43d733e1c0ba44761f01ae4e1a2f69013424c403af0"},"schema_version":"1.0"},"canonical_sha256":"a505da9d2408b719e157ae5e2b192276266128884bc3112e1158d563c5408168","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:43.379626Z","signature_b64":"SSOdWYUgtutK9v5QaWh9BoKidMZKrncnhA1Xqxwn0ZUW5AscD4M/6YnY3AQXDjVK0whtaYIrCqfEMPkui1PYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a505da9d2408b719e157ae5e2b192276266128884bc3112e1158d563c5408168","last_reissued_at":"2026-07-05T10:04:43.379128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:43.379128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.13980","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-05T10:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5WYygHJWz/GeRLP3qiOgoEkvRGVtoK9tMMxPxyH62Mhplop/nxd1bhMmKnBZsob8fggELCftztJepQiE54ZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:46:30.826064Z"},"content_sha256":"a7712c5b3851996ae3d5fe52c2ad3e80b392cf740a74abfad88a9fcbb33a7b3c","schema_version":"1.0","event_id":"sha256:a7712c5b3851996ae3d5fe52c2ad3e80b392cf740a74abfad88a9fcbb33a7b3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UUC5VHJEBC3RTYKXVZPCWGJCOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The minimum size of a $k$-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":"2025-01-23T02:40:55Z","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. Clearly, a graph is locally nonforesty if and only if every vertex of the graph is the hub of a wheel. We determine the minimum size of a $k$-connected locally nonforesty graph of order $n.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13980","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/2501.13980/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-05T10:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SO4yTsCddTRtokzQk1pAk2A+bYgtA06UVaFDSbCR0lJi7yc0BguZX8AJulqT+3J/e/tC/t4O1IpZY6+gL18yCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:46:30.826537Z"},"content_sha256":"8ab8ad5e5288dc34d2ce3beed43e8e9d5f18d4b3392cb74579456de256085f76","schema_version":"1.0","event_id":"sha256:8ab8ad5e5288dc34d2ce3beed43e8e9d5f18d4b3392cb74579456de256085f76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUC5VHJEBC3RTYKXVZPCWGJCOY/bundle.json","state_url":"https://pith.science/pith/UUC5VHJEBC3RTYKXVZPCWGJCOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUC5VHJEBC3RTYKXVZPCWGJCOY/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-13T16:46:30Z","links":{"resolver":"https://pith.science/pith/UUC5VHJEBC3RTYKXVZPCWGJCOY","bundle":"https://pith.science/pith/UUC5VHJEBC3RTYKXVZPCWGJCOY/bundle.json","state":"https://pith.science/pith/UUC5VHJEBC3RTYKXVZPCWGJCOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUC5VHJEBC3RTYKXVZPCWGJCOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UUC5VHJEBC3RTYKXVZPCWGJCOY","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":"b3e8af914e679daf6acba43d733e1c0ba44761f01ae4e1a2f69013424c403af0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-23T02:40:55Z","title_canon_sha256":"55d2fa29e905d296e1381a6049b7c2ad86c3c5376b54c706b261e1ded26ea113"},"schema_version":"1.0","source":{"id":"2501.13980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13980","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13980v1","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13980","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"UUC5VHJEBC3R","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"pith_short_16","alias_value":"UUC5VHJEBC3RTYKX","created_at":"2026-07-05T10:04:43Z"},{"alias_kind":"pith_short_8","alias_value":"UUC5VHJE","created_at":"2026-07-05T10:04:43Z"}],"graph_snapshots":[{"event_id":"sha256:8ab8ad5e5288dc34d2ce3beed43e8e9d5f18d4b3392cb74579456de256085f76","target":"graph","created_at":"2026-07-05T10:04:43Z","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/2501.13980/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. Clearly, a graph is locally nonforesty if and only if every vertex of the graph is the hub of a wheel. We determine the minimum size of a $k$-connected locally nonforesty graph of order $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":"2025-01-23T02:40:55Z","title":"The minimum size of a $k$-connected locally nonforesty graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13980","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:a7712c5b3851996ae3d5fe52c2ad3e80b392cf740a74abfad88a9fcbb33a7b3c","target":"record","created_at":"2026-07-05T10:04:43Z","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":"b3e8af914e679daf6acba43d733e1c0ba44761f01ae4e1a2f69013424c403af0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-23T02:40:55Z","title_canon_sha256":"55d2fa29e905d296e1381a6049b7c2ad86c3c5376b54c706b261e1ded26ea113"},"schema_version":"1.0","source":{"id":"2501.13980","kind":"arxiv","version":1}},"canonical_sha256":"a505da9d2408b719e157ae5e2b192276266128884bc3112e1158d563c5408168","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a505da9d2408b719e157ae5e2b192276266128884bc3112e1158d563c5408168","first_computed_at":"2026-07-05T10:04:43.379128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:04:43.379128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SSOdWYUgtutK9v5QaWh9BoKidMZKrncnhA1Xqxwn0ZUW5AscD4M/6YnY3AQXDjVK0whtaYIrCqfEMPkui1PYAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:04:43.379626Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.13980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7712c5b3851996ae3d5fe52c2ad3e80b392cf740a74abfad88a9fcbb33a7b3c","sha256:8ab8ad5e5288dc34d2ce3beed43e8e9d5f18d4b3392cb74579456de256085f76"],"state_sha256":"5be301f13535ca3f32238c2c4c7bfd0e1112553088999edb1b49a839cdd51233"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ikm0Lg6wAcKRiMDHvee3HNik/8TBdAPM1SWHkAZ7dlEfDQuJ7ImkncNRLMQC114y4NDGUvO73fz+vefv/OoyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T16:46:30.832023Z","bundle_sha256":"df001efe90a8784f13cbece254f2928c7d20e0b1d6e8e0098201a368d7e82965"}}