{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:22XXSA46EJPBPVAQWXGCJZLQIE","short_pith_number":"pith:22XXSA46","canonical_record":{"source":{"id":"1606.03790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T01:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"7218100c75201a8de03a7cfc6fcafec7ac95d2db8c76b05828e06a31ca75d1a8","abstract_canon_sha256":"e7bf4c0f06afef19397472873635fcff40ecd3a6794edf9f4b4867150b41f375"},"schema_version":"1.0"},"canonical_sha256":"d6af79039e225e17d410b5cc24e5704139a434bb0baa568075f0d63306fb0ca5","source":{"kind":"arxiv","id":"1606.03790","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03790","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03790v2","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03790","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"22XXSA46EJPB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"22XXSA46EJPBPVAQ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"22XXSA46","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:22XXSA46EJPBPVAQWXGCJZLQIE","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T01:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"7218100c75201a8de03a7cfc6fcafec7ac95d2db8c76b05828e06a31ca75d1a8","abstract_canon_sha256":"e7bf4c0f06afef19397472873635fcff40ecd3a6794edf9f4b4867150b41f375"},"schema_version":"1.0"},"canonical_sha256":"d6af79039e225e17d410b5cc24e5704139a434bb0baa568075f0d63306fb0ca5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:22.353774Z","signature_b64":"nxD+Y2Soe5eKjG6evHFybPit17ijldPgsYVlnU91g7mycx+FCAmcz+PE6QHxKqZXhsUX5fWZFL9Y1aR3V88vBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6af79039e225e17d410b5cc24e5704139a434bb0baa568075f0d63306fb0ca5","last_reissued_at":"2026-05-18T01:12:22.353446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:22.353446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03790","source_version":2,"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-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAgbuQunn7kXy7isedduv+MWdxhUNQxFXAJGaYTcQyOPDuruEGpr0y8bXBlo7lDNI9MXjSh7hLrJP3LYvGdKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:39:09.276493Z"},"content_sha256":"6147edf3d3f608074efa6c998cb554be9c78b68f24efb34499eaf38f5692ae26","schema_version":"1.0","event_id":"sha256:6147edf3d3f608074efa6c998cb554be9c78b68f24efb34499eaf38f5692ae26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:22XXSA46EJPBPVAQWXGCJZLQIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The super spanning connectivity of arrangement graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Min Xu, Pingshan Li","submitted_at":"2016-06-13T01:57:43Z","abstract_excerpt":"A $k$-container $C(u, v)$ of a graph $G$ is a set of $k$ internally disjoint paths between $u$ and $v$. A $k$-container $C(u, v)$ of $G$ is a $k^*$-container if it is a spanning subgraph of $G$. A graph $G$ is $k^*$-connected if there exists a $k^*$-container between any two different vertices of G. A $k$-regular graph $G$ is super spanning connected if $G$ is $i^*$-container for all $1\\le i\\le k$. In this paper, we prove that the arrangement graph $A_{n, k}$ is super spanning connected if $n\\ge 4$ and $n-k\\ge 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03790","kind":"arxiv","version":2},"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-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TeD+tZEyUqWEM3px/Cd8Sg7kjT6uKlLPSVCoUaEjMC+dn93cTXGtdrqR+Uef6Fc7fHJOo5UQygVWqCQM/vzjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:39:09.277221Z"},"content_sha256":"37158b9d7cd39be4710a2e3a0ad6490c418b1bda05cac9b80ebea9081703de70","schema_version":"1.0","event_id":"sha256:37158b9d7cd39be4710a2e3a0ad6490c418b1bda05cac9b80ebea9081703de70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22XXSA46EJPBPVAQWXGCJZLQIE/bundle.json","state_url":"https://pith.science/pith/22XXSA46EJPBPVAQWXGCJZLQIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22XXSA46EJPBPVAQWXGCJZLQIE/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-06T21:39:09Z","links":{"resolver":"https://pith.science/pith/22XXSA46EJPBPVAQWXGCJZLQIE","bundle":"https://pith.science/pith/22XXSA46EJPBPVAQWXGCJZLQIE/bundle.json","state":"https://pith.science/pith/22XXSA46EJPBPVAQWXGCJZLQIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22XXSA46EJPBPVAQWXGCJZLQIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:22XXSA46EJPBPVAQWXGCJZLQIE","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":"e7bf4c0f06afef19397472873635fcff40ecd3a6794edf9f4b4867150b41f375","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T01:57:43Z","title_canon_sha256":"7218100c75201a8de03a7cfc6fcafec7ac95d2db8c76b05828e06a31ca75d1a8"},"schema_version":"1.0","source":{"id":"1606.03790","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03790","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03790v2","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03790","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"22XXSA46EJPB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"22XXSA46EJPBPVAQ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"22XXSA46","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:37158b9d7cd39be4710a2e3a0ad6490c418b1bda05cac9b80ebea9081703de70","target":"graph","created_at":"2026-05-18T01:12:22Z","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":"A $k$-container $C(u, v)$ of a graph $G$ is a set of $k$ internally disjoint paths between $u$ and $v$. A $k$-container $C(u, v)$ of $G$ is a $k^*$-container if it is a spanning subgraph of $G$. A graph $G$ is $k^*$-connected if there exists a $k^*$-container between any two different vertices of G. A $k$-regular graph $G$ is super spanning connected if $G$ is $i^*$-container for all $1\\le i\\le k$. In this paper, we prove that the arrangement graph $A_{n, k}$ is super spanning connected if $n\\ge 4$ and $n-k\\ge 2$.","authors_text":"Min Xu, Pingshan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T01:57:43Z","title":"The super spanning connectivity of arrangement graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03790","kind":"arxiv","version":2},"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:6147edf3d3f608074efa6c998cb554be9c78b68f24efb34499eaf38f5692ae26","target":"record","created_at":"2026-05-18T01:12:22Z","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":"e7bf4c0f06afef19397472873635fcff40ecd3a6794edf9f4b4867150b41f375","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T01:57:43Z","title_canon_sha256":"7218100c75201a8de03a7cfc6fcafec7ac95d2db8c76b05828e06a31ca75d1a8"},"schema_version":"1.0","source":{"id":"1606.03790","kind":"arxiv","version":2}},"canonical_sha256":"d6af79039e225e17d410b5cc24e5704139a434bb0baa568075f0d63306fb0ca5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6af79039e225e17d410b5cc24e5704139a434bb0baa568075f0d63306fb0ca5","first_computed_at":"2026-05-18T01:12:22.353446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:22.353446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nxD+Y2Soe5eKjG6evHFybPit17ijldPgsYVlnU91g7mycx+FCAmcz+PE6QHxKqZXhsUX5fWZFL9Y1aR3V88vBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:22.353774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03790","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6147edf3d3f608074efa6c998cb554be9c78b68f24efb34499eaf38f5692ae26","sha256:37158b9d7cd39be4710a2e3a0ad6490c418b1bda05cac9b80ebea9081703de70"],"state_sha256":"c61a8ef624a6677473a5f546aad7c591830c4e8fd88449eb3016de394e00624f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GU/Z7yfqGARjwrh43gT0qX92xMCuqVvoBtYLfxu7VSiusoqV6FsxN57r0TWC/acH8eH1wzCGqy+HsU5EYKhUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:39:09.281469Z","bundle_sha256":"134b0c6a67f5a47bfd0399a38867867f419a04e8fd3b7b12e7ff0ea16a6217de"}}