{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZA6G2LNBSWRQUSJE4QCTJDXWPR","short_pith_number":"pith:ZA6G2LNB","schema_version":"1.0","canonical_sha256":"c83c6d2da195a30a4924e405348ef67c70bce5f3d680537ac22f75506e44b158","source":{"kind":"arxiv","id":"1904.06527","version":1},"attestation_state":"computed","paper":{"title":"On the $g$-extra connectivity of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sun-Yuan Hsieh, Yaping Mao, Zhao Wang","submitted_at":"2019-04-13T11:14:21Z","abstract_excerpt":"Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network $G$. In 1996, F\\`{a}brega and Fiol proposed the $g$-extra connectivity of $G$. A subset of vertices $S$ is said to be a \\emph{cutset} if $G-S$ is not connected. A cutset $S$ is called an \\emph{$R_g$-cutset}, where $g$ is a non-negative integer, if every component of $G-S$ has at least $g+1$ vertices. If $G$ has at least one $R_g$-cutset, the \\emph{$g$-extra connectivity} of $G$, denoted by $\\kappa_g(G)$, is then defined as the minimum cardinality over all $R_g$-cutsets of $G$. In t"},"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":"1904.06527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-13T11:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"c1499c32d3492f9ba4c5ffa959c847eaa9c17ea28c25b85321b4a81b930b0078","abstract_canon_sha256":"a1866df662d464f4d71cb5deb9799073ab9371731ae9bad61489b330a1b77e92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:38.946554Z","signature_b64":"R8qljRXoX81zxla6QofG+h9jNiBcqfoGZvt8zPpZxsM8mSg+PqvC5jcXZ39BWETzX+k8ucxyxVXFS2OqOxsODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c83c6d2da195a30a4924e405348ef67c70bce5f3d680537ac22f75506e44b158","last_reissued_at":"2026-05-17T23:48:38.946016Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:38.946016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $g$-extra connectivity of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sun-Yuan Hsieh, Yaping Mao, Zhao Wang","submitted_at":"2019-04-13T11:14:21Z","abstract_excerpt":"Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network $G$. In 1996, F\\`{a}brega and Fiol proposed the $g$-extra connectivity of $G$. A subset of vertices $S$ is said to be a \\emph{cutset} if $G-S$ is not connected. A cutset $S$ is called an \\emph{$R_g$-cutset}, where $g$ is a non-negative integer, if every component of $G-S$ has at least $g+1$ vertices. If $G$ has at least one $R_g$-cutset, the \\emph{$g$-extra connectivity} of $G$, denoted by $\\kappa_g(G)$, is then defined as the minimum cardinality over all $R_g$-cutsets of $G$. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06527","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.06527","created_at":"2026-05-17T23:48:38.946115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06527v1","created_at":"2026-05-17T23:48:38.946115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06527","created_at":"2026-05-17T23:48:38.946115+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZA6G2LNBSWRQ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZA6G2LNBSWRQUSJE","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZA6G2LNB","created_at":"2026-05-18T12:33:33.725879+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/ZA6G2LNBSWRQUSJE4QCTJDXWPR","json":"https://pith.science/pith/ZA6G2LNBSWRQUSJE4QCTJDXWPR.json","graph_json":"https://pith.science/api/pith-number/ZA6G2LNBSWRQUSJE4QCTJDXWPR/graph.json","events_json":"https://pith.science/api/pith-number/ZA6G2LNBSWRQUSJE4QCTJDXWPR/events.json","paper":"https://pith.science/paper/ZA6G2LNB"},"agent_actions":{"view_html":"https://pith.science/pith/ZA6G2LNBSWRQUSJE4QCTJDXWPR","download_json":"https://pith.science/pith/ZA6G2LNBSWRQUSJE4QCTJDXWPR.json","view_paper":"https://pith.science/paper/ZA6G2LNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06527&json=true","fetch_graph":"https://pith.science/api/pith-number/ZA6G2LNBSWRQUSJE4QCTJDXWPR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZA6G2LNBSWRQUSJE4QCTJDXWPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZA6G2LNBSWRQUSJE4QCTJDXWPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZA6G2LNBSWRQUSJE4QCTJDXWPR/action/storage_attestation","attest_author":"https://pith.science/pith/ZA6G2LNBSWRQUSJE4QCTJDXWPR/action/author_attestation","sign_citation":"https://pith.science/pith/ZA6G2LNBSWRQUSJE4QCTJDXWPR/action/citation_signature","submit_replication":"https://pith.science/pith/ZA6G2LNBSWRQUSJE4QCTJDXWPR/action/replication_record"}},"created_at":"2026-05-17T23:48:38.946115+00:00","updated_at":"2026-05-17T23:48:38.946115+00:00"}