{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WAXUKLQ5LSOR2VYPMMQQHPGNO5","short_pith_number":"pith:WAXUKLQ5","canonical_record":{"source":{"id":"1106.4411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-22T10:34:25Z","cross_cats_sorted":[],"title_canon_sha256":"cb3f32247352ba2fd7eca82711e40caf227c1e8ff623db2eed748de9b0aabe3a","abstract_canon_sha256":"70c0cce1790f71b43e9b27d385efeb576bcfdfa1e64f851debf82d2db97eaf09"},"schema_version":"1.0"},"canonical_sha256":"b02f452e1d5c9d1d570f632103bccd777c578745a4d443ffe43839c453b31a73","source":{"kind":"arxiv","id":"1106.4411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4411","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4411v1","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4411","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"WAXUKLQ5LSOR","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WAXUKLQ5LSOR2VYP","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WAXUKLQ5","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WAXUKLQ5LSOR2VYPMMQQHPGNO5","target":"record","payload":{"canonical_record":{"source":{"id":"1106.4411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-22T10:34:25Z","cross_cats_sorted":[],"title_canon_sha256":"cb3f32247352ba2fd7eca82711e40caf227c1e8ff623db2eed748de9b0aabe3a","abstract_canon_sha256":"70c0cce1790f71b43e9b27d385efeb576bcfdfa1e64f851debf82d2db97eaf09"},"schema_version":"1.0"},"canonical_sha256":"b02f452e1d5c9d1d570f632103bccd777c578745a4d443ffe43839c453b31a73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:33.028983Z","signature_b64":"BBmT5XecWAqN3GGzs88q0rObwHq5iLJw4aOn8KYI1wt2MELOl/UvrgJVX/9dyngy3ksQfvG80+U2UdOyNmdrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b02f452e1d5c9d1d570f632103bccd777c578745a4d443ffe43839c453b31a73","last_reissued_at":"2026-05-18T04:19:33.028589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:33.028589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.4411","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-05-18T04:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2E448Dfal++W6BwCjG3CmzbWJWfVgNKsCzun8JccaBzAnze2hJwaDhYRKngbY14XYCM/3HcC/JxjkeVfVrMGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:06:35.156662Z"},"content_sha256":"ecee03f0655ac20d5cd2fd969e3fe7c5e92dcd82d2c7c944029cb000c49b5c7d","schema_version":"1.0","event_id":"sha256:ecee03f0655ac20d5cd2fd969e3fe7c5e92dcd82d2c7c944029cb000c49b5c7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WAXUKLQ5LSOR2VYPMMQQHPGNO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on the minimal size of a graph with generalized connectivity kappa_3= 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shasha Li, Xueliang Li, Yongtang Shi","submitted_at":"2011-06-22T10:34:25Z","abstract_excerpt":"The concept of generalized $k$-connectivity $\\kappa_{k}(G)$ of a graph $G$ was introduced by Chartrand et al. in recent years. In our early paper, extremal theory for this graph parameter was started. We determined the minimal number of edges of a graph of order $n$ with $\\kappa_{3}= 2$, i.e., for a graph $G$ of order $n$ and size $e(G)$ with $\\kappa_{3}(G)= 2$, we proved that $e(G)\\geq (6/5)n$, and the lower bound is sharp by constructing a class of graphs, only for $n\\equiv 0 \\ (mod \\ 5)$ and $n\\neq 10$. In this paper, we improve the lower bound to $\\lceil(6/5)n\\rceil$. Moreover, we show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4411","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":""},"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-05-18T04:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNpTHci4uFoYszVwnh8qnuE5fLzYBEuWAkhF4mEsKfzV7FUqhlJbkE2dPPMJnaIL0FZxKCkacGhcX7j5dnRaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:06:35.157330Z"},"content_sha256":"a8b34d9c4615e24a38c1776e13e8ebdae7e2447cde2b92a35d60e607ae1fad70","schema_version":"1.0","event_id":"sha256:a8b34d9c4615e24a38c1776e13e8ebdae7e2447cde2b92a35d60e607ae1fad70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAXUKLQ5LSOR2VYPMMQQHPGNO5/bundle.json","state_url":"https://pith.science/pith/WAXUKLQ5LSOR2VYPMMQQHPGNO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAXUKLQ5LSOR2VYPMMQQHPGNO5/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-05-26T04:06:35Z","links":{"resolver":"https://pith.science/pith/WAXUKLQ5LSOR2VYPMMQQHPGNO5","bundle":"https://pith.science/pith/WAXUKLQ5LSOR2VYPMMQQHPGNO5/bundle.json","state":"https://pith.science/pith/WAXUKLQ5LSOR2VYPMMQQHPGNO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAXUKLQ5LSOR2VYPMMQQHPGNO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WAXUKLQ5LSOR2VYPMMQQHPGNO5","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":"70c0cce1790f71b43e9b27d385efeb576bcfdfa1e64f851debf82d2db97eaf09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-22T10:34:25Z","title_canon_sha256":"cb3f32247352ba2fd7eca82711e40caf227c1e8ff623db2eed748de9b0aabe3a"},"schema_version":"1.0","source":{"id":"1106.4411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4411","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4411v1","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4411","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"WAXUKLQ5LSOR","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WAXUKLQ5LSOR2VYP","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WAXUKLQ5","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:a8b34d9c4615e24a38c1776e13e8ebdae7e2447cde2b92a35d60e607ae1fad70","target":"graph","created_at":"2026-05-18T04:19:33Z","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"},"paper":{"abstract_excerpt":"The concept of generalized $k$-connectivity $\\kappa_{k}(G)$ of a graph $G$ was introduced by Chartrand et al. in recent years. In our early paper, extremal theory for this graph parameter was started. We determined the minimal number of edges of a graph of order $n$ with $\\kappa_{3}= 2$, i.e., for a graph $G$ of order $n$ and size $e(G)$ with $\\kappa_{3}(G)= 2$, we proved that $e(G)\\geq (6/5)n$, and the lower bound is sharp by constructing a class of graphs, only for $n\\equiv 0 \\ (mod \\ 5)$ and $n\\neq 10$. In this paper, we improve the lower bound to $\\lceil(6/5)n\\rceil$. Moreover, we show tha","authors_text":"Shasha Li, Xueliang Li, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-22T10:34:25Z","title":"Note on the minimal size of a graph with generalized connectivity kappa_3= 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4411","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:ecee03f0655ac20d5cd2fd969e3fe7c5e92dcd82d2c7c944029cb000c49b5c7d","target":"record","created_at":"2026-05-18T04:19:33Z","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":"70c0cce1790f71b43e9b27d385efeb576bcfdfa1e64f851debf82d2db97eaf09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-22T10:34:25Z","title_canon_sha256":"cb3f32247352ba2fd7eca82711e40caf227c1e8ff623db2eed748de9b0aabe3a"},"schema_version":"1.0","source":{"id":"1106.4411","kind":"arxiv","version":1}},"canonical_sha256":"b02f452e1d5c9d1d570f632103bccd777c578745a4d443ffe43839c453b31a73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b02f452e1d5c9d1d570f632103bccd777c578745a4d443ffe43839c453b31a73","first_computed_at":"2026-05-18T04:19:33.028589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:33.028589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BBmT5XecWAqN3GGzs88q0rObwHq5iLJw4aOn8KYI1wt2MELOl/UvrgJVX/9dyngy3ksQfvG80+U2UdOyNmdrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:33.028983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.4411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecee03f0655ac20d5cd2fd969e3fe7c5e92dcd82d2c7c944029cb000c49b5c7d","sha256:a8b34d9c4615e24a38c1776e13e8ebdae7e2447cde2b92a35d60e607ae1fad70"],"state_sha256":"baacfb8f48a69f1052a8aa97ad0c1ecd8e32b1d43441096719d432338e812f00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8o4Tw4DQA89aXbZpNTvgF1C/xLXb2XH4YzEynLCNT5XP4KCpd06d17vAZz6J/bMWbD9RiHt3A1PFOzqrRLYLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:06:35.160477Z","bundle_sha256":"b6f1635d7e074db54a00146ed81627bc881dbff99565f43ba8a7c302029322aa"}}