{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PPGZZHTMOPMB4UWSOENIRVY5TX","short_pith_number":"pith:PPGZZHTM","canonical_record":{"source":{"id":"1706.04742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-15T05:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"1fa083e857e671b6309672c2a77401692ffd1508a899cc2fd83a7e4f0d93d71e","abstract_canon_sha256":"2b8bb43fcc1dbc19d0256638c4973a8641860b3c313d213b912181e68dc2332f"},"schema_version":"1.0"},"canonical_sha256":"7bcd9c9e6c73d81e52d2711a88d71d9de596b820aa6b61a05b0e7d28df2afff2","source":{"kind":"arxiv","id":"1706.04742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04742","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04742v1","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04742","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"pith_short_12","alias_value":"PPGZZHTMOPMB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PPGZZHTMOPMB4UWS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PPGZZHTM","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PPGZZHTMOPMB4UWSOENIRVY5TX","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-15T05:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"1fa083e857e671b6309672c2a77401692ffd1508a899cc2fd83a7e4f0d93d71e","abstract_canon_sha256":"2b8bb43fcc1dbc19d0256638c4973a8641860b3c313d213b912181e68dc2332f"},"schema_version":"1.0"},"canonical_sha256":"7bcd9c9e6c73d81e52d2711a88d71d9de596b820aa6b61a05b0e7d28df2afff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:19.264401Z","signature_b64":"TvVKU++TFFj7qgytPcZdwIsqbhGufii5TMiLCLlWRJKGq9NQzje7DyPeeQESgFj/Ywh+XzKhstQZw8x33pmlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bcd9c9e6c73d81e52d2711a88d71d9de596b820aa6b61a05b0e7d28df2afff2","last_reissued_at":"2026-05-18T00:42:19.263806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:19.263806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04742","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:42:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uri2/iFF1FSmGEU3hb088sYtf/ZJBrQpFBbnx0ZaAi8L2xEMvUahvlBTR8rfgnBD4lqA/T3+QZKTmQx6oTdbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:55:30.745452Z"},"content_sha256":"0fb321be366432b8d412dbded76ce7bef45ad4b28902a9ff6ea37324d18b9a1b","schema_version":"1.0","event_id":"sha256:0fb321be366432b8d412dbded76ce7bef45ad4b28902a9ff6ea37324d18b9a1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PPGZZHTMOPMB4UWSOENIRVY5TX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the spanning connectivity of tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhang, Shurong Zhang, Weihua Yang","submitted_at":"2017-06-15T05:17:37Z","abstract_excerpt":"Let $D$ be a digraph. A $k$-container of $D$ between $u$ and $v$, $C(u,v)$, is a set of $k$ internally disjoint paths between $u$ and $v$. A $k$-container $C(u,v)$ of $D$ is a strong (resp. weak) $k^{*}$-container if there is a set of $k$ internally disjoint paths with the same direction (resp. with different directions allowed) between $u$ and $v$ and it contains all vertices of $D$. A digraph $D$ is $k^{*}$-strongly (resp. $k^{*}$-weakly) connected if there exists a strong (resp. weak) $k^{*}$-container between any two distinct vertices. We define the strong (resp. weak) spanning connectivit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04742","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:42:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ldsRv4BxqRN2dk2CaRwdV7pqT9dEHhPdjf8xLESij88R5lHxCDdgYT9EmDRF7gbMkbCTfjTqgY7vo+fpm3rDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:55:30.745797Z"},"content_sha256":"c194482da4afc8e5cf151bd5af5a59d55dbe4f79e2b25a3e3307bafe03a2965c","schema_version":"1.0","event_id":"sha256:c194482da4afc8e5cf151bd5af5a59d55dbe4f79e2b25a3e3307bafe03a2965c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPGZZHTMOPMB4UWSOENIRVY5TX/bundle.json","state_url":"https://pith.science/pith/PPGZZHTMOPMB4UWSOENIRVY5TX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPGZZHTMOPMB4UWSOENIRVY5TX/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-01T19:55:30Z","links":{"resolver":"https://pith.science/pith/PPGZZHTMOPMB4UWSOENIRVY5TX","bundle":"https://pith.science/pith/PPGZZHTMOPMB4UWSOENIRVY5TX/bundle.json","state":"https://pith.science/pith/PPGZZHTMOPMB4UWSOENIRVY5TX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPGZZHTMOPMB4UWSOENIRVY5TX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PPGZZHTMOPMB4UWSOENIRVY5TX","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":"2b8bb43fcc1dbc19d0256638c4973a8641860b3c313d213b912181e68dc2332f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-15T05:17:37Z","title_canon_sha256":"1fa083e857e671b6309672c2a77401692ffd1508a899cc2fd83a7e4f0d93d71e"},"schema_version":"1.0","source":{"id":"1706.04742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04742","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04742v1","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04742","created_at":"2026-05-18T00:42:19Z"},{"alias_kind":"pith_short_12","alias_value":"PPGZZHTMOPMB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PPGZZHTMOPMB4UWS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PPGZZHTM","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:c194482da4afc8e5cf151bd5af5a59d55dbe4f79e2b25a3e3307bafe03a2965c","target":"graph","created_at":"2026-05-18T00:42:19Z","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 $D$ be a digraph. A $k$-container of $D$ between $u$ and $v$, $C(u,v)$, is a set of $k$ internally disjoint paths between $u$ and $v$. A $k$-container $C(u,v)$ of $D$ is a strong (resp. weak) $k^{*}$-container if there is a set of $k$ internally disjoint paths with the same direction (resp. with different directions allowed) between $u$ and $v$ and it contains all vertices of $D$. A digraph $D$ is $k^{*}$-strongly (resp. $k^{*}$-weakly) connected if there exists a strong (resp. weak) $k^{*}$-container between any two distinct vertices. We define the strong (resp. weak) spanning connectivit","authors_text":"Bo Zhang, Shurong Zhang, Weihua Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-15T05:17:37Z","title":"On the spanning connectivity of tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04742","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:0fb321be366432b8d412dbded76ce7bef45ad4b28902a9ff6ea37324d18b9a1b","target":"record","created_at":"2026-05-18T00:42:19Z","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":"2b8bb43fcc1dbc19d0256638c4973a8641860b3c313d213b912181e68dc2332f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-15T05:17:37Z","title_canon_sha256":"1fa083e857e671b6309672c2a77401692ffd1508a899cc2fd83a7e4f0d93d71e"},"schema_version":"1.0","source":{"id":"1706.04742","kind":"arxiv","version":1}},"canonical_sha256":"7bcd9c9e6c73d81e52d2711a88d71d9de596b820aa6b61a05b0e7d28df2afff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bcd9c9e6c73d81e52d2711a88d71d9de596b820aa6b61a05b0e7d28df2afff2","first_computed_at":"2026-05-18T00:42:19.263806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:19.263806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TvVKU++TFFj7qgytPcZdwIsqbhGufii5TMiLCLlWRJKGq9NQzje7DyPeeQESgFj/Ywh+XzKhstQZw8x33pmlCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:19.264401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fb321be366432b8d412dbded76ce7bef45ad4b28902a9ff6ea37324d18b9a1b","sha256:c194482da4afc8e5cf151bd5af5a59d55dbe4f79e2b25a3e3307bafe03a2965c"],"state_sha256":"9af5c101b2f9f4a981e92a858d56a54cc1e41f5cb66b91af4ad0a370a3c21c76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4F1oV3tjah9vrIIJH3BidARsWM2v6fzdOPgLS5ZmrF4a/+mGr2vgLort4kENSkCRj/1oxh9+Bkd9VBWewUOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:55:30.747756Z","bundle_sha256":"18f6f96471d1b95102eaaa75bd9121ae6445a404c701bbef47f91b55c5d68ad7"}}