{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LQOCKDCTLDTQ7NFMQD2E2EWSWW","short_pith_number":"pith:LQOCKDCT","schema_version":"1.0","canonical_sha256":"5c1c250c5358e70fb4ac80f44d12d2b5b35bdce846f8458adc869731756d078c","source":{"kind":"arxiv","id":"1803.10414","version":1},"attestation_state":"computed","paper":{"title":"Two kinds of generalized connectivity of dual cubes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eddie Cheng, Rong-Xia Hao, Shu-Li Zhao","submitted_at":"2018-03-28T04:57:05Z","abstract_excerpt":"Let $S\\subseteq V(G)$ and $\\kappa_{G}(S)$ denote the maximum number $k$ of edge-disjoint trees $T_{1}, T_{2}, \\cdots, T_{k}$ in $G$ such that $V(T_{i})\\bigcap V(T_{j})=S$ for any $i, j \\in \\{1, 2, \\cdots, k\\}$ and $i\\neq j$. For an integer $r$ with $2\\leq r\\leq n$, the {\\em generalized $r$-connectivity} of a graph $G$ is defined as $\\kappa_{r}(G)= min\\{\\kappa_{G}(S)|S\\subseteq V(G)$ and $|S|=r\\}$. The $r$-component connectivity $c\\kappa_{r}(G)$ of a non-complete graph $G$ is the minimum number of vertices whose deletion results in a graph with at least $r$ components. These two parameters are "},"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":"1803.10414","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T04:57:05Z","cross_cats_sorted":[],"title_canon_sha256":"761052f3f843d9d3dcd1b55fac4b73f5bf4dce945784304f5b48d6cf0528ecf9","abstract_canon_sha256":"5e645d4163f50fcf384deec2f3464ee793ca011730a1f768530592c4723f4188"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:55.478399Z","signature_b64":"gYBmrIFYiBeD/Vmkgm8Le2VOJIfCoRRAgO+oZ4mxyxrZIG0mSJiXHNTAlI0HorxyXFgdk2A/Y8sc4vkouCGiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c1c250c5358e70fb4ac80f44d12d2b5b35bdce846f8458adc869731756d078c","last_reissued_at":"2026-05-18T00:19:55.477665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:55.477665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two kinds of generalized connectivity of dual cubes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eddie Cheng, Rong-Xia Hao, Shu-Li Zhao","submitted_at":"2018-03-28T04:57:05Z","abstract_excerpt":"Let $S\\subseteq V(G)$ and $\\kappa_{G}(S)$ denote the maximum number $k$ of edge-disjoint trees $T_{1}, T_{2}, \\cdots, T_{k}$ in $G$ such that $V(T_{i})\\bigcap V(T_{j})=S$ for any $i, j \\in \\{1, 2, \\cdots, k\\}$ and $i\\neq j$. For an integer $r$ with $2\\leq r\\leq n$, the {\\em generalized $r$-connectivity} of a graph $G$ is defined as $\\kappa_{r}(G)= min\\{\\kappa_{G}(S)|S\\subseteq V(G)$ and $|S|=r\\}$. The $r$-component connectivity $c\\kappa_{r}(G)$ of a non-complete graph $G$ is the minimum number of vertices whose deletion results in a graph with at least $r$ components. These two parameters are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10414","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":"1803.10414","created_at":"2026-05-18T00:19:55.477783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10414v1","created_at":"2026-05-18T00:19:55.477783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10414","created_at":"2026-05-18T00:19:55.477783+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQOCKDCTLDTQ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQOCKDCTLDTQ7NFM","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQOCKDCT","created_at":"2026-05-18T12:32:37.024351+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/LQOCKDCTLDTQ7NFMQD2E2EWSWW","json":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW.json","graph_json":"https://pith.science/api/pith-number/LQOCKDCTLDTQ7NFMQD2E2EWSWW/graph.json","events_json":"https://pith.science/api/pith-number/LQOCKDCTLDTQ7NFMQD2E2EWSWW/events.json","paper":"https://pith.science/paper/LQOCKDCT"},"agent_actions":{"view_html":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW","download_json":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW.json","view_paper":"https://pith.science/paper/LQOCKDCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10414&json=true","fetch_graph":"https://pith.science/api/pith-number/LQOCKDCTLDTQ7NFMQD2E2EWSWW/graph.json","fetch_events":"https://pith.science/api/pith-number/LQOCKDCTLDTQ7NFMQD2E2EWSWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/action/storage_attestation","attest_author":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/action/author_attestation","sign_citation":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/action/citation_signature","submit_replication":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/action/replication_record"}},"created_at":"2026-05-18T00:19:55.477783+00:00","updated_at":"2026-05-18T00:19:55.477783+00:00"}