{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BYWZR2Y4QEVBWBNMVLMVZEBL2I","short_pith_number":"pith:BYWZR2Y4","schema_version":"1.0","canonical_sha256":"0e2d98eb1c812a1b05acaad95c902bd20ef6b7c6a0cd9945d303d0c2fdc8cf19","source":{"kind":"arxiv","id":"1305.1089","version":3},"attestation_state":"computed","paper":{"title":"Graphs with large generalized (edge-)connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yaping Mao","submitted_at":"2013-05-06T05:32:01Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized $k$-edge-connectivity $\\lambda_k(G)$. In this paper, graphs of order $n$ such that $\\kappa_k(G)=n-\\frac{k}{2}-1$ and $\\lambda_k(G)=n-\\frac{k}{2}-1$ for even $k$ are characterized."},"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":"1305.1089","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-06T05:32:01Z","cross_cats_sorted":[],"title_canon_sha256":"90ef44d14a9f7a6cafba791494854b5f64aea450fce147589b0c413822f10faf","abstract_canon_sha256":"892f59f3a5bb28aeb27aab8d88ef24f64506a561156494b63e5a3fd64ef19758"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:36.043747Z","signature_b64":"bEy/Jffd9Iv4n1IE5or47TnLV2FU4TCjq2Xsj2oC90DS9TwgY22CQDoP6INFHbG09CV7yedwndcNxmc5h2cTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e2d98eb1c812a1b05acaad95c902bd20ef6b7c6a0cd9945d303d0c2fdc8cf19","last_reissued_at":"2026-05-18T01:34:36.043076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:36.043076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with large generalized (edge-)connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yaping Mao","submitted_at":"2013-05-06T05:32:01Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized $k$-edge-connectivity $\\lambda_k(G)$. In this paper, graphs of order $n$ such that $\\kappa_k(G)=n-\\frac{k}{2}-1$ and $\\lambda_k(G)=n-\\frac{k}{2}-1$ for even $k$ are characterized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1089","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.1089","created_at":"2026-05-18T01:34:36.043180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1089v3","created_at":"2026-05-18T01:34:36.043180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1089","created_at":"2026-05-18T01:34:36.043180+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYWZR2Y4QEVB","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYWZR2Y4QEVBWBNM","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYWZR2Y4","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYWZR2Y4QEVBWBNMVLMVZEBL2I","json":"https://pith.science/pith/BYWZR2Y4QEVBWBNMVLMVZEBL2I.json","graph_json":"https://pith.science/api/pith-number/BYWZR2Y4QEVBWBNMVLMVZEBL2I/graph.json","events_json":"https://pith.science/api/pith-number/BYWZR2Y4QEVBWBNMVLMVZEBL2I/events.json","paper":"https://pith.science/paper/BYWZR2Y4"},"agent_actions":{"view_html":"https://pith.science/pith/BYWZR2Y4QEVBWBNMVLMVZEBL2I","download_json":"https://pith.science/pith/BYWZR2Y4QEVBWBNMVLMVZEBL2I.json","view_paper":"https://pith.science/paper/BYWZR2Y4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1089&json=true","fetch_graph":"https://pith.science/api/pith-number/BYWZR2Y4QEVBWBNMVLMVZEBL2I/graph.json","fetch_events":"https://pith.science/api/pith-number/BYWZR2Y4QEVBWBNMVLMVZEBL2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYWZR2Y4QEVBWBNMVLMVZEBL2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYWZR2Y4QEVBWBNMVLMVZEBL2I/action/storage_attestation","attest_author":"https://pith.science/pith/BYWZR2Y4QEVBWBNMVLMVZEBL2I/action/author_attestation","sign_citation":"https://pith.science/pith/BYWZR2Y4QEVBWBNMVLMVZEBL2I/action/citation_signature","submit_replication":"https://pith.science/pith/BYWZR2Y4QEVBWBNMVLMVZEBL2I/action/replication_record"}},"created_at":"2026-05-18T01:34:36.043180+00:00","updated_at":"2026-05-18T01:34:36.043180+00:00"}