{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4QMW6KNHMXC26UBLMWFC7JFO23","short_pith_number":"pith:4QMW6KNH","canonical_record":{"source":{"id":"1201.2983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-14T03:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"8013ac427820cbb8a28acf6085c586811a6abbf3d45465281c6c9891bfb464b0","abstract_canon_sha256":"b0af589f49d423c573dbd154be0173d22246b2911bb4f50a4f8ccd178dfb7df3"},"schema_version":"1.0"},"canonical_sha256":"e4196f29a765c5af502b658a2fa4aed6e7269b73379983135359bf344e28f998","source":{"kind":"arxiv","id":"1201.2983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2983","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2983v1","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2983","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"4QMW6KNHMXC2","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4QMW6KNHMXC26UBL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4QMW6KNH","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4QMW6KNHMXC26UBLMWFC7JFO23","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-14T03:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"8013ac427820cbb8a28acf6085c586811a6abbf3d45465281c6c9891bfb464b0","abstract_canon_sha256":"b0af589f49d423c573dbd154be0173d22246b2911bb4f50a4f8ccd178dfb7df3"},"schema_version":"1.0"},"canonical_sha256":"e4196f29a765c5af502b658a2fa4aed6e7269b73379983135359bf344e28f998","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:32.611862Z","signature_b64":"rCZ67D1nkYZX+7r2zxHhe/+Tsbm597aWOrq4ukbEwp0ZDuVnwJfnyFYVBQwJgOg6/Q/XUquSEQFtjUPTubiOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4196f29a765c5af502b658a2fa4aed6e7269b73379983135359bf344e28f998","last_reissued_at":"2026-05-18T04:04:32.611176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:32.611176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2983","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-18T04:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jq0r3iIY6S+VVHrVuTKnw4ibd/lTfgEAuz5flVuS7m3WRjusbXXzdYkVWY6mw5FgxMf4c8bSjAK7yLD3iP9lBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:35:49.030175Z"},"content_sha256":"cc2f1a79264d9c69ac8cbba6c5d086bead7dd143961c8ce6e1fe9a6361f4e979","schema_version":"1.0","event_id":"sha256:cc2f1a79264d9c69ac8cbba6c5d086bead7dd143961c8ce6e1fe9a6361f4e979"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4QMW6KNHMXC26UBLMWFC7JFO23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs with large generalized 3-connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun","submitted_at":"2012-01-14T03:39:01Z","abstract_excerpt":"Let $S$ be a nonempty set of vertices of a connected graph $G$. A collection $T_1,..., T_\\ell$ of trees in $G$ is said to be internally disjoint trees connecting $S$ if $E(T_i)\\cap E(T_j)= \\emptyset$ and $V(T_i)\\cap V(T_j)=S$ for any pair of distinct integers $i, j$, where $1 \\leq i, j \\leq r$. For an integer $k$ with $2 \\leq k \\leq n$, the generalized $k$-connectivity $\\kappa_k(G)$ of $G$ is the greatest positive integer $r$ such that $G$ contains at least $r$ internally disjoint trees connecting $S$ for any set $S$ of $k$ vertices of $G$. Obviously, $\\kappa_2(G)$ is the connectivity of $G$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2983","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-18T04:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Swqo7bOQAuz4VfjzkgCyUnzGrS4m4vcM7RJvp8bbZw0Uls1roqj0JaQP/2yE006cDooK8kSJS0vOegfg2rKcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:35:49.030525Z"},"content_sha256":"37e752ad12b632e3d3eb5b0ebec85e69f08751887aba31d1bd4d7acdb1e8cf60","schema_version":"1.0","event_id":"sha256:37e752ad12b632e3d3eb5b0ebec85e69f08751887aba31d1bd4d7acdb1e8cf60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23/bundle.json","state_url":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QMW6KNHMXC26UBLMWFC7JFO23/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-01T17:35:49Z","links":{"resolver":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23","bundle":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23/bundle.json","state":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QMW6KNHMXC26UBLMWFC7JFO23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4QMW6KNHMXC26UBLMWFC7JFO23","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":"b0af589f49d423c573dbd154be0173d22246b2911bb4f50a4f8ccd178dfb7df3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-14T03:39:01Z","title_canon_sha256":"8013ac427820cbb8a28acf6085c586811a6abbf3d45465281c6c9891bfb464b0"},"schema_version":"1.0","source":{"id":"1201.2983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2983","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2983v1","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2983","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"4QMW6KNHMXC2","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4QMW6KNHMXC26UBL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4QMW6KNH","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:37e752ad12b632e3d3eb5b0ebec85e69f08751887aba31d1bd4d7acdb1e8cf60","target":"graph","created_at":"2026-05-18T04:04:32Z","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$ be a nonempty set of vertices of a connected graph $G$. A collection $T_1,..., T_\\ell$ of trees in $G$ is said to be internally disjoint trees connecting $S$ if $E(T_i)\\cap E(T_j)= \\emptyset$ and $V(T_i)\\cap V(T_j)=S$ for any pair of distinct integers $i, j$, where $1 \\leq i, j \\leq r$. For an integer $k$ with $2 \\leq k \\leq n$, the generalized $k$-connectivity $\\kappa_k(G)$ of $G$ is the greatest positive integer $r$ such that $G$ contains at least $r$ internally disjoint trees connecting $S$ for any set $S$ of $k$ vertices of $G$. Obviously, $\\kappa_2(G)$ is the connectivity of $G$. ","authors_text":"Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-14T03:39:01Z","title":"Graphs with large generalized 3-connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2983","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:cc2f1a79264d9c69ac8cbba6c5d086bead7dd143961c8ce6e1fe9a6361f4e979","target":"record","created_at":"2026-05-18T04:04:32Z","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":"b0af589f49d423c573dbd154be0173d22246b2911bb4f50a4f8ccd178dfb7df3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-14T03:39:01Z","title_canon_sha256":"8013ac427820cbb8a28acf6085c586811a6abbf3d45465281c6c9891bfb464b0"},"schema_version":"1.0","source":{"id":"1201.2983","kind":"arxiv","version":1}},"canonical_sha256":"e4196f29a765c5af502b658a2fa4aed6e7269b73379983135359bf344e28f998","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4196f29a765c5af502b658a2fa4aed6e7269b73379983135359bf344e28f998","first_computed_at":"2026-05-18T04:04:32.611176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:32.611176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rCZ67D1nkYZX+7r2zxHhe/+Tsbm597aWOrq4ukbEwp0ZDuVnwJfnyFYVBQwJgOg6/Q/XUquSEQFtjUPTubiOAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:32.611862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc2f1a79264d9c69ac8cbba6c5d086bead7dd143961c8ce6e1fe9a6361f4e979","sha256:37e752ad12b632e3d3eb5b0ebec85e69f08751887aba31d1bd4d7acdb1e8cf60"],"state_sha256":"11ebdd88b655ecc6e42ef1105c7504190ff74aab8446b48ef6234f389d8c0964"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fpo4046/D2pGnXKjOxuCc8LR+mgSe6vvbH5NWA+p20KPZhJc7t9TSzjh5eYWh1ZQAdQfG97diwAJbQ83YDebDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:35:49.032459Z","bundle_sha256":"3bd80bc35eded3521251bd66ae1810fc0562472f62df44c1c8e6282798101eeb"}}