{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LQOCKDCTLDTQ7NFMQD2E2EWSWW","short_pith_number":"pith:LQOCKDCT","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"},"canonical_sha256":"5c1c250c5358e70fb4ac80f44d12d2b5b35bdce846f8458adc869731756d078c","source":{"kind":"arxiv","id":"1803.10414","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10414","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10414v1","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10414","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"LQOCKDCTLDTQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LQOCKDCTLDTQ7NFM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LQOCKDCT","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LQOCKDCTLDTQ7NFMQD2E2EWSWW","target":"record","payload":{"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"},"canonical_sha256":"5c1c250c5358e70fb4ac80f44d12d2b5b35bdce846f8458adc869731756d078c","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"},"source_kind":"arxiv","source_id":"1803.10414","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-18T00:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtOpaVeyFHlQgJSiCgG27YZ1SNSYonlvRvotuIyh2OCHG2/UObSw5SCFkjGtuRZ82JVIVT4+OiR+FHhS2LZDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:15:05.520236Z"},"content_sha256":"2d0fe73ac5051e648135f350f60655e727e646ac3cb5dad32393240a4b5e7885","schema_version":"1.0","event_id":"sha256:2d0fe73ac5051e648135f350f60655e727e646ac3cb5dad32393240a4b5e7885"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LQOCKDCTLDTQ7NFMQD2E2EWSWW","target":"graph","payload":{"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"},"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-18T00:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNoT6RJh4XVjqrmV/PhwLC/GWOSapszXCF/CAkrcC2sibdGZXlf/fjzpOocZkQKKS3oGSWW+ivMVXFVkLg4eAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:15:05.520934Z"},"content_sha256":"85a003814c8e609c5c17680a6c0d182fa82ce71bde3f003137a8bde9a1130c60","schema_version":"1.0","event_id":"sha256:85a003814c8e609c5c17680a6c0d182fa82ce71bde3f003137a8bde9a1130c60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/bundle.json","state_url":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/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-06-09T03:15:05Z","links":{"resolver":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW","bundle":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/bundle.json","state":"https://pith.science/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQOCKDCTLDTQ7NFMQD2E2EWSWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LQOCKDCTLDTQ7NFMQD2E2EWSWW","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":"5e645d4163f50fcf384deec2f3464ee793ca011730a1f768530592c4723f4188","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T04:57:05Z","title_canon_sha256":"761052f3f843d9d3dcd1b55fac4b73f5bf4dce945784304f5b48d6cf0528ecf9"},"schema_version":"1.0","source":{"id":"1803.10414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10414","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10414v1","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10414","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"LQOCKDCTLDTQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LQOCKDCTLDTQ7NFM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LQOCKDCT","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:85a003814c8e609c5c17680a6c0d182fa82ce71bde3f003137a8bde9a1130c60","target":"graph","created_at":"2026-05-18T00:19:55Z","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":"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 ","authors_text":"Eddie Cheng, Rong-Xia Hao, Shu-Li Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T04:57:05Z","title":"Two kinds of generalized connectivity of dual cubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10414","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:2d0fe73ac5051e648135f350f60655e727e646ac3cb5dad32393240a4b5e7885","target":"record","created_at":"2026-05-18T00:19:55Z","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":"5e645d4163f50fcf384deec2f3464ee793ca011730a1f768530592c4723f4188","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T04:57:05Z","title_canon_sha256":"761052f3f843d9d3dcd1b55fac4b73f5bf4dce945784304f5b48d6cf0528ecf9"},"schema_version":"1.0","source":{"id":"1803.10414","kind":"arxiv","version":1}},"canonical_sha256":"5c1c250c5358e70fb4ac80f44d12d2b5b35bdce846f8458adc869731756d078c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c1c250c5358e70fb4ac80f44d12d2b5b35bdce846f8458adc869731756d078c","first_computed_at":"2026-05-18T00:19:55.477665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:55.477665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gYBmrIFYiBeD/Vmkgm8Le2VOJIfCoRRAgO+oZ4mxyxrZIG0mSJiXHNTAlI0HorxyXFgdk2A/Y8sc4vkouCGiAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:55.478399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d0fe73ac5051e648135f350f60655e727e646ac3cb5dad32393240a4b5e7885","sha256:85a003814c8e609c5c17680a6c0d182fa82ce71bde3f003137a8bde9a1130c60"],"state_sha256":"b8dd16d32b6eafac50eb49e5c10f07716f5f75afef8cdc0d3ce84b0bf841d759"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmzwbFHfMkX4WrtgFN6IQhhx24FFJo1/8aGGFgeeD4g21I/L/dfNiI98D/wXULCUS88asP+VscWHwfu4ekw7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:15:05.525448Z","bundle_sha256":"12a66de8737bb4d14734d13347dff81cc61ead841612c67747affff98f9819f7"}}