{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:G4WOCOAF62KLOQT4RWWHC6LZET","short_pith_number":"pith:G4WOCOAF","canonical_record":{"source":{"id":"2412.03869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"73d524407f62761e3dd0f32276009d41e8a17afc8d4482605243a31dcaefa0d8","abstract_canon_sha256":"69109f16dfe9f31d9959d37ca6df6d5ca29298b0e80fdd320efdba81766ffeb1"},"schema_version":"1.0"},"canonical_sha256":"372ce13805f694b7427c8dac71797924ee07842ea34c8d8a0ea7c6c47fd451ff","source":{"kind":"arxiv","id":"2412.03869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03869","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03869v1","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03869","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"G4WOCOAF62KL","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"pith_short_16","alias_value":"G4WOCOAF62KLOQT4","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"pith_short_8","alias_value":"G4WOCOAF","created_at":"2026-07-05T09:44:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:G4WOCOAF62KLOQT4RWWHC6LZET","target":"record","payload":{"canonical_record":{"source":{"id":"2412.03869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"73d524407f62761e3dd0f32276009d41e8a17afc8d4482605243a31dcaefa0d8","abstract_canon_sha256":"69109f16dfe9f31d9959d37ca6df6d5ca29298b0e80fdd320efdba81766ffeb1"},"schema_version":"1.0"},"canonical_sha256":"372ce13805f694b7427c8dac71797924ee07842ea34c8d8a0ea7c6c47fd451ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:42.434868Z","signature_b64":"3Vw5Uy69p/C+VwSnpI6tTxJxMBqv4xIUWwbbcSB/X4xNSi+MnAXigAttzGABRt0sA7eQqItctF8ExPX/X0AECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"372ce13805f694b7427c8dac71797924ee07842ea34c8d8a0ea7c6c47fd451ff","last_reissued_at":"2026-07-05T09:44:42.434420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:42.434420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.03869","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:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e8syrqpMo20z9qHW3cepTwLCIyfV5GeDtNnb7IEUP5+Uh6y6ktRJWbSiiglljssGPV/asKBm2NmBj0vQ3cvEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:06:40.407472Z"},"content_sha256":"f52e37293288f70eadeccaac333c275a1093109554f020fd4bf5af03d827f4ac","schema_version":"1.0","event_id":"sha256:f52e37293288f70eadeccaac333c275a1093109554f020fd4bf5af03d827f4ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:G4WOCOAF62KLOQT4RWWHC6LZET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse graphs with an independent or foresty minimum vertex cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kun Cheng, Xingzhi Zhan, Yurui Tang","submitted_at":"2024-12-05T04:39:48Z","abstract_excerpt":"A connected graph is called fragile if it contains an independent vertex cut. In 2002 Chen and Yu proved that every connected graph of order $n$ and size at most $2n-4$ is fragile, and in 2013 Le and Pfender characterized the non-fragile graphs of order $n$ and size $2n-3.$ It is natural to consider minimum vertex cuts. We prove two results. (1) Every connected graph of order $n$ with $n\\ge 7$ and size at most $\\lfloor 3n/2\\rfloor$ has an independent minimum vertex cut; (2) every connected graph of order $n$ with $n\\ge 7$ and size at most $2n$ has a foresty minimum vertex cut. Both results are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03869","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/2412.03869/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:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EoGrcCNgTrXgBUfIQhwPEB9xD5COKbQ39/+LYVuPVL7bY0SEej/qZmgz9Xo/rQxH6x3aphl3nbk3vT7arjXcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:06:40.408081Z"},"content_sha256":"d0f24e153b4864a0af06937d90690fbb3107d3c504ddd7f02bf14e96961a3049","schema_version":"1.0","event_id":"sha256:d0f24e153b4864a0af06937d90690fbb3107d3c504ddd7f02bf14e96961a3049"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4WOCOAF62KLOQT4RWWHC6LZET/bundle.json","state_url":"https://pith.science/pith/G4WOCOAF62KLOQT4RWWHC6LZET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4WOCOAF62KLOQT4RWWHC6LZET/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-13T14:06:40Z","links":{"resolver":"https://pith.science/pith/G4WOCOAF62KLOQT4RWWHC6LZET","bundle":"https://pith.science/pith/G4WOCOAF62KLOQT4RWWHC6LZET/bundle.json","state":"https://pith.science/pith/G4WOCOAF62KLOQT4RWWHC6LZET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4WOCOAF62KLOQT4RWWHC6LZET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:G4WOCOAF62KLOQT4RWWHC6LZET","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":"69109f16dfe9f31d9959d37ca6df6d5ca29298b0e80fdd320efdba81766ffeb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:39:48Z","title_canon_sha256":"73d524407f62761e3dd0f32276009d41e8a17afc8d4482605243a31dcaefa0d8"},"schema_version":"1.0","source":{"id":"2412.03869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03869","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03869v1","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03869","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"G4WOCOAF62KL","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"pith_short_16","alias_value":"G4WOCOAF62KLOQT4","created_at":"2026-07-05T09:44:42Z"},{"alias_kind":"pith_short_8","alias_value":"G4WOCOAF","created_at":"2026-07-05T09:44:42Z"}],"graph_snapshots":[{"event_id":"sha256:d0f24e153b4864a0af06937d90690fbb3107d3c504ddd7f02bf14e96961a3049","target":"graph","created_at":"2026-07-05T09:44:42Z","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/2412.03869/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A connected graph is called fragile if it contains an independent vertex cut. In 2002 Chen and Yu proved that every connected graph of order $n$ and size at most $2n-4$ is fragile, and in 2013 Le and Pfender characterized the non-fragile graphs of order $n$ and size $2n-3.$ It is natural to consider minimum vertex cuts. We prove two results. (1) Every connected graph of order $n$ with $n\\ge 7$ and size at most $\\lfloor 3n/2\\rfloor$ has an independent minimum vertex cut; (2) every connected graph of order $n$ with $n\\ge 7$ and size at most $2n$ has a foresty minimum vertex cut. Both results are","authors_text":"Kun Cheng, Xingzhi Zhan, Yurui Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:39:48Z","title":"Sparse graphs with an independent or foresty minimum vertex cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03869","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:f52e37293288f70eadeccaac333c275a1093109554f020fd4bf5af03d827f4ac","target":"record","created_at":"2026-07-05T09:44:42Z","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":"69109f16dfe9f31d9959d37ca6df6d5ca29298b0e80fdd320efdba81766ffeb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:39:48Z","title_canon_sha256":"73d524407f62761e3dd0f32276009d41e8a17afc8d4482605243a31dcaefa0d8"},"schema_version":"1.0","source":{"id":"2412.03869","kind":"arxiv","version":1}},"canonical_sha256":"372ce13805f694b7427c8dac71797924ee07842ea34c8d8a0ea7c6c47fd451ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"372ce13805f694b7427c8dac71797924ee07842ea34c8d8a0ea7c6c47fd451ff","first_computed_at":"2026-07-05T09:44:42.434420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:44:42.434420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Vw5Uy69p/C+VwSnpI6tTxJxMBqv4xIUWwbbcSB/X4xNSi+MnAXigAttzGABRt0sA7eQqItctF8ExPX/X0AECw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:44:42.434868Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.03869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f52e37293288f70eadeccaac333c275a1093109554f020fd4bf5af03d827f4ac","sha256:d0f24e153b4864a0af06937d90690fbb3107d3c504ddd7f02bf14e96961a3049"],"state_sha256":"58f387d0d59a9f97cb872d3d8683c4bdbde5fd180498223e0d902180e897aa52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqXeQzdV4JFAWgrJMoWvlc4GfoPkAt7OG0vipCAyoLFnfsh97yrlhY2qE7r6A/0jP4n16rTLrtCWT03l2xCsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:06:40.414900Z","bundle_sha256":"e0e935f150e91e4addea50290ddf181e1ea8c6ad14a539b6e6e3d1f980244d1b"}}