{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JGEWDWKE4MRNZBLQOFWFL5BK5F","short_pith_number":"pith:JGEWDWKE","canonical_record":{"source":{"id":"1101.3811","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T02:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"deb31439c66e8a7cfe960680aea054b3f2aef9c64a9d6b585b588135014bed93","abstract_canon_sha256":"615f5d1f171567f75b999cb5cd6c8200371b68fccbea10eda6fa538b3bb3632f"},"schema_version":"1.0"},"canonical_sha256":"498961d944e322dc8570716c55f42ae958998202123d08e863feacc8f3f82abb","source":{"kind":"arxiv","id":"1101.3811","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3811","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3811v3","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3811","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"JGEWDWKE4MRN","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JGEWDWKE4MRNZBLQ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JGEWDWKE","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JGEWDWKE4MRNZBLQOFWFL5BK5F","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3811","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T02:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"deb31439c66e8a7cfe960680aea054b3f2aef9c64a9d6b585b588135014bed93","abstract_canon_sha256":"615f5d1f171567f75b999cb5cd6c8200371b68fccbea10eda6fa538b3bb3632f"},"schema_version":"1.0"},"canonical_sha256":"498961d944e322dc8570716c55f42ae958998202123d08e863feacc8f3f82abb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:51.202704Z","signature_b64":"ND/jFVW3FiJmro+oqbSe8XYfYGUAUhXvWWaEjKlbRyoWFGw2a/AyjWOhQDCZyyG+b6ZEEnSSPOv+kABSs7esDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"498961d944e322dc8570716c55f42ae958998202123d08e863feacc8f3f82abb","last_reissued_at":"2026-05-18T02:22:51.202107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:51.202107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3811","source_version":3,"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-18T02:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOtH37db16pGdQZxdO6OTyDBa7LuJMtZbu/OLFPKaXSI99iBM2o3zLptZ1LX/ioxLYrRiWn9y6kt7Tw8sU+/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:09.735384Z"},"content_sha256":"bd6292128bec829207af73268b83df53b373777808c2a608cf1a15874a072fb8","schema_version":"1.0","event_id":"sha256:bd6292128bec829207af73268b83df53b373777808c2a608cf1a15874a072fb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JGEWDWKE4MRNZBLQOFWFL5BK5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The minimal size of a graph with generalized connectivity $\\kappa_3 = 2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shasha Li, Xueliang Li, Yongtang Shi","submitted_at":"2011-01-20T02:30:24Z","abstract_excerpt":"Let $G$ be a nontrivial connected graph of order $n$ and $k$ an integer with $2\\leq k\\leq n$. For a set $S$ of $k$ vertices of $G$, let $\\kappa (S)$ denote the maximum number $\\ell$ of edge-disjoint trees $T_1,T_2,...,T_\\ell$ in $G$ such that $V(T_i)\\cap V(T_j)=S$ for every pair $i,j$ of distinct integers with $1\\leq i,j\\leq \\ell$. Chartrand et al. generalized the concept of connectivity as follows: The $k$-$connectivity$, denoted by $\\kappa_k(G)$, of $G$ is defined by $\\kappa_k(G)=$min$\\{\\kappa(S)\\}$, where the minimum is taken over all $k$-subsets $S$ of $V(G)$. Thus $\\kappa_2(G)=\\kappa(G)$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3811","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"},"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-18T02:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHbSDVnHILzu3BxFaIJw5Xz2Tlu9h0XVrS0WAYSU4SZTj9z9yoqbqdaCjoRfcv76hU0qXRkjUeRA2mXuJsoRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:09.735981Z"},"content_sha256":"08eec1e4da7a558291a73b16a145940687f535f8db5ba384ad802c0643345b10","schema_version":"1.0","event_id":"sha256:08eec1e4da7a558291a73b16a145940687f535f8db5ba384ad802c0643345b10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/bundle.json","state_url":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/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-05-25T20:16:09Z","links":{"resolver":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F","bundle":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/bundle.json","state":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JGEWDWKE4MRNZBLQOFWFL5BK5F","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":"615f5d1f171567f75b999cb5cd6c8200371b68fccbea10eda6fa538b3bb3632f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T02:30:24Z","title_canon_sha256":"deb31439c66e8a7cfe960680aea054b3f2aef9c64a9d6b585b588135014bed93"},"schema_version":"1.0","source":{"id":"1101.3811","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3811","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3811v3","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3811","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"JGEWDWKE4MRN","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JGEWDWKE4MRNZBLQ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JGEWDWKE","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:08eec1e4da7a558291a73b16a145940687f535f8db5ba384ad802c0643345b10","target":"graph","created_at":"2026-05-18T02:22:51Z","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 $G$ be a nontrivial connected graph of order $n$ and $k$ an integer with $2\\leq k\\leq n$. For a set $S$ of $k$ vertices of $G$, let $\\kappa (S)$ denote the maximum number $\\ell$ of edge-disjoint trees $T_1,T_2,...,T_\\ell$ in $G$ such that $V(T_i)\\cap V(T_j)=S$ for every pair $i,j$ of distinct integers with $1\\leq i,j\\leq \\ell$. Chartrand et al. generalized the concept of connectivity as follows: The $k$-$connectivity$, denoted by $\\kappa_k(G)$, of $G$ is defined by $\\kappa_k(G)=$min$\\{\\kappa(S)\\}$, where the minimum is taken over all $k$-subsets $S$ of $V(G)$. Thus $\\kappa_2(G)=\\kappa(G)$,","authors_text":"Shasha Li, Xueliang Li, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T02:30:24Z","title":"The minimal size of a graph with generalized connectivity $\\kappa_3 = 2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3811","kind":"arxiv","version":3},"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:bd6292128bec829207af73268b83df53b373777808c2a608cf1a15874a072fb8","target":"record","created_at":"2026-05-18T02:22:51Z","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":"615f5d1f171567f75b999cb5cd6c8200371b68fccbea10eda6fa538b3bb3632f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T02:30:24Z","title_canon_sha256":"deb31439c66e8a7cfe960680aea054b3f2aef9c64a9d6b585b588135014bed93"},"schema_version":"1.0","source":{"id":"1101.3811","kind":"arxiv","version":3}},"canonical_sha256":"498961d944e322dc8570716c55f42ae958998202123d08e863feacc8f3f82abb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"498961d944e322dc8570716c55f42ae958998202123d08e863feacc8f3f82abb","first_computed_at":"2026-05-18T02:22:51.202107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:51.202107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ND/jFVW3FiJmro+oqbSe8XYfYGUAUhXvWWaEjKlbRyoWFGw2a/AyjWOhQDCZyyG+b6ZEEnSSPOv+kABSs7esDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:51.202704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3811","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd6292128bec829207af73268b83df53b373777808c2a608cf1a15874a072fb8","sha256:08eec1e4da7a558291a73b16a145940687f535f8db5ba384ad802c0643345b10"],"state_sha256":"ea3c6edb3a3de1d0bb7fd013e2a9ba504791bddee5aee0845f9886f24a364aa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXi8MpBgEW/yZ/ofr3uRHrlIEPdPAymm50xRmM2lUC87kMZZ8OHBrPV+HGJVnTqBlxy7EqbYop2LCWZ/sXv5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:16:09.739392Z","bundle_sha256":"90de219b916512011d800cf40a3d7d897636cb77ee8282a98db76b66c9173deb"}}