{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RL22WDDT7ED7K4BU6QKT3L63P6","short_pith_number":"pith:RL22WDDT","schema_version":"1.0","canonical_sha256":"8af5ab0c73f907f57034f4153dafdb7f8364240e0b46501da77709fc6203273d","source":{"kind":"arxiv","id":"1705.08087","version":1},"attestation_state":"computed","paper":{"title":"Two bounds for generalized $3$-connectivity of Cartesian product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjian Lv, Hui Gao, Kaishun Wang","submitted_at":"2017-05-23T06:22:16Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_{k}(G)$ of a graph $G$, which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let $G$ and $H$ be nontrivial connected graphs. Recently, Li et al. gave a lower bound for the generalized $3$-connectivity of the Cartesian product graph $G \\square H$ and proposed a conjecture for the case that $H$ is $3$-connected. In this paper, we give two different forms of lower bounds for the generalized $3$-connectivity of Cartesian product graphs. The first lower bound is stronger than theirs, and the second confirm"},"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":"1705.08087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T06:22:16Z","cross_cats_sorted":[],"title_canon_sha256":"27b39d2e8c5e01a34c37e1ec42f92c2fdcee3c17c1ba0cb8aa7a11d2a8081246","abstract_canon_sha256":"65ca24af7e3ef0c585576cd635180a287730b41fecec65b0d157153059c076f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:49.388366Z","signature_b64":"knNzuNdB1SwEUNGpmh0X9PvYY1TVTOxgLY1zJn2CYJ5wZ1waHcEuPJMsQ7734CbZGocDuOQLFPrDHaNNEq3gAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8af5ab0c73f907f57034f4153dafdb7f8364240e0b46501da77709fc6203273d","last_reissued_at":"2026-05-18T00:43:49.387795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:49.387795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two bounds for generalized $3$-connectivity of Cartesian product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjian Lv, Hui Gao, Kaishun Wang","submitted_at":"2017-05-23T06:22:16Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_{k}(G)$ of a graph $G$, which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let $G$ and $H$ be nontrivial connected graphs. Recently, Li et al. gave a lower bound for the generalized $3$-connectivity of the Cartesian product graph $G \\square H$ and proposed a conjecture for the case that $H$ is $3$-connected. In this paper, we give two different forms of lower bounds for the generalized $3$-connectivity of Cartesian product graphs. The first lower bound is stronger than theirs, and the second confirm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08087","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":"1705.08087","created_at":"2026-05-18T00:43:49.387878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08087v1","created_at":"2026-05-18T00:43:49.387878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08087","created_at":"2026-05-18T00:43:49.387878+00:00"},{"alias_kind":"pith_short_12","alias_value":"RL22WDDT7ED7","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RL22WDDT7ED7K4BU","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RL22WDDT","created_at":"2026-05-18T12:31:39.905425+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/RL22WDDT7ED7K4BU6QKT3L63P6","json":"https://pith.science/pith/RL22WDDT7ED7K4BU6QKT3L63P6.json","graph_json":"https://pith.science/api/pith-number/RL22WDDT7ED7K4BU6QKT3L63P6/graph.json","events_json":"https://pith.science/api/pith-number/RL22WDDT7ED7K4BU6QKT3L63P6/events.json","paper":"https://pith.science/paper/RL22WDDT"},"agent_actions":{"view_html":"https://pith.science/pith/RL22WDDT7ED7K4BU6QKT3L63P6","download_json":"https://pith.science/pith/RL22WDDT7ED7K4BU6QKT3L63P6.json","view_paper":"https://pith.science/paper/RL22WDDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08087&json=true","fetch_graph":"https://pith.science/api/pith-number/RL22WDDT7ED7K4BU6QKT3L63P6/graph.json","fetch_events":"https://pith.science/api/pith-number/RL22WDDT7ED7K4BU6QKT3L63P6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RL22WDDT7ED7K4BU6QKT3L63P6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RL22WDDT7ED7K4BU6QKT3L63P6/action/storage_attestation","attest_author":"https://pith.science/pith/RL22WDDT7ED7K4BU6QKT3L63P6/action/author_attestation","sign_citation":"https://pith.science/pith/RL22WDDT7ED7K4BU6QKT3L63P6/action/citation_signature","submit_replication":"https://pith.science/pith/RL22WDDT7ED7K4BU6QKT3L63P6/action/replication_record"}},"created_at":"2026-05-18T00:43:49.387878+00:00","updated_at":"2026-05-18T00:43:49.387878+00:00"}